nach oben

BIT Numerical Mathematics

Erschienen in:

01.03.2014

The structure of iterative methods for symmetric linear discrete ill-posed problems

verfasst von: L. Dykes, F. Marcellán, L. Reichel

Erschienen in: BIT Numerical Mathematics | Ausgabe 1/2014

Einloggen

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

search-config

KI-gestützte Suche

Aus

Abstract

The iterative solution of large linear discrete ill-posed problems with an error contaminated data vector requires the use of specially designed methods in order to avoid severe error propagation. Range restricted minimal residual methods have been found to be well suited for the solution of many such problems. This paper discusses the structure of matrices that arise in a range restricted minimal residual method for the solution of large linear discrete ill-posed problems with a symmetric matrix. The exploitation of the structure results in a method that is competitive with respect to computer storage, number of iterations, and accuracy.

Vorheriger Artikel Comparison of software for computing the action of the matrix exponential

Nächster Artikel Refining estimates of invariant and deflating subspaces for large and sparse matrices and pencils

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

Algorithm 3.1 refers to the algorithm in Section 3 unless explicitly stated otherwise.

Brezinski, C., Redivo-Zaglia, M., Rodriguez, G., Seatzu, S.: Multi-parameter regularization techniques for ill-conditioned linear systems. Numer. Math. 94, 203–228 (2003)CrossRefMATHMathSciNet

Brezinski, C., Redivo-Zaglia, M., Sadok, H.: New look-ahead Lanczos-type algorithms for linear systems. Numer. Math. 83, 53–85 (1999)CrossRefMATHMathSciNet

Buhmann, M.D., Iserles, A.: On orthogonal polynomials transformed by the QR algorithm. J. Comput. Appl. Math. 43, 117–134 (1992)CrossRefMATHMathSciNet

Calvetti, D., Lewis, B., Reichel, L.: On the choice of subspace for iterative methods for linear discrete ill-posed problems. Int. J. Appl. Math. Comput. Sci. 11, 1069–1092 (2001)MATHMathSciNet

Calvetti, D., Reichel, L., Zhang, Q.: Conjugate gradient algorithms for symmetric inconsistent linear systems. In: Brown, J.D., Chu, M.T., Ellison, D.C., Plemmons, R. J. (ed.) Proceedings of the Cornelius Lanczos International Centenary Conference, pp. 267–272. SIAM, Philadelphia (1994)

Dykes, L., Reichel, L.: A family of range restricted iterative methods for linear discrete ill-posed problems. Dolomites Res Notes Approx 6, 27–36 (2013)CrossRef

Gautschi, W.: Orthogonal polynomials: computation and approximation. Oxford University Press, Oxford (2004)

Golub, G.H., Van Loan, C.F.: Matrix computations, 4th edn. Johns Hopkins University Press, Baltimore (2013)MATH

Hanke, M.: Conjugate gradient type methods for Ill-posed problems. Longman, Harlow (1995)MATH

10.

Hansen, P.C.: Regularization tools version 4.0 for Matlab 7.3. Numer. Algorithms 46, 189–194 (2007)CrossRefMATHMathSciNet

11.

Hansen, P.C., Jensen, T.K.: Noise propagation in regularizing iterations for image deblurring. Electron. Trans. Numer. Anal. 31, 204–220 (2008)MATHMathSciNet

12.

Kautsky, J., Golub, G.H.: On the calculation of Jacobi matrices. Linear Algebra Appl. 52–53, 439–455 (1983)

13.

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)MathSciNet

14.

Morigi, S., Reichel, L., Sgallari, F., Zama, F.: Iterative methods for ill-posed problems and semiconvergent sequences. J. Comput. Appl. Math. 193, 157–167 (2006)CrossRefMATHMathSciNet

15.

Neuman, A., Reichel, L., Sadok, H.: Implementations of range restricted iterative methods for linear discrete ill-posed problems. Linear Algebra Appl. 436, 3974–3990 (2012)CrossRefMATHMathSciNet

16.

Neuman, A., Reichel, L., Sadok, H.: Algorithms for range restricted iterative methods for linear discrete ill-posed problems. Numer. Algorithms 59, 325–331 (2012)CrossRefMATHMathSciNet

17.

Paige, C.C., Saunders, M.A.: Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12, 617–629 (1975)CrossRefMATHMathSciNet

18.

Phillips, D.L.: A technique for the numerical solution of certain integral equations of the first kind. J. ACM 9, 84–97 (1962)CrossRefMATH

19.

Reichel, L., Rodriguez, G.: Old and new parameter choice rules for discrete ill-posed problems. Numer. Algorithms 63, 65–87 (2013)CrossRefMATHMathSciNet

20.

Saad, Y.: Iterative methods for sparse linear systems, 2nd edn. SIAM, Philadelphia (2003)CrossRefMATH

21.

Shaw Jr, C.B.: Improvements of the resolution of an instrument by numerical solution of an integral equation. J. Math. Anal. Appl. 37, 83–112 (1972)CrossRefMATHMathSciNet

Titel: The structure of iterative methods for symmetric linear discrete ill-posed problems
verfasst von: L. Dykes
F. Marcellán
L. Reichel
Publikationsdatum: 01.03.2014
Verlag: Springer Netherlands
Erschienen in: BIT Numerical Mathematics / Ausgabe 1/2014
Print ISSN: 0006-3835
Elektronische ISSN: 1572-9125
DOI: https://doi.org/10.1007/s10543-014-0476-2

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

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

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Springer Professional "Wirtschaft+Technik"

Weitere Artikel der Ausgabe 1/2014

Equivalence between modified symplectic Gram-Schmidt and Householder SR algorithms

Minimization principles and computation for the generalized linear response eigenvalue problem

Geometric means of structured matrices

Symmetric spaces and Lie triple systems in numerical analysis of differential equations

Eigenvalue perturbation theory of symplectic, orthogonal, and unitary matrices under generic structured rank one perturbations

Implicit QR for rank-structured matrix pencils