Powered by OpenAIRE graph
Found an issue? Give us feedback
downloadFull-Text
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Smithsonian figsharearrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Smithsonian figshare
Article . 2021
License: CC BY
Full-Text: https://figshare.com/articles/journal_contribution/Recursive_Relaxation_Identification_of_Linear_Multivariable_Systems_with_its_Parallel_Algorithm/13626758
Data sources: Bielefeld Academic Search Engine (BASE)
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
figshare
Other literature type . 2021
License: CC BY
Data sources: Datacite
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
figshare
Other literature type . 2021
License: CC BY
Data sources: Datacite
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Information Sciences
Article . 1996 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 1996
Data sources: zbMATH Open
DBLP
Article
Data sources: DBLP
https://dx.doi.org/10.1016/002...
Article
Data sources: Microsoft Academic Graph
 View all 5 versions
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Recursive relaxation identification of linear multivariable systems with its parallel algorithm

descriptionPublicationkeyboard_double_arrow_right Article , Other literature type 01 Mar 1996 English Publisher:Elsevier BVJournal:Information Sciences, volume 89, pages 211-223 (issn: 0020-0255, Copyright policy )
Authors: Mi Lu; Kunlin Liu;

doi: 10.1016/0020-0255(95)00235-9 , 10.6084/m9.figshare.13626758.v1 , 10.6084/m9.figshare.13626758

Recursive relaxation identification of linear multivariable systems with its parallel algorithm

Abstract

In this paper, we propose a new method for the identification of discrete-time linear multivariable systems. This method comprises three recursive computation schemesincluding two parameter estimate schemes for both state equation and observation equation, respectively, and the state estimate scheme via Kalman filtering. We call thismethod the recursive relaxation identification, abbreviated as RRI. Compared with the existing methods, the RRI algorithm has advantages of simplification, fast computation,and high efficiency, and is suitable for fast real-time on-line adaptive identification of linear multivariable systems.

Related Organizations
Keywords

PRAM, thrashing, linear discrete-time multivariable system, Parallel algorithms, Mesh-Connected Computer, nCUBE, Computer System Architecture, Multivariable systems, multidimensional control systems, Parallel numerical computation, polynomial product, recursive least squares, identification, System identification, Kalman filtering, data compression, Analysis of Algorithms and Complexity

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 3
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
3
Average
Average
Average
Green