Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields

Algorithmica ◽  
1999 ◽  
Vol 24 (3-4) ◽  
pp. 331-348 ◽  
Author(s):  
E. Kaltofen ◽  
A. Lobo
Keyword(s):  
Linear Systems ◽  
Finite Fields ◽  
Free Solution ◽  
Sparse Linear Systems ◽  
Matrix Free

scholarly journals Complexity transitions in global algorithms for sparse linear systems over finite fields

2002 ◽  
Vol 35 (35) ◽  
pp. 7559-7574 ◽  
Author(s):  
A Braunstein ◽  
M Leone ◽  
F Ricci-Tersenghi ◽  
R Zecchina
Keyword(s):  
Linear Systems ◽  
Finite Fields ◽  
Sparse Linear Systems

Parallel algorithm for solving sparse linear systems

1996 ◽  
Vol 32 (19) ◽  
pp. 1766
Author(s):  
K.N. Balasubramanya Murthy ◽  
C. Siva Ram Murthy
Keyword(s):  
Parallel Algorithm ◽  
Linear Systems ◽  
Sparse Linear Systems

Discretisation of sparse linear systems: An optimisation approach

2015 ◽  
Vol 80 ◽  
pp. 42-49 ◽  
Author(s):  
M. Souza ◽  
J.C. Geromel ◽  
P. Colaneri ◽  
R.N. Shorten
Keyword(s):  
Linear Systems ◽  
Sparse Linear Systems

scholarly journals Amesos2 and Belos: Direct and Iterative Solvers for Large Sparse Linear Systems

2012 ◽  
Vol 20 (3) ◽  
pp. 241-255 ◽  
Author(s):  
Eric Bavier ◽  
Mark Hoemmen ◽  
Sivasankaran Rajamanickam ◽  
Heidi Thornquist
Keyword(s):  
Linear Systems ◽  
Iterative Methods ◽  
Sparse Matrix ◽  
Sparse Matrices ◽  
Direct Methods ◽  
Iterative Solvers ◽  
Software Project ◽  
Sparse Linear Systems ◽  
Scalar Type ◽  
Mixed Precision

Solvers for large sparse linear systems come in two categories: direct and iterative. Amesos2, a package in the Trilinos software project, provides direct methods, and Belos, another Trilinos package, provides iterative methods. Amesos2 offers a common interface to many different sparse matrix factorization codes, and can handle any implementation of sparse matrices and vectors, via an easy-to-extend C++ traits interface. It can also factor matrices whose entries have arbitrary “Scalar” type, enabling extended-precision and mixed-precision algorithms. Belos includes many different iterative methods for solving large sparse linear systems and least-squares problems. Unlike competing iterative solver libraries, Belos completely decouples the algorithms from the implementations of the underlying linear algebra objects. This lets Belos exploit the latest hardware without changes to the code. Belos favors algorithms that solve higher-level problems, such as multiple simultaneous linear systems and sequences of related linear systems, faster than standard algorithms. The package also supports extended-precision and mixed-precision algorithms. Together, Amesos2 and Belos form a complete suite of sparse linear solvers.

Sign in / Sign up

Export Citation Format

Share Document