The rate of convergence of an approximate matrix factorization semi- direct method
From MaRDI portal
Publication:1141458
DOI10.1007/BF01396653zbMath0437.65027OpenAlexW2006361281MaRDI QIDQ1141458
David J. Evans, Elias A. Lipitakis
Publication date: 1981
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132700
rate of convergenceimplicit schemessparse LU factorizationacceleration parametersextreme eigenvalues of the iteration matrixsemi-direct method
Factorization of matrices (15A23) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Iterative numerical methods for linear systems (65F10)
Related Items (10)
Preconditioned iterative methods for solving 3d boundary value problems ⋮ Approximate root-free factorization techniques for solving elliptic difference equations in three space variables ⋮ Numerical solution of three-dimensional boundary-value problems by generalized approximate inverse matrix techniques ⋮ A class of explicit preconditioned conjugate gradient methods for solving large finite element systems ⋮ The rate of convergence of explicit approximate inverse preconditioning ⋮ Numerical solution of non-linear elliptic boundary-value problems by isomorphic iterative methods ⋮ Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors ⋮ Preconditioning by approximations of the discrete Laplacian for 2‐D non‐linear free convection elliptic equations ⋮ Implicit semi-direct methods based on root-free sparse factorization procedures ⋮ Explicit preconditioned conjugate gradient schemes for solving biharmonic equations
Cites Work
This page was built for publication: The rate of convergence of an approximate matrix factorization semi- direct method
