Type of matrix A and matrix B.
General 0 The input matrix is a matrix that you cannot describe with one of the other categories.
Upper Triangular 3 The input matrix is upper triangular.
Matrix A in the Sylvester equation.
Matrix B in the Sylvester equation.
Matrix C in the Sylvester equation.
Form of the Sylvester equation.
Plus 0 op(A)X + X op(B) = aC, where A is the input matrix A, B is the input matrix B, and C is the input matrix C.
Minus 1 op(A)X - X op(B) = aC, where A is the input matrix A, B is the input matrix B, and C is the input matrix C.
Operation this node performs on matrix A in the Sylvester equation.
Not Transposed 0 op(A) = A, where A is the input matrix A.
Transposed 1 op(A) = transpose of A, where A is the input matrix A.
Operation this node performs on matrix B in the Sylvester equation.
Not Transposed 0 op(B) = B, where B is the input matrix B.
Transposed 1 op(B) = transpose of B, where B is the input matrix B.
Solution of the Sylvester equation.
Scaling factor a of the Sylvester equation.
A Boolean that returns whether the node uses perturbed values to solve the equation.
True Uses perturbed values to solve the Sylvester equation. The eigenvalues of matrix A and matrix B are common or close and indicate the solution of the Sylvester equation is not unique. If the solution of the Sylvester equation is not unique, the node might not return the correct solution.
False Does not use perturbed values to solve the Sylvester equation.
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 (±) depends on the equation you want to solve.