GCV for Tikhonov regularization via global Golub-Kahan decomposition.
From MaRDI portal
Publication:2829107
DOI10.1002/NLA.2034zbMATH Open1374.65064OpenAlexW2337734184MaRDI QIDQ2829107FDOQ2829107
Lothar Reichel, C. Fenu, G. Rodriguez
Publication date: 26 October 2016
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.2034
singular value decompositionTikhonov regularizationnumerical experimentsgeneralized cross validationGauss quadrature rulelarge-scale least-squares problemsGauss-Radau quadrature ruleglobal Golub-Kahan decompositionstandard Golub-Kahan bidiagonalization
Numerical quadrature and cubature formulas (65D32) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22)
Cites Work
- Title not available (Why is that?)
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Error estimates for the regularization of least squares problems
- Error estimates for large-scale ill-posed problems
- Smoothing noisy data with spline functions: Estimating the correct degree of smoothing by the method of generalized cross-validation
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Rank-Deficient and Discrete Ill-Posed Problems
- Comparing parameter choice methods for regularization of ill-posed problems
- 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
- Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- A weighted pseudoinverse, generalized singular values, and constrained least squares problems
- Estimation of the \(L\)-curve via Lanczos bidiagonalization
- Bounding matrix functionals via partial global block Lanczos decomposition
- Discretization independent convergence rates for noise level-free parameter choice rules for the regularization of ill-conditioned problems
- Some large-scale matrix computation problems
- Moments of a linear operator, with applications to the trace of the inverse of matrices and the solution of equations.
- A Stochastic Estimator of the Trace of the Influence Matrix for Laplacian Smoothing Splines
- A probing method for computing the diagonal of a matrix inverse
- Global FOM and GMRES algorithms for matrix equations
- \texttt{smt}: A Matlab toolbox for structured matrices
- A GCV based Arnoldi-Tikhonov regularization method
- The prolate matrix
- Matrices, moments, and rational quadrature
- Rotational image deblurring with sparse matrices
- Fast generalized cross validation using Krylov subspace methods
- Algebraic properties of the block GMRES and block Arnoldi methods
- The implementation of a generalized cross validation algorithm using deflation techniques for linear systems
Cited In (28)
- The e-MoM approach for approximating matrix functionals
- Graph Laplacian for image deblurring
- The extended global Lanczos method, Gauss-Radau quadrature, and matrix function approximation
- Tensor Krylov subspace methods with an invertible linear transform product applied to image processing
- Efficient estimates in regression models with highly correlated covariates
- The Short-Term Rational Lanczos Method and Applications
- Residual whiteness principle for parameter-free image restoration
- Approximation of the Tikhonov regularization parameter through Aitken's extrapolation
- A comparison of parameter choice rules for \(\ell^p\)-\(\ell^q\) minimization
- Variable projection methods for separable nonlinear inverse problems with general-form Tikhonov regularization
- GCV for Tikhonov regularization by partial SVD
- On the computation of a truncated SVD of a large linear discrete ill-posed problem
- On and Beyond Total Variation Regularization in Imaging: The Role of Space Variance
- Estimates for the generalized cross-validation function via an extrapolation and statistical approach
- A GCV based Arnoldi-Tikhonov regularization method
- Weighted tensor Golub-Kahan-Tikhonov-type methods applied to image processing using a t-product
- An Arnoldi-based preconditioner for iterated Tikhonov regularization
- Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches
- Estimating the trace of matrix functions with application to complex networks
- Solution methods for linear discrete ill-posed problems for color image restoration
- Tensor Arnoldi-Tikhonov and GMRES-type methods for ill-posed problems with a t-product structure
- A special modified Tikhonov regularization matrix for discrete ill-posed problems
- Generalized cross validation for \(\ell^p\)-\(\ell^q\) minimization
- Error estimates for Golub–Kahan bidiagonalization with Tikhonov regularization for ill–posed operator equations
- Solution of ill-posed problems with Chebfun
- Modulus-based iterative methods for constrained Tikhonov regularization
- Generalized singular value decomposition with iterated Tikhonov regularization
- Parameter determination for Tikhonov regularization problems in general form
Uses Software
This page was built for publication: GCV for Tikhonov regularization via global Golub-Kahan decomposition.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829107)
