Sciweavers

103 search results - page 3 / 21
» Algorithms for solving linear systems over cyclotomic fields
Sort
View
LSSC
2005
Springer
13 years 11 months ago
Improved Solution Enclosures for Over- and Underdetermined Interval Linear Systems
Abstract. In this paper we discuss an inclusion method for solving rectangular (over- and under-determined) dense linear systems where the input data are uncertain and vary within ...
Evgenija D. Popova
COCO
2008
Springer
100views Algorithms» more  COCO 2008»
13 years 8 months ago
Detecting Rational Points on Hypersurfaces over Finite Fields
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
Swastik Kopparty, Sergey Yekhanin
CORR
2008
Springer
149views Education» more  CORR 2008»
13 years 6 months ago
Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we...
Ori Shental, Danny Bickson, Paul H. Siegel, Jack K...
TPDS
2008
97views more  TPDS 2008»
13 years 6 months ago
Solving Systems of Linear Equations on the CELL Processor Using Cholesky Factorization
: The STI CELL processor introduces pioneering solutions in processor architecture. At the same time it presents new challenges for the development of numerical algorithms. One is ...
Jakub Kurzak, Alfredo Buttari, Jack Dongarra
PC
2002
158views Management» more  PC 2002»
13 years 6 months ago
On parallel block algorithms for exact triangularizations
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
Jean-Guillaume Dumas, Jean-Louis Roch