Tridiagonal matrices;
Crout's LU factorization;
recurrence relation;
D O I:
10.1080/09720529.2005.10698020
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
An algorithm for computing the inverse of a general tridiagonal matrix is introduced. This algorithm is obtained by factoring this matrix into the product of two bidiagonal matrices using Crout's LU factorization, one upper and one lower bidiagonal. A simple recurrence relation is used to generate a sequence of numbers, this sequence is then used to fill in the matrices L, u, L-1, u(-1) and consequently the required inverse.
机构:
Univ Calif Berkeley, Dept Math, Berkeley, CA 94720 USA
Univ Calif Berkeley, Div Comp Sci, Dept EECS, Berkeley, CA 94720 USAUniv Calif Berkeley, Dept Math, Berkeley, CA 94720 USA
Parlett, Beresford
Dopico, Froilan M.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Carlos III Madrid, Dept Matemat, Leganes 28911, SpainUniv Calif Berkeley, Dept Math, Berkeley, CA 94720 USA
Dopico, Froilan M.
Ferreira, Carla
论文数: 0引用数: 0
h-index: 0
机构:
Univ Minho, Ctr Math, P-4710057 Braga, Portugal
Univ Minho, Math & Applicat Dept, P-4710057 Braga, PortugalUniv Calif Berkeley, Dept Math, Berkeley, CA 94720 USA