File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-540-31954-2_29
- Scopus: eid_2-s2.0-24344450067
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Identification of deterministic switched ARX systems via identification of algebraic varieties
Title | Identification of deterministic switched ARX systems via identification of algebraic varieties |
---|---|
Authors | |
Issue Date | 2005 |
Citation | Lecture Notes in Computer Science, 2005, v. 3414, p. 449-465 How to Cite? |
Abstract | We present a closed-form (linear-algebraic) solution to the identification of deterministic switched ARX systems and characterize conditions that guarantee the uniqueness of the solution. We show that the simultaneous identification of the number of ARX systems, the (possibly different) model orders, the ARX model parameters, and the switching sequence is equivalent to the identification and decomposition of a projective algebraic variety whose degree and dimension depend on the number of ARX systems and the model orders, respectively. Given an upper bound for the number of systems, our algorithm identifies the variety and the maximum orders by fitting a polynomial to the data, and the number of systems, the model parameters, and the switching sequence by differentiating this polynomial. Our method is provably correct in the deterministic case, provides a good sub-optimal solution in the stochastic case, and can handle large low-dimensional data sets (up to tens of thousands points) in a batch fashion. © Springer-Verlag Berlin Heidelberg 2005. |
Persistent Identifier | http://hdl.handle.net/10722/327485 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ma, Yi | - |
dc.contributor.author | Vidai, René | - |
dc.date.accessioned | 2023-03-31T05:31:41Z | - |
dc.date.available | 2023-03-31T05:31:41Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | Lecture Notes in Computer Science, 2005, v. 3414, p. 449-465 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10722/327485 | - |
dc.description.abstract | We present a closed-form (linear-algebraic) solution to the identification of deterministic switched ARX systems and characterize conditions that guarantee the uniqueness of the solution. We show that the simultaneous identification of the number of ARX systems, the (possibly different) model orders, the ARX model parameters, and the switching sequence is equivalent to the identification and decomposition of a projective algebraic variety whose degree and dimension depend on the number of ARX systems and the model orders, respectively. Given an upper bound for the number of systems, our algorithm identifies the variety and the maximum orders by fitting a polynomial to the data, and the number of systems, the model parameters, and the switching sequence by differentiating this polynomial. Our method is provably correct in the deterministic case, provides a good sub-optimal solution in the stochastic case, and can handle large low-dimensional data sets (up to tens of thousands points) in a batch fashion. © Springer-Verlag Berlin Heidelberg 2005. | - |
dc.language | eng | - |
dc.relation.ispartof | Lecture Notes in Computer Science | - |
dc.title | Identification of deterministic switched ARX systems via identification of algebraic varieties | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-540-31954-2_29 | - |
dc.identifier.scopus | eid_2-s2.0-24344450067 | - |
dc.identifier.volume | 3414 | - |
dc.identifier.spage | 449 | - |
dc.identifier.epage | 465 | - |