New restarted Lanczos bidiagonalization methods for the computation of a few of the largest
or smallest singular values of a large matrix are presented. Restarting is carried out by …

This document describes slePc, the Scalable Library for Eigenvalue Problem Computations,
a software package for the solution of large sparse eigenproblems on parallel computers. It …

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 …

Performing global resolvent analysis for high-Reynolds-number turbulent flow calls for the
handling of a large discrete operator. Even though such a large operator is required in the …

We address the problem of computing the smallest symplectic eigenvalues and the
corresponding eigenvectors of symmetric positive-definite matrices in the sense of …

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 …

The direct and adjoint operators play an undeniably important role in a vast number of
theoretical and practical studies that range from linear stability to flow control and nonlinear …

We consider solution of multiply shifted systems of nonsymmetric linear equations, possibly
also with multiple right-hand sides. First, for a single right-hand side, the matrix is shifted by …

In this paper, combined the regular splittings of the coefficient matrix I− α P with the inner-
outer iteration framework [9], a general inner-outer (GIO) iteration method is presented for …

The PageRank algorithm plays an important role in determining the importance of Web
pages. The core of this algorithm involves using the classical power method to compute the …