Convergence rates for inverse-free rational approximation of matrix functions

Simple item page
dc.contributor.authorJagels, Carl
dc.contributor.authorMach, Thomas
dc.contributor.authorReichel, Lothar
dc.contributor.authorVandebril, Raf
dc.date.accessioned2017-01-09T03:33:16Z
dc.date.available2017-01-09T03:33:16Z
dc.date.issued2016-12-01
dc.description.abstractThis article deduces geometric convergence rates for approximating matrix functions via inverse-free rational Krylov methods. In applications one frequently encounters matrix functions such as the matrix exponential or matrix logarithm; often the matrix under consideration is too large to compute the matrix function directly, and Krylov subspace methods are used to determine a reduced problem. If many evaluations of a matrix function of the form f(A)v with a large matrix A are required, then it may be advantageous to determine a reduced problem using rational Krylov subspaces. These methods may give more accurate approximations of f(A)v with subspaces of smaller dimension than standard Krylov subspace methods. Unfortunately, the system solves required to construct an orthogonal basis for a rational Krylov subspace may create numerical difficulties and/or require excessive computing time. This paper investigates a novel approach to determine an orthogonal basis of an approximation of a rational Krylov subspace of (small) dimension from a standard orthogonal Krylov subspace basis of larger dimension. The approximation error will depend on properties of the matrix A and on the dimension of the original standard Krylov subspace. We show that our inverse-free method for approximating the rational Krylov subspace converges geometrically (for increasing dimension of the standard Krylov subspace) to a rational Krylov subspace. The convergence rate may be used to predict the dimension of the standard Krylov subspace necessary to obtain a certain accuracy in the approximation. Computed examples illustrate the theory developed.ru_RU
dc.identifier.citationJagels, C., Mach, T., Reichel, L., & Vandebril, R. (2016). Convergence rates for inverse-free rational approximation of matrix functions. Linear Algebra and Its Applications, 510, 291-310. DOI: 10.1016/j.laa.2016.08.029ru_RU
dc.identifier.urihttp://nur.nu.edu.kz/handle/123456789/2202
dc.language.isoenru_RU
dc.publisherLinear Algebra and Its Applicationsru_RU
dc.rightsAttribution-NonCommercial-ShareAlike 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/us/*
dc.subjectapproximationru_RU
dc.subjectconvergence rateru_RU
dc.subjectiterative methodru_RU
dc.subjectmatrix functionru_RU
dc.subjectrational Krylovru_RU
dc.titleConvergence rates for inverse-free rational approximation of matrix functionsru_RU
dc.typeArticleru_RU

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Carl Jagels, Thomas Mach, Lothar Reichel, Raf Vandebril.pdf
Size:
16.76 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
6.22 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Articles