Sciweavers

170 search results - page 27 / 34
» Solving Sparse Integer Linear Systems
Sort
View
SC
1995
ACM
14 years 1 months ago
A Novel Approach Towards Automatic Data Distribution
: Data distribution is one of the key aspects that a parallelizing compiler for a distributed memory architecture should consider, in order to get efficiency from the system. The ...
Jordi Garcia, Eduard Ayguadé, Jesús ...
SGP
2003
13 years 11 months ago
Global Conformal Parameterization
We solve the problem of computing global conformal parameterizations for surfaces with nontrivial topologies. The parameterization is global in the sense that it preserves the con...
Xianfeng Gu, Shing-Tung Yau
FCSC
2008
88views more  FCSC 2008»
13 years 9 months ago
Fraction-free matrix factors: new forms for LU and QR factors
Gaussian elimination and LU factoring have been greatly studied from the algorithmic point of view, but much less from the point view of the best output format. In this paper, we g...
Wenqin Zhou, David J. Jeffrey
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 9 months ago
MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
Abstract. CG, SYMMLQ, and MINRES are Krylov subspace methods for solving large symmetric systems of linear equations. CG (the conjugate-gradient method) is reliable on positive-def...
Sou-Cheng T. Choi, Christopher C. Paige, Michael A...
IPPS
2006
IEEE
14 years 3 months ago
On the performance of parallel normalized explicit preconditioned conjugate gradient type methods
A new class of parallel normalized preconditioned conjugate gradient type methods in conjunction with normalized approximate inverses algorithms, based on normalized approximate f...
George A. Gravvanis, Konstantinos M. Giannoutakis