Finds the inverse of an input matrix, if the inverse exists.
The input matrix is a matrix that you cannot describe with one of the other categories.
The input matrix is positive-definite.
The input matrix is lower triangular.
The input matrix is upper triangular.
A square matrix.
This input accepts a 2D array of double-precision, floating point numbers or 2D array of complex double-precision, floating point numbers.
If the matrix is singular or is not square, this node returns an empty array and an error.
Error conditions that occur before this node runs. The node responds to this input according to standard error behavior.
Default: No error
The inverse matrix of the input matrix.
Error information. The node produces this output according to standard error behavior.
If the input matrix is nonsingular, this node calculates the output inverse matrix by solving the linear system given by the following equation.
AB = I
If A is a nonsingular matrix, you can show that the solution to the preceding system is unique and that it corresponds to the output inverse matrix of A, given by the following equation.
B = A-1
Therefore, B is an inverse matrix.
The numerical implementation of the matrix inversion is not only numerically intensive, but because of its recursive nature, is also highly sensitive to round-off errors introduced by the floating-point numeric coprocessor. Although the computations use the maximum possible accuracy, this node cannot always solve for the system.
Where This Node Can Run:
Desktop OS: Windows
FPGA: Not supported