✦ LIBER ✦

The extended Krylov subspace method and orthogonal Laurent polynomials

✍ Scribed by Carl Jagels; Lothar Reichel

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 247 KB
Volume: 431
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.03.006

No coin nor oath required. For personal study only.

✦ Synopsis

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. This method projects the approximation problem onto an extended Krylov subspace K ,m (A) = span{A -+1 v, . . . , A -1 v, v, Av, . . . , A m-1 v} of fairly small dimension, and then solves the small approximation problem so obtained. We review available results for the extended Krylov subspace method and relate them to properties of Laurent polynomials. The structure of the projected problem receives particular attention. We are concerned with the situations when m = and m = 2 .

📜 SIMILAR VOLUMES

Recursion relations for the extended Kry

Recursion relations for the extended Krylov subspace method

✍ Carl Jagels; Lothar Reichel 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 409 KB

The Strong Chebyshev Distribution and Or

The Strong Chebyshev Distribution and Orthogonal Laurent Polynomials

✍ S.Clement Cooper; Philip E Gustafson 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 264 KB

The strong Chebyshev distribution and the Chebyshev orthogonal Laurent polynomials are examined in detail. Explicit formulas are derived for the orthogonal Laurent polynomials, uniform convergence of the associated continued fraction is established, and the zeros of the Chebyshev L-polynomials are g

Orthogonal Laurent polynomials and the s

Orthogonal Laurent polynomials and the strong Hamburger moment problem

✍ William B Jones; W.J Thron; Olav Njåstad 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 1023 KB

A new investigation of the extended Kryl

A new investigation of the extended Krylov subspace method for matrix function evaluations

✍ L. Knizhnerman; V. Simoncini 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB

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

Determination of a good value of the tim

Determination of a good value of the time step and preconditioned Krylov subspace methods for the Navier-Stokes equations

✍ F. Toutounian 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 765 KB

The main purpose of this paper is to develop stable versions of some Krylov subspace methods for solving the linear systems of equations Ax = b which arise in the difference solution of 2-D nonstationary Navier-Stokes equations using implicit scheme and to determine a good value of the time step. Ou