Log in

Sparse algorithms for indefinite system of linear equations

  • Article
  • Published:
Computational Mechanics Aims and scope Submit manuscript

Abstract

 Sparse LDLT algorithms, based upon mixed forward-backward factorization strategies, are developed for direct solution of indefinite system of linear equations. A simple rotation matrix is also introduced and incorporated into 2×2 pivoting strategies. Several test problems have been conducted in order to evaluate the numerical performance of the proposed algorithms, and its associated FORTRAN codes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Germany)

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, P., Runesha, H., Nguyen, D. et al. Sparse algorithms for indefinite system of linear equations. Computational Mechanics 25, 33–42 (2000). https://doi.org/10.1007/s004660050013

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004660050013

Keywords

Navigation