A normalized sparse linear equations solver

DOI10.1016/0377-0427(83)90021-3MaRDI QIDQ793503zbMATH OpenOpenAlexFDO

Authors Elias A. Lipitakis

Publication date 1983

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-0427(83)90021-3

zbMATH Keywords

approximate \(D_{R}T'_{R}T_{R}D_{R}\) factorizationfinite element systemsforward-backward substitutionincomplete factorizationinner iterationnumerical exampleself-adjoint elliptic partial differential equations

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to linear algebra (15-04) Factorization of matrices (15A23) Boundary value problems for second-order elliptic equations (35J25) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Review text

The finite element solution of a class of two-dimensional self-adjoint elliptic partial differential equations leads to the solution of a linear system with a large sparse symmetric coefficient matrix which has an irregular off-centre band. After factorization into \(DTT^ TD\) with \(D\) diagonal and \(T\) upper unit triangular the system can essentially be solved by forward-backward substitution. The exact factorization can be considered as a special case of a described approximate factorization where the amount of fill in for the factor \(T\) can be guarded by a fill in or a rejection parameter. An inner iteration is needed for the determination of \(T\)'s coefficients. A \texttt{Fortran} routine is given for the solution of the sparse linear system and a numerical example is reported on.

Recommendations

• scientific article; zbMATH DE number 3888795
• Direct and approximate algorithmic methods for solving self-adjoint elliptic PDEs in three-space dimensions
• A Factorization-Related Method for Elliptic Partial Differential Equations with Iterative Improvement
• Direct Methods for Solving Sparse Systems of Linear Equations
• Approximate root-free factorization techniques for solving elliptic difference equations in three space variables

Cites work

• A normalized implicit conjugate gradient method for the solution of large sparse systems of linear equations
• scientific article; zbMATH DE number 3562346 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)

Cited in

(11)

• OpenMP based parallel normalized direct methods for sparse finite element linear systems
• Explicit approximate inverse preconditioning techniques
• A sparse linear equations solver for 3D-regular domains
• scientific article; zbMATH DE number 3930235 (Why is no real title available?)
• OAHM: A fortran subroutine for solving a class of unsymmetric linear systems of equations
• scientific article; zbMATH DE number 1286195 (Why is no real title available?)
• Preconditioned iterative methods for solving 3d boundary value problems
• scientific article; zbMATH DE number 851599 (Why is no real title available?)
• Hybrid Sparse Linear Solutions with Substituted Factorization
• Direct and approximate algorithmic methods for solving self-adjoint elliptic PDEs in three-space dimensions
• High performance inverse preconditioning

This page was built for publication: A normalized sparse linear equations solver

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793503)