𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Krylov type subspace methods for matrix polynomials

✍ Scribed by Leonard Hoffnung; Ren-Cang Li; Qiang Ye

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
329 KB
Volume
415
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The extended Krylov subspace method and
The extended Krylov subspace method and orthogonal Laurent polynomials
✍ Carl Jagels; Lothar Reichel πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 247 KB

The need to evaluate expressions of the form f (A)v, where A is a large sparse or structured symmetric matrix, v is a vector, and f is a nonlinear function, arises in many applications. The extended Krylov subspace method can be an attractive scheme for computing approximations of such expressions.

On a variable smoothing procedure for Kr
On a variable smoothing procedure for Krylov subspace methods
✍ M. Heyouni; H. Sadok πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 601 KB

It is known that the convergence behavior of Galerkin-Krylov subspace methods for solving linear systems can be very erratic. A smoothing technique or a minimal residual seminorm variant of these Galerkin methods can be proposed to eliminate this problem. In this paper we examine a class of minimal

Implementation of a restarted Krylov sub
Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
✍ Martin Afanasjew; Michael Eiermann; Oliver G. Ernst; Stefan GΓΌttel πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 511 KB

A new implementation of restarted Krylov subspace methods for evaluating f (A)b for a function f, a matrix A and a vector b is proposed. In contrast to an implementation proposed previously, it requires constant work and constant storage space per restart cycle. The convergence behavior of this sche