On the choice of iteration parameters in the Stone incomplete factorization

DOI10.21136/am.1983.104038zbMath0532.65020OpenAlexW3047721004MaRDI QIDQ3314854

Karel Segeth

Publication date: 1983

Full work available at URL: https://eudml.org/doc/15307

zbMATH Keywords

Numerical experimentslarge sparse systemschoice of parametersStone incomplete factorizationStone's method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Cites Work

• The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
• Second Order Strongly Implicit Symmetric Factorization Methods for the Solution of Elliptic Difference Equations
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
• Iterative Solution of Implicit Approximations of Multidimensional Partial Differential Equations
• A Symmetric Factorization Procedure for the Solution of Elliptic Boundary Value Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item