Tikhonov regularization via flexible Arnoldi reduction
From MaRDI portal
Publication:906959
DOI10.1007/s10543-014-0542-9zbMath1332.65058OpenAlexW1983444614MaRDI QIDQ906959
Publication date: 1 February 2016
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-014-0542-9
numerical exampleTikhonov regularizationill-posed problemArnoldi processflexible general minimal residual (GMRES) method
Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10)
Related Items (8)
Projected nonstationary iterated Tikhonov regularization ⋮ Arnoldi methods for image deblurring with anti-reflective boundary conditions ⋮ On the choice of subspace for large-scale Tikhonov regularization problems in general form ⋮ A Golub-Kahan-type reduction method for matrix pairs ⋮ Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework ⋮ Iterative Tikhonov regularization of tensor equations based on the Arnoldi process and some of its generalizations ⋮ A method for computing a few eigenpairs of large generalized eigenvalue problems ⋮ Multidirectional subspace expansion for one-parameter and multiparameter Tikhonov regularization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Application of denoising methods to regularizationof ill-posed problems
- Implementations of range restricted iterative methods for linear discrete ill-posed problems
- Tikhonov regularization based on generalized Krylov subspace methods
- Multi-parameter regularization and its numerical realization
- An iterative method for Tikhonov regularization with a general linear regularization operator
- On the reduction of Tikhonov minimization problems and the construction of regularization matrices
- Simple square smoothing regularization operators
- A Golub-Kahan-type reduction method for matrix pairs
- Multi-parameter regularization techniques for ill-conditioned linear systems
- Tikhonov regularization of large linear problems
- A weighted pseudoinverse, generalized singular values, and constrained least squares problems
- Semi-implicit complementary volume scheme for solving level set like equations in image processing and curve evolution
- Computing the generalized singular values/vectors of large sparse or structured matrix pairs
- Old and new parameter choice rules for discrete ill-posed problems
- Square smoothing regularization matrices with accurate boundary conditions
- Sylvester Tikhonov-regularization methods in image restoration
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- FGMRES for linear discrete ill-posed problems
- Multi-parameter Arnoldi-Tikhonov methods
- Regularization tools version \(4.0\) for matlab \(7.3\)
- Decomposition methods for large linear discrete ill-posed problems
- Orthogonal projection regularization operators
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- Square regularization matrices for large linear discrete ill-posed problems
- Nonlinearly Preconditioned Krylov Subspace Methods for Discrete Newton Algorithms
- The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Algorithms for the regularization of ill-conditioned least squares problems
- Rank-Deficient and Discrete Ill-Posed Problems
- A Krylov Subspace Method for Quadratic Matrix Polynomials with Application to Constrained Least Squares Problems
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A Projection‐Based Approach to General‐Form Tikhonov Regularization
This page was built for publication: Tikhonov regularization via flexible Arnoldi reduction
