Several algorithms have appeared for solving the Ordinary Linear Model (OLM), after a number of observations have been added or deleted. In this paper we employ Householder transformations and Givens rotations to solve the updated and downdated OLM, using a massively parallel SIMD computer. Some of our methods are modified versions of serial algorithms published previously while others appear for the first time. The execution time models of all algorithms are studied and compared
The availability of high-performance computing tools gives the opportunity of solving mathematical r...
Computationally efficient serial and parallel algorithms for estimating the general linear model are...
The paper deals with the developing of the methodological backgrounds for the modeling and simulatio...
Two parallel algorithms are proposed for the solution of the General Linear Model on a SIMD array pr...
Within the context of recursive least-squares, the implementation of a Householder algorithm for blo...
This dissertation proposes a new technique for efficient parallel solution of very large linear syst...
AbstractThe use of the Givens method to solve linear equations on a parallel computer is reviewed, a...
AbstractThe solution of linear systems continues to play an important role in scientific computing. ...
We report on the properties of implementations of fast-Givens rotation and Householder reflector bas...
. In this paper we employ Householder transformations and compound Givens rotations to compute the C...
In this paper a parallel implementation of the SVD-updating algorithm using approximate rotations is...
n this paper we propose new stable parallel algorithms based on Householder transformations and comp...
The interior point method (IPM) is now well established as a competitive technique for solving very ...
Streaming SIMD Extensions (SSE) is a unique feature embedded in the Pentium III and IV classes of mi...
In this thesis we study iterative algorithms with simple sublinear time update steps, and we show ho...
The availability of high-performance computing tools gives the opportunity of solving mathematical r...
Computationally efficient serial and parallel algorithms for estimating the general linear model are...
The paper deals with the developing of the methodological backgrounds for the modeling and simulatio...
Two parallel algorithms are proposed for the solution of the General Linear Model on a SIMD array pr...
Within the context of recursive least-squares, the implementation of a Householder algorithm for blo...
This dissertation proposes a new technique for efficient parallel solution of very large linear syst...
AbstractThe use of the Givens method to solve linear equations on a parallel computer is reviewed, a...
AbstractThe solution of linear systems continues to play an important role in scientific computing. ...
We report on the properties of implementations of fast-Givens rotation and Householder reflector bas...
. In this paper we employ Householder transformations and compound Givens rotations to compute the C...
In this paper a parallel implementation of the SVD-updating algorithm using approximate rotations is...
n this paper we propose new stable parallel algorithms based on Householder transformations and comp...
The interior point method (IPM) is now well established as a competitive technique for solving very ...
Streaming SIMD Extensions (SSE) is a unique feature embedded in the Pentium III and IV classes of mi...
In this thesis we study iterative algorithms with simple sublinear time update steps, and we show ho...
The availability of high-performance computing tools gives the opportunity of solving mathematical r...
Computationally efficient serial and parallel algorithms for estimating the general linear model are...
The paper deals with the developing of the methodological backgrounds for the modeling and simulatio...