Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Journal of Computati...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Journal of Computational and Applied Mathematics
Article
License: Elsevier Non-Commercial
Data sources: UnpayWall
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Journal of Computational and Applied Mathematics
Article . 2009
License: Elsevier Non-Commercial
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Journal of Computational and Applied Mathematics
Article . 2009 . Peer-reviewed
License: Elsevier Non-Commercial
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2009
Data sources: zbMATH Open
versions View all 4 versions
addClaim

Arnoldi–Tikhonov regularization methods

Arnoldi-Tikhonov regularization methods
Authors: Lewis, Bryan; Reichel, Lothar;

Arnoldi–Tikhonov regularization methods

Abstract

The problem is to solve a large, ill-conditioned linear system \(Ax=b\) of size \(n\), where \(b=\hat{b}+e\) with \(\hat{b}\) the ``true'' vector and \(e\) some error. Tikhonov regularization minimizes \(\|Ax-b\|^2+\mu^{-1}\|x\|\) with \(\mu\) a regularization parameter. The proposed (range restricted) Arnoldi-Tikhonov regularization looks for the minimizer \(x_{\mu,\ell}\) in the Krylov subspace \(K_\ell(A,Ab)=\text{span}\{Ab,A^2b,\dots,A^{\ell}b\}\) produced by the Arnoldi method. It is shown that, under some conditions, \(\varphi_\ell(\mu)=\|Ax_{\mu,\ell}-b\|^2\) is convex with a unique minimum, and \(\ell\) is taken to be the smallest (or slightly larger) index for which \(\varphi(\mu)1\) reflects the uncertainty of the estimate \(\varepsilon\). An efficient implementation is described that compares favorably with range restricted generalized minimal residual (GMRES) method (GMRES applied within \(K_\ell(A,Ab)\)), and other regularization methods of the authors which is illustrated by several numerical examples.

Related Organizations
Keywords

Iterative numerical methods for linear systems, numerical examples, Discrepancy principle, Applied Mathematics, discrepancy principle, Arnoldi-Tikhonov regularization, ill-posed problem, generalized minimal residual method, Krylov subspace method, Computational Mathematics, Ill-posedness and regularization problems in numerical linear algebra, Ill-posed problem, Inverse problem, Regularization, inverse problem, Arnoldi decomposition

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    49
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
49
Top 10%
Top 10%
Top 10%
hybrid