@@ 302-308 (lines=7) @@ | ||
299 | $f = -$sn * $e[$j-1]; |
|
300 | $e[$j-1] = $cs * $e[$j-1]; |
|
301 | } |
|
302 | if ($wantv) { |
|
303 | for ($i = 0; $i < $this->n; ++$i) { |
|
304 | $t = $cs * $this->V[$i][$j] + $sn * $this->V[$i][$p-1]; |
|
305 | $this->V[$i][$p-1] = -$sn * $this->V[$i][$j] + $cs * $this->V[$i][$p-1]; |
|
306 | $this->V[$i][$j] = $t; |
|
307 | } |
|
308 | } |
|
309 | } |
|
310 | break; |
|
311 | // Split at negligible s(k). |
|
@@ 322-328 (lines=7) @@ | ||
319 | $this->s[$j] = $t; |
|
320 | $f = -$sn * $e[$j]; |
|
321 | $e[$j] = $cs * $e[$j]; |
|
322 | if ($wantu) { |
|
323 | for ($i = 0; $i < $this->m; ++$i) { |
|
324 | $t = $cs * $this->U[$i][$j] + $sn * $this->U[$i][$k-1]; |
|
325 | $this->U[$i][$k-1] = -$sn * $this->U[$i][$j] + $cs * $this->U[$i][$k-1]; |
|
326 | $this->U[$i][$j] = $t; |
|
327 | } |
|
328 | } |
|
329 | } |
|
330 | break; |
|
331 | // Perform one qr step. |