416 search results - page 22 / 84 » A Paradigm for Parallel Matrix Algorithms: |
ARITH
1993
IEEE
15 years 3 months ago
1993
IEEE
An attractive paradigm for building fast numerical algorithms is the following: 1 try a fast but occasionally unstable algorithm, 2 test the accuracy of the computed answer, a...
77
Voted
IPPS
1999
IEEE
15 years 3 months ago
1999
IEEE
The system of equations that govern kinematically redundant manipulators is commonly solved by nding the singular value decomposition (SVD) of the corresponding Jacobian matrix. T...
HPCC
2007
Springer
15 years 5 months ago
2007
Springer
This paper presents a new algorithm for computing the singular value decomposition (SVD) on multilevel memory hierarchy architectures. This algorithm is based on one-sided JRS iter...
77
Voted
WCRE
2002
IEEE
15 years 4 months ago
2002
IEEE
As new computer architectures are developed to exploit large-scale data-level parallelism, techniques are needed to retarget legacy sequential code to these platforms. Sequential ...
108
click to vote
NC
1998
15 years 12 days ago
1998
In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is exte...