An efficient algorithm for the separable nonlinear least squares problem
DOI10.3390/a10030078zbMath1461.65060OpenAlexW2736287492MaRDI QIDQ1657029
Tjalling J. Ypma, Yun-Qiu Shen
Publication date: 13 August 2018
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a10030078
quadratic convergenceLU factorizationQR factorizationGauss-Newton methodnonlinear least squaresleast squares solutionsover-determined systemsseparable equationsfull-rank matrices
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of solutions to systems of equations (65H10) Matrix equations and identities (15A24) Orthogonalization in numerical linear algebra (65F25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Newton's method for singular nonlinear equations using approximate left and right nullspaces of the Jacobian
- Numerical bifurcation of separable parameterized equations
- Solving rank-deficient separable nonlinear equations
- Solving nonlinear systems of equations with only one nonlinear variable
- The variable projection algorithm in time-resolved spectroscopy, microscopy and mass spectrometry applications
- Solving separable nonlinear least squares problems using the QR factorization
- Solving separable nonlinear equations using LU factorization
- Solving \(N+m\) nonlinear equations with only m nonlinear variables
- Rank deficiencies and bifurcation into affine subspaces for separable parameterized equations
- Separable nonlinear least squares: the variable projection method and its applications
- The Immersed Interface Method
- The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
This page was built for publication: An efficient algorithm for the separable nonlinear least squares problem
