F07QPF (ZSPSVX) (PDF version)
F07 Chapter Contents
F07 Chapter Introduction
NAG Library Manual

NAG Library Routine Document

F07QPF (ZSPSVX)

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

+ Contents

    1  Purpose
    7  Accuracy

1  Purpose

F07QPF (ZSPSVX) uses the diagonal pivoting factorization
A=UDUT   or   A=LDLT
to compute the solution to a complex system of linear equations
AX=B ,
where A is an n by n symmetric matrix stored in packed format and X and B are n by r matrices. Error bounds on the solution and a condition estimate are also provided.

2  Specification

SUBROUTINE F07QPF ( FACT, UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, LDX, RCOND, FERR, BERR, WORK, RWORK, INFO)
INTEGER  N, NRHS, IPIV(N), LDB, LDX, INFO
REAL (KIND=nag_wp)  RCOND, FERR(NRHS), BERR(NRHS), RWORK(N)
COMPLEX (KIND=nag_wp)  AP(*), AFP(*), B(LDB,*), X(LDX,*), WORK(2*N)
CHARACTER(1)  FACT, UPLO
The routine may be called by its LAPACK name zspsvx.

3  Description

F07QPF (ZSPSVX) performs the following steps:
  1. If FACT='N', the diagonal pivoting method is used to factor A as A=UDUT if UPLO='U' or A=LDLT if UPLO='L', where U (or L) is a product of permutation and unit upper (lower) triangular matrices and D is symmetric and block diagonal with 1 by 1 and 2 by 2 diagonal blocks.
  2. If some dii=0, so that D is exactly singular, then the routine returns with INFO=i. Otherwise, the factored form of A is used to estimate the condition number of the matrix A. If the reciprocal of the condition number is less than machine precision, INFO=N+1 is returned as a warning, but the routine still goes on to solve for X and compute error bounds as described below.
  3. The system of equations is solved for X using the factored form of A.
  4. Iterative refinement is applied to improve the computed solution matrix and to calculate error bounds and backward error estimates for it.

4  References

Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999) LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia http://www.netlib.org/lapack/lug
Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore
Higham N J (2002) Accuracy and Stability of Numerical Algorithms (2nd Edition) SIAM, Philadelphia

5  Parameters

1:     FACT – CHARACTER(1)Input
On entry: specifies whether or not the factorized form of the matrix A has been supplied.
FACT='F'
AFP and IPIV contain the factorized form of the matrix A. AFP and IPIV will not be modified.
FACT='N'
The matrix A will be copied to AFP and factorized.
Constraint: FACT='F' or 'N'.
2:     UPLO – CHARACTER(1)Input
On entry: if UPLO='U', the upper triangle of A is stored.
If UPLO='L', the lower triangle of A is stored.
Constraint: UPLO='U' or 'L'.
3:     N – INTEGERInput
On entry: n, the number of linear equations, i.e., the order of the matrix A.
Constraint: N0.
4:     NRHS – INTEGERInput
On entry: r, the number of right-hand sides, i.e., the number of columns of the matrix B.
Constraint: NRHS0.
5:     AP(*) – COMPLEX (KIND=nag_wp) arrayInput
Note: the dimension of the array AP must be at least max1,N×N+1/2.
On entry: the n by n symmetric matrix A, packed by columns.
More precisely,
  • if UPLO='U', the upper triangle of A must be stored with element Aij in APi+jj-1/2 for ij;
  • if UPLO='L', the lower triangle of A must be stored with element Aij in APi+2n-jj-1/2 for ij.
6:     AFP(*) – COMPLEX (KIND=nag_wp) arrayInput/Output
Note: the dimension of the array AFP must be at least max1,N×N+1/2.
On entry: if FACT='F', AFP contains the block diagonal matrix D and the multipliers used to obtain the factor U or L from the factorization A=UDUT or A=LDLT as computed by F07QRF (ZSPTRF), stored as a packed triangular matrix in the same storage format as A.
On exit: if FACT='N', AFP contains the block diagonal matrix D and the multipliers used to obtain the factor U or L from the factorization A=UDUT or A=LDLT as computed by F07QRF (ZSPTRF), stored as a packed triangular matrix in the same storage format as A.
7:     IPIV(N) – INTEGER arrayInput/Output
On entry: if FACT='F', IPIV contains details of the interchanges and the block structure of D, as determined by F07QRF (ZSPTRF).
  • if IPIVi=k>0, dii is a 1 by 1 pivot block and the ith row and column of A were interchanged with the kth row and column;
  • if UPLO='U' and IPIVi-1=IPIVi=-l<0, di-1,i-1d-i,i-1 d-i,i-1dii  is a 2 by 2 pivot block and the i-1th row and column of A were interchanged with the lth row and column;
  • if UPLO='L' and IPIVi=IPIVi+1=-m<0, diidi+1,idi+1,idi+1,i+1 is a 2 by 2 pivot block and the i+1th row and column of A were interchanged with the mth row and column.
On exit: if FACT='N', IPIV contains details of the interchanges and the block structure of D, as determined by F07QRF (ZSPTRF), as described above.
8:     B(LDB,*) – COMPLEX (KIND=nag_wp) arrayInput
Note: the second dimension of the array B must be at least max1,NRHS.
On entry: the n by r right-hand side matrix B.
9:     LDB – INTEGERInput
On entry: the first dimension of the array B as declared in the (sub)program from which F07QPF (ZSPSVX) is called.
Constraint: LDBmax1,N.
10:   X(LDX,*) – COMPLEX (KIND=nag_wp) arrayOutput
Note: the second dimension of the array X must be at least max1,NRHS.
On exit: if INFO=0 or N+1, the n by r solution matrix X.
11:   LDX – INTEGERInput
On entry: the first dimension of the array X as declared in the (sub)program from which F07QPF (ZSPSVX) is called.
Constraint: LDXmax1,N.
12:   RCOND – REAL (KIND=nag_wp)Output
On exit: the estimate of the reciprocal condition number of the matrix A. If RCOND=0.0, the matrix may be exactly singular. This condition is indicated by INFO>0 and INFON. Otherwise, if RCOND is less than the machine precision, the matrix is singular to working precision. This condition is indicated by INFO=N+1.
13:   FERR(NRHS) – REAL (KIND=nag_wp) arrayOutput
On exit: if INFO=0 or N+1, an estimate of the forward error bound for each computed solution vector, such that x^j-xj/xjFERRj where x^j is the jth column of the computed solution returned in the array X and xj is the corresponding column of the exact solution X. The estimate is as reliable as the estimate for RCOND, and is almost always a slight overestimate of the true error.
14:   BERR(NRHS) – REAL (KIND=nag_wp) arrayOutput
On exit: if INFO=0 or N+1, an estimate of the component-wise relative backward error of each computed solution vector x^j (i.e., the smallest relative change in any element of A or B that makes x^j an exact solution).
15:   WORK(2×N) – COMPLEX (KIND=nag_wp) arrayWorkspace
16:   RWORK(N) – REAL (KIND=nag_wp) arrayWorkspace
17:   INFO – INTEGEROutput
On exit: INFO=0 unless the routine detects an error (see Section 6).

6  Error Indicators and Warnings

Errors or warnings detected by the routine:
INFO<0
If INFO=-i, the ith argument had an illegal value. An explanatory message is output, and execution of the program is terminated.
INFO>0 and INFON
If INFON, di,i is exactly zero. The factorization has been completed, but the factor D is exactly singular, so the solution and error bounds could not be computed. RCOND=0.0 is returned.
INFO=N+1
D is nonsingular, but RCOND is less than machine precision, meaning that the matrix is singular to working precision. Nevertheless, the solution and error bounds are computed because there are a number of situations where the computed solution can be more accurate than the value of RCOND would suggest.

7  Accuracy

For each right-hand side vector b, the computed solution x^ is the exact solution of a perturbed system of equations A+Ex^=b, where
E1 = Oε A1 ,
where ε is the machine precision. See Chapter 11 of Higham (2002) for further details.
If x^ is the true solution, then the computed solution x satisfies a forward error bound of the form
x-x^ x^ wc condA,x^,b
where condA,x^,b = A-1 A x^ + b / x^ condA = A-1 A κ A. If x^  is the j th column of X , then wc  is returned in BERRj  and a bound on x - x^ / x^  is returned in FERRj . See Section 4.4 of Anderson et al. (1999) for further details.

8  Further Comments

The factorization of A  requires approximately 43 n3  floating point operations.
For each right-hand side, computation of the backward error involves a minimum of 16n2  floating point operations. Each step of iterative refinement involves an additional 24n2  operations. At most five steps of iterative refinement are performed, but usually only one or two steps are required. Estimating the forward error involves solving a number of systems of equations of the form Ax=b ; the number is usually 4 or 5 and never more than 11. Each solution involves approximately 8n2  operations.
The real analogue of this routine is F07PBF (DSPSVX). The complex Hermitian analogue of this routine is F07PPF (ZHPSVX).

9  Example

This example solves the equations
AX=B ,
where A  is the complex symmetric matrix
A = -0.56+0.12i -1.54-2.86i 5.32-1.59i 3.80+0.92i -1.54-2.86i -2.83-0.03i -3.52+0.58i -7.86-2.96i 5.32-1.59i -3.52+0.58i 8.86+1.81i 5.14-0.64i 3.80+0.92i -7.86-2.96i 5.14-0.64i -0.39-0.71i
and
B = -6.43+19.24i -4.59-35.53i -0.49-01.47i 6.95+20.49i -48.18+66.00i -12.08-27.02i -55.64+41.22i -19.09-35.97i .
Error estimates for the solutions, and an estimate of the reciprocal of the condition number of the matrix A  are also output.

9.1  Program Text

Program Text (f07qpfe.f90)

9.2  Program Data

Program Data (f07qpfe.d)

9.3  Program Results

Program Results (f07qpfe.r)


F07QPF (ZSPSVX) (PDF version)
F07 Chapter Contents
F07 Chapter Introduction
NAG Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2012