Approximate root-free factorization techniques for solving elliptic difference equations in three space variables
DOI10.1016/0024-3795(86)90227-2zbMath0609.65070OpenAlexW1976256539MaRDI QIDQ1086996
Publication date: 1986
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(86)90227-2
finite difference methodsselfadjointimplicit iterative schemeasymptotic number of iterationsdirect factorization algorithm
Factorization of matrices (15A23) Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Implicit semi-direct methods based on root-free sparse factorization procedures
- 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
- 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
- Ordering of the iterative parameters in the cyclical Chebyshev iterative method
- A generalized SSOR method
- A Symmetric Factorization Procedure for the Solution of Elliptic Boundary Value Problems
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
This page was built for publication: Approximate root-free factorization techniques for solving elliptic difference equations in three space variables