Sciweavers

231 search results - page 1 / 47
» Parallel algorithms for indefinite linear systems
Sort
View
PC
2002
118views Management» more  PC 2002»
13 years 4 months ago
Parallel algorithms for indefinite linear systems
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
Ahmed H. Sameh, Vivek Sarin
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 5 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...
AUTOMATICA
2006
70views more  AUTOMATICA 2006»
13 years 5 months ago
A Toeplitz algorithm for polynomial J-spectral factorization
A block Toeplitz algorithm is proposed to perform the J-spectral factorization of a para-Hermitian polynomial matrix. The input matrix can be singular or indefinite, and it can ha...
Juan Carlos Zúñiga, Didier Henrion
PARLE
1993
13 years 9 months ago
Arithmetic for Parallel Linear Recursive Query Evaluation in Deductive Databases
: An arithmetic approach, such as the Level-Finding method described in this paper for evaluating linear recursive queries in deductive database systems provides great potential fo...
Jerome Robinson, Shutian Lin