IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v237y2025icp247-262.html
   My bibliography  Save this article

Hierarchical Newton iterative identification methods for a class of input multi-piecewise Hammerstein models with autoregressive noise

Author

Listed:
  • Fan, Yamin
  • Liu, Ximei
  • Li, Meihang

Abstract

Advancements in mathematical theories and applied technologies have driven research on modeling and identification of complex nonlinear systems, yet existing models still face challenges in terms of model structures, accuracy of parameter estimation, and efficiency. In this study, we present a class of input multi-piecewise Hammerstein models that utilize piecewise-linear function to capture arbitrary nonlinear characteristics. By employing the key term separation technique and the Newton iterative algorithm for parameter estimation, a generalized Newton iterative algorithm is proposed, which overcomes the limitations of conventional identification methods in handling complex nonlinearities. Additionally, considering the computational load caused by the numerous parameters in multi-piecewise linear function and the inversion of the Hessian matrix in the Newton iterative algorithm, the hierarchical identification principle is introduced and a three-stage generalized Newton iterative algorithm is derived for enhancing the computational efficiency. The feasibility of the presented methods are demonstrated through a simulation example.

Suggested Citation

  • Fan, Yamin & Liu, Ximei & Li, Meihang, 2025. "Hierarchical Newton iterative identification methods for a class of input multi-piecewise Hammerstein models with autoregressive noise," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 237(C), pages 247-262.
  • Handle: RePEc:eee:matcom:v:237:y:2025:i:c:p:247-262
    DOI: 10.1016/j.matcom.2025.04.019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475425001491
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2025.04.019?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:matcom:v:237:y:2025:i:c:p:247-262. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.