On preconditioning Schur complement and Schur complement preconditioning.
The paper analyses the biconjugate gradient algorithm and its preconditioned version for solving large systems of linear algebraic equations with nonsingular sparse complex matrices. Special emphasis is laid on symmetric matrices arising from discretization of complex partial differential equations by the finite element method.
We provide a comparative study of the Subspace Projected Approximate Matrix method, abbreviated SPAM, which is a fairly recent iterative method of computing a few eigenvalues of a Hermitian matrix . It falls in the category of inner-outer iteration methods and aims to reduce the costs of matrix-vector products with within its inner iteration. This is done by choosing an approximation of , and then, based on both and , to define a sequence of matrices that increasingly better approximate...