@@ 374-380 (lines=7) @@ | ||
371 | $e[$j] = $cs * $e[$j] - $sn * $this->s[$j]; |
|
372 | $g = $sn * $this->s[$j + 1]; |
|
373 | $this->s[$j + 1] = $cs * $this->s[$j + 1]; |
|
374 | if ($wantv) { |
|
375 | for ($i = 0; $i < $this->n; ++$i) { |
|
376 | $t = $cs * $this->V[$i][$j] + $sn * $this->V[$i][$j + 1]; |
|
377 | $this->V[$i][$j + 1] = -$sn * $this->V[$i][$j] + $cs * $this->V[$i][$j + 1]; |
|
378 | $this->V[$i][$j] = $t; |
|
379 | } |
|
380 | } |
|
381 | $t = hypo($f, $g); |
|
382 | $cs = $f / $t; |
|
383 | $sn = $g / $t; |
|
@@ 389-395 (lines=7) @@ | ||
386 | $this->s[$j + 1] = -$sn * $e[$j] + $cs * $this->s[$j + 1]; |
|
387 | $g = $sn * $e[$j + 1]; |
|
388 | $e[$j + 1] = $cs * $e[$j + 1]; |
|
389 | if ($wantu && ($j < $this->m - 1)) { |
|
390 | for ($i = 0; $i < $this->m; ++$i) { |
|
391 | $t = $cs * $this->U[$i][$j] + $sn * $this->U[$i][$j + 1]; |
|
392 | $this->U[$i][$j + 1] = -$sn * $this->U[$i][$j] + $cs * $this->U[$i][$j + 1]; |
|
393 | $this->U[$i][$j] = $t; |
|
394 | } |
|
395 | } |
|
396 | } |
|
397 | $e[$p - 2] = $f; |
|
398 | $iter = $iter + 1; |