Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
ATZ-Fachkongress

Chassis.tech plus 2024


4 Kongresse in einer Veranstaltung

Treffen Sie in München die Fachleute von Chassis, Lenkung, Bremsen sowie Reifen/Räder.
Erweiterte Suche
Anmelden
nach oben
BIT Numerical Mathematics
Erschienen in: BIT Numerical Mathematics 2/2014

01.06.2014

A GCV based Arnoldi-Tikhonov regularization method

verfasst von: Paolo Novati, Maria Rosaria Russo

Erschienen in: BIT Numerical Mathematics | Ausgabe 2/2014

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

For the solution of linear discrete ill-posed problems, in this paper we consider the Arnoldi-Tikhonov method coupled with the Generalized Cross Validation for the computation of the regularization parameter at each iteration. We study the convergence behavior of the Arnoldi method and its properties for the approximation of the (generalized) singular values, under the hypothesis that Picard condition is satisfied. Numerical experiments on classical test problems and on image restoration are presented.
Vorheriger Artikel Optimal recovery of isotropic classes of rth differentiable multivariate functions
Nächster Artikel A new iterative algorithm for mean curvature-based variational image denoising

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren
Literatur
1.
Bauer, F., Lukas, M.: Comparing parameter choice methods for regularization of ill-posed problems. Math. Comput. Simul. 81(9), 1795–1841 (2011) CrossRefMATHMathSciNet
2.
Björck, Å.: A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations. BIT Numer. Math. 28, 659–670 (1988) CrossRefMATH
3.
Calvetti, D., Morigi, S., Reichel, L., Sgallari, F.: Tikhonov regularization and the L-curve for large discrete ill-posed problems. J. Comput. Appl. Math. 123, 423–446 (2000) CrossRefMATHMathSciNet
4.
Chung, J., Nagy, J.G., O’Leary, D.P.: A weighted-GCV method for Lanczos-hybrid regularization. Electron. Trans. Numer. Anal. 28, 149–167 (2007/08) MathSciNet
5.
Donatelli, M., Neuman, A., Reichel, L.: Square regularization matrices for large linear discrete ill-posed problems. Numer. Linear Algebra Appl. 19, 896–913 (2012) CrossRefMATHMathSciNet
6.
7.
Gazzola, S., Novati, P.: Automatic parameter setting for Arnoldi-Tikhonov methods. J. Comput. Appl. Math. 256, 180–195 (2014) CrossRefMathSciNet
8.
Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996) MATH
9.
Golub, G.H., Heath, M., Wahba, G.: Generalized cross-validation as a method for choosing a good ridge parameter. Technometrics 21(2), 215–223 (1979) CrossRefMATHMathSciNet
10.
Golub, G.H., Luk, F.T., Overton, M.L.: A block Lanczos method for computing the singular values and corresponding singular vectors of a matrix. ACM Trans. Math. Softw. 7(2), 149–169 (1981) CrossRefMATHMathSciNet
11.
Hämarik, U., Palm, R., Raus, T.: A family of rules for parameter choice in Tikhonov regularization of ill-posed problems with inexact noise level. J. Comput. Appl. Math. 236(8), 2146–2157 (2012) CrossRefMATHMathSciNet
12.
Hanke, M.: On Lanczos based methods for the regularization of discrete ill-posed problems. BIT Numer. Math. 41, 1008–1018 (2001) CrossRefMathSciNet
13.
Hanke, M., Hansen, P.C.: Regularization methods for large-scale problems. Surv. Math. Ind. 3, 253–315 (1993) MATHMathSciNet
14.
Hansen, P.C.: The discrete Picard condition for discrete ill-posed problems. BIT Numer. Math. 30, 658–672 (1990) CrossRefMATH
15.
Hansen, P.C.: Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion. SIAM, Philadelphia (1998) CrossRef
16.
17.
Hochstenbach, M., Reichel, L.: An iterative method for Tikhonov regularization with a general linear regularization operator. J. Integral Equ. Appl. 22, 463–480 (2010) CrossRefMathSciNet
18.
Hochstenbach, M., McNinch, N., Reichel, L.: Discrete ill-posed least-squares problems with a solution norm constraint. Linear Algebra Appl. 436, 3801–3818 (2012) CrossRefMATHMathSciNet
19.
Hofmann, B.: Regularization for Applied Inverse and Ill-Posed Problems. Teubner, Stuttgart (1986) CrossRefMATH
20.
Kilmer, M.E., O’Leary, D.P.: Choosing regularization parameters in iterative methods for ill-posed problems. SIAM J. Matrix Anal. Appl. 22, 1204–1221 (2001) CrossRefMATHMathSciNet
21.
Kilmer, M.E., Hansen, P.C., Español, M.I.: A projection-based approach to general-form Tikhonov regularization. SIAM J. Sci. Comput. 29(1), 315–330 (2007) CrossRefMATHMathSciNet
22.
Kindermann, S.: Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems. Electron. Trans. Numer. Anal. 38, 233–257 (2011) MATHMathSciNet
23.
Kohn, R., Ansley, C.F., Tharm, D.: The performance of cross-validation and maximum likelihood estimators of spline smoothing parameters. J. Am. Stat. Assoc. 86, 1042–1050 (1991) CrossRefMathSciNet
24.
25.
Lukas, M.A.: Robust generalized cross-validation for choosing the regularization parameter. Inverse Probl. 22, 1883–1902 (2006) CrossRefMATHMathSciNet
26.
27.
Nevanlinna, O.: Convergence of Iterations for Linear Equations. Birkhäuser, Basel (1993) CrossRefMATH
28.
29.
O’Leary, D.P.: Near-optimal parameters for Tikhonov and other regularization methods. SIAM J. Sci. Comput. 23(4), 1161–1171 (2011) CrossRefMathSciNet
30.
O’Leary, D.P., Simmons, J.A.: A bidiagonalization-regularization procedure for large-scale discretizations of ill-posed problems. SIAM J. Sci. Stat. Comput. 2, 474–489 (1981) CrossRefMATHMathSciNet
31.
Reichel, L., Rodriguez, G.: Old and new parameter choice rules for discrete ill-posed problems. Numer. Algorithms 63, 65–87 (2013) CrossRefMATHMathSciNet
32.
Saad, Y.: Numerical Methods for Large Eigenvalue Problems. Algorithms and Architectures for Advanced Scientific Computing. Manchester University Press, Manchester, Halsted Press, New York (1992)
33.
Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003) CrossRefMATH
34.
Saad, Y., Wu, K.: DQGMRES: a direct quasi-minimal residual algorithm based on incomplete orthogonalization. Numer. Linear Algebra Appl. 3, 329–343 (1996) CrossRefMATHMathSciNet
35.
Thompson, A.M., Kay, J.W., Titterington, D.M.: A cautionary note about crossvalidatory choice. J. Stat. Comput. Simul. 33, 199–216 (1989) CrossRefMATHMathSciNet
36.
37.
Wahba, G.: A comparison of GCV and GML for choosing the smoothing parameter in the generalized spline smoothing problem. Ann. Stat. 13, 1378–1402 (1985) CrossRefMATHMathSciNet
Metadaten
Titel
A GCV based Arnoldi-Tikhonov regularization method
verfasst von
Paolo Novati
Maria Rosaria Russo
Publikationsdatum
01.06.2014
Verlag
Springer Netherlands
Erschienen in
BIT Numerical Mathematics / Ausgabe 2/2014
Print ISSN: 0006-3835
Elektronische ISSN: 1572-9125
DOI
https://doi.org/10.1007/s10543-013-0447-z

Weitere Artikel der Ausgabe 2/2014

BIT Numerical Mathematics 2/2014 Zur Ausgabe

OriginalPaper

Low-rank tensor completion by Riemannian optimization

OriginalPaper

Optimal second order rectangular elasticity elements with weakly symmetric stress

OriginalPaper

A finite element method for a biharmonic equation based on gradient recovery operators

OriginalPaper

Construction of scrambled polynomial lattice rules over with small mean square weighted discrepancy

OriginalPaper

Higher order numerical methods for solving fractional differential equations

OriginalPaper

Optimal recovery of isotropic classes of rth differentiable multivariate functions

Premium Partner

    Bildnachweise