F07UWF (ZTPTRI) (PDF version)
F07 Chapter Contents
F07 Chapter Introduction
NAG Library Manual

NAG Library Routine Document

F07UWF (ZTPTRI)

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

F07UWF (ZTPTRI) computes the inverse of a complex triangular matrix, using packed storage.

2  Specification

SUBROUTINE F07UWF ( UPLO, DIAG, N, AP, INFO)
INTEGER  N, INFO
COMPLEX (KIND=nag_wp)  AP(*)
CHARACTER(1)  UPLO, DIAG
The routine may be called by its LAPACK name ztptri.

3  Description

F07UWF (ZTPTRI) forms the inverse of a complex triangular matrix A, using packed storage. Note that the inverse of an upper (lower) triangular matrix is also upper (lower) triangular.

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 whether A is upper or lower triangular.
UPLO='U'
A is upper triangular.
UPLO='L'
A is lower triangular.
Constraint: UPLO='U' or 'L'.
2:     DIAG – CHARACTER(1)Input
On entry: indicates whether A is a nonunit or unit triangular matrix.
DIAG='N'
A is a nonunit triangular matrix.
DIAG='U'
A is a unit triangular matrix; the diagonal elements are not referenced and are assumed to be 1.
Constraint: DIAG='N' or 'U'.
3:     N – INTEGERInput
On entry: n, the order of the matrix A.
Constraint: N0.
4:     AP(*) – COMPLEX (KIND=nag_wp) arrayInput/Output
Note: the dimension of the array AP must be at least max1,N×N+1/2.
On entry: the n by n triangular 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.
If DIAG='U', the diagonal elements of A are assumed to be 1, and are not referenced; the same storage scheme is used whether DIAG='N' or ‘U’.
On exit: A is overwritten by A-1, using the same storage format as described above.
5:     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 parameter had an illegal value. An explanatory message is output, and execution of the program is terminated.
INFO>0
If INFO=i, ai,i is exactly zero; A is singular and its inverse cannot be computed.

7  Accuracy

The computed inverse X satisfies
XA-IcnεXA ,
where cn is a modest linear function of n, and ε is the machine precision.
Note that a similar bound for AX-I cannot be guaranteed, although it is almost always satisfied.
The computed inverse satisfies the forward error bound
X-A-1cnεA-1AX .
See Du Croz and Higham (1992).

8  Further Comments

The total number of real floating point operations is approximately 43n3.
The real analogue of this routine is F07UJF (DTPTRI).

9  Example

This example computes the inverse of the matrix A, where
A= 4.78+4.56i 0.00+0.00i 0.00+0.00i 0.00+0.00i 2.00-0.30i -4.11+1.25i 0.00+0.00i 0.00+0.00i 2.89-1.34i 2.36-4.25i 4.15+0.80i 0.00+0.00i -1.89+1.15i 0.04-3.69i -0.02+0.46i 0.33-0.26i ,
using packed storage.

9.1  Program Text

Program Text (f07uwfe.f90)

9.2  Program Data

Program Data (f07uwfe.d)

9.3  Program Results

Program Results (f07uwfe.r)


F07UWF (ZTPTRI) (PDF version)
F07 Chapter Contents
F07 Chapter Introduction
NAG Library Manual

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