Computational complexity reduction in scaled H ∞ synthesis
- Author
- IWASAKI, T1 ; HARA, S1 ; ROTEA, M. A2
[1] Department of Computational Intelligence and Systems Science, Tokyo Institute of Technology, 4259 Nagatsuta-cho, Midori-ku, Yokohama 226, Japan
[2] School of Aeronautics and Astronautics, Purdue University, West Lafayette, IN 47907, United States - Source
Automatica (Oxford). 1997, Vol 33, Num 7, pp 1325-1332 ; ref : 25 ref
- CODEN
- ATCAA9
- ISSN
- 0005-1098
- Scientific domain
- Control theory, operational research; Computer science
- Publisher
- Elsevier, Oxford
- Publication country
- United Kingdom
- Document type
- Article
- Language
- English
- Keyword (fr)
- Commande H infini Commande robuste Complexité calcul Conception assistée Optimisation Stabilité robuste Système asservi Système incertain
- Keyword (en)
- H infinite control Robust control Computational complexity Computer aided design Optimization Robust stability Feedback system Uncertain system
- Keyword (es)
- Control H infinito Control robusta Complejidad computación Concepción asistida Optimización Estabilidad robusta Servomecanismo Sistema incierto
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02D Control theory. Systems / 001D02D06 Control system analysis
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02D Control theory. Systems / 001D02D07 Control system synthesis
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 2758073
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1016/S0005-1098(97)00045-9 
https://dx.doi.org/10.1016/S0005-1098(97)00045-9
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1016\/S0005-1098(97)00045-9\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:60:\"Computational complexity reduction in scaled H \u221e synthesis\";s:9:\"\u0000*\u0000jtitle\";s:19:\"Automatica (Oxford)\";s:9:\"\u0000*\u0000stitle\";s:17:\"Automatica (Oxf.)\";s:7:\"\u0000*\u0000date\";s:4:\"1997\";s:9:\"\u0000*\u0000volume\";s:2:\"33\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:4:\"1325\";s:8:\"\u0000*\u0000epage\";s:4:\"1332\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0005-1098\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"IWASAKI\";s:10:\"\u0000*\u0000aufirst\";s:1:\"T\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:7:\"HARA, S\";i:1;s:11:\"ROTEA, M. A\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ATCAA9\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:60:\"Computational complexity reduction in scaled H \u221e synthesis\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1016\/S0005-1098(97)00045-9\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:60:\"Computational complexity reduction in scaled H \u221e synthesis\";s:9:\"\u0000*\u0000jtitle\";s:19:\"Automatica (Oxford)\";s:9:\"\u0000*\u0000stitle\";s:17:\"Automatica (Oxf.)\";s:7:\"\u0000*\u0000date\";s:4:\"1997\";s:9:\"\u0000*\u0000volume\";s:2:\"33\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:4:\"1325\";s:8:\"\u0000*\u0000epage\";s:4:\"1332\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0005-1098\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"IWASAKI\";s:10:\"\u0000*\u0000aufirst\";s:1:\"T\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:7:\"HARA, S\";i:1;s:11:\"ROTEA, M. A\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ATCAA9\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:60:\"Computational complexity reduction in scaled H \u221e synthesis\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:29:\"10.1016\/S0005-1098(97)00045-9\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1016\/S0005-1098(97)00045-9\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:60:\"Computational complexity reduction in scaled H \u221e synthesis\";s:9:\"\u0000*\u0000jtitle\";s:19:\"Automatica (Oxford)\";s:9:\"\u0000*\u0000stitle\";s:17:\"Automatica (Oxf.)\";s:7:\"\u0000*\u0000date\";s:4:\"1997\";s:9:\"\u0000*\u0000volume\";s:2:\"33\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:4:\"1325\";s:8:\"\u0000*\u0000epage\";s:4:\"1332\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0005-1098\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"IWASAKI\";s:10:\"\u0000*\u0000aufirst\";s:1:\"T\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:7:\"HARA, S\";i:1;s:11:\"ROTEA, M. A\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ATCAA9\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:60:\"Computational complexity reduction in scaled H \u221e synthesis\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1016\/S0005-1098(97)00045-9\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:60:\"Computational complexity reduction in scaled H \u221e synthesis\";s:9:\"\u0000*\u0000jtitle\";s:19:\"Automatica (Oxford)\";s:9:\"\u0000*\u0000stitle\";s:17:\"Automatica (Oxf.)\";s:7:\"\u0000*\u0000date\";s:4:\"1997\";s:9:\"\u0000*\u0000volume\";s:2:\"33\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:4:\"1325\";s:8:\"\u0000*\u0000epage\";s:4:\"1332\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0005-1098\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"IWASAKI\";s:10:\"\u0000*\u0000aufirst\";s:1:\"T\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:7:\"HARA, S\";i:1;s:11:\"ROTEA, M. A\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ATCAA9\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:60:\"Computational complexity reduction in scaled H \u221e synthesis\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1016\/S0005-1098(97)00045-9\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:60:\"Computational complexity reduction in scaled H \u221e synthesis\";s:9:\"\u0000*\u0000jtitle\";s:19:\"Automatica (Oxford)\";s:9:\"\u0000*\u0000stitle\";s:17:\"Automatica (Oxf.)\";s:7:\"\u0000*\u0000date\";s:4:\"1997\";s:9:\"\u0000*\u0000volume\";s:2:\"33\";s:8:\"\u0000*\u0000issue\";s:1:\"7\";s:8:\"\u0000*\u0000spage\";s:4:\"1325\";s:8:\"\u0000*\u0000epage\";s:4:\"1332\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0005-1098\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"IWASAKI\";s:10:\"\u0000*\u0000aufirst\";s:1:\"T\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:7:\"HARA, S\";i:1;s:11:\"ROTEA, M. A\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ATCAA9\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:60:\"Computational complexity reduction in scaled H \u221e synthesis\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
