40 search results - page 4 / 8 » Preconditioned iterative methods on sparse subspaces |
SIAMREV
2010
13 years 2 months ago
2010
We examine condition numbers, preconditioners, and iterative methods for finite element discretizations of coercive PDEs in the context of the fundamental solvability result, the L...
CPHYSICS
2010
13 years 7 months ago
2010
We investigate fully parallel Newton-Krylov-Schwarz (NKS) algorithms for solving the large sparse nonlinear systems of equations arising from the finite element discretization of ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. An iterative method LSMR is presented for solving linear systems Ax = b and leastsquares problem min Ax - b 2, with A being sparse or a fast linear operator. LSMR is base...
EUROPAR
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. ILU(k) is a commonly used preconditioner for iterative linear solvers for sparse, non-symmetric systems. It is often preferred for the sake of its stability. We present T...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. CG, SYMMLQ, and MINRES are Krylov subspace methods for solving large symmetric systems of linear equations. CG (the conjugate-gradient method) is reliable on positive-def...