A DIRECT SOLUTION TO THE BLOCK TRIDIAGONAL MATRIX INVERSION PROBLEM

DOI10.1080/03081078908935044zbMath0683.65011OpenAlexW2010879813MaRDI QIDQ4733290

Keith Bowden

Publication date: 1989

Published in: International Journal of General Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081078908935044

zbMATH Keywords

algorithmfinite differencesblock matricesinverse of a block tridiagonal matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Solution of finite-horizon multivariate linear rational expectations models and sparse linear systems, Computing entries of the inverse of a sparse matrix using the FIND algorithm

Cites Work

• Partitioning, tearing and modification of sparse linear systems
• An $O(n^2 )$ Method for Solving Constant Coefficient Boundary Value Problems in Two Dimensions
• Marching Algorithms for Elliptic Boundary Value Problems. I: The Constant Coefficient Case
• Marching Algorithms for Elliptic Boundary Value Problems. II: The Variable Coefficient Case
• On Direct Methods for Solving Poisson’s Equations