Sylvester Equations VI
- Updated2025-07-30
- 2 minute(s) read
Solves the Sylvester matrix equation. The data types you wire to the A, B, and C inputs determine the polymorphic instance to use.

The following equations define the Sylvester matrix equation:
op(A)X + Xop(B) = aCor
op(A)X – Xop(B) = aCwhere op(A) is A or the conjugate transpose of A, op(B) is B or the conjugate transpose of B, and a is a scaling factor to avoid overflow in X.
The Sylvester matrix equation has a unique solution if and only if λ ± β ≠ 0, where λ and β are the eigenvalues of A and B, respectively, and the sign (+ or –) depends on the equation you want to solve. When the solution of the Sylvester matrix equation is not unique, this VI sets perturbed to TRUE and might not return the correct solution.