๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Recursion relations for the extended Krylov subspace method

โœ Scribed by Carl Jagels; Lothar Reichel

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
409 KB
Volume
434
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.

MULTIGRID AND KRYLOV SUBSPACE METHODS FO
MULTIGRID AND KRYLOV SUBSPACE METHODS FOR THE DISCRETE STOKES EQUATIONS
โœ HOWARD C. ELMAN ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 845 KB

Discretization of the Stokes equations produces a symmetric indefinite system of linear equations. For stable discretizatiom a variety of numerical methods have been proposed that have rates of convergence independent of the mesh size used in the dkretization. In this paper we compare the performanc

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