Geodesic
On incomplete factorization methods with generalized compensation
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 1 (1998) no. 4, pp. 321-336 
V. P. Il'in; K. Yu. Laevskii. On incomplete factorization methods with generalized compensation. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 1 (1998) no. 4, pp. 321-336. http://geodesic.mathdoc.fr/item/SJVM_1998_1_4_a3/
@article{SJVM_1998_1_4_a3,
     author = {V. P. Il'in and K. Yu. Laevskii},
     title = {On incomplete factorization methods with generalized compensation},
     journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
     pages = {321--336},
     year = {1998},
     volume = {1},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJVM_1998_1_4_a3/}
}
TY  - JOUR
AU  - V. P. Il'in
AU  - K. Yu. Laevskii
TI  - On incomplete factorization methods with generalized compensation
JO  - Sibirskij žurnal vyčislitelʹnoj matematiki
PY  - 1998
SP  - 321
EP  - 336
VL  - 1
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/SJVM_1998_1_4_a3/
LA  - ru
ID  - SJVM_1998_1_4_a3
ER  - 
%0 Journal Article
%A V. P. Il'in
%A K. Yu. Laevskii
%T On incomplete factorization methods with generalized compensation
%J Sibirskij žurnal vyčislitelʹnoj matematiki
%D 1998
%P 321-336
%V 1
%N 4
%U http://geodesic.mathdoc.fr/item/SJVM_1998_1_4_a3/
%G ru
%F SJVM_1998_1_4_a3

Voir la notice de l'article provenant de la source Math-Net.Ru

The iterative incomplete factorization methods are described on the base of definition of preconditioning $B$ matrix from generalized compensation principle $B_{y_k}=A_{y_k}$, $k=1,\dots,m$, where $A$ is the matrix of original system of linear algebraic equations and $\{y_k\}$ is the set of so called probe vectors. The correctness of such algorithms and conditions of positive definiteness of preconditioning matrices are investigated for solution to the Stieltjes type block-tridiagonal systems. The estimates of condition number of matrix product $B^{-1}A$, that define the iterative convergence rate, are derived in the terms of the properties of original matrices.

[1] Il'in V. P., Iterative Incomplete Factorization Methods, World Scientific Publishing Co, Singapore, 1992 | MR

[2] Axelsson O., Iterative Solution Methods, Cambridge University Press, 1994 | MR | Zbl

[3] Ilin V. P., Metody nepolnoi faktorizatsii dlya resheniya algebraicheskikh sistem, Nauka, M., 1995 | MR

[4] Stone H. L., “Iterative solution of implicit approximations of multidimensional partial differential equations”, SIAM J. Numer. Anal., 5 (1968), 530–558 | DOI | MR | Zbl

[5] Lin Avi, “Towards generalization and optimization of implicit methods”, Intern. J. for Numer. Methods in Fluids, 5 (1985), 357–380 | DOI | MR | Zbl

[6] Axelsson O., Polman B., Block preconditioning and domain decomposition methods. I, Report No 8735, Catholic University, Nijmegen, 1987 | MR

[7] Axelsson O., Polman B., Block preconditioning and domain decomposition methods. II, Report No 8807, Catholic University, Nijmegen, 1988 | MR

[8] Il'in V. P., Laevskii K. Yu., “Generalized compensation principle in incomplete factorization methods”, Rus. J. Num. Anal. Math. Mod., 12:5 (1997), 399–420 | DOI | MR

[9] Carpraux J. F., Godunov S. K., Kuznetsov S. V., “Condition number of the Krylov bases and subspaces”, Linear algebra and its applications, 248 (1996), 137–160 | DOI | MR | Zbl