Solving Stable Sylvester Equations via Rational Iterative Schemes
- 7 December 2005
- journal article
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 28 (1) , 51-83
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Existence of a low rank or ℋ︁‐matrix approximant to the solution of a Sylvester equationNumerical Linear Algebra with Applications, 2004
- LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairsACM Transactions on Mathematical Software, 1996
- Parallel algorithms for algebraic Riccati equationsInternational Journal of Control, 1991
- Model order reduction via real Schur-form decompositionInternational Journal of Control, 1991
- On a fundamental property of the cross- Gramian matrixIEEE Transactions on Circuits and Systems, 1984
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†International Journal of Control, 1980
- Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equationsBIT Numerical Mathematics, 1980
- A Hessenberg-Schur method for the problem AX + XB= CIEEE Transactions on Automatic Control, 1979
- Improving the Efficiency of Matrix Operations in the Numerical Solution of Stiff Ordinary Differential EquationsACM Transactions on Mathematical Software, 1978
- The numerical solution of the matrix equationXA+AY=FBIT Numerical Mathematics, 1977