1972Mathematics of ComputationRequires access

On the Solution of Block-Tridiagonal Systems Arising from Certain Finite-Difference Equations

J. M. Varah

Open publisher page 11 citations

Abstract

We consider the solution of the linear systems arising from certain implicit finite-difference approximations to systems of linear differential equations. In particular, we consider those schemes which lead to matrices of block-tridiagonal form. There are two common methods for solving such equations: using a block-tridiagonal factorization (blocksolve), or treating the matrix as a band matrix (bandsolve). First, we discuss conditions for ensuring the numerical stability of the block-tridiagonal factorization for general matrices of this form. Then, we compare the two methods for general block-tridiagonal matrices (including matrices arising from the Crank-Nicolson scheme for systems of parabolic equations) and for a more specialized block-tridiagonal matrix which arises from schemes of H. B. Keller for systems of two-point boundary value problems and parabolic equations.

About this research paper

What this paper is about

We consider the solution of the linear systems arising from certain implicit finite-difference approximations to systems of linear differential equations. In particular, we consider those schemes which lead to matrices of block-tridiagonal form. There are two common methods for solving such equations: using a block-tridiagonal factorization (blocksolve), or treating the matrix as a band matrix (bandsolve). First, we discuss conditions for ensuring the numerical stability of the block-tridiagonal factorization for general matrices of this form. Then, we compare the two methods for general block-tridiagonal matrices (including matrices arising from the Crank-Nicolson scheme for systems of parabolic equations) and for a more specialized block-tridiagonal matrix which arises from schemes of H. B. Keller for systems of two-point boundary value problems and parabolic equations.

Why it matters

OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We consider the solution of the linear systems arising from certain implicit finite-difference approximations to systems of linear differential equations. In particular, we consider those schemes which lead to matrices of block-tridiagonal form. There are two common methods for solving such equations: using a block-tridiagonal factorization (blocksolve), or treating the matrix as a band matrix (bandsolve). First, we discuss conditions for ensuring the numerical stability of the block-tridiagonal factorization for general matrices of this form. Then, we compare the two methods for general block-tridiagonal matrices (including matrices arising from the Crank-Nicolson scheme for systems of parabolic equations) and for a more specialized block-tridiagonal matrix which arises from schemes of H. B. Keller for systems of two-point boundary value problems and parabolic equations.

Key concepts: Tridiagonal matrix, Mathematics, Tridiagonal matrix algorithm, Crank–Nicolson method, Matrix splitting, Applied mathematics, Matrix (chemical analysis), Boundary value problem

Related papers

Back to paper searchBrowse research topicsOriginal source
On the Solution of Block-Tridiagonal Systems Arising from Certain Finite-Difference Equations — Research Paper | ScholarLens