Tridiagonal matrix algorithm
id:
tridiagonal-matrix-algorithm-268-8476056
title:
Tridiagonal matrix algorithm
text:
In numerical linear algebra, the tridiagonal matrix algorithm, also known as the Thomas algorithm, is a simplified form of Gaussian elimination that can be used to solve tridiagonal systems of equations. A tridiagonal system for n unknowns may be written as where a 1 = 0 and c n = 0 . For such systems, the solution can be obtained in O operations instead of O required by Gaussian elimination. A first sweep eliminates the a i 's, and then an (abbreviated) backward substitution produces the soluti
brand slug:
wiki
category slug:
encyclopedia
description:
Improved reduction for specific matrices
original url:
https://en.wikipedia.org/wiki/Tridiagonal_matrix_algorithm
date created:
date modified:
2024-04-08T21:00:54Z
main entity:
{"identifier":"Q1819156","url":"https://www.wikidata.org/entity/Q1819156"}
image:
fields total:
13
integrity:
14