Twofold deflation preconditioning of linear algebraic systems. I. Theory

LY Kolotilina�- Zapiski Nauchnykh Seminarov POMI, 1995 - mathnet.ru
In this paper, preconditioning of linear algebraic systems with symmetric positive-definite
coefficient matrices by deflation is considered. The twofold deflation technique for�…

Twofold deflation preconditioning of linear algebraic systems. I. Theory

LY Kolotilina�- Journal of Mathematical Sciences, 1998 - Springer
In this paper, preconditioning of linear algebraic systems with symmetric positive-definite
coefficient matrices by deflation is considered. The twofold deflation technique for�…

[PDF][PDF] A deflation formula for tridiagonal matrices

M Fiedler�- Aplikace matematiky, 1980 - dml.cz
Aplikace matematiky Page 1 Aplikace matematiky Miroslav Fiedler A deflation formula for
tridiagonal matrices Aplikace matematiky, Vol. 25 (1980), No. 5, 348–357 Persistent URL�…

Inner deflation for symmetric tridiagonal matrices

IS Dhillon, AN Malyshev�- Linear algebra and its applications, 2003 - Elsevier
Suppose that one knows an accurate approximation to an eigenvalue of a real symmetric
tridiagonal matrix. A variant of deflation by the Givens rotations is proposed in order to split�…

The necessary and sufficient conditions of regularizability of degenerate sets of linear algebraic equations using the shift method

VA Morozov, AB Nazimov�- USSR Computational Mathematics and�…, 1986 - Elsevier
THE NECESSARY AND SUFFICIENT CONDITIONS OF DEGENERATE SETS OF LINEAR
ALGEBRAIC EQUATIONS REGULARIZABILITY OF USING THE SHIFT MET Page 1 USSR�…

Optimization of the ILU (0) factorization algorithm with the use of compressed sparse row format

RR Akhunov, SP Kuksenko, VK Salov…�- Journal of Mathematical�…, 2013 - Springer
Improvements of the ILU (0) factorization algorithm for preconditioning linear algebraic
systems with dense matrices are suggested. The preconditioner is stored in compressed�…

Fast algorithms for block Toeplitz matrices

EE Tyrtyshnikov - 1986 - degruyter.com
This paper presents the solution of linear systems with block Toeplitz matrices by
constructing block versions of the Fade approximation. This approach yields a fast method of�…

[PDF][PDF] Preconditioning saddle point problems with the help of saddle point operators

MV Gorelova, EV Chizhonkov�- Computational Mathematics and�…, 2004 - researchgate.net
For a nonsingular system of linear equations with a symmetric indefinite block matrix,
preconditioning with the help of a matrix having a similar (saddle point) structure is�…

Fast superoptimal preconditioning of multiindex Toeplitz matrices

C van der Mee, G Rodriguez, S Seatzu�- Linear algebra and its applications, 2006 - Elsevier
In this article three well-known methods of circulant preconditioning of finite multiindex
Toeplitz linear systems, that is linear systems indexed by integers i1,…, id with 0⩽ is< ns (s�…

A method of matrix inverse triangular decomposition based on contiguous principal submatrices

P Delsarte, Y Genin, Y Kamp�- Linear Algebra and its Applications, 1980 - Elsevier
An algorithm is presented which performs the triangular decomposition of the inverse of a
given matrix. The method is applicable to any matrix all contiguous principal submatrices of�…