Vectorization of linear recurrence relations
SIAM Journal on Scientific and Statistical Computing
Solving linear recurrences with loop raking
Journal of Parallel and Distributed Computing
Review of general and Toeplitz vector bidiagonal solvers
Parallel Computing
The scientist and engineer's guide to digital signal processing
The scientist and engineer's guide to digital signal processing
Parallel programming in OpenMP
Parallel programming in OpenMP
Solving Linear Systems on Vector and Shared Memory Computers
Solving Linear Systems on Vector and Shared Memory Computers
On the numerical evaluation of linear recurrences
Journal of Computational and Applied Mathematics
Solving Linear Recurrence Systems on a Cray Y-MP
PARA '94 Proceedings of the First International Workshop on Parallel Scientific Computing
New Generalized Data Structures for Matrices Lead to a Variety of High Performance Algorithms
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Parallel Algorithms for Solving Linear Recurrence Systems
CONPAR '92/ VAPP V Proceedings of the Second Joint International Conference on Vector and Parallel Processing: Parallel Processing
High-performance linear algebra algorithms using new generalized data structures for matrices
IBM Journal of Research and Development
| Hi-index | 0.00 |
The aim of this contribution is to show that the performance of the recently developed high performance algorithm for evaluating linear recursive filters can be increased by using new generalized data structures for dense matrices introduced by F. G. Gustavson. The new implementation is based on vectorized algorithms for banded triangular Toeplitz matrix - vector multiplication and the algorithm for solving linear recurrence systems with constant coefficients. The results of experiments performed on Intel Itanium 2 and Cray X1 are also presented and discussed.