Apache
/
commons-math
mirror of https://github.com/apache/commons-math.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Removed double[] solve(double[]) from EigenDecompositionImpl.Solver 

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/math/trunk@1165505 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Sebastien Brisard 2011-09-06 06:17:38 +00:00
parent 3998594624
commit d4834d0d57
1 changed files with 0 additions and 37 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

37
src/main/java/org/apache/commons/math/linear/EigenDecompositionImpl.java
View File

@ -268,43 +268,6 @@ public class EigenDecompositionImpl implements EigenDecomposition {
this.eigenvectors = eigenvectors;
}
/**
* Solve the linear equation A × X = B for symmetric matrices A.
* <p>
* This method only find exact linear solutions, i.e. solutions for
* which ||A &times; X - B|| is exactly 0.
* </p>
* @param b Right-hand side of the equation A &times; X = B
* @return a Vector X that minimizes the two norm of A &times; X - B
* @throws DimensionMismatchException if the matrices dimensions do not match.
* @throws SingularMatrixException if the decomposed matrix is singular.
*/
public double[] solve(final double[] b) {
if (!isNonSingular()) {
throw new SingularMatrixException();
}
final int m = realEigenvalues.length;
if (b.length != m) {
throw new DimensionMismatchException(b.length, m);
}
final double[] bp = new double[m];
final ArrayRealVector bVector = new ArrayRealVector(b, false);
for (int i = 0; i < m; ++i) {
final ArrayRealVector v = eigenvectors[i];
final double[] vData = v.getDataRef();
final double s = v.dotProduct(bVector) / realEigenvalues[i];
for (int j = 0; j < m; ++j) {
bp[j] += s * vData[j];
}
}
return bp;
}
/**
* Solve the linear equation A &times; X = B for symmetric matrices A.
* <p>