Sciweavers

417 search results - page 2 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
SYNASC
2008
IEEE
266views Algorithms» more  SYNASC 2008»
13 years 11 months ago
On Computing Solutions of Linear Diophantine Equations with One Non-linear Parameter
We present an algorithm for solving Diophantine equations which are linear in the variables, but non-linear in one parameter. This enables us to compute data dependences in more ge...
Armin Größlinger, Stefan Schuster
RTA
1997
Springer
13 years 9 months ago
Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space
In the development of algorithms for finding the minimal solutions of systems of linear Diophantine equations, little use has been made (to our knowledge) of the results by Stanle...
Ana Paula Tomás, Miguel Filgueiras
MOC
1998
147views more  MOC 1998»
13 years 5 months ago
On the Diophantine equation |axn - byn | = 1
If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptio...
Michael A. Bennett, Benjamin M. M. de Weger
ECCV
2008
Springer
14 years 7 months ago
A Lattice-Preserving Multigrid Method for Solving the Inhomogeneous Poisson Equations Used in Image Analysis
Abstract. The inhomogeneous Poisson (Laplace) equation with internal Dirichlet boundary conditions has recently appeared in several applications ranging from image segmentation [1,...
Leo Grady
MOC
1998
65views more  MOC 1998»
13 years 5 months ago
Solving constrained Pell equations
Consider the system of Diophantine equations x2 − ay2 = b, P (x, y) = z2, where P is a given integer polynomial. Historically, such systems have been analyzed by using Baker’s ...
Kiran S. Kedlaya