src/PhpSpreadsheet/Shared/JAMA/QRDecomposition.php 1 location
|
@@ 162-164 (lines=3) @@
|
159 |
|
public function getQ() |
160 |
|
{ |
161 |
|
for ($k = $this->n-1; $k >= 0; --$k) { |
162 |
|
for ($i = 0; $i < $this->m; ++$i) { |
163 |
|
$Q[$i][$k] = 0.0; |
164 |
|
} |
165 |
|
$Q[$k][$k] = 1.0; |
166 |
|
for ($j = $k; $j < $this->n; ++$j) { |
167 |
|
if ($this->QR[$k][$k] != 0) { |
src/PhpSpreadsheet/Shared/JAMA/SingularValueDecomposition.php 1 location
|
@@ 144-146 (lines=3) @@
|
141 |
|
$e[$k] = -$e[$k]; |
142 |
|
if (($k+1 < $this->m) and ($e[$k] != 0.0)) { |
143 |
|
// Apply the transformation. |
144 |
|
for ($i = $k+1; $i < $this->m; ++$i) { |
145 |
|
$work[$i] = 0.0; |
146 |
|
} |
147 |
|
for ($j = $k+1; $j < $this->n; ++$j) { |
148 |
|
for ($i = $k+1; $i < $this->m; ++$i) { |
149 |
|
$work[$i] += $e[$j] * $A[$i][$j]; |