hide long namesshow long names
hide short namesshow short names
Integer type:  int32  int64  nag_int  show int32  show int32  show int64  show int64  show nag_int  show nag_int

PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

NAG Toolbox: nag_lapack_zhptrf (f07pr)

 Contents

    1  Purpose
    2  Syntax
    7  Accuracy
    9  Example

Purpose

nag_lapack_zhptrf (f07pr) computes the Bunch–Kaufman factorization of a complex Hermitian indefinite matrix, using packed storage.

Syntax

[ap, ipiv, info] = f07pr(uplo, n, ap)
[ap, ipiv, info] = nag_lapack_zhptrf(uplo, n, ap)

Description

nag_lapack_zhptrf (f07pr) factorizes a complex Hermitian matrix A, using the Bunch–Kaufman diagonal pivoting method and packed storage. A is factorized as either A=PUDUHPT if uplo='U' or A=PLDLHPT if uplo='L', where P is a permutation matrix, U (or L) is a unit upper (or lower) triangular matrix and D is an Hermitian block diagonal matrix with 1 by 1 and 2 by 2 diagonal blocks; U (or L) has 2 by 2 unit diagonal blocks corresponding to the 2 by 2 blocks of D. Row and column interchanges are performed to ensure numerical stability while keeping the matrix Hermitian.
This method is suitable for Hermitian matrices which are not known to be positive definite. If A is in fact positive definite, no interchanges are performed and no 2 by 2 blocks occur in D.

References

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

Parameters

Compulsory Input Parameters

1:     uplo – string (length ≥ 1)
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 PUDUHPT, where U is upper triangular.
uplo='L'
The lower triangular part of A is stored and A is factorized as PLDLHPT, where L is lower triangular.
Constraint: uplo='U' or 'L'.
2:     n int64int32nag_int scalar
n, the order of the matrix A.
Constraint: n0.
3:     ap: – complex array
The dimension of the array ap must be at least max1,n×n+1/2
The n by n Hermitian 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.

Optional Input Parameters

None.

Output Parameters

1:     ap: – complex array
The dimension of the array ap will be max1,n×n+1/2
A stores details of the block diagonal matrix D and the multipliers used to obtain the factor U or L as specified by uplo.
2:     ipivn int64int32nag_int array
Details of the interchanges and the block structure of D. More precisely,
  • 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.
3:     info int64int32nag_int scalar
info=0 unless the function detects an error (see Error Indicators and Warnings).

Error Indicators and Warnings

Cases prefixed with W are classified as warnings and do not generate an error of type NAG:error_n. See nag_issue_warnings.

   info<0
If info=-i, argument i had an illegal value. An explanatory message is output, and execution of the program is terminated.
W  info>0
Element _ of the diagonal is exactly zero. The factorization has been completed, but the block diagonal matrix D is exactly singular, and division by zero will occur if it is used to solve a system of equations.

Accuracy

If uplo='U', the computed factors U and D are the exact factors of a perturbed matrix A+E, where
EcnεPUDUHPT ,  
cn is a modest linear function of n, and ε is the machine precision.
If uplo='L', a similar statement holds for the computed factors L and D.

Further Comments

The elements of D overwrite the corresponding elements of A; if D has 2 by 2 blocks, only the upper or lower triangle is stored, as specified by uplo.
The unit diagonal elements of U or L and the 2 by 2 unit diagonal blocks are not stored. The remaining elements of U and L are stored in the corresponding columns of the array ap, but additional row interchanges must be applied to recover U or L explicitly (this is seldom necessary). If ipivi=i, for i=1,2,,n (as is the case when A is positive definite), then U or L are stored explicitly in packed form (except for their unit diagonal elements which are equal to 1).
The total number of real floating-point operations is approximately 43n3.
A call to nag_lapack_zhptrf (f07pr) may be followed by calls to the functions:
The real analogue of this function is nag_lapack_dsptrf (f07pd).

Example

This example computes the Bunch–Kaufman factorization 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 ,  
using packed storage.
function f07pr_example


fprintf('f07pr example results\n\n');

% Hermitian indefinite matrix A (Lower triangular part stored in packed form)
uplo = 'L';
n = int64(4);
ap = [-1.36 + 0i;  1.58 - 0.9i;   2.21 + 0.21i;  3.91 - 1.5i;
                  -8.87 + 0i;    -1.84 + 0.03i; -1.78 - 1.18i;
                                 -4.63 + 0i;     0.11 - 0.11i;
                                                -1.84 + 0i];

% Factorize
[apf, ipiv, info] = f07pr( ...
                           uplo, n, ap);

[ifail] = x04dc( ...
                 uplo, 'Non-unit', n, apf, 'Details of factorization');

fprintf('\nPivot indices\n   ');
fprintf('%11d', ipiv);
fprintf('\n');


f07pr example results

 Details of factorization
             1          2          3          4
 1     -1.3600
        0.0000

 2      3.9100    -1.8400
       -1.5000     0.0000

 3      0.3100     0.5637    -5.4176
        0.0433     0.2850     0.0000

 4     -0.1518     0.3397     0.2997    -7.1028
        0.3743     0.0303     0.1578     0.0000

Pivot indices
            -4         -4          3          4

PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

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