Article
Full entry |
PDF
(1.5 MB)
Feedback
PDF
(1.5 MB)
Feedback
Keywords:
Stone incomplete factorization; choice of parameters; Stone’s method; large sparse systems; Numerical experiments
Stone incomplete factorization; choice of parameters; Stone’s method; large sparse systems; Numerical experiments
Summary:
The paper is concerned with the iterative solution of sparse linear algebraic systems by the Stone incomplete factorization. For the sake of clarity, the algorithm of the Stone incomplete factorization is described and, moreover, some properties of the method are derived in the paper. The conclusion is devoted to a series of numerical experiments focused on the choice of iteration parameters in the Stone method. The model problem considered showe that we can, in general, choose appropriate values of the parameters successfully without a deeper a priori analysis of the linear system solved.
References:
[1] O. Axelsson: Solution of linear systems of equations: iterative methods. Sparse Matrix Techniques. (Advanced Course, Copenhagen 1976.) Lecture Notes in Mathematics, Vol. 572. Springer-Verlag, Berlin 1977, 1 - 51. MR 0448834
[2] I. Babuška M. Práger E. Vitásek: Numerical Processes in Differential Equations. SNTL7 Praha 1966. MR 0223101
[3] A. Bracha-Barak P. Saylor: A symmetric factorization procedure for the solution of elliptic boundary value problems. SIAM J. Numer. Anal. 10 (1973), 190-206. DOI 10.1137/0710020 | MR 0315876
[4] N. I. Buleev: A numerical method for solving two- and three-dimensional diffusion equations. (Russian.) Mat. Sb. 51 (1960), 227-238.
[5] T. Dupont R. P. Kendall H. H. Rachford: An approximate factorization procedure for solving self-adjoint elliptic difference equations. SIAM J. Numer. Anal. 5 (1968), 559-573. DOI 10.1137/0705045 | MR 0235748
[6] I. Gustafsson: On first and second order symmetric factorization methods for the solution of elliptic difference equations. Res. Rep. 78.01 R, Dept. of Computer Sciences, Chalmers University of Technology and the University of Goteborg, Goteborg 1978.
[7] D. S. Kershaw: The incomplete Choleski-conjugate gradient method for iterative solution of systems of linear equations. J. Comput. Phys. 26 (1978), 43 - 65. DOI 10.1016/0021-9991(78)90098-0 | MR 0488669
[8] J. A. Meijerink H. A. van der Vorst: An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Math. Соmр. 31 (1977), 148-162. MR 0438681
[9] P. Saylor: Second order strongly implicit symmetric factorization methods for the solution of elliptic difference equations. SIAM J. Numer. Anal. 11 (1974), 894-908. DOI 10.1137/0711071 | MR 0421105 | Zbl 0295.65059
[10] K. Segeth: The iterative use of fast algorithms for the solution of elliptic partial differential equations. (Lecture at the summer school Software a algoritmy numerické matematiky 4, Karlovy Vary 1981.) Matematický ústav ČSAV, Praha 1983.
[11] K. Segeth: Numerical experiments with the Stone incomplete triangular decomposition. Mathematical Models in Physics and Chemistry and Their Numerical Realization 3. (School-Seminar, Visegrád 1982.) To appear. MR 0790545
[12] S.Selberherr A.Schütz W. Petzl: MINIMOS - a two-dimensional MOS transistor singular analyser. IEEE J. Solid-State Circuits SC-15 (1980), 605-623. DOI 10.1109/JSSC.1980.1051444
[13] H. L. Stone: Iterative solution of implicit approximations of multidimensional partial differential equations. SIAM J. Numer. Anal. 5 (1968), 530-558. DOI 10.1137/0705044 | MR 0238504 | Zbl 0197.13304
[14] R. J. Taranto: Numerical studies of Stone's factorization and the iteration parameters, $\alpha$ and $\tau$. Rep. 423, Dept. of Computer Science, University of Illinois, Urbana, 111., 1971.
Search
Partner of
