src/PhpSpreadsheet/Shared/JAMA/SingularValueDecomposition.php 1 location
|
@@ 150-152 (lines=3) @@
|
147 |
|
$e[$k] = -$e[$k]; |
148 |
|
if (($k + 1 < $this->m) and ($e[$k] != 0.0)) { |
149 |
|
// Apply the transformation. |
150 |
|
for ($i = $k + 1; $i < $this->m; ++$i) { |
151 |
|
$work[$i] = 0.0; |
152 |
|
} |
153 |
|
for ($j = $k + 1; $j < $this->n; ++$j) { |
154 |
|
for ($i = $k + 1; $i < $this->m; ++$i) { |
155 |
|
$work[$i] += $e[$j] * $A[$i][$j]; |
src/PhpSpreadsheet/Shared/JAMA/QRDecomposition.php 1 location
|
@@ 177-179 (lines=3) @@
|
174 |
|
public function getQ() |
175 |
|
{ |
176 |
|
for ($k = $this->n - 1; $k >= 0; --$k) { |
177 |
|
for ($i = 0; $i < $this->m; ++$i) { |
178 |
|
$Q[$i][$k] = 0.0; |
179 |
|
} |
180 |
|
$Q[$k][$k] = 1.0; |
181 |
|
for ($j = $k; $j < $this->n; ++$j) { |
182 |
|
if ($this->QR[$k][$k] != 0) { |