A normalized sparse linear equations solver (Q793503)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3856344
Language Label Description Also known as
default for all languages
No label defined
    English
    A normalized sparse linear equations solver
    scientific article; zbMATH DE number 3856344

      Statements

      A normalized sparse linear equations solver (English)
      0 references
      0 references
      1983
      0 references
      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.
      0 references
      incomplete factorization
      0 references
      finite element systems
      0 references
      self-adjoint elliptic partial differential equations
      0 references
      forward-backward substitution
      0 references
      inner iteration
      0 references
      approximate \(D_{R}T'_{R}T_{R}D_{R}\) factorization
      0 references
      numerical example
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references