An algorithm for decomposing a class of matrices into lower and upper triangular matrices

DOI10.1016/0016-0032(90)90030-MMaRDI QIDQ923596zbMATH OpenOpenAlexWikidataFDO

Authors David J. Lanteigne, Don A. Gregory, Adhami, Reza R.

Publication date 1990

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0016-0032(90)90030-m

zbMATH Keywords

algorithm almost tridiagonal matrices direct method LU decomposition Numerical examples

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Review text

For a class of almost tridiagonal matrices an efficient algorithm for factoring it into a product of lower and upper \((=LU)\) triangular matrices is presented. Numerical examples are given.

This page was built for publication: An algorithm for decomposing a class of matrices into lower and upper triangular matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q923596)