scientific article; zbMATH DE number 176170
computational complexityconvergencefinite differenceincomplete factorizationsiterative methodlarge sparse systemsemi-direct methodssymmetric compact preconditioned iterative methods
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Finite difference methods for boundary value problems involving PDEs (65N06)
[For the entire collection see Zbl 0753.00013.] The authors develop a theory for an iterative method based on incomplete factorizations for the discretization of 2-dimensional self-adjoint elliptic partial differential equations. The equations of the discretization are ordered by considering first those corresponding to the boundary nodes; the method is based on incomplete factorizations for that ordering which eliminates part of the fill-in created by the boundary nodes. The authors study convergence and computational complexity of the method and they also describe its application to nonlinear problems.
- Approximate root-free factorization techniques for solving elliptic difference equations in three space variables
- Über die Konvergenzoptimierung eines symmetrischen Iterationsverfahrens. (On the convergence optimization for a symmetric iteration method)
- Convergence analysis of iterative methods by pseudodifference operators
- On the theory of equivalent operators and application to the numerical solution of uniformly elliptic partial differential equations
- scientific article; zbMATH DE number 572208 (Why is no real title available?)
- О сходимости и точности метода итерируемой приближенной факторизации операторов многомерных высокоточных бикомпактных схем
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035273)
