Add to ORKGIn this paper we describe an hybrid algorithm for an even number of processors based on an algorithm for two processors and the Overlapping Partition Method for tridiagonal systems. Moreover, we compare this hybrid method with the Partition Wang’s method in a BSP computer. Finally, we compare the theoretical computation cost of both methods for a Cray T3D computer, using the cost model that BSP model provides.This work was partially supported by Spanish DGES grants PB97-0334 and PB98-0977
this paper, the wrap-around partitioning methodology, originally proposed by Hegland [1], is conside...
本論文對線性三對角方程組之解法提出平行演算法於超立方體網路 (hypercube network), 並且此平行演算法能達到最佳費用 (optimalcost ) O(N). 討論的解法包含 (1)循...
Various tridiagonal solvers have been proposed in recent years for different parallel platforms. In ...
In this paper we describe an hybrid algorithm for an even number of processors based on an algorithm...
An optimized parallel algorithm is proposed to solve the problem occurred in the process of complica...
A new method, namely the Parallel Two-Level Hybrid (PTH) method, is developed to solve tridiagonal s...
Abstract—A new method, namely, the Parallel Two-Level Hybrid (PTH) method, is developed to solve tri...
AbstractA parallel version of the cyclic reduction algorithm for the solution of tridiagonal linear ...
AbstractIn a recent publication (1992), the authors showed how efficient a new level 3 BLAS algorith...
AbstractThe recursive doubling algorithm as developed by Stone can be used to solve a tridiagonal li...
ABSTRACT. Tridiagonal linear systems of equations can be solved on conventional serial machines in a...
This paper is concerned with the parallel implementation of two splittings methods for solving block...
We study the performance of three parallel algorithms and their hybrid variants for solving tridiago...
The Parallel Diagonal Dominant (PDD) algorithm is an efficient tridiagonal solver. In this paper, a ...
AbstractDiagonally dominant tridiagonal Toeplitz systems of linear equations arise in many applicati...
this paper, the wrap-around partitioning methodology, originally proposed by Hegland [1], is conside...
本論文對線性三對角方程組之解法提出平行演算法於超立方體網路 (hypercube network), 並且此平行演算法能達到最佳費用 (optimalcost ) O(N). 討論的解法包含 (1)循...
Various tridiagonal solvers have been proposed in recent years for different parallel platforms. In ...
In this paper we describe an hybrid algorithm for an even number of processors based on an algorithm...
An optimized parallel algorithm is proposed to solve the problem occurred in the process of complica...
A new method, namely the Parallel Two-Level Hybrid (PTH) method, is developed to solve tridiagonal s...
Abstract—A new method, namely, the Parallel Two-Level Hybrid (PTH) method, is developed to solve tri...
AbstractA parallel version of the cyclic reduction algorithm for the solution of tridiagonal linear ...
AbstractIn a recent publication (1992), the authors showed how efficient a new level 3 BLAS algorith...
AbstractThe recursive doubling algorithm as developed by Stone can be used to solve a tridiagonal li...
ABSTRACT. Tridiagonal linear systems of equations can be solved on conventional serial machines in a...
This paper is concerned with the parallel implementation of two splittings methods for solving block...
We study the performance of three parallel algorithms and their hybrid variants for solving tridiago...
The Parallel Diagonal Dominant (PDD) algorithm is an efficient tridiagonal solver. In this paper, a ...
AbstractDiagonally dominant tridiagonal Toeplitz systems of linear equations arise in many applicati...
this paper, the wrap-around partitioning methodology, originally proposed by Hegland [1], is conside...
本論文對線性三對角方程組之解法提出平行演算法於超立方體網路 (hypercube network), 並且此平行演算法能達到最佳費用 (optimalcost ) O(N). 討論的解法包含 (1)循...
Various tridiagonal solvers have been proposed in recent years for different parallel platforms. In ...