The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems
From MaRDI portal
Publication:3943902
DOI10.1093/imanum/2.2.241zbMath0484.65021OpenAlexW2113834512MaRDI QIDQ3943902
Publication date: 1982
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imanum/2.2.241
regularizationauto-correlationmethod of generalized cross-validationnoisy ill-conditioned linear least-squares problemspseudo-rank determination
Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items
Adaptive cross approximation for ill-posed problems, On the computation of a truncated SVD of a large linear discrete ill-posed problem, Global Golub-Kahan bidiagonalization applied to large discrete ill-posed problems, Computation of the singular value expansion, Error estimates for Golub–Kahan bidiagonalization with Tikhonov regularization for ill–posed operator equations, Noise-reducing cascadic multilevel methods for linear discrete ill-posed problems, Greedy Tikhonov regularization for large linear ill-posed problems, Fractional Tikhonov regularization method in Hilbert scales, Subspace-restricted singular value decompositions for linear discrete ill-posed problems, An iterative Lagrange method for the regularization of discrete ill-posed inverse problems, An iterative method for Tikhonov regularization with a general linear regularization operator, Regularized minimal-norm solution of an overdetermined system of first kind integral equations, Adaptive cross approximation for Tikhonov regularization in general form, Some numerical aspects of Arnoldi-Tikhonov regularization, Implementations of range restricted iterative methods for linear discrete ill-posed problems, Numerical considerations of block GMRES methods when applied to linear discrete ill-posed problems, Solution of ill-posed problems with Chebfun, Tikhonov regularization via flexible Arnoldi reduction, Tikhonov regularization based on generalized Krylov subspace methods, Application of fractional derivatives for obtaining new Tikhonov regularization matrices, FGMRES for linear discrete ill-posed problems, Algorithms for range restricted iterative methods for linear discrete ill-posed problems, Some properties of range restricted GMRES methods, Comparison of a-posteriori parameter choice rules for linear discrete ill-posed problems, Generalized singular value decomposition with iterated Tikhonov regularization, A novel modified TRSVD method for large-scale linear discrete ill-posed problems, Vector extrapolation applied to truncated singular value decomposition and truncated iteration, Fractional regularization matrices for linear discrete ill-posed problems, A new zero-finder for Tikhonov regularization, Square smoothing regularization matrices with accurate boundary conditions, A generalized LSQR algorithm, Invertible smoothing preconditioners for linear discrete ill-posed problems, Inverse problems for regularization matrices, Decomposition methods for large linear discrete ill-posed problems, Regularization parameter determination for discrete ill-posed problems, Arnoldi-Tikhonov regularization methods, Extension of Tikhonov regularization method using linear fractional programming, Arnoldi decomposition, GMRES, and preconditioning for linear discrete ill-posed problems, Vector extrapolation enhanced TSVD for linear discrete ill-posed problems, Error estimates for large-scale ill-posed problems, Simple stopping criteria for the LSQR method applied to discrete ill-posed problems, Cascadic multilevel methods for ill-posed problems, Tikhonov regularization and the L-curve for large discrete ill-posed problems, An inertial extrapolation method for convex simple bilevel optimization, Numerical decomposition of a convex function, Square regularization matrices for large linear discrete ill-posed problems, Continuous quadric patch approximation of curved surfaces, Enriched Krylov subspace methods for ill-posed problems, Some Properties of the Arnoldi-Based Methods for Linear Ill-Posed Problems
