Sylvester's equation: Accuracy and computational stability (Q1903648)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sylvester's equation: Accuracy and computational stability |
scientific article |
Statements
Sylvester's equation: Accuracy and computational stability (English)
0 references
1 February 1996
0 references
Two problems related to the equation \(AX + XB = C\), known as the Sylvester matrix equation, are investigated. The Sylvester equation in which \(A\), \(B\) and \(C\) are \(m \times m\), \(n \times n\) and \(m \times n\) matrices, respectively, appears frequently in the theory of linear dynamic systems in relation to problems of control and stability. The first problem deals with the accuracy of the computed solution \(\widehat{X}\). The second handles the stability aspects of the solution and discusses ways for computing the backward error. A scheme is proposed using the residual \(R\) formed as \(A\widehat{X} + \widehat{X} B - C\) to ameliorate the solution of Sylvester's equation based on an iterative improvement technique similar to the famous one used in linear equations' solvers. The convergence of the proposed scheme is proved. The results apply automatically to the special case when \(A = B^T\) (Lyapunov equation).
0 references
matrix norms
0 references
conditioning
0 references
scaling
0 references
error analysis
0 references
Sylvester matrix equation
0 references
linear dynamic systems
0 references
control
0 references
stability
0 references
iterative improvement
0 references
convergence
0 references
Lyapunov equation
0 references