2
SUBROUTINE DGBFA (ABD, LDA, N, ML, MU, IPVT, INFO)
3
C***BEGIN PROLOGUE DGBFA
4
C***PURPOSE Factor a band matrix using Gaussian elimination.
5
C***LIBRARY SLATEC (LINPACK)
7
C***TYPE DOUBLE PRECISION (SGBFA-S, DGBFA-D, CGBFA-C)
8
C***KEYWORDS BANDED, LINEAR ALGEBRA, LINPACK, MATRIX FACTORIZATION
9
C***AUTHOR Moler, C. B., (U. of New Mexico)
12
C DGBFA factors a double precision band matrix by elimination.
14
C DGBFA is usually called by DGBCO, but it can be called
15
C directly with a saving in time if RCOND is not needed.
19
C ABD DOUBLE PRECISION(LDA, N)
20
C contains the matrix in band storage. The columns
21
C of the matrix are stored in the columns of ABD and
22
C the diagonals of the matrix are stored in rows
23
C ML+1 through 2*ML+MU+1 of ABD .
24
C See the comments below for details.
27
C the leading dimension of the array ABD .
28
C LDA must be .GE. 2*ML + MU + 1 .
31
C the order of the original matrix.
34
C number of diagonals below the main diagonal.
38
C number of diagonals above the main diagonal.
40
C More efficient if ML .LE. MU .
43
C ABD an upper triangular matrix in band storage and
44
C the multipliers which were used to obtain it.
45
C The factorization can be written A = L*U where
46
C L is a product of permutation and unit lower
47
C triangular matrices and U is upper triangular.
50
C an integer vector of pivot indices.
54
C = K if U(K,K) .EQ. 0.0 . This is not an error
55
C condition for this subroutine, but it does
56
C indicate that DGBSL will divide by zero if
57
C called. Use RCOND in DGBCO for a reliable
58
C indication of singularity.
62
C If A is a band matrix, the following program segment
63
C will set up the input.
65
C ML = (band width below the diagonal)
66
C MU = (band width above the diagonal)
77
C This uses rows ML+1 through 2*ML+MU+1 of ABD .
78
C In addition, the first ML rows in ABD are used for
79
C elements generated during the triangularization.
80
C The total number of rows needed in ABD is 2*ML+MU+1 .
81
C The ML+MU by ML+MU upper left triangle and the
82
C ML by ML lower right triangle are not referenced.
84
C***REFERENCES J. J. Dongarra, J. R. Bunch, C. B. Moler, and G. W.
85
C Stewart, LINPACK Users' Guide, SIAM, 1979.
86
C***ROUTINES CALLED DAXPY, DSCAL, IDAMAX
87
C***REVISION HISTORY (YYMMDD)
89
C 890531 Changed all specific intrinsics to generic. (WRB)
90
C 890831 Modified array declarations. (WRB)
91
C 890831 REVISION DATE from Version 3.2
92
C 891214 Prologue converted to Version 4.0 format. (BAB)
93
C 900326 Removed duplicate information from DESCRIPTION section.
95
C 920501 Reformatted the REFERENCES section. (WRB)
96
C***END PROLOGUE DGBFA
97
INTEGER LDA,N,ML,MU,IPVT(*),INFO
98
DOUBLE PRECISION ABD(LDA,*)
101
INTEGER I,IDAMAX,I0,J,JU,JZ,J0,J1,K,KP1,L,LM,M,MM,NM1
103
C***FIRST EXECUTABLE STATEMENT DGBFA
107
C ZERO INITIAL FILL-IN COLUMNS
111
IF (J1 .LT. J0) GO TO 30
122
C GAUSSIAN ELIMINATION WITH PARTIAL PIVOTING
125
IF (NM1 .LT. 1) GO TO 130
129
C ZERO NEXT FILL-IN COLUMN
132
IF (JZ .GT. N) GO TO 50
133
IF (ML .LT. 1) GO TO 50
139
C FIND L = PIVOT INDEX
142
L = IDAMAX(LM+1,ABD(M,K),1) + M - 1
145
C ZERO PIVOT IMPLIES THIS COLUMN ALREADY TRIANGULARIZED
147
IF (ABD(L,K) .EQ. 0.0D0) GO TO 100
149
C INTERCHANGE IF NECESSARY
151
IF (L .EQ. M) GO TO 60
157
C COMPUTE MULTIPLIERS
160
CALL DSCAL(LM,T,ABD(M+1,K),1)
162
C ROW ELIMINATION WITH COLUMN INDEXING
164
JU = MIN(MAX(JU,MU+IPVT(K)),N)
166
IF (JU .LT. KP1) GO TO 90
171
IF (L .EQ. MM) GO TO 70
175
CALL DAXPY(LM,T,ABD(M+1,K),1,ABD(MM+1,J),1)
185
IF (ABD(M,N) .EQ. 0.0D0) INFO = N