NAG Library Routine Document
f08utf (zpbstf) computes a split Cholesky factorization of a complex Hermitian positive definite band matrix.
|Integer, Intent (In)||:: ||n, kb, ldbb|
|Integer, Intent (Out)||:: ||info|
|Complex (Kind=nag_wp), Intent (Inout)||:: ||bb(ldbb,*)|
|Character (1), Intent (In)||:: ||uplo|C Header Interface
f08utf_ (const char *uplo, const Integer *n, const Integer *kb, Complex bb, const Integer *ldbb, Integer *info, const Charlen length_uplo)|
The routine may be called by its
computes a split Cholesky factorization of a complex Hermitian positive definite band matrix
. It is designed to be used in conjunction with f08usf (zhbgst)
The factorization has the form
is a band matrix of the same bandwidth as
and the following structure:
is upper triangular in the first
rows, and transposed — hence, lower triangular — in the remaining rows. For example, if
- 1: – Character(1)Input
: indicates whether the upper or lower triangular part of
- The upper triangular part of is stored.
- The lower triangular part of is stored.
- 2: – IntegerInput
On entry: , the order of the matrix .
- 3: – IntegerInput
, the number of superdiagonals,
, of the matrix
If , the number of subdiagonals, , of the matrix .
- 4: – Complex (Kind=nag_wp) arrayInput/Output
the second dimension of the array bb
must be at least
Hermitian positive definite band matrix
The matrix is stored in rows
, more precisely,
- if , the elements of the upper triangle of within the band must be stored with element in ;
- if , the elements of the lower triangle of within the band must be stored with element in
On exit: is overwritten by the elements of its split Cholesky factor .
- 5: – IntegerInput
: the first dimension of the array bb
as declared in the (sub)program from which f08utf (zpbstf)
- 6: – IntegerOutput
unless the routine detects an error (see Section 6
Error Indicators and Warnings
If , argument had an illegal value. An explanatory message is output, and execution of the program is terminated.
If , the factorization could not be completed, because the updated element would be the square root of a negative number. Hence is not positive definite. This may indicate an error in forming the matrix .
The computed factor
is the exact factor of a perturbed matrix
is a modest linear function of
is the machine precision
. It follows that
Parallelism and Performance
f08utf (zpbstf) 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 total number of floating-point operations is approximately , assuming .
A call to f08utf (zpbstf)
may be followed by a call to f08usf (zhbgst)
to solve the generalized eigenproblem
are banded and
is positive definite.
The real analogue of this routine is f08uff (dpbstf)
See Section 10
in f08usf (zhbgst)