Direct and approximate algorithmic methods for solving self-adjoint elliptic PDEs in three-space dimensions

DOI10.1016/0377-0427(83)90039-0zbMath0538.65071OpenAlexW1965977433MaRDI QIDQ793502

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)90039-0

zbMATH Keywords

numerical exampleFORTRAN routinesincomplete factorizationforward-backward substitution

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Approximate root-free factorization techniques for solving elliptic difference equations in three space variables

This page was built for publication: Direct and approximate algorithmic methods for solving self-adjoint elliptic PDEs in three-space dimensions