Implicit semi-direct methods based on root-free sparse factorization procedures

DOI10.1007/BF02218440zbMath0517.65081OpenAlexW1994489635MaRDI QIDQ1053429

Elias A. Lipitakis, David J. Evans

Publication date: 1983

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02218440

zbMATH Keywords

numerical results23, 194-208 (1983)implicit semi-direct methodsroot-free sparse factorization

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical computation of solutions to systems of equations (65H10) Boundary value problems for second-order elliptic equations (35J25) Hyperbolic conservation laws (35L65) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (5)

Approximate root-free factorization techniques for solving elliptic difference equations in three space variables ⋮ A class of explicit preconditioned conjugate gradient methods for solving large finite element systems ⋮ A three‐dimensional symmetric linear equation solver ⋮ Explicit approximate inverse preconditioning techniques ⋮ The rate of convergence of explicit approximate inverse preconditioning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Normalized factorization procedures for the solution of self-adjoint elliptic partial differential equations in three-space dimensions
• Solving non-linear elliptic difference equations by extendable sparse factorization procedures
• The rate of convergence of an approximate matrix factorization semi- direct method
• A normalized implicit conjugate gradient method for the solution of large sparse systems of linear equations
• The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
• An extrapolation procedure for solving linear systems
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• A class of first order factorization methods
• An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
• Iterative Solution of Implicit Approximations of Multidimensional Partial Differential Equations

This page was built for publication: Implicit semi-direct methods based on root-free sparse factorization procedures