An Algorithm for the Regularization of Ill-Conditioned, Banded Least Squares Problems
From MaRDI portal
Publication:3336580
DOI10.1137/0905017zbMath0546.65014OpenAlexW2010384703MaRDI QIDQ3336580
Publication date: 1984
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0905017
regularizationsmoothing splinenumerical stabilityleast squaresfill-inband structureill-conditionedQR-decompositionCholesky algorithmplane rotationsGivens rotation-algorithm
Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items (17)
A Note on the Superoptimal Matrix Algebra Operators ⋮ An algorithm for computing constrained smoothing spline functions ⋮ A variant of finite-dimensional Tikhonov regularization with a-posteriori parameter choice ⋮ An efficient method for calculating smoothing splines using orthogonal transformations ⋮ Operator-theoretic and regularization approaches to ill-posed problems ⋮ Fast Computation of Spectral Projectors of Banded Matrices ⋮ Superoptimal approximation for unbounded symbols ⋮ Preconditioners for ill-posed Toeplitz matrices with differentiable generating functions ⋮ A direct method for a regularized least-squares problem ⋮ Smoothing noisy data with spline functions ⋮ Efficient algorithms for robust generalized cross-validation spline smoothing ⋮ A classification scheme for regularizing preconditioners, with application to Toeplitz systems ⋮ A wavelet-based method for solving discrete first-kind Fredholm equations with piecewise constant solutions ⋮ The discrete Picard condition for discrete ill-posed problems ⋮ On systolic array methods for band matrix factorizations ⋮ Ill-Posed Problems: Operator Methodologies of Resolution and Regularization ⋮ Spline smoothing under constraints on derivatives
This page was built for publication: An Algorithm for the Regularization of Ill-Conditioned, Banded Least Squares Problems
