An efficient algorithm for a model with a bidiagonal coefficient matrix
Publication:1855035
DOI10.1016/S0096-3003(00)00052-7zbMath1024.65079WikidataQ126671160 ScholiaQ126671160MaRDI QIDQ1855035
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
finite difference method; parallel computing; tridiagonal systems; one step methods; bidiagonal system; first-order hyperbolic equation; bidiagonal Toeplitz matrix; heat exchanger coefficient
65F50: Computational methods for sparse matrices
65M06: Finite difference methods for initial value and initial-boundary value problems involving PDEs
80M20: Finite difference methods applied to problems in thermodynamics and heat transfer
35L45: Initial value problems for first-order hyperbolic systems
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
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