NAG FL Interface
f07qrf (zsptrf)
1
Purpose
f07qrf computes the Bunch–Kaufman factorization of a complex symmetric matrix, using packed storage.
2
Specification
Fortran Interface
Integer, Intent (In) |
:: |
n |
Integer, Intent (Out) |
:: |
ipiv(n), info |
Complex (Kind=nag_wp), Intent (Inout) |
:: |
ap(*) |
Character (1), Intent (In) |
:: |
uplo |
|
C++ Header Interface
#include <nag.h> extern "C" {
}
|
The routine may be called by the names f07qrf, nagf_lapacklin_zsptrf or its LAPACK name zsptrf.
3
Description
f07qrf factorizes a complex symmetric matrix , using the Bunch–Kaufman diagonal pivoting method and packed storage. is factorized as either if or if , where is a permutation matrix, (or ) is a unit upper (or lower) triangular matrix and is a symmetric block diagonal matrix with by and by diagonal blocks; (or ) has by unit diagonal blocks corresponding to the by blocks of . Row and column interchanges are performed to ensure numerical stability while preserving symmetry.
4
References
Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore
5
Arguments
-
1:
– Character(1)
Input
-
On entry: specifies whether the upper or lower triangular part of
is stored and how
is to be factorized.
- The upper triangular part of is stored and is factorized as , where is upper triangular.
- The lower triangular part of is stored and is factorized as , where is lower triangular.
Constraint:
or .
-
2:
– Integer
Input
-
On entry: , the order of the matrix .
Constraint:
.
-
3:
– Complex (Kind=nag_wp) array
Input/Output
-
Note: the dimension of the array
ap
must be at least
.
On entry: the
by
symmetric matrix
, packed by columns.
More precisely,
- if , the upper triangle of must be stored with element in for ;
- if , the lower triangle of must be stored with element in for .
On exit:
is overwritten by details of the block diagonal matrix
and the multipliers used to obtain the factor
or
as specified by
uplo.
-
4:
– Integer array
Output
-
On exit: details of the interchanges and the block structure of
. More precisely,
- if , is a by pivot block and the th row and column of were interchanged with the th row and column;
- if and , is a by pivot block and the th row and column of were interchanged with the th row and column;
- if and , is a by pivot block and the th row and column of were interchanged with the th row and column.
-
5:
– Integer
Output
On exit:
unless the routine detects an error (see
Section 6).
6
Error Indicators and Warnings
If , argument had an illegal value. An explanatory message is output, and execution of the program is terminated.
-
Element of the diagonal is exactly zero.
The factorization has been completed, but the block diagonal matrix
is exactly singular, and division by zero will occur if it is
used to solve a system of equations.
7
Accuracy
If
, the computed factors
and
are the exact factors of a perturbed matrix
, where
is a modest linear function of
, and
is the
machine precision.
If , a similar statement holds for the computed factors and .
8
Parallelism and Performance
f07qrf 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.
The elements of
overwrite the corresponding elements of
; if
has
by
blocks, only the upper or lower triangle is stored, as specified by
uplo.
The unit diagonal elements of or and the by unit diagonal blocks are not stored. The remaining elements of or overwrite elements in the corresponding columns of , but additional row interchanges must be applied to recover or explicitly (this is seldom necessary). If , for , then or are stored explicitly in packed form (except for their unit diagonal elements which are equal to ).
The total number of real floating-point operations is approximately .
A call to
f07qrf may be followed by calls to the routines:
- f07qsf to solve ;
- f07quf to estimate the condition number of ;
- f07qwf to compute the inverse of .
The real analogue of this routine is
f07pdf.
10
Example
This example computes the Bunch–Kaufman factorization of the matrix
, where
using packed storage.
10.1
Program Text
10.2
Program Data
10.3
Program Results