A higher-order compact method in space and time based on parallel implementation of the Thomas algorithm
Publication:1570339
DOI10.1006/JCPH.2000.6497zbMath0959.65102OpenAlexW2014574788MaRDI QIDQ1570339
Philip J. Morris, Alex Povitsky
Publication date: 18 April 2001
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcph.2000.6497
parallel computingcompact schemeThomas algorithmhigher-order numerical methodpipelined Gauss elimination
Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Parallel numerical computation (65Y05) Initial value problems for first-order hyperbolic systems (35L45)
Related Items (17)
Cites Work
- Dispersion-relation-preserving finite differene schemes for computational acoustics
- Compact finite difference schemes with spectral-like resolution
- Boundary and interface conditions for high-order finite-difference methods applied to the Euler and Navier-Stokes equations
- A parallel three-dimensional computational aeroacoustics method using nonlinear disturbance equations
- Optimizing Tridiagonal Solvers for Alternating Direction Methods on Boolean Cube Multiprocessors
- Numerical Linear Algebra for High-Performance Computers
- Sound generation by shock–vortex interactions
- Alternating-Direction Line-Relaxation Methods on Multicomputers
- Numerical Stability in Problems of Linear Algebra
This page was built for publication: A higher-order compact method in space and time based on parallel implementation of the Thomas algorithm