Iterative SVD-based methods for ill-posed problems
SIAM Journal on Scientific Computing
Matrix computations (3rd ed.)
Tikhonov regularization and total least squares
Tikhonov regularization and total least squares
Asynchronous distributed solution of large scale nonlinear inversion problems
Selected papers of the second Panamerican workshop on Applied and computational mathematics
Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion
Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
ACM Transactions on Mathematical Software (TOMS)
An Improved Algorithm for Computing the Singular Value Decomposition
ACM Transactions on Mathematical Software (TOMS)
Least squares scattered data fitting by truncated SVDs
Applied Numerical Mathematics - Applied and computational mathematics: Selected papers of the third panamerican workshop Trujillo, Peru, 24-28 April 2000
The triangle method for finding the corner of the L-curve
Applied Numerical Mathematics
Least squares collocation solution of elliptic problems in general regions
Mathematics and Computers in Simulation - Special issue: Applied and computational mathematics - selected papers of the fifth PanAmerican workshop - June 21-25, 2004, Tegucigalpa, Honduras
Variable projections neural network training
Mathematics and Computers in Simulation - Special issue: Applied and computational mathematics - selected papers of the fifth PanAmerican workshop - June 21-25, 2004, Tegucigalpa, Honduras
Radial function collocation solution of partial differential equations in irregular domains
International Journal of Computing Science and Mathematics
Hi-index | 0.00 |
The least squares approximation by tensor products of B-splines of large sets of scattered data is considered. This ill-conditioned or even singular problem requires special techniques, some of which are described in this paper. The performance of a Block Truncated Singular Value Decomposition (BTSVD) algorithm and two Lanczos based algorithms for sparse LSQ is compared. Several regularization methods are discussed.