An efficient algorithm for a model with a bidiagonal coefficient matrix

DOI10.1016/S0096-3003(00)00052-7zbMath1024.65079OpenAlexW2062423884WikidataQ126671160 ScholiaQ126671160MaRDI QIDQ1855035

L. E. Garey

Publication date: 28 January 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(00)00052-7

zbMATH Keywords

finite difference methodparallel computingtridiagonal systemsone step methodsbidiagonal systemfirst-order hyperbolic equationbidiagonal Toeplitz matrixheat exchanger coefficient

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Finite difference methods applied to problems in thermodynamics and heat transfer (80M20) Initial value problems for first-order hyperbolic systems (35L45) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

A parallel method for linear equations with tridiagonal Toeplitz coefficient matrices

Cites Work

• A new method for solving symmetric circulant tridiagonal systems of linear equations
• A parallel algorithm for solving Toeplitz linear systems
• A moving grid algorithm for a heat exchanger with phase changes
• A fast algorithm for solving special tridiagonal systems
• On the Solution of Circulant Linear Systems
• A Parallel Fast Direct Solver for Block Tridiagonal Systems with Separable Matrices of Arbitrary Dimension
• A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
• On Direct Methods for Solving Poisson’s Equations

This page was built for publication: An efficient algorithm for a model with a bidiagonal coefficient matrix