Moore-Penrose Pseudoinverse Formula:
where \(\Sigma^+\) has \(1/\sigma_i\) on diagonal for \(\sigma_i > 0\), 0 otherwise, from SVD \(A = U \Sigma V^T\)
From: | To: |
The Moore-Penrose pseudoinverse is a generalization of the inverse matrix for singular or rectangular matrices. It provides a least-squares solution to systems of linear equations that may not have exact solutions.
The calculator computes the pseudoinverse using Singular Value Decomposition (SVD):
Where:
Explanation: The SVD decomposes the matrix, then the pseudoinverse is constructed by taking reciprocals of non-zero singular values.
Details: The pseudoinverse is crucial in linear algebra, statistics (linear regression), control theory, and machine learning (particularly in solving systems with no unique solution).
Tips: Enter your matrix with rows separated by semicolons and elements separated by spaces or commas. For example: "1,2,3;4,5,6" for a 2×3 matrix.
Q1: When is the pseudoinverse equal to the regular inverse?
A: When the matrix is square and non-singular (has non-zero determinant).
Q2: What applications use pseudoinverse?
A: Least squares regression, robotics, signal processing, and solving underdetermined systems.
Q3: How does Python compute pseudoinverse?
A: Typically via numpy.linalg.pinv which uses SVD internally.
Q4: What's the computational complexity?
A: O(min(mn², m²n)) for an m×n matrix, dominated by the SVD computation.
Q5: Can pseudoinverse handle rank-deficient matrices?
A: Yes, it provides the minimal norm solution for underdetermined systems.