NAG Library Routine Document

f07gdf  (dpptrf)

 Contents

    1  Purpose
    7  Accuracy

1
Purpose

f07gdf (dpptrf) computes the Cholesky factorization of a real symmetric positive definite matrix, using packed storage.

2
Specification

Fortran Interface
Subroutine f07gdf ( uplo, n, ap, info)
Integer, Intent (In):: n
Integer, Intent (Out):: info
Real (Kind=nag_wp), Intent (Inout):: ap(*)
Character (1), Intent (In):: uplo
C Header Interface
#include nagmk26.h
void  f07gdf_ ( const char *uplo, const Integer *n, double ap[], Integer *info, const Charlen length_uplo)
The routine may be called by its LAPACK name dpptrf.

3
Description

f07gdf (dpptrf) forms the Cholesky factorization of a real symmetric positive definite matrix A either as A=UTU if uplo='U' or A=LLT if uplo='L', where U is an upper triangular matrix and L is lower triangular, using packed storage.

4
References

Demmel J W (1989) On floating-point errors in Cholesky LAPACK Working Note No. 14 University of Tennessee, Knoxville http://www.netlib.org/lapack/lawnspdf/lawn14.pdf
Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

5
Arguments

1:     uplo – Character(1)Input
On entry: specifies whether the upper or lower triangular part of A is stored and how A is to be factorized.
uplo='U'
The upper triangular part of A is stored and A is factorized as UTU, where U is upper triangular.
uplo='L'
The lower triangular part of A is stored and A is factorized as LLT, 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 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.
On exit: if info=0, the factor U or L from the Cholesky factorization A=UTU or A=LLT, in the same storage format as A.
4:     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
The leading minor of order value is not positive definite and the factorization could not be completed. Hence A itself is not positive definite. This may indicate an error in forming the matrix A. To factorize a symmetric matrix which is not positive definite, call f07pdf (dsptrf) instead.

7
Accuracy

If uplo='U', the computed factor U is the exact factor of a perturbed matrix A+E, where
EcnεUTU ,  
cn is a modest linear function of n, and ε is the machine precision.
If uplo='L', a similar statement holds for the computed factor L. It follows that eijcnεaiiajj.

8
Parallelism and Performance

f07gdf (dpptrf) 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 13n3.
A call to f07gdf (dpptrf) may be followed by calls to the routines:
The complex analogue of this routine is f07grf (zpptrf).

10
Example

This example computes the Cholesky factorization of the matrix A, where
A= 4.16 -3.12 0.56 -0.10 -3.12 5.03 -0.83 1.18 0.56 -0.83 0.76 0.34 -0.10 1.18 0.34 1.18 ,  
using packed storage.

10.1
Program Text

Program Text (f07gdfe.f90)

10.2
Program Data

Program Data (f07gdfe.d)

10.3
Program Results

Program Results (f07gdfe.r)

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