Sciweavers

381 search results - page 3 / 77
» Fraction-Free RNS Algorithms for Solving Linear Systems
Sort
View
EPIA
1997
Springer
13 years 12 months ago
An Algorithm for Solving Systems of Linear Diophantine Equations in Naturals
Abstract. A new algorithm for finding the minimal solutions of systems of linear Diophantine equations has recently been published. In its description the emphasis was put on the ...
Ana Paula Tomás, Miguel Filgueiras
AAECC
1991
Springer
96views Algorithms» more  AAECC 1991»
13 years 11 months ago
On Wiedemann's Method of Solving Sparse Linear Systems
Erich Kaltofen, B. David Saunders
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 2 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 7 months ago
Solving Sparse Integer Linear Systems
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a p-adic lifting technique combined with the use of block matr...
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne...
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
14 years 1 months ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain