getEigenvectors(); $eigValues = $decomp->getRealEigenvalues(); $this->assertEquals($knownEigvalues, $eigValues, '', $epsilon); $this->assertEquals($knownEigvectors, $eigVectors, '', $epsilon); // Secondly, generate a symmetric square matrix // and test for A.v=λ.v // // (We, for now, omit non-symmetric matrices whose eigenvalues can be complex numbers) $len = 3; $A = array_fill(0, $len, array_fill(0, $len, 0.0)); srand(intval(microtime(true) * 1000)); for ($i=0; $i < $len; $i++) { for ($k=0; $k < $len; $k++) { if ($i > $k) { $A[$i][$k] = $A[$k][$i]; } else { $A[$i][$k] = rand(0, 10); } } } $decomp = new EigenvalueDecomposition($A); $eigValues = $decomp->getRealEigenvalues(); $eigVectors= $decomp->getEigenvectors(); foreach ($eigValues as $index => $lambda) { $m1 = new Matrix($A); $m2 = (new Matrix($eigVectors[$index]))->transpose(); // A.v=λ.v $leftSide = $m1->multiply($m2)->toArray(); $rightSide= $m2->multiplyByScalar($lambda)->toArray(); $this->assertEquals($leftSide, $rightSide, '', $epsilon); } } }