Skip to content

Adding a recursive xLARFT #1080

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 21 commits into from
Dec 3, 2024
Merged

Adding a recursive xLARFT #1080

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
21 commits
Select commit Hold shift + click to select a range
8a338cf
a
jprhyne May 29, 2024
7fdd346
Merge branch 'master' of github.com:jprhyne/lapack
jprhyne Jun 12, 2024
d1f787c
Merge branch 'master' of github.com:jprhyne/lapack
jprhyne Oct 14, 2024
4490848
Merge branch 'master' of github.com:jprhyne/lapack
jprhyne Oct 14, 2024
2122708
DO NOT MERGE: demonstrating changes work
jprhyne Oct 14, 2024
5495628
CAN MERGE: Implemented my version of xlarft with comments added, and …
jprhyne Oct 16, 2024
13aab4a
Merge branch 'Reference-LAPACK:master' into master
jprhyne Oct 16, 2024
298804e
Merge branch 'Reference-LAPACK:master' into larft
jprhyne Oct 16, 2024
b966220
Merge pull request #1 from jprhyne/larft
jprhyne Oct 16, 2024
1ba075c
updating parameter definition in the single complex version
jprhyne Oct 16, 2024
46e8388
Merge branch 'Reference-LAPACK:master' into master
jprhyne Nov 4, 2024
828db43
Merge branch 'Reference-LAPACK:master' into master
jprhyne Nov 16, 2024
3065ee8
Merge branch 'Reference-LAPACK:master' into larft
jprhyne Nov 22, 2024
60c66af
Merge pull request #2 from jprhyne/larft
jprhyne Nov 22, 2024
2534b59
updating documentation to be more descriptive
jprhyne Nov 22, 2024
dadd80e
Merge branch 'master' of github.com:jprhyne/lapack
jprhyne Nov 22, 2024
354a16f
Removed mod files and extranous file changes (hopefully)
jprhyne Nov 30, 2024
273ab49
removed extranous changes (hopefully x2)
jprhyne Nov 30, 2024
d4741c8
removed all extranous changes
jprhyne Nov 30, 2024
db48820
lowered line length to hopefully fix build failures in the CI
jprhyne Nov 30, 2024
e9b05ef
Updated variants information as well as fixed trailing line in zlarft
jprhyne Nov 30, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Removed mod files and extranous file changes (hopefully)
  • Loading branch information
@jprhyne
jprhyne committed Nov 30, 2024
commit 354a16f22f984ce1ff161657c4db9b7ad352b136
44 changes: 22 additions & 22 deletions SRC/clarft.f
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -159,8 +159,8 @@
*> \endverbatim
*>
* =====================================================================
RECURSIVE SUBROUTINE CLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
$ LDT )
RECURSIVE SUBROUTINE CLARFT( DIRECT, STOREV, N, K, V, LDV,
$ TAU, T, LDT )
*
* -- LAPACK auxiliary routine --
* -- LAPACK is a software package provided by Univ. of Tennessee, --
Expand Down Expand Up @@ -319,8 +319,8 @@ RECURSIVE SUBROUTINE CLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* T_{1,2} = T_{1,2}*V_{2,2}
*
CALL CTRMM('Right', 'Lower', 'No transpose', 'Unit', L, K-L,
$ ONE, V(L+1, L+1), LDV, T(1, L+1), LDT)
CALL CTRMM('Right', 'Lower', 'No transpose', 'Unit', L,
$ K-L, ONE, V(L+1, L+1), LDV, T(1, L+1), LDT)

*
* T_{1,2} = V_{3,1}'*V_{3,2} + T_{1,2}
Expand Down Expand Up @@ -410,8 +410,8 @@ RECURSIVE SUBROUTINE CLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* T_{1,2} = T_{1,2}*V_{2,2}'
*
CALL CTRMM('Right', 'Upper', 'Conjugate', 'Unit', L, K-L, ONE,
$ V(L+1, L+1), LDV, T(1, L+1), LDT)
CALL CTRMM('Right', 'Upper', 'Conjugate', 'Unit', L, K-L,
$ ONE, V(L+1, L+1), LDV, T(1, L+1), LDT)

*
* T_{1,2} = V_{1,3}*V_{2,3}' + T_{1,2}
Expand All @@ -426,8 +426,8 @@ RECURSIVE SUBROUTINE CLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* T_{1,2} = -T_{1,1}*T_{1,2}
*
CALL CTRMM('Left', 'Upper', 'No transpose', 'Non-unit', L, K-L,
$ NEG_ONE, T, LDT, T(1, L+1), LDT)
CALL CTRMM('Left', 'Upper', 'No transpose', 'Non-unit', L,
$ K-L, NEG_ONE, T, LDT, T(1, L+1), LDT)

*
* T_{1,2} = T_{1,2}*T_{2,2}
Expand Down Expand Up @@ -490,8 +490,8 @@ RECURSIVE SUBROUTINE CLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* Compute T_{2,2} recursively
*
CALL CLARFT(DIRECT, STOREV, N, L, V(1, K-L+1), LDV, TAU(K-L+1),
$ T(K-L+1,K-L+1), LDT)
CALL CLARFT(DIRECT, STOREV, N, L, V(1, K-L+1), LDV,
$ TAU(K-L+1), T(K-L+1,K-L+1), LDT)
*
* Compute T_{2,1}
* T_{2,1} = V_{2,2}'
Expand All @@ -504,8 +504,8 @@ RECURSIVE SUBROUTINE CLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* T_{2,1} = T_{2,1}*V_{2,1}
*
CALL CTRMM('Right', 'Upper', 'No transpose', 'Unit', L, K-L,
$ ONE, V(N-K+1,1), LDV, T(K-L+1,1), LDT)
CALL CTRMM('Right', 'Upper', 'No transpose', 'Unit', L,
$ K-L, ONE, V(N-K+1,1), LDV, T(K-L+1,1), LDT)

*
* T_{2,1} = V_{2,2}'*V_{2,1} + T_{2,1}
Expand All @@ -520,8 +520,8 @@ RECURSIVE SUBROUTINE CLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* T_{2,1} = -T_{2,2}*T_{2,1}
*
CALL CTRMM('Left', 'Lower', 'No transpose', 'Non-unit', L, K-L,
$ NEG_ONE, T(K-L+1,K-L+1), LDT, T(K-L+1,1), LDT)
CALL CTRMM('Left', 'Lower', 'No transpose', 'Non-unit', L,
$ K-L, NEG_ONE, T(K-L+1,K-L+1), LDT, T(K-L+1,1), LDT)
*
* T_{2,1} = T_{2,1}*T_{1,1}
*
Expand Down Expand Up @@ -585,8 +585,8 @@ RECURSIVE SUBROUTINE CLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* Compute T_{2,2} recursively
*
CALL CLARFT(DIRECT, STOREV, N, L, V(K-L+1,1), LDV, TAU(K-L+1),
$ T(K-L+1,K-L+1), LDT)
CALL CLARFT(DIRECT, STOREV, N, L, V(K-L+1,1), LDV,
$ TAU(K-L+1), T(K-L+1,K-L+1), LDT)
*
* Compute T_{2,1}
* T_{2,1} = V_{2,2}
Expand All @@ -597,8 +597,8 @@ RECURSIVE SUBROUTINE CLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* T_{2,1} = T_{2,1}*V_{1,2}'
*
CALL CTRMM('Right', 'Lower', 'Conjugate', 'Unit', L, K-L, ONE,
$ V(1, N-K+1), LDV, T(K-L+1,1), LDT)
CALL CTRMM('Right', 'Lower', 'Conjugate', 'Unit', L, K-L,
$ ONE, V(1, N-K+1), LDV, T(K-L+1,1), LDT)

*
* T_{2,1} = V_{2,1}*V_{1,1}' + T_{2,1}
Expand All @@ -614,13 +614,13 @@ RECURSIVE SUBROUTINE CLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* T_{2,1} = -T_{2,2}*T_{2,1}
*
CALL CTRMM('Left', 'Lower', 'No tranpose', 'Non-unit', L, K-L,
$ NEG_ONE, T(K-L+1,K-L+1), LDT, T(K-L+1,1), LDT)
CALL CTRMM('Left', 'Lower', 'No tranpose', 'Non-unit', L,
$ K-L, NEG_ONE, T(K-L+1,K-L+1), LDT, T(K-L+1,1), LDT)

*
* T_{2,1} = T_{2,1}*T_{1,1}
*
CALL CTRMM('Right', 'Lower', 'No tranpose', 'Non-unit', L, K-L,
$ ONE, T, LDT, T(K-L+1,1), LDT)
CALL CTRMM('Right', 'Lower', 'No tranpose', 'Non-unit', L,
$ K-L, ONE, T, LDT, T(K-L+1,1), LDT)
END IF
END SUBROUTINE
4 changes: 2 additions & 2 deletions SRC/dgelqf.f
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -251,8 +251,8 @@ SUBROUTINE DGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
* Form the triangular factor of the block reflector
* H = H(i) H(i+1) . . . H(i+ib-1)
*
CALL DLARFT( 'Forward', 'Rowwise', N-I+1, IB, A( I, I ),
$ LDA, TAU( I ), WORK, LDWORK )
CALL DLARFT( 'Forward', 'Rowwise', N-I+1, IB, A( I,
$ I ), LDA, TAU( I ), WORK, LDWORK )
*
* Apply H to A(i+ib:m,i:n) from the right
*
Expand Down
4 changes: 2 additions & 2 deletions SRC/dgeqlf.f
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -256,8 +256,8 @@ SUBROUTINE DGEQLF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
* Form the triangular factor of the block reflector
* H = H(i+ib-1) . . . H(i+1) H(i)
*
CALL DLARFT( 'Backward', 'Columnwise', M-K+I+IB-1,
$ IB, A( 1, N-K+I ), LDA, TAU( I ), WORK,
CALL DLARFT( 'Backward', 'Columnwise', M-K+I+IB-1, IB,
$ A( 1, N-K+I ), LDA, TAU( I ), WORK,
$ LDWORK )
*
* Apply H**T to A(1:m-k+i+ib-1,1:n-k+i-1) from the left
Expand Down
3 changes: 1 addition & 2 deletions SRC/dgerqf.f
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -257,8 +257,7 @@ SUBROUTINE DGERQF( M, N, A, LDA, TAU, WORK, LWORK, INFO )
* H = H(i+ib-1) . . . H(i+1) H(i)
*
CALL DLARFT( 'Backward', 'Rowwise', N-K+I+IB-1, IB,
$ A( M-K+I, 1 ), LDA, TAU( I ), WORK,
$ LDWORK )
$ A( M-K+I, 1 ), LDA, TAU( I ), WORK, LDWORK )
*
* Apply H to A(1:m-k+i-1,1:n-k+i+ib-1) from the right
*
Expand Down
44 changes: 22 additions & 22 deletions SRC/dlarft.f
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -159,8 +159,8 @@
*> \endverbatim
*>
* =====================================================================
RECURSIVE SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
$ LDT )
RECURSIVE SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV,
$ TAU, T, LDT )
*
* -- LAPACK auxiliary routine --
* -- LAPACK is a software package provided by Univ. of Tennessee, --
Expand Down Expand Up @@ -315,8 +315,8 @@ RECURSIVE SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* T_{1,2} = T_{1,2}*V_{2,2}
*
CALL DTRMM('Right', 'Lower', 'No transpose', 'Unit', L, K-L,
$ ONE, V(L+1, L+1), LDV, T(1, L+1), LDT)
CALL DTRMM('Right', 'Lower', 'No transpose', 'Unit', L,
$ K-L, ONE, V(L+1, L+1), LDV, T(1, L+1), LDT)

*
* T_{1,2} = V_{3,1}'*V_{3,2} + T_{1,2}
Expand Down Expand Up @@ -406,8 +406,8 @@ RECURSIVE SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* T_{1,2} = T_{1,2}*V_{2,2}'
*
CALL DTRMM('Right', 'Upper', 'Transpose', 'Unit', L, K-L, ONE,
$ V(L+1, L+1), LDV, T(1, L+1), LDT)
CALL DTRMM('Right', 'Upper', 'Transpose', 'Unit', L, K-L,
$ ONE, V(L+1, L+1), LDV, T(1, L+1), LDT)

*
* T_{1,2} = V_{1,3}*V_{2,3}' + T_{1,2}
Expand All @@ -422,8 +422,8 @@ RECURSIVE SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* T_{1,2} = -T_{1,1}*T_{1,2}
*
CALL DTRMM('Left', 'Upper', 'No transpose', 'Non-unit', L, K-L,
$ NEG_ONE, T, LDT, T(1, L+1), LDT)
CALL DTRMM('Left', 'Upper', 'No transpose', 'Non-unit', L,
$ K-L, NEG_ONE, T, LDT, T(1, L+1), LDT)

*
* T_{1,2} = T_{1,2}*T_{2,2}
Expand Down Expand Up @@ -486,8 +486,8 @@ RECURSIVE SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* Compute T_{2,2} recursively
*
CALL DLARFT(DIRECT, STOREV, N, L, V(1, K-L+1), LDV, TAU(K-L+1),
$ T(K-L+1,K-L+1), LDT)
CALL DLARFT(DIRECT, STOREV, N, L, V(1, K-L+1), LDV,
$ TAU(K-L+1), T(K-L+1,K-L+1), LDT)
*
* Compute T_{2,1}
* T_{2,1} = V_{2,2}'
Expand All @@ -500,8 +500,8 @@ RECURSIVE SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* T_{2,1} = T_{2,1}*V_{2,1}
*
CALL DTRMM('Right', 'Upper', 'No transpose', 'Unit', L, K-L,
$ ONE, V(N-K+1,1), LDV, T(K-L+1,1), LDT)
CALL DTRMM('Right', 'Upper', 'No transpose', 'Unit', L,
$ K-L, ONE, V(N-K+1,1), LDV, T(K-L+1,1), LDT)

*
* T_{2,1} = V_{2,2}'*V_{2,1} + T_{2,1}
Expand All @@ -516,8 +516,8 @@ RECURSIVE SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* T_{2,1} = -T_{2,2}*T_{2,1}
*
CALL DTRMM('Left', 'Lower', 'No transpose', 'Non-unit', L, K-L,
$ NEG_ONE, T(K-L+1,K-L+1), LDT, T(K-L+1,1), LDT)
CALL DTRMM('Left', 'Lower', 'No transpose', 'Non-unit', L,
$ K-L, NEG_ONE, T(K-L+1,K-L+1), LDT, T(K-L+1,1), LDT)
*
* T_{2,1} = T_{2,1}*T_{1,1}
*
Expand Down Expand Up @@ -581,8 +581,8 @@ RECURSIVE SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* Compute T_{2,2} recursively
*
CALL DLARFT(DIRECT, STOREV, N, L, V(K-L+1,1), LDV, TAU(K-L+1),
$ T(K-L+1,K-L+1), LDT)
CALL DLARFT(DIRECT, STOREV, N, L, V(K-L+1,1), LDV,
$ TAU(K-L+1), T(K-L+1,K-L+1), LDT)
*
* Compute T_{2,1}
* T_{2,1} = V_{2,2}
Expand All @@ -593,8 +593,8 @@ RECURSIVE SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* T_{2,1} = T_{2,1}*V_{1,2}'
*
CALL DTRMM('Right', 'Lower', 'Transpose', 'Unit', L, K-L, ONE,
$ V(1, N-K+1), LDV, T(K-L+1,1), LDT)
CALL DTRMM('Right', 'Lower', 'Transpose', 'Unit', L, K-L,
$ ONE, V(1, N-K+1), LDV, T(K-L+1,1), LDT)

*
* T_{2,1} = V_{2,1}*V_{1,1}' + T_{2,1}
Expand All @@ -610,13 +610,13 @@ RECURSIVE SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
*
* T_{2,1} = -T_{2,2}*T_{2,1}
*
CALL DTRMM('Left', 'Lower', 'No tranpose', 'Non-unit', L, K-L,
$ NEG_ONE, T(K-L+1,K-L+1), LDT, T(K-L+1,1), LDT)
CALL DTRMM('Left', 'Lower', 'No tranpose', 'Non-unit', L,
$ K-L, NEG_ONE, T(K-L+1,K-L+1), LDT, T(K-L+1,1), LDT)

*
* T_{2,1} = T_{2,1}*T_{1,1}
*
CALL DTRMM('Right', 'Lower', 'No tranpose', 'Non-unit', L, K-L,
$ ONE, T, LDT, T(K-L+1,1), LDT)
CALL DTRMM('Right', 'Lower', 'No tranpose', 'Non-unit', L,
$ K-L, ONE, T, LDT, T(K-L+1,1), LDT)
END IF
END SUBROUTINE
3 changes: 2 additions & 1 deletion SRC/dorglq.f
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -253,7 +253,8 @@ SUBROUTINE DORGLQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
* Form the triangular factor of the block reflector
* H = H(i) H(i+1) . . . H(i+ib-1)
*
CALL DLARFT( 'Forward', 'Rowwise', N-I+1, IB, A( I, I ),
CALL DLARFT( 'Forward', 'Rowwise', N-I+1, IB, A( I,
$ I ),
$ LDA, TAU( I ), WORK, LDWORK )
*
* Apply H**T to A(i+ib:m,i:n) from the right
Expand Down
2 changes: 1 addition & 1 deletion SRC/dorgql.f
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -260,7 +260,7 @@ SUBROUTINE DORGQL( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
* Form the triangular factor of the block reflector
* H = H(i+ib-1) . . . H(i+1) H(i)
*
CALL DLARFT( 'Backward', 'Columnwise', M-K+I+IB-1, IB,
CALL DLARFT( 'Backward', 'Columnwise', M-K+I+IB-1, IB,
$ A( 1, N-K+I ), LDA, TAU( I ), WORK, LDWORK )
*
* Apply H to A(1:m-k+i+ib-1,1:n-k+i-1) from the left
Expand Down
4 changes: 2 additions & 2 deletions SRC/dorgrq.f
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -261,8 +261,8 @@ SUBROUTINE DORGRQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
* Form the triangular factor of the block reflector
* H = H(i+ib-1) . . . H(i+1) H(i)
*
CALL DLARFT( 'Backward', 'Rowwise', N-K+I+IB-1, IB,
$ A( II, 1 ), LDA, TAU( I ), WORK, LDWORK)
CALL DLARFT( 'Backward', 'Rowwise', N-K+I+IB-1, IB,
$ A( II, 1 ), LDA, TAU( I ), WORK, LDWORK )
*
* Apply H**T to A(1:m-k+i-1,1:n-k+i+ib-1) from the right
*
Expand Down
2 changes: 1 addition & 1 deletion SRC/dormlq.f
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -316,7 +316,7 @@ SUBROUTINE DORMLQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
* Form the triangular factor of the block reflector
* H = H(i) H(i+1) . . . H(i+ib-1)
*
CALL DLARFT( 'Forward', 'Rowwise', NQ-I+1, IB, A( I, I ),
CALL DLARFT( 'Forward', 'Rowwise', NQ-I+1, IB, A( I, I ),
$ LDA, TAU( I ), WORK( IWT ), LDT )
IF( LEFT ) THEN
*
Expand Down
4 changes: 2 additions & 2 deletions SRC/dormql.f
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -310,8 +310,8 @@ SUBROUTINE DORMQL( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
* Form the triangular factor of the block reflector
* H = H(i+ib-1) . . . H(i+1) H(i)
*
CALL DLARFT( 'Backward', 'Columnwise', NQ-K+I+IB-1, IB,
$ A( 1, I ), LDA, TAU( I ), WORK( IWT ), LDT)
CALL DLARFT( 'Backward', 'Columnwise', NQ-K+I+IB-1, IB,
$ A( 1, I ), LDA, TAU( I ), WORK( IWT ), LDT )
IF( LEFT ) THEN
*
* H or H**T is applied to C(1:m-k+i+ib-1,1:n)
Expand Down
3 changes: 2 additions & 1 deletion SRC/dormqr.f
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -309,7 +309,8 @@ SUBROUTINE DORMQR( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
* Form the triangular factor of the block reflector
* H = H(i) H(i+1) . . . H(i+ib-1)
*
CALL DLARFT( 'Forward', 'Columnwise', NQ-I+1, IB, A( I, I ),
CALL DLARFT( 'Forward', 'Columnwise', NQ-I+1, IB, A( I,
$ I ),
$ LDA, TAU( I ), WORK( IWT ), LDT )
IF( LEFT ) THEN
*
Expand Down
Binary file removed SRC/la_constants.mod
View file
Open in desktop
Copy link
Contributor

@langou langou Nov 30, 2024

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I do not think we want the .mod file

Binary file not shown.
Binary file removed SRC/la_xisnan.mod
View file
Open in desktop
Copy link
Contributor

@langou langou Nov 30, 2024

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I do not think we want the .mod file

Copy link
Contributor Author

@jprhyne jprhyne Nov 30, 2024

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Is this something that could potentially be added to a gitignore file as I notice the file is created after I run 'make' so it seems to be a product of some compilation process. Not sure if its because of some machine tests that are failing (things like testing NaNs and Max behavior)

Copy link
Contributor

@langou langou Nov 30, 2024

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

"Is this something that could potentially be added to a gitignore file." Good idea. Feel welcome to submit a separate pull request with this feature.

Binary file not shown.
2 changes: 1 addition & 1 deletion SRC/slarft.f
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -160,7 +160,7 @@
*>
* =====================================================================
RECURSIVE SUBROUTINE SLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T,
$ LDT )
$ TAU, T, LDT )
*
* -- LAPACK auxiliary routine --
* -- LAPACK is a software package provided by Univ. of Tennessee, --
Expand Down
Loading