相关论文: An implementation of Runge's method for Diophantin…

This paper discusses stochastic numerical methods of Runge-Kutta type with weak and strong convergences for systems of stochastic differential equations in It\^o form. At the beginning we give a brief overview of the stochastic numerical…

We study Diophantine equations of type $f(x)=g(y)$, where $f$ and $g$ are lacunary polynomials. According to a well known finiteness criterion, for a number field $K$ and nonconstant $f, g\in K[x]$, the equation $f(x)=g(y)$ has infinitely…

By finding all integral points on certain elliptic and hyperelliptic curves we completely solve the Diophantine equation $\binom{n}{k}=\binom{m}{l}+d$ for $-3\leq d\leq 3$ and $(k,l)\in\{(2,3),\; (2,4),\;(2,5),\; (2,6),\; (2,8),\; (3,4),\;…

Let $\ell$ and $p$ be (not necessarily distinct) prime numbers and $F$ be a global function field of characteristic $\ell$ with field of constants $\kappa$. Assume that there exists a prime $P_\infty$ of $F$ which has degree $1$, and let…

In this article, we introduce and study three numerical methods for the Dirichlet Monge Amp\`ere equation in two dimensions. The approaches consist in considering new equivalent problems. The latter are discretized by a wide stencil finite…

In this study, a recursive solution technique in conjunction with generalized integrating factors is presented and applied to address first and second order linear differential equations. This approach demonstrates practical utility in…

Let p, c be distinct odd primes, and l \ge 2 an integer. We find sufficient conditions for the Diophantine equation cy^l=(x^p-1)/(x-1) not to have integer solutions

Semi-Lagrangian methods are numerical methods designed to find approximate solutions to particular time-dependent partial differential equations (PDEs) that describe the advection process. We propose semi-Lagrangian one-step methods for…

In this paper we show a way to generalize the linear Diophantine equation a1x1+a2x2+...+anxn=d . We deal with the nonlinear Diophantine equation det|A X|=+-d , which generalizes the linear one, and we give a necessary and sufficient…

We relate a previous result of ours on families of Diophantine equations having only trivial solutions with a result on the approximation of an algebraic number by products of rational numbers and units. We compare this approximation with a…

In this paper, the elliptic curves theory is used for solving the Diophantine equations $\sum_{i=1}^n a_ix_{i} ^6+\sum_{i=1}^m b_iy_{i} ^3= \sum_{i=1}^na_iX_{i}^6\pm\sum_{i=1}^m b_iY_{i} ^3$, where $n$, $m$ $\geq 1$ and $a_i$, $b_i$, are…

We present a general algorithm for solving all two-variable polynomial Diophantine equations consisting of three monomials. Before this work, even the existence of an algorithm for solving the one-parameter family of equations…

In this short note we are presenting a method of finding particular solutions of nonhomegeneous linear equations. This approach is different from methods of undetermined coefficients or variation of parameters presented in virtually every…

For two relatively prime positive integers $a, b\in \mathbb{N}$, it is known that exactly one of the two Diophantine equations $$ax + by \ =\ \frac{(a-1)(b-1)}{2}\ \mbox{ and }\ 1 + ax + by \ =\ \frac{(a-1)(b-1)}{2}$$ has a nonnegative…

We give criteria of the solvability of the diophantine equation $p=x^2+ny^2$ over some imaginary quadratic fields where $p$ is a prime element. The criteria becomes quite simple in special cases.

This paper introduces a novel framework for the solution of (large-scale) Lyapunov and Sylvester equations derived from numerical integration methods. Suitable systems of ordinary differential equations are introduced. Low-rank…

A modified Gauss's algorithm for solving a system of linear equations in an integral ring is proposed, as well as an appropriate algorithm for calculating the elements of the adjoint matrix.

Let $K= \mathbf{Q}(\sqrt{d})$ be a quadratic field and $\mathcal{O}_{K}$ be its ring of integers. We study the solvability of the Diophantine equation $r + s + t = rst = 2$ in $\mathcal{O}_{K}$. We prove that except for $d= -7, -1, 17$ and…

Solving feasibility problems is a central task in mathematics and the applied sciences. One particularly successful method is the Douglas-Rachford algorithm. In this paper, we provide many new conditions sufficient for finite convergence.…

In this paper, elliptic curves theory is used for solving the Diophantine equations X^3+Y^3+Z^3+aU^k=a_0U_0^{t_0}+...+a_nU_n^{t_n}, k=3,4 where n, ti are natural numbers and a, a_i are fixed arbitrary rational numbers. We try to transform…