F07PJF (DSPTRI) (PDF version)
F07 Chapter Contents
F07 Chapter Introduction
NAG Library Manual

NAG Library Routine Document

F07PJF (DSPTRI)

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

F07PJF (DSPTRI) computes the inverse of a real symmetric indefinite matrix A, where A has been factorized by F07PDF (DSPTRF), using packed storage.

2  Specification

SUBROUTINE F07PJF ( UPLO, N, AP, IPIV, WORK, INFO)
INTEGER  N, IPIV(*), INFO
REAL (KIND=nag_wp)  AP(*), WORK(N)
CHARACTER(1)  UPLO
The routine may be called by its LAPACK name dsptri.

3  Description

F07PJF (DSPTRI) is used to compute the inverse of a real symmetric indefinite matrix A, the routine must be preceded by a call to F07PDF (DSPTRF), which computes the Bunch–Kaufman factorization of A, using packed storage.
If UPLO='U', A=PUDUTPT and A-1 is computed by solving UTPTXPU=D-1.
If UPLO='L', A=PLDLTPT and A-1 is computed by solving LTPTXPL=D-1.

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  Parameters

1:     UPLO – CHARACTER(1)Input
On entry: specifies how A has been factorized.
UPLO='U'
A=PUDUTPT, where U is upper triangular.
UPLO='L'
A=PLDLTPT, where L is lower triangular.
Constraint: UPLO='U' or 'L'.
2:     N – INTEGERInput
On entry: n, the order of the matrix A.
Constraint: N0.
3:     AP* – REAL (KIND=nag_wp) arrayInput/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 F07PDF (DSPTRF).
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 arrayInput
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 F07PDF (DSPTRF).
5:     WORKN – REAL (KIND=nag_wp) arrayWorkspace
6:     INFO – INTEGEROutput
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

F07PJF (DSPTRI) is not threaded by NAG in any implementation.
F07PJF (DSPTRI) 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 floating-point operations is approximately 23n3.
The complex analogues of this routine are F07PWF (ZHPTRI) for Hermitian matrices and F07QWF (ZSPTRI) for symmetric matrices.

10  Example

This example computes the inverse of the matrix A, where
A= 2.07 3.87 4.20 -1.15 3.87 -0.21 1.87 0.63 4.20 1.87 1.15 2.06 -1.15 0.63 2.06 -1.81 .  
Here A is symmetric indefinite, stored in packed form, and must first be factorized by F07PDF (DSPTRF).

10.1  Program Text

Program Text (f07pjfe.f90)

10.2  Program Data

Program Data (f07pjfe.d)

10.3  Program Results

Program Results (f07pjfe.r)


F07PJF (DSPTRI) (PDF version)
F07 Chapter Contents
F07 Chapter Introduction
NAG Library Manual

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