111 citations · 327 across the 17 of their papers we have counts for
5 papers · 1 filter
PLSS: A Projected Linear Systems Solver
Johannes J. Brust, Michael A. Saunders
We propose iterative projection methods for solving square or rectangular consistent linear systems Ax = b. Existing projection methods use sketching matrices (possibly randomized)…
A semi-conjugate gradient method for solving unsymmetric positive definite linear systems
Na Huang, Yu-Hong Dai, Dominique Orban +1
The conjugate gradient (CG) method is a classic Krylov subspace method for solving symmetric positive definite linear systems. We introduce an analogous semi-conjugate gradient (SC…
Linear solvers for power grid optimization problems: a review of GPU-accelerated linear solvers
Kasia Swirydowicz, Eric Darve, Wesley Jones +5
The linear equations that arise in interior methods for constrained optimization are sparse symmetric indefinite and become extremely ill-conditioned as the interior method converg…
A practical factorization of a Schur complement for PDE-constrained Distributed Optimal Control
Youngsoo Choi, Charbel Farhat, Walter Murray +1
A distributed optimal control problem with the constraint of a linear elliptic partial differential equation is considered. A necessary optimality condition for this problem forms…
MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
Sou-Cheng T. Choi, Christopher C. Paige, Michael A. Saunders
CG, SYMMLQ, and MINRES are Krylov subspace methods for solving symmetric systems of linear equations. When these methods are applied to an incompatible system (that is, a singular…