On optimal short recurrences for generating orthogonal Krylov subspace bases
| dc.contributor.author | Liesen, Jörg | |
| dc.contributor.author | Strakoš, Zdenek | |
| dc.date.accessioned | 2017-12-19T15:29:17Z | |
| dc.date.available | 2017-12-19T15:29:17Z | |
| dc.date.issued | 2008-08-05 | |
| dc.description.abstract | We analyze necessary and sufficient conditions on a nonsingular matrix A such that, for any initial vector $r_0$, an orthogonal basis of the Krylov subspaces ${\cal K}_n(A,r_0)$ is generated by a short recurrence. Orthogonality here is meant with respect to some unspecified positive definite inner product. This question is closely related to the question of existence of optimal Krylov subspace solvers for linear algebraic systems, where optimal means the smallest possible error in the norm induced by the given inner product. The conditions on A we deal with were first derived and characterized more than 20 years ago by Faber and Manteuffel (SIAM J. Numer. Anal., 21 (1984), pp. 352–362). Their main theorem is often quoted and appears to be widely known. Its details and underlying concepts, however, are quite intricate, with some subtleties not covered in the literature we are aware of. Our paper aims to present and clarify the existing important results in the context of the Faber–Manteuffel theorem. Furthermore, we review attempts to find an easier proof of the theorem and explain what remains to be done in order to complete that task. | en |
| dc.identifier.eissn | 1095-7200 | |
| dc.identifier.issn | 0036-1445 | |
| dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/7287 | |
| dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-6560 | |
| dc.language.iso | en | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject.ddc | 518 Numerische Analysis | de |
| dc.subject.ddc | 512 Algebra | de |
| dc.subject.other | Krylov subspace methods | en |
| dc.subject.other | orthogonal bases | en |
| dc.subject.other | short recurrences | en |
| dc.subject.other | conjugate gradient-like methods | en |
| dc.title | On optimal short recurrences for generating orthogonal Krylov subspace bases | en |
| dc.type | Article | en |
| dc.type.version | publishedVersion | en |
| dcterms.bibliographicCitation.doi | 10.1137/060662149 | en |
| dcterms.bibliographicCitation.issue | 3 | en |
| dcterms.bibliographicCitation.journaltitle | SIAM Review | en |
| dcterms.bibliographicCitation.originalpublishername | Society for Industrial and Applied Mathematics | en |
| dcterms.bibliographicCitation.originalpublisherplace | Philadelphia, Pa | en |
| dcterms.bibliographicCitation.pageend | 503 | en |
| dcterms.bibliographicCitation.pagestart | 485 | en |
| dcterms.bibliographicCitation.volume | 50 | en |
| tub.accessrights.dnb | domain | en |
| tub.affiliation | Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik::FG Numerische Lineare Algebra | de |
| tub.affiliation.faculty | Fak. 2 Mathematik und Naturwissenschaften | de |
| tub.affiliation.group | FG Numerische Lineare Algebra | de |
| tub.affiliation.institute | Inst. Mathematik | de |
| tub.publisher.universityorinstitution | Technische Universität Berlin | en |