Hybrid enriched bidiagonalization for discrete ill-posed problems

Per Christian Hansen*, Yiqiu Dong, Kuniyoshi Abe

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

34 Downloads (Pure)


The regularizing properties of the Golub–Kahan bidiagonalization algorithm are powerful when the associated Krylov subspace captures the dominating components of the solution. In some applications the regularized solution can be further improved by enrichment, that is, 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 bidiagonalization algorithm, and we describe how to incorporate Tikhonov regularization. This leads to a hybrid iterative method where the choice of regularization parameter in each iteration also provides a stopping rule.

Original languageEnglish
Article numbere2230
JournalNumerical Linear Algebra with Applications
Issue number3
Number of pages9
Publication statusPublished - 2019


  • Enriched subspaces
  • Hybrid iterative methods
  • Krylov subspace methods
  • Regularizing iterations

Fingerprint Dive into the research topics of 'Hybrid enriched bidiagonalization for discrete ill-posed problems'. Together they form a unique fingerprint.

Cite this