IDEAS home Printed from https://ideas.repec.org/a/hin/complx/9619427.html
   My bibliography  Save this article

Efficient Parameters Estimation Method for the Separable Nonlinear Least Squares Problem

Author

Listed:
  • Ke Wang
  • Guolin Liu
  • Qiuxiang Tao
  • Min Zhai

Abstract

In this work, we combine the special structure of the separable nonlinear least squares problem with a variable projection algorithm based on singular value decomposition to separate linear and nonlinear parameters. Then, we propose finding the nonlinear parameters using the Levenberg–Marquart (LM) algorithm and either solve the linear parameters using the least squares method directly or by using an iteration method that corrects the characteristic values based on the L-curve, according to whether or not the nonlinear function coefficient matrix is ill posed. To prove the feasibility of the proposed method, we compared its performance on three examples with that of the LM method without parameter separation. The results show that (1) the parameter separation method reduces the number of iterations and improves computational efficiency by reducing the parameter dimensions and (2) when the coefficient matrix of the linear parameters is well-posed, using the least squares method to solve the fitting problem provides the highest fitting accuracy. When the coefficient matrix is ill posed, the method of correcting characteristic values based on the L-curve provides the most accurate solution to the fitting problem.

Suggested Citation

  • Ke Wang & Guolin Liu & Qiuxiang Tao & Min Zhai, 2020. "Efficient Parameters Estimation Method for the Separable Nonlinear Least Squares Problem," Complexity, Hindawi, vol. 2020, pages 1-16, February.
  • Handle: RePEc:hin:complx:9619427
    DOI: 10.1155/2020/9619427
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/9619427.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2020/9619427.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/9619427?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:9619427. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.