Identification of 2D Interconnected Systems: An efficient Steepest-Descent approach

Patricio Torres; Jan Willem van Wingerden

doi:10.1016/j.ifacol.2018.09.094

Identification of 2D Interconnected Systems: An efficient Steepest-Descent approach

Patricio Torres
, Jan Willem van Wingerden

Team Jan-Willem van Wingerden

Research output: Contribution to journal › Conference article › Scientific › peer-review

1 Citation (Scopus)

64 Downloads (Pure)

Abstract

In this paper, a new identification method for large 2D grids of interconnected systems is presented. The proposed algorithm minimizes the Output-Error of the lifted system by using a Steepest-Descent optimization method which exploit the Multilevel Sequentially-Semi Separable (MSSS) structure of the involved matrices. Furthermore, it is shown that the computational complexity of the proposed approach is linear with respect to the number of subsystems in the grid. Finally, a numerical example is presented in order to show the effectiveness of the proposed algorithm.

Original language	English
Pages (from-to)	78-83
Journal	IFAC-PapersOnLine
Volume	51
Issue number	15
DOIs	https://doi.org/10.1016/j.ifacol.2018.09.094
Publication status	Published - 2018
Event	SYSID 2018: 18th IFAC Symposium on System Identification - Stockholm, Sweden Duration: 9 Jul 2018 → 11 Jul 2018

Keywords

Efficient Algorithms
Interconnected systems
Jacobian
Output-Error identification
Steepest-Descent

Thematic collaboration

TU Delft Wind Energy Institute (DUWIND)

Access to Document

10.1016/j.ifacol.2018.09.094

1-s2.0-S2405896318317543-mainFinal published version, 479 KB

Cite this

@article{3fbfc0a2fe8e4de08d7791a5cbf43ca9,

title = "Identification of 2D Interconnected Systems: An efficient Steepest-Descent approach",

abstract = "In this paper, a new identification method for large 2D grids of interconnected systems is presented. The proposed algorithm minimizes the Output-Error of the lifted system by using a Steepest-Descent optimization method which exploit the Multilevel Sequentially-Semi Separable (MSSS) structure of the involved matrices. Furthermore, it is shown that the computational complexity of the proposed approach is linear with respect to the number of subsystems in the grid. Finally, a numerical example is presented in order to show the effectiveness of the proposed algorithm.",

keywords = "Efficient Algorithms, Interconnected systems, Jacobian, Output-Error identification, Steepest-Descent",

author = "Patricio Torres and Wingerden, \{Jan Willem van\}",

year = "2018",

doi = "10.1016/j.ifacol.2018.09.094",

language = "English",

volume = "51",

pages = "78--83",

journal = "IFAC-PapersOnLine",

issn = "2405-8963",

publisher = "Elsevier",

number = "15",

note = "SYSID 2018: 18th IFAC Symposium on System Identification ; Conference date: 09-07-2018 Through 11-07-2018",

}

TY - JOUR

T1 - Identification of 2D Interconnected Systems

T2 - SYSID 2018: 18th IFAC Symposium on System Identification

AU - Torres, Patricio

AU - Wingerden, Jan Willem van

PY - 2018

Y1 - 2018

N2 - In this paper, a new identification method for large 2D grids of interconnected systems is presented. The proposed algorithm minimizes the Output-Error of the lifted system by using a Steepest-Descent optimization method which exploit the Multilevel Sequentially-Semi Separable (MSSS) structure of the involved matrices. Furthermore, it is shown that the computational complexity of the proposed approach is linear with respect to the number of subsystems in the grid. Finally, a numerical example is presented in order to show the effectiveness of the proposed algorithm.

AB - In this paper, a new identification method for large 2D grids of interconnected systems is presented. The proposed algorithm minimizes the Output-Error of the lifted system by using a Steepest-Descent optimization method which exploit the Multilevel Sequentially-Semi Separable (MSSS) structure of the involved matrices. Furthermore, it is shown that the computational complexity of the proposed approach is linear with respect to the number of subsystems in the grid. Finally, a numerical example is presented in order to show the effectiveness of the proposed algorithm.

KW - Efficient Algorithms

KW - Interconnected systems

KW - Jacobian

KW - Output-Error identification

KW - Steepest-Descent

UR - https://www.scopus.com/pages/publications/85054383042

U2 - 10.1016/j.ifacol.2018.09.094

DO - 10.1016/j.ifacol.2018.09.094

M3 - Conference article

AN - SCOPUS:85054383042

SN - 2405-8963

VL - 51

SP - 78

EP - 83

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

IS - 15

Y2 - 9 July 2018 through 11 July 2018

ER -

Identification of 2D Interconnected Systems: An efficient Steepest-Descent approach

Abstract

Keywords

Thematic collaboration

Access to Document

Other files and links

Fingerprint

Cite this