ПРО ВИБІР ПОЧАТКОВОГО НАБЛИЖЕННЯ В ІТЕРАЦІЙНИХ АЛГОРИТМАХ РОЗВ’ЯЗАННЯ РІВНЯННЯ X − ATX−1A = Q
The algorithm of solution of the matrix equation is considered. In this algorithm the starting value is constructed by use of the linear matrix inequalities. For improving the received starting value the Newton procedure is used. On the example, the efficiency of algorithm is shown also in the cases...
Saved in:
| Date: | 2011 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
V.M. Glushkov Institute of Cybernetics of NAS of Ukraine
2011
|
| Online Access: | https://jais.net.ua/index.php/files/article/view/543 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Problems of Control and Informatics |