1ZGTSV(1)                 LAPACK routine (version 3.2)                 ZGTSV(1)
2
3
4

NAME

6       ZGTSV - solves the equation   A*X = B,
7

SYNOPSIS

9       SUBROUTINE ZGTSV( N, NRHS, DL, D, DU, B, LDB, INFO )
10
11           INTEGER       INFO, LDB, N, NRHS
12
13           COMPLEX*16    B( LDB, * ), D( * ), DL( * ), DU( * )
14

PURPOSE

16       ZGTSV   solves the equation where A is an N-by-N tridiagonal matrix, by
17       Gaussian elimination with partial pivoting.
18       Note that the equation  A'*X = B  may be solved  by  interchanging  the
19       order of the arguments DU and DL.
20

ARGUMENTS

22       N       (input) INTEGER
23               The order of the matrix A.  N >= 0.
24
25       NRHS    (input) INTEGER
26               The  number of right hand sides, i.e., the number of columns of
27               the matrix B.  NRHS >= 0.
28
29       DL      (input/output) COMPLEX*16 array, dimension (N-1)
30               On entry, DL must contain the (n-1) subdiagonal elements of  A.
31               On  exit, DL is overwritten by the (n-2) elements of the second
32               superdiagonal of the upper triangular matrix U from the LU fac‐
33               torization of A, in DL(1), ..., DL(n-2).
34
35       D       (input/output) COMPLEX*16 array, dimension (N)
36               On  entry, D must contain the diagonal elements of A.  On exit,
37               D is overwritten by the n diagonal elements of U.
38
39       DU      (input/output) COMPLEX*16 array, dimension (N-1)
40               On entry, DU must contain the (n-1) superdiagonal  elements  of
41               A.   On  exit,  DU  is overwritten by the (n-1) elements of the
42               first superdiagonal of U.
43
44       B       (input/output) COMPLEX*16 array, dimension (LDB,NRHS)
45               On entry, the N-by-NRHS right hand side matrix B.  On exit,  if
46               INFO = 0, the N-by-NRHS solution matrix X.
47
48       LDB     (input) INTEGER
49               The leading dimension of the array B.  LDB >= max(1,N).
50
51       INFO    (output) INTEGER
52               = 0:  successful exit
53               < 0:  if INFO = -i, the i-th argument had an illegal value
54               > 0:  if INFO = i, U(i,i) is exactly zero, and the solution has
55               not been computed.  The factorization has  not  been  completed
56               unless i = N.
57
58
59
60 LAPACK routine (version 3.2)    November 2008                        ZGTSV(1)