The routine may be called by the names f07gnf, nagf_lapacklin_zppsv or its LAPACK name zppsv.
3Description
f07gnf uses the Cholesky decomposition to factor as if or if , where is an upper triangular matrix and is a lower triangular matrix. The factored form of is then used to solve the system of equations .
4References
Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999) LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia https://www.netlib.org/lapack/lug
Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore
5Arguments
1: – Character(1)Input
On entry: if , the upper triangle of is stored.
If , the lower triangle of is stored.
Constraint:
or .
2: – IntegerInput
On entry: , the number of linear equations, i.e., the order of the matrix .
Constraint:
.
3: – IntegerInput
On entry: , the number of right-hand sides, i.e., the number of columns of the matrix .
Constraint:
.
4: – Complex (Kind=nag_wp) arrayInput/Output
Note: the dimension of the array ap
must be at least
.
On entry: the Hermitian 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: if , the factor or from the Cholesky factorization or , in the same storage format as .
5: – Complex (Kind=nag_wp) arrayInput/Output
Note: the second dimension of the array b
must be at least
.
to solve the equations , where is a single right-hand side, b may be supplied as a one-dimensional array with length .
On entry: the right-hand side matrix .
On exit: if , the solution matrix .
6: – IntegerInput
On entry: the first dimension of the array b as declared in the (sub)program from which f07gnf is called.
Constraint:
.
7: – IntegerOutput
On exit: unless the routine detects an error (see Section 6).
6Error Indicators and Warnings
If , argument had an illegal value. An explanatory message is output, and execution of the program is terminated.
The leading minor of order of is not positive definite, so the factorization could not be completed, and the solution has not been computed.
7Accuracy
The computed solution for a single right-hand side, , satisfies an equation of the form
where
and is the machine precision. An approximate error bound for the computed solution is given by
where , the condition number of with respect to the solution of the linear equations. See Section 4.4 of Anderson et al. (1999) for further details.
f07gpf is a comprehensive LAPACK driver that returns forward and backward error bounds and an estimate of the condition number. Alternatively, f04cef solves and returns a forward error bound and condition estimate. f04cef calls f07gnf to solve the equations.
8Parallelism and Performance
Background information to multithreading can be found in the Multithreading documentation.
f07gnf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f07gnf 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.
9Further Comments
The total number of floating-point operations is approximately , where is the number of right-hand sides.