Sciweavers

5115 search results - page 3 / 1023
» On Randomized Lanczos Algorithms
Sort
View
SIAMSC
2011
162views more  SIAMSC 2011»
13 years 1 months ago
Accelerating the LSTRS Algorithm
In a recent paper [Rojas, Santos, Sorensen: ACM ToMS 34 (2008), Article 11] an efficient method for solving the Large-Scale Trust-Region Subproblem was suggested which is based on ...
Jörg Lampe, Marielba Rojas, Danny C. Sorensen...
SIAMSC
2010
143views more  SIAMSC 2010»
13 years 4 months ago
Computing and Deflating Eigenvalues While Solving Multiple Right-Hand Side Linear Systems with an Application to Quantum Chromod
Abstract. We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate G...
Andreas Stathopoulos, Konstantinos Orginos
PPSC
1993
13 years 7 months ago
A Matrix Framework for Conjugate Gradient Methods and Some Variants of CG with Less Synchronization Overhead
We will present a matrix framework for the conjugate gradient methods, which is expressed in terms of whole vector sequences instead of single vectors or initial parts of sequence...
Eduardo F. D'Azevedo, Victor Eijkhout, Charles H. ...
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 6 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...