On the numerical analtsys of generated sylvester equations
From MaRDI portal
Publication:4323499
DOI10.1080/01630569408816591zbMath0813.65083OpenAlexW1565772926MaRDI QIDQ4323499
Publication date: 22 February 1995
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630569408816591
numerical resultssensitivity analysiscondition numbererror boundsdeparture from normalitymatrix Sylvester equation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices
- Linear matrix equations: The module theoretic approach
- Controllability, observability and the solution of AX-XB=C
- Un metodo a convergenza quadratica per equazioni matriciali lineari
- Algebraic method for the study of some linear matrix equations
- A rapidly convergent method for the solution of the matrix equation XA + AY = F
- Nonsingular solutions of TA-BT=C
- High-order iterative methods for the solution of the matrix equation XA+AY=F
- A survey of the theory of spectral operators
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Some Applications of the Lyapunov Matrix Equation
- Solution of the Equation $AX + XB = C$ by Inversion of an $M \times M$ or $N \times N$ Matrix
- Comparison of four numerical algorithms for solving the Liapunov matrix equation†
- Explicit Solutions of Linear Matrix Equations
- Resultants and the Solution of $AX - XB = - C$
- Solving the Matrix Equation $\sum _{\rho = 1}^r f_\rho (A)Xg_\rho (B) = C$
