version 1.15, 2014/01/27 09:28:21
|
version 1.20, 2023/08/07 08:38:57
|
Line 2
|
Line 2
|
* |
* |
* =========== DOCUMENTATION =========== |
* =========== DOCUMENTATION =========== |
* |
* |
* Online html documentation available at |
* Online html documentation available at |
* http://www.netlib.org/lapack/explore-html/ |
* http://www.netlib.org/lapack/explore-html/ |
* |
* |
*> \htmlonly |
*> \htmlonly |
*> Download DLARFT + dependencies |
*> Download DLARFT + dependencies |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlarft.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlarft.f"> |
*> [TGZ]</a> |
*> [TGZ]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlarft.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlarft.f"> |
*> [ZIP]</a> |
*> [ZIP]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlarft.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlarft.f"> |
*> [TXT]</a> |
*> [TXT]</a> |
*> \endhtmlonly |
*> \endhtmlonly |
* |
* |
* Definition: |
* Definition: |
* =========== |
* =========== |
* |
* |
* SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT ) |
* SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT ) |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
* CHARACTER DIRECT, STOREV |
* CHARACTER DIRECT, STOREV |
* INTEGER K, LDT, LDV, N |
* INTEGER K, LDT, LDV, N |
Line 27
|
Line 27
|
* .. Array Arguments .. |
* .. Array Arguments .. |
* DOUBLE PRECISION T( LDT, * ), TAU( * ), V( LDV, * ) |
* DOUBLE PRECISION T( LDT, * ), TAU( * ), V( LDV, * ) |
* .. |
* .. |
* |
* |
* |
* |
*> \par Purpose: |
*> \par Purpose: |
* ============= |
* ============= |
Line 125
|
Line 125
|
* Authors: |
* Authors: |
* ======== |
* ======== |
* |
* |
*> \author Univ. of Tennessee |
*> \author Univ. of Tennessee |
*> \author Univ. of California Berkeley |
*> \author Univ. of California Berkeley |
*> \author Univ. of Colorado Denver |
*> \author Univ. of Colorado Denver |
*> \author NAG Ltd. |
*> \author NAG Ltd. |
* |
|
*> \date September 2012 |
|
* |
* |
*> \ingroup doubleOTHERauxiliary |
*> \ingroup doubleOTHERauxiliary |
* |
* |
Line 163
|
Line 161
|
* ===================================================================== |
* ===================================================================== |
SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT ) |
SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT ) |
* |
* |
* -- LAPACK auxiliary routine (version 3.4.2) -- |
* -- LAPACK auxiliary routine -- |
* -- LAPACK is a software package provided by Univ. of Tennessee, -- |
* -- LAPACK is a software package provided by Univ. of Tennessee, -- |
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- |
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- |
* September 2012 |
|
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
CHARACTER DIRECT, STOREV |
CHARACTER DIRECT, STOREV |
Line 221
|
Line 218
|
END DO |
END DO |
DO J = 1, I-1 |
DO J = 1, I-1 |
T( J, I ) = -TAU( I ) * V( I , J ) |
T( J, I ) = -TAU( I ) * V( I , J ) |
END DO |
END DO |
J = MIN( LASTV, PREVLASTV ) |
J = MIN( LASTV, PREVLASTV ) |
* |
* |
* T(1:i-1,i) := - tau(i) * V(i:j,1:i-1)**T * V(i:j,i) |
* T(1:i-1,i) := - tau(i) * V(i:j,1:i-1)**T * V(i:j,i) |
* |
* |
CALL DGEMV( 'Transpose', J-I, I-1, -TAU( I ), |
CALL DGEMV( 'Transpose', J-I, I-1, -TAU( I ), |
$ V( I+1, 1 ), LDV, V( I+1, I ), 1, ONE, |
$ V( I+1, 1 ), LDV, V( I+1, I ), 1, ONE, |
$ T( 1, I ), 1 ) |
$ T( 1, I ), 1 ) |
ELSE |
ELSE |
* Skip any trailing zeros. |
* Skip any trailing zeros. |
Line 236
|
Line 233
|
END DO |
END DO |
DO J = 1, I-1 |
DO J = 1, I-1 |
T( J, I ) = -TAU( I ) * V( J , I ) |
T( J, I ) = -TAU( I ) * V( J , I ) |
END DO |
END DO |
J = MIN( LASTV, PREVLASTV ) |
J = MIN( LASTV, PREVLASTV ) |
* |
* |
* T(1:i-1,i) := - tau(i) * V(1:i-1,i:j) * V(i,i:j)**T |
* T(1:i-1,i) := - tau(i) * V(1:i-1,i:j) * V(i,i:j)**T |
Line 280
|
Line 277
|
END DO |
END DO |
DO J = I+1, K |
DO J = I+1, K |
T( J, I ) = -TAU( I ) * V( N-K+I , J ) |
T( J, I ) = -TAU( I ) * V( N-K+I , J ) |
END DO |
END DO |
J = MAX( LASTV, PREVLASTV ) |
J = MAX( LASTV, PREVLASTV ) |
* |
* |
* T(i+1:k,i) = -tau(i) * V(j:n-k+i,i+1:k)**T * V(j:n-k+i,i) |
* T(i+1:k,i) = -tau(i) * V(j:n-k+i,i+1:k)**T * V(j:n-k+i,i) |
Line 295
|
Line 292
|
END DO |
END DO |
DO J = I+1, K |
DO J = I+1, K |
T( J, I ) = -TAU( I ) * V( J, N-K+I ) |
T( J, I ) = -TAU( I ) * V( J, N-K+I ) |
END DO |
END DO |
J = MAX( LASTV, PREVLASTV ) |
J = MAX( LASTV, PREVLASTV ) |
* |
* |
* T(i+1:k,i) = -tau(i) * V(i+1:k,j:n-k+i) * V(i,j:n-k+i)**T |
* T(i+1:k,i) = -tau(i) * V(i+1:k,j:n-k+i) * V(i,j:n-k+i)**T |