Voir la notice de l'article provenant de la source Math-Net.Ru
@article{SJIM_2007_10_4_a4, author = {V. P. Il'in and E. A. Itskovich}, title = {Semi-conjugate direction methods with dynamic preconditioning}, journal = {Sibirskij \v{z}urnal industrialʹnoj matematiki}, pages = {41--54}, publisher = {mathdoc}, volume = {10}, number = {4}, year = {2007}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/SJIM_2007_10_4_a4/} }
TY - JOUR AU - V. P. Il'in AU - E. A. Itskovich TI - Semi-conjugate direction methods with dynamic preconditioning JO - Sibirskij žurnal industrialʹnoj matematiki PY - 2007 SP - 41 EP - 54 VL - 10 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/SJIM_2007_10_4_a4/ LA - ru ID - SJIM_2007_10_4_a4 ER -
V. P. Il'in; E. A. Itskovich. Semi-conjugate direction methods with dynamic preconditioning. Sibirskij žurnal industrialʹnoj matematiki, Tome 10 (2007) no. 4, pp. 41-54. http://geodesic.mathdoc.fr/item/SJIM_2007_10_4_a4/
[1] Axelsson O., Iterative Solution Methods, Cambridge Univ. Press, Cambridge, 1994 | MR | Zbl
[2] Szyld D. B., Vogel J. A., “FQMR: a flexible quasi-minimal residual method with inexact preconditioning”, SIAM J. Sci. Comput., 23:2 (2001), 363–380 | DOI | MR | Zbl
[3] Ilin V. P., Metody nepolnoi faktorizatsii dlya resheniya algebraicheskikh sistem, Nauka, M., 1995 | MR
[4] Marchuk G. I., Metody rasschepleniya i peremennykh napravlenii, OVM AN SSSR, M., 1986 | MR
[5] Miellou J. C., Spiteri P., “Optimization of relaxation parameter for SSOR and ADI preconditioning”, Numer. Algorithms, 29 (2002), 153–195 | DOI | MR | Zbl
[6] Spiteri P., Miellou J. C., Bahi J. M., “Evaluation of parameters for the optimization of SSOR and ADI preconditioning”, Numer. Algorithms, 29 (2002), 249–265 | DOI | MR | Zbl
[7] Miellou J. C., Spiteri P., Evans D. J., “Preconditionnement SSOR: Optimisation du conditionnement obtenuen fonction du parametre de relaxation”, Internat. J. Comput. Math., 41 (1992), 189–200 | DOI | Zbl
[8] Godunov S. K., Prokopov G. P., “O reshenii raznostnogo uravneniya Laplasa”, Zhurn. vychisl. matematiki i mat. fiziki, 9:2 (1969), 462–468 | MR | Zbl
[9] Gorbenko N. I., Ilin V. P., “O gradientnykh metodakh peremennykh napravlenii”, Nekotorye problemy vychislitelnoi i prikladnoi matematiki, Nauka, Novosibirsk, 1975, 207–213
[10] Konovalov A. N., “Variatsionnaya optimizatsiya iteratsionnykh metodov rasschepleniya”, Sib. mat. zhurn., 38:2 (1997), 312–325 | MR | Zbl
[11] Konovalov A. N., “Metod skoreishego spuska s adaptivnym poperemenno-treugolnym pereobuslavlivatelem”, Differents. uravneniya, 40:7 (2004), 953–963 | MR | Zbl
[12] Konovalov A. N., “Adaptivnyi metod verkhnei relaksatsii”, Differents. uravneniya, 42:7 (2006), 943–950 | MR | Zbl
[13] Motsartova A. S., “Iteratsionnyi metod skoreishego spuska s adaptivnym poperemenno-treugolnym pereobuslavlivatelem”, Tr. konf. molodykh uchenykh, Izd-vo IVMiMG, Novosibirsk, 2006, 152–159
[14] Eisenstat S. C., Elman H. C., Schultz M. H., “Variational iterative methods for nonsymmetric systems of linear equations”, SIAM J. Numer. Anal., 20:3 (1983), 345–357 | DOI | MR | Zbl
[15] Saad Y., Iterative Methods for Sparse Linear Systems, PWS Publ., New York, 1996 | MR | Zbl
[16] Stewart G. W., “Conjugate directionmethods for solving systems of linear equations”, Numer. Math., 21 (1973), 285–297 | DOI | MR | Zbl
[17] Yuan J. Y., Golub G. H., Plemmons R. J., Cecilio W. A. G., “Semi-conjugate directionmethods for real positive definite systems”, BIT, 44:1 (2004), 189–207 | DOI | MR | Zbl
[18] Sadok H., “Analysis of the convergence of the minimal and the orthogonal residual methods”, Numer. Algorithms, 40 (2005), 201–216 | DOI | MR | Zbl
[19] Kaporin I., “Superlinear convergence in minimum residual iterations”, Numer. Linear Algebra Appl., 12 (2005), 1–18 | DOI | MR
[20] Ilin V. P., Chislennyi analiz, Ch. 1, Izd-vo IVMiMG SO RAN, Novosibirsk, 2004
[21] Andreeva M. Yu., Il'in V. P., Itskovich E. A., “Two solvers for nonsymmetric SLAE”, Bull. Novosibirsk Comput. Center. Ser. Numer. Anal., 2004, no. 12, 1–16 | Zbl