Two parallel algorithms are proposed for the solution of the General Linear Model on a SIMD array processor. The first algorithm employs efficiently compound Givens rotations while the second algorithm uses Householder transformations. The implementation of the two algorithms on the 1024 processor AMT DAP-510 is described and their performance analysed using high accurate execution time models. No single algorithm is superior in all ranges examined and the best choice depends on the problem size and the number of processing elements available
A SIMD scheme for parallelization of the 2-D array operation M(x) = (D×A + B×I + V) x is developed f...
AbstractA profile is given of current research, as it pertains to computational mathematics, on Very...
n this paper we propose new stable parallel algorithms based on Householder transformations and comp...
Several algorithms have appeared for solving the Ordinary Linear Model (OLM), after a number of obse...
. In this paper we employ Householder transformations and compound Givens rotations to compute the C...
The concurrent solution of large linear systems of equations on processor meshes of fixed size has b...
This dissertation proposes a new technique for efficient parallel solution of very large linear syst...
This paper provides an introduction to algorithms for fundamental linear algebra problems on various...
This paper provides an introduction to algorithms for fundamental linear algebra problems on various...
As parallel machines become more widely available, many existing algorithms are being converted to t...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are...
Streaming SIMD Extensions (SSE) is a unique feature embedded in the Pentium III and IV classes of mi...
Part 1: Session 1: Parallel Programming and AlgorithmsInternational audienceThe LU decomposition is ...
The thesis is concerned with the inversion of matrices and the solution of linear systems and eigens...
This study developed a parallel algorithm to efficiently solve linear programming models. The propos...
A SIMD scheme for parallelization of the 2-D array operation M(x) = (D×A + B×I + V) x is developed f...
AbstractA profile is given of current research, as it pertains to computational mathematics, on Very...
n this paper we propose new stable parallel algorithms based on Householder transformations and comp...
Several algorithms have appeared for solving the Ordinary Linear Model (OLM), after a number of obse...
. In this paper we employ Householder transformations and compound Givens rotations to compute the C...
The concurrent solution of large linear systems of equations on processor meshes of fixed size has b...
This dissertation proposes a new technique for efficient parallel solution of very large linear syst...
This paper provides an introduction to algorithms for fundamental linear algebra problems on various...
This paper provides an introduction to algorithms for fundamental linear algebra problems on various...
As parallel machines become more widely available, many existing algorithms are being converted to t...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are...
Streaming SIMD Extensions (SSE) is a unique feature embedded in the Pentium III and IV classes of mi...
Part 1: Session 1: Parallel Programming and AlgorithmsInternational audienceThe LU decomposition is ...
The thesis is concerned with the inversion of matrices and the solution of linear systems and eigens...
This study developed a parallel algorithm to efficiently solve linear programming models. The propos...
A SIMD scheme for parallelization of the 2-D array operation M(x) = (D×A + B×I + V) x is developed f...
AbstractA profile is given of current research, as it pertains to computational mathematics, on Very...
n this paper we propose new stable parallel algorithms based on Householder transformations and comp...