52 search results - page 5 / 11 » pARMS: A Package for Solving General Sparse Linear Systems o... |
NAA
2004
Springer
14 years 25 days ago
2004
Springer
It was recently shown that block-circulant preconditioners applied to a conjugate gradient method used to solve structured sparse linear systems arising from 2D or 3D elliptic prob...
EUROPAR
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
IPPS
1995
IEEE
13 years 11 months ago
1995
IEEE
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
JPDC
2006
13 years 7 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
ESANN
2004
13 years 8 months ago
2004
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...