李雅普诺夫方程的空间矩阵解

1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes Pub Date : 1975-12-01 DOI:10.1109/CDC.1975.270713

J. Pivnichny

{"title":"李雅普诺夫方程的空间矩阵解","authors":"J. Pivnichny","doi":"10.1109/CDC.1975.270713","DOIUrl":null,"url":null,"abstract":"It is well known [2, 3] that the nth order Lyapunov equation, AP+PA'=-Q, can be expanded to a n(n+1)/2 order linear vector equation and then solved using conventional linear equation methods. The purpose of this short paper is to present recent work on the sparceness of the resulting equation and the computational advantage of that sparceness, for large n.","PeriodicalId":164707,"journal":{"name":"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1975-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sparce matrix solution of the Lyapunov equation\",\"authors\":\"J. Pivnichny\",\"doi\":\"10.1109/CDC.1975.270713\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is well known [2, 3] that the nth order Lyapunov equation, AP+PA'=-Q, can be expanded to a n(n+1)/2 order linear vector equation and then solved using conventional linear equation methods. The purpose of this short paper is to present recent work on the sparceness of the resulting equation and the computational advantage of that sparceness, for large n.\",\"PeriodicalId\":164707,\"journal\":{\"name\":\"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1975-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1975.270713\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1975.270713","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

众所周知[2,3]，n阶Lyapunov方程AP+PA'=-Q可以展开为n(n+1)/2阶线性向量方程，然后用常规线性方程方法求解。这篇短文的目的是介绍最近关于结果方程的稀疏性的工作，以及对于大n的稀疏性的计算优势。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Sparce matrix solution of the Lyapunov equation

It is well known [2, 3] that the nth order Lyapunov equation, AP+PA'=-Q, can be expanded to a n(n+1)/2 order linear vector equation and then solved using conventional linear equation methods. The purpose of this short paper is to present recent work on the sparceness of the resulting equation and the computational advantage of that sparceness, for large n.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes

自引率

0.00%

发文量