topology identification of coupling map lattice under sparsity condition

Clicks: 120
ID: 202504
2015
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #560 of 1,093 articles by views in journal of power sources

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 1,093 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
Coupling map lattice is an efficient mathematical model for studying complex systems. This paper studies the topology identification of coupled map lattice (CML) under the sparsity condition. We convert the identification problem into the problem of solving the underdetermined linear equations. The l1 norm method is used to solve the underdetermined equations. The requirement of data characters and sampling times are discussed in detail. We find that the high entropy and small coupling coefficient data are suitable for the identification. When the measurement time is more than 2.86 times sparsity, the accuracy of identification can reach an acceptable level. And when the measurement time reaches 4 times sparsity, we can receive a fairly good accuracy.
Reference Key
yu2015mathematicaltopology Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Jiangni Yu;Lixiang Li;Yixian Yang
Journal journal of power sources
Year 2015
DOI
10.1155/2015/303454
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.