|
|
|
|
| LEADER |
02814nam a2200469 4500 |
| 001 |
978-1-84628-573-8 |
| 003 |
DE-He213 |
| 005 |
20191027193141.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121227s2001 xxk| s |||| 0|eng d |
| 020 |
|
|
|a 9781846285738
|9 978-1-84628-573-8
|
| 024 |
7 |
|
|a 10.1007/BFb0110347
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a TJ212-225
|
| 072 |
|
7 |
|a TJFM
|2 bicssc
|
| 072 |
|
7 |
|a TEC004000
|2 bisacsh
|
| 072 |
|
7 |
|a TJFM
|2 thema
|
| 082 |
0 |
4 |
|a 629.8
|2 23
|
| 100 |
1 |
|
|a Galkowski, Krzysztof.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 245 |
1 |
0 |
|a State-space Realisations of Linear 2-D Systems with Extensions to the General nD (n > 2) case
|h [electronic resource] /
|c by Krzysztof Galkowski.
|
| 250 |
|
|
|a 1st ed. 2001.
|
| 264 |
|
1 |
|a London :
|b Springer London :
|b Imprint: Springer,
|c 2001.
|
| 300 |
|
|
|a XI, 232 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Control and Information Sciences,
|x 0170-8643 ;
|v 263
|
| 505 |
0 |
|
|a Preliminaries -- The elementary operation algorithm for polynomial matrices -- 2D state-space realizations and the elementary operation algorithm - Single input - Single output (SISO) case -- MIMO systems - the 1D case -- Multiple-input, multiple-output (MIMO) systems - the 2D case -- The elementary operation approach extensions -- State-space realizations for 2D/nD systems revisited - Relations to the EOA -- Conclusions and further work.
|
| 520 |
|
|
|a This book demonstrates the newly developed Elementary Operations Algorithm (EOA). This is a systematic method for constructing a range of state-space realizations for 2-D systems. The key achievements of the monograph are as follows: - It provides a research-level introduction to the general area and undertakes a comparative critical review of previous approaches. - It gives a thorough coverage of the theoretical basis of the EOA algorithm. - It demonstrates the effectiveness of the EOA algorithm, for example, through the use of algebraic symbolic computing (using MAPLE), as well as by comparing this method with common alternatives.
|
| 650 |
|
0 |
|a Control engineering.
|
| 650 |
1 |
4 |
|a Control and Systems Theory.
|0 http://scigraph.springernature.com/things/product-market-codes/T19010
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9781447139577
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9781852334109
|
| 830 |
|
0 |
|a Lecture Notes in Control and Information Sciences,
|x 0170-8643 ;
|v 263
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/BFb0110347
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-ENG
|
| 912 |
|
|
|a ZDB-2-LNI
|
| 912 |
|
|
|a ZDB-2-BAE
|
| 950 |
|
|
|a Engineering (Springer-11647)
|