{"title":"Solving the algebraic Riccati equation on a hypercube multiprocessor","authors":"J. Gardiner, A. Laub","doi":"10.1145/63047.63116","DOIUrl":null,"url":null,"abstract":"A parallel algorithm for solving the algebraic Riccati equation is described and its performance on an Intel iPSC/d5 is reported. Three variations of the matrix sign function algorithm are compared. The best one showed efficiencies of about 60 percent on large problems.","PeriodicalId":299435,"journal":{"name":"Conference on Hypercube Concurrent Computers and Applications","volume":"144 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Hypercube Concurrent Computers and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/63047.63116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
A parallel algorithm for solving the algebraic Riccati equation is described and its performance on an Intel iPSC/d5 is reported. Three variations of the matrix sign function algorithm are compared. The best one showed efficiencies of about 60 percent on large problems.