A GCV based Arnoldi-Tikhonov regularization method
DOI10.1007/S10543-013-0447-ZzbMATH Open1317.65104arXiv1304.0148OpenAlexW2035106447MaRDI QIDQ398632FDOQ398632
Authors: P. Novati, Maria Rosaria Russo
Publication date: 15 August 2014
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.0148
Recommendations
- Arnoldi-Tikhonov regularization methods
- GCV for Tikhonov regularization by partial SVD
- GCV for Tikhonov regularization via global Golub-Kahan decomposition.
- Tikhonov regularization via flexible Arnoldi reduction
- Some numerical aspects of Arnoldi-Tikhonov regularization
- An Arnoldi-based preconditioner for iterated Tikhonov regularization
- scientific article; zbMATH DE number 1262548
- A GCV based method for nonlinear ill-posed problems
- Tikhonov regularization and randomized GSVD
- A weighted-GCV method for Lanczos-hybrid regularization
singular value decompositionTikhonov regularizationnumerical examplegeneralized cross validationArnoldi algorithmimage restoration problemlinear discrete ill-posed problemregularization toolbox
Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10)
Cites Work
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Title not available (Why is that?)
- A comparison of GCV and GML for choosing the smoothing parameter in the generalized spline smoothing problem
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Title not available (Why is that?)
- Rank-Deficient and Discrete Ill-Posed Problems
- Regularization methods for large-scale problems
- Title not available (Why is that?)
- Comparing parameter choice methods for regularization of ill-posed problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Old and new parameter choice rules for discrete ill-posed problems
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- Discrete ill-posed least-squares problems with a solution norm constraint
- Title not available (Why is that?)
- Arnoldi-Tikhonov regularization methods
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- Choosing regularization parameters in iterative methods for ill-posed problems
- Square regularization matrices for large linear discrete ill-posed problems.
- Robust generalized cross-validation for choosing the regularization parameter
- The discrete Picard condition for discrete ill-posed problems
- A Projection‐Based Approach to General‐Form Tikhonov Regularization
- An iterative method for Tikhonov regularization with a general linear regularization operator
- Automatic parameter setting for Arnoldi-Tikhonov methods
- A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- A weighted-GCV method for Lanczos-hybrid regularization
- A family of rules for parameter choice in Tikhonov regularization of ill-posed problems with inexact noise level
- Near-optimal parameters for Tikhonov and other regularization methods
- A cautionary note about crossvalidatory choice
- Minimum Principles for Ill-Posed Problems
- A Note on the Superlinear Convergence of GMRES
- Adaptive Arnoldi-Tikhonov regularization for image restoration
Cited In (24)
- Some transpose-free CG-like solvers for nonsymmetric ill-posed problems
- Fast computation of orthonormal basis for RBF spaces through Krylov space methods
- Adaptive Arnoldi-Tikhonov regularization for image restoration
- The regularizing properties of global GMRES for solving large-scale linear discrete ill-posed problems with several right-hand sides
- IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
- Some results on the regularization of LSQR for large-scale discrete ill-posed problems
- An efficient iterative method to general-form to general-form Tikhonov regularization
- GCV for Tikhonov regularization by partial SVD
- A GCV based method for nonlinear ill-posed problems
- Tikhonov regularization via flexible Arnoldi reduction
- Inheritance of the discrete Picard condition in Krylov subspace methods
- On the Lanczos and Golub-Kahan reduction methods applied to discrete ill-posed problems.
- An Arnoldi-based preconditioner for iterated Tikhonov regularization
- The regularized global GMERR method for solving large-scale linear discrete ill-posed problems
- GCV for Tikhonov regularization via global Golub-Kahan decomposition.
- Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches
- A special modified Tikhonov regularization matrix for discrete ill-posed problems
- A Tikhonov regularized penalty function approach for solving polylinear programming problems
- Automatic parameter setting for Arnoldi-Tikhonov methods
- Stable Computation of Least Squares Problems of the OGM(1,N) Model and Short-Term Traffic Flow Prediction
- Embedded techniques for choosing the parameter in Tikhonov regularization.
- Arnoldi decomposition, GMRES, and preconditioning for linear discrete ill-posed problems
- Some properties of the Arnoldi-based methods for linear ill-posed problems
- Multi-parameter Arnoldi-Tikhonov methods
Uses Software
This page was built for publication: A GCV based Arnoldi-Tikhonov regularization method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398632)