Mostrar el registro sencillo del ítem

dc.contributor.authorCarvalho, Joao Batista da Pazpt_BR
dc.contributor.authorDatta, Karabipt_BR
dc.contributor.authorHong, Yoopyopt_BR
dc.date.accessioned2011-01-29T06:00:40Zpt_BR
dc.date.issued2003pt_BR
dc.identifier.issn0018-9286pt_BR
dc.identifier.urihttp://hdl.handle.net/10183/27610pt_BR
dc.description.abstractA new block algorithm for computing a full rank solution of the Sylvester-observer equation arising in state estimation is proposed. The major computational kernels of this algorithm are: 1) solutions of standard Sylvester equations, in each case of which one of the matrices is of much smaller order than that of the system matrix and (furthermore, this small matrix can be chosen arbitrarily), and 2) orthogonal reduction of small order matrices. There are numerically stable algorithms for performing these tasks including the Krylov-subspace methods for solving large and sparse Sylvester equations. The proposed algorithm is also rich in Level 3 Basic Linear Algebra Subroutine (BLAS-3) computations and is thus suitable for high performance computing. Furthermore, the results on numerical experiments on some benchmark examples show that the algorithm has better accuracy than that of some of the existing block algorithms for this problem.en
dc.format.mimetypeapplication/pdfpt_BR
dc.language.isoengpt_BR
dc.relation.ispartofIEEE transactions on automatic control. New York. Vol. 48, no. 12 (dec. 2003), p. 2223-2228pt_BR
dc.rightsOpen Accessen
dc.subjectAlgoritmospt_BR
dc.subjectBlock algorithmen
dc.subjectSylvester-observer equationen
dc.subjectState estimationen
dc.titleA new block algorithm for full-rank solution of the Sylvester-observer equationpt_BR
dc.typeArtigo de periódicopt_BR
dc.identifier.nrb000642886pt_BR
dc.type.originEstrangeiropt_BR


Ficheros en el ítem

Thumbnail
   

Este ítem está licenciado en la Creative Commons License

Mostrar el registro sencillo del ítem