The Kronecker product has a rich and very pleasing algebra that supports a wide range of
fast, elegant, and practical algorithms. Several trends in scientific computing suggest that …

In many large scale scientific or engineering computations, ranging from computing the
frequency response of a circuit to the earthquake response of a buildingto the energy levels …

A modification is given of the GMRES iterative method for nonsymmetric systems of linear
equations. The new method deflates eigenvalues using Wu and Simon's thick restarting …

Some might say that the eigenproblem is one of the examples people discovered by looking
at the sky and wondering. Even though it was formulated to explain the movement of the …

The generalized minimum residual method (GMRES) is well known for solving large
nonsymmetric systems of linear equations. It generally uses restarting, which slows the …

This goal of this paper is to present an elegant relationshipbetween an implicitly restarted
Arnoldi method (IRAM) and nonstationary (subspace) simultaneous iteration. This …

Solving systems of algebraic linear equations is among the most frequent problems in
scientific computing. It appears in many areas like physics, engineering, chemistry, biology …

The increasing number of applications requiring the solution of large-scale singular value
problems has rekindled an interest in iterative methods for the SVD. Some promising recent …

Block-GMRES is an iterative method for solving nonsymmetric systems of linear equations
with multiple right-hand sides. Restarting may be needed, due to orthogonalization expense …

A restarted Arnoldi algorithm is given that computes eigenvalues and eigenvectors. It is
related to implicitly restarted Arnoldi, but has a simpler restarting approach. Harmonic and …