LBAS: Lanczos Bidiagonalization with Subspace Augmentation for Discrete Inverse Problems

Publication: ResearchReport – Annual report year: 2017

Documents

View graph of relations

The regularizing properties of Lanczos bidiagonalization are powerful when the underlying Krylov subspace captures the dominating components of the solution. In some applications the regularized solution can be further improved by augmenting the Krylov subspace with a low-dimensional subspace that represents specific prior information. Inspired by earlier work on GMRES we demonstrate how to carry these ideas over to the Lanczos bidiagonalization algorithm
Original languageEnglish
PublisherDTU Compute
Number of pages12
StatePublished - 2017
SeriesDTU Compute-Technical Report-2017
Volume3
ISSN1601-2321
Download as:
Download as PDF
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
Word

Download statistics

No data available

ID: 134945662