Unified framework for the parallelization of divide and conquer based tridiagonal systems
- 1 June 1997
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 23 (6) , 667-686
- https://doi.org/10.1016/s0167-8191(97)00022-7
Abstract
No abstract availableKeywords
Funding Information
- European Commission (BRITE-EURAM III BE95 1564)
- Ministerio de Ciencia e Innovación
- Comisión Interministerial de Ciencia y Tecnología (TIC96 1125CO3a)
This publication has 18 references indexed in Scilit:
- A binary tree implementation of a parallel distributed tridiagonal solverParallel Computing, 1995
- Unified architecture for divide and conquer based tridiagonal system solversIEEE Transactions on Computers, 1994
- Parallel architecture for fast transforms with trigonometric kernelIEEE Transactions on Parallel and Distributed Systems, 1994
- Constant geometry fast Fourier transforms on array processorsIEEE Transactions on Computers, 1993
- Efficient tridiagonal solvers on multicomputersIEEE Transactions on Computers, 1992
- A VLSI constant geometry architecture for the fast Hartley and Fourier transformsIEEE Transactions on Parallel and Distributed Systems, 1992
- Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equationsParallel Computing, 1991
- A method to parallelize tridiagonal solversParallel Computing, 1991
- Parallelization and vectorization aspects of the solution of tridiagonal linear systemsParallel Computing, 1990
- An Adaptation of the Fast Fourier Transform for Parallel ProcessingJournal of the ACM, 1968