A full-Newton approach to separable nonlinear least squares problems and its application to discrete least squares rational approximation

zbMATH Open1171.65381MaRDI QIDQ836853FDOQ836853

Authors: Carlos Borges 

Publication date: 8 September 2009

Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/130662

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Separable least squares, variable projection, and the Gauss-Newton algorithm
• On the separable nonlinear least squares problems
• Solving separable nonlinear least squares problems using the QR factorization
• scientific article; zbMATH DE number 794290
• scientific article; zbMATH DE number 740117

zbMATH Keywords

rational approximationseparable nonlinear least squares

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Approximation by rational functions (41A20)

Cited In (8)

• Title not available (Why is that?)
• Solving separable nonlinear least squares problems using the QR factorization
• Efficient computation of the Gauss-Newton direction when fitting NURBS using ODR
• SOLVING SEPARABLE NONLINEAR LEAST SQUARES PROBLEMS BY DAVIDENKO'S METHOD
• Variable projection for nonlinear least squares problems
• Practical algorithms for multivariate rational approximation
• Solving the inverse problem for an ordinary differential equation using conjugation
• Title not available (Why is that?)

This page was built for publication: A full-Newton approach to separable nonlinear least squares problems and its application to discrete least squares rational approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q836853)