AbstractWe show a simple parallel acceleration (from about 2n to about 1.4n lognparallel arithmetic steps) of the straightforward parallelization of the substitution algorithm for a nonsingular triangular linear system of n equations. This only requires that we increase by less than 3 times the overall number of flops (or the potential work) of the former algorithm. The previous parallel acceleration of the substitution algorithm in [1] was slower than ours by the factor log n
This paper presents new algorithms for the parallel evaluation of certain polynomial expres-sions. I...
Solving a system of equations of the form Tx = y, where T is a sparse triangular matrix, is require...
We consider solving triangular systems of linear equations on a hypercube multiprocessor. Specifica...
A few parallel algorithms for solving triangular systems resulting from parallel factorization of sp...
AbstractThis paper explores the problem of solving triangular linear systems on parallel distributed...
[[abstract]]A fast parallel algorithm, which is generalized from the parallel algorithms for solving...
A new parallel approach for solving a pentadiagonal linear system is presented. The parallel partiti...
Solution of sparse triangular systems of linear equations is a performance bottleneck in many method...
The paper presents two new algorithms for the direct parallel solution of systems of linear equation...
We consider the problem of computing a scaling α such that the solution x of the scaled linear syste...
Several parallel algorithms have been proposed for the solution of triangular systems. The stability...
ABSTRACT. Tridiagonal linear systems of equations can be solved on conventional serial machines in a...
Matrix L is lower triangular if all entries above its main diagonal are zero, `ij = 0 for i < j M...
ABSTR&CT. The parallel evaluation of rational expressions i considered. New algorithms which min...
International audienceOn modern parallel architectures, floating-point computations may become non-d...
This paper presents new algorithms for the parallel evaluation of certain polynomial expres-sions. I...
Solving a system of equations of the form Tx = y, where T is a sparse triangular matrix, is require...
We consider solving triangular systems of linear equations on a hypercube multiprocessor. Specifica...
A few parallel algorithms for solving triangular systems resulting from parallel factorization of sp...
AbstractThis paper explores the problem of solving triangular linear systems on parallel distributed...
[[abstract]]A fast parallel algorithm, which is generalized from the parallel algorithms for solving...
A new parallel approach for solving a pentadiagonal linear system is presented. The parallel partiti...
Solution of sparse triangular systems of linear equations is a performance bottleneck in many method...
The paper presents two new algorithms for the direct parallel solution of systems of linear equation...
We consider the problem of computing a scaling α such that the solution x of the scaled linear syste...
Several parallel algorithms have been proposed for the solution of triangular systems. The stability...
ABSTRACT. Tridiagonal linear systems of equations can be solved on conventional serial machines in a...
Matrix L is lower triangular if all entries above its main diagonal are zero, `ij = 0 for i < j M...
ABSTR&CT. The parallel evaluation of rational expressions i considered. New algorithms which min...
International audienceOn modern parallel architectures, floating-point computations may become non-d...
This paper presents new algorithms for the parallel evaluation of certain polynomial expres-sions. I...
Solving a system of equations of the form Tx = y, where T is a sparse triangular matrix, is require...
We consider solving triangular systems of linear equations on a hypercube multiprocessor. Specifica...
DOI
Add to ORKG