A THREE-DIMENSIONAL SYMMETRIC LINEAR EQUATION SOLVER.

Saved in:
Bibliographic Details
Title: A THREE-DIMENSIONAL SYMMETRIC LINEAR EQUATION SOLVER.
Authors: Gravyanis, George A.1
Source: Communications in Numerical Methods in Engineering. Sep94, Vol. 10 Issue 9, p717-730. 14p.
Subjects: Factorization of operators, Finite differences, Numerical analysis, Matrices (Mathematics), Algorithms, Sparse matrices
Abstract: Factorization procedures for the efficient solution of large sparse linear finite difference systems have been introduced recently. In these procedures the large sparse symmetric coefficient matrix of a certain structure is factorized exactly, yielding a direct solution method. Furthermore, approximate factorization procedures yield implicit preconditioning iterative methods for the finite difference solution. The numerical implementation of these algorithms is presented and Fortran subroutines for the efficient solution of the resulting sparse symmetric linear system of algebraic equations are given. [ABSTRACT FROM AUTHOR]
Copyright of Communications in Numerical Methods in Engineering is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Factorization procedures for the efficient solution of large sparse linear finite difference systems have been introduced recently. In these procedures the large sparse symmetric coefficient matrix of a certain structure is factorized exactly, yielding a direct solution method. Furthermore, approximate factorization procedures yield implicit preconditioning iterative methods for the finite difference solution. The numerical implementation of these algorithms is presented and Fortran subroutines for the efficient solution of the resulting sparse symmetric linear system of algebraic equations are given. [ABSTRACT FROM AUTHOR]
ISSN:10698299
DOI:10.1002/cnm.1640100906