573 search results - page 34 / 115 » On Wiedemann's Method of Solving Sparse Linear Systems |
PC
2010
13 years 7 months ago
2010
The graphics processing unit (GPU) is used to solve large linear systems derived from partial differential equations. The differential equations studied are strongly convection-...
CVPR
2010
IEEE
13 years 9 months ago
2010
IEEE
It has been of great interest to find sparse and/or nonnegative representations in computer vision literature. In this paper we propose a novel method to such a purpose and refer...
ICPPW
2006
IEEE
14 years 3 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
SIAMSC
2008
13 years 9 months ago
2008
Abstract. Many vector-valued functions, representing expensive computations, are also structured computations. In this case the calculation of the Newton step can be greatly accele...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...