Please use this identifier to cite or link to this item:
For citation please use:
Main Title: Backward error analysis of an inexact Arnoldi method using a certain Gram Schmidt variant
Author(s): Kandler, Ute
Schröder, Christian
Type: Research Paper
Abstract: In numerous recent applications including tensor computations, compressed sensing and mixed precision arithmetics vector operations like summing, scaling, or matrix-vector multiplication are subject to inaccuracies whereas inner products are exact. We investigate the behavior of Arnoldi's method for Hermitian matrices under these circumstances. We introduce a special purpose variant of Gram Schmidt orthogonalization and prove bounds on the distance to orthogonality of the now-not-anymore orthogonal Krylov subspace basis. This Gram Schmidt variant additionally implicitly provides an exactly orthogonal basis. In the second part we perform a backward error analysis and show that this exactly orthogonal basis satisfies a Krylov relation for a perturbed system matrix -- even in the Hermitian case. We prove bounds for the norm of the backward error which is shown to be on the level of the accuracy of the vector operations. Care is taken to avoid problems in case of near breakdowns. Finally, numerical experiments confirm the applicability of the method and of the proven bounds.
Subject(s): inexact matrix-vector operations
Gram Schmidt orthogonalization
loss of orthogonality
Arnoldi's method
Krylov relation
backward error bounds
Issue Date: 27-Mar-2013
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 65F15 Eigenvalues, eigenvectors
65F25 Orthogonalization
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2013, 10
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Format: Adobe PDF | Size: 539.6 kB
DownloadShow Preview

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.