Stewart's Krylov-Schur algorithm offers two advantages over Sorensen's implicitly restarted Arnoldi (IRA) algorithm. The first is ease of deflation of converged Ritz vect...
In this paper two classes of iterative methods for saddle point problems are considered: inexact Uzawa algorithms and a class of methods with symmetric preconditioners. In both cas...
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the...
A new software code for computing selected eigenvalues and associated eigenvectors of a real symmetric matrix is described. The eigenvalues are either the smallest or those closes...
In this paper, we describe block matrix algorithms for the iterative solution of large scale linear-quadratic optimal control problems arising from the optimal control of parabolic...
Tarek P. Mathew, Marcus Sarkis, Christian E. Schae...