NAG FL Interface
f07pwf (zhptri)

1 Purpose

f07pwf computes the inverse of a complex Hermitian indefinite matrix A, where A has been factorized by f07prf, using packed storage.

2 Specification

Fortran Interface
Subroutine f07pwf ( uplo, n, ap, ipiv, work, info)
Integer, Intent (In) :: n, ipiv(*)
Integer, Intent (Out) :: info
Complex (Kind=nag_wp), Intent (Inout) :: ap(*)
Complex (Kind=nag_wp), Intent (Out) :: work(n)
Character (1), Intent (In) :: uplo
C Header Interface
#include <nag.h>
void  f07pwf_ (const char *uplo, const Integer *n, Complex ap[], const Integer ipiv[], Complex work[], Integer *info, const Charlen length_uplo)
The routine may be called by the names f07pwf, nagf_lapacklin_zhptri or its LAPACK name zhptri.

3 Description

f07pwf is used to compute the inverse of a complex Hermitian indefinite matrix A, the routine must be preceded by a call to f07prf, which computes the Bunch–Kaufman factorization of A, using packed storage.
If uplo='U', A=PUDUHPT and A-1 is computed by solving UHPTXPU=D-1 for X.
If uplo='L', A=PLDLHPT and A-1 is computed by solving LHPTXPL=D-1 for X.

4 References

Du Croz J J and Higham N J (1992) Stability of methods for matrix inversion IMA J. Numer. Anal. 12 1–19

5 Arguments

1: uplo Character(1) Input
On entry: specifies how A has been factorized.
uplo='U'
A=PUDUHPT, where U is upper triangular.
uplo='L'
A=PLDLHPT, where L is lower triangular.
Constraint: uplo='U' or 'L'.
2: n Integer Input
On entry: n, the order of the matrix A.
Constraint: n0.
3: ap* Complex (Kind=nag_wp) array Input/Output
Note: the dimension of the array ap must be at least max1,n×n+1/2.
On entry: the factorization of A stored in packed form, as returned by f07prf.
On exit: the factorization is overwritten by the n by n matrix A-1.
More precisely,
  • if uplo='U', the upper triangle of A-1 must be stored with element Aij in api+jj-1/2 for ij;
  • if uplo='L', the lower triangle of A-1 must be stored with element Aij in api+2n-jj-1/2 for ij.
4: ipiv* Integer array Input
Note: the dimension of the array ipiv must be at least max1,n.
On entry: details of the interchanges and the block structure of D, as returned by f07prf.
5: workn Complex (Kind=nag_wp) array Workspace
6: info Integer Output
On exit: info=0 unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

info<0
If info=-i, argument i had an illegal value. An explanatory message is output, and execution of the program is terminated.
info>0
Element value of the diagonal is exactly zero. D is singular and the inverse of A cannot be computed.

7 Accuracy

The computed inverse X satisfies a bound of the form cn is a modest linear function of n, and ε is the machine precision.

8 Parallelism and Performance

f07pwf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.
Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

The total number of real floating-point operations is approximately 83n3.
The real analogue of this routine is f07pjf.

10 Example

This example computes the inverse of the matrix A, where
A= -1.36+0.00i 1.58+0.90i 2.21-0.21i 3.91+1.50i 1.58-0.90i -8.87+0.00i -1.84-0.03i -1.78+1.18i 2.21+0.21i -1.84+0.03i -4.63+0.00i 0.11+0.11i 3.91-1.50i -1.78-1.18i 0.11-0.11i -1.84+0.00i .  
Here A is Hermitian indefinite, stored in packed form, and must first be factorized by f07prf.

10.1 Program Text

Program Text (f07pwfe.f90)

10.2 Program Data

Program Data (f07pwfe.d)

10.3 Program Results

Program Results (f07pwfe.r)