zsptrf (l)  Linux Manuals
zsptrf: computes the factorization of a complex symmetric matrix A stored in packed format using the BunchKaufman diagonal pivoting method
NAME
ZSPTRF  computes the factorization of a complex symmetric matrix A stored in packed format using the BunchKaufman diagonal pivoting methodSYNOPSIS
 SUBROUTINE ZSPTRF(
 UPLO, N, AP, IPIV, INFO )
 CHARACTER UPLO
 INTEGER INFO, N
 INTEGER IPIV( * )
 COMPLEX*16 AP( * )
PURPOSE
ZSPTRF computes the factorization of a complex symmetric matrix A stored in packed format using the BunchKaufman diagonal pivoting method:A
where U (or L) is a product of permutation and unit upper (lower) triangular matrices, and D is symmetric and block diagonal with 1by1 and 2by2 diagonal blocks.
ARGUMENTS
 UPLO (input) CHARACTER*1

= aqUaq: Upper triangle of A is stored;
= aqLaq: Lower triangle of A is stored.  N (input) INTEGER
 The order of the matrix A. N >= 0.
 AP (input/output) COMPLEX*16 array, dimension (N*(N+1)/2)
 On entry, the upper or lower triangle of the symmetric matrix A, packed columnwise in a linear array. The jth column of A is stored in the array AP as follows: if UPLO = aqUaq, AP(i + (j1)*j/2) = A(i,j) for 1<=i<=j; if UPLO = aqLaq, AP(i + (j1)*(2nj)/2) = A(i,j) for j<=i<=n. On exit, the block diagonal matrix D and the multipliers used to obtain the factor U or L, stored as a packed triangular matrix overwriting A (see below for further details).
 IPIV (output) INTEGER array, dimension (N)
 Details of the interchanges and the block structure of D. If IPIV(k) > 0, then rows and columns k and IPIV(k) were interchanged and D(k,k) is a 1by1 diagonal block. If UPLO = aqUaq and IPIV(k) = IPIV(k1) < 0, then rows and columns k1 and IPIV(k) were interchanged and D(k1:k,k1:k) is a 2by2 diagonal block. If UPLO = aqLaq and IPIV(k) = IPIV(k+1) < 0, then rows and columns k+1 and IPIV(k) were interchanged and D(k:k+1,k:k+1) is a 2by2 diagonal block.
 INFO (output) INTEGER

= 0: successful exit
< 0: if INFO = i, the ith argument had an illegal value
> 0: if INFO = i, D(i,i) is exactly zero. The factorization has been completed, but the block diagonal matrix D is exactly singular, and division by zero will occur if it is used to solve a system of equations.
FURTHER DETAILS
596  Based on modifications by J. Lewis, Boeing Computer ServicesIf UPLO = aqUaq, then A = U*D*Uaq, where
U
i.e., U is a product of terms P(k)*U(k), where k decreases from n to 1 in steps of 1 or 2, and D is a block diagonal matrix with 1by1 and 2by2 diagonal blocks D(k). P(k) is a permutation matrix as defined by IPIV(k), and U(k) is a unit upper triangular matrix, such that if the diagonal block D(k) is of order s (s = 1 or 2), then
U(k)
If s = 1, D(k) overwrites A(k,k), and v overwrites A(1:k1,k). If s = 2, the upper triangle of D(k) overwrites A(k1,k1), A(k1,k), and A(k,k), and v overwrites A(1:k2,k1:k).
If UPLO = aqLaq, then A = L*D*Laq, where
L
i.e., L is a product of terms P(k)*L(k), where k increases from 1 to n in steps of 1 or 2, and D is a block diagonal matrix with 1by1 and 2by2 diagonal blocks D(k). P(k) is a permutation matrix as defined by IPIV(k), and L(k) is a unit lower triangular matrix, such that if the diagonal block D(k) is of order s (s = 1 or 2), then
L(k)
If s = 1, D(k) overwrites A(k,k), and v overwrites A(k+1:n,k). If s = 2, the lower triangle of D(k) overwrites A(k,k), A(k+1,k), and A(k+1,k+1), and v overwrites A(k+2:n,k:k+1).