# naginterfaces.library.linsys.complex_​posdef_​packed_​solve¶

naginterfaces.library.linsys.complex_posdef_packed_solve(uplo, ap, b)[source]

complex_posdef_packed_solve computes the solution to a complex system of linear equations , where is an Hermitian positive definite matrix, stored in packed format, and and are matrices. An estimate of the condition number of and an error bound for the computed solution are also returned.

For full information please refer to the NAG Library document for f04ce

https://www.nag.com/numeric/nl/nagdoc_28.7/flhtml/f04/f04cef.html

Parameters
uplostr, length 1

If , the upper triangle of the matrix is stored.

If , the lower triangle of the matrix is stored.

apcomplex, array-like, shape

The Hermitian matrix . The upper or lower triangular part of the Hermitian matrix is packed column-wise in a linear array. The th column of is stored in the array as follows:

bcomplex, array-like, shape

The matrix of right-hand sides .

Returns
apcomplex, ndarray, shape

If the function exits successfully or = + 1, the factor or from the Cholesky factorization or , in the same storage format as .

bcomplex, ndarray, shape

If the function exits successfully or = + 1, the solution matrix .

rcondfloat

If the function exits successfully or = + 1, an estimate of the reciprocal of the condition number of the matrix , computed as .

errbndfloat

If the function exits successfully or = + 1, an estimate of the forward error bound for a computed solution , such that , where is a column of the computed solution returned in the array and is the corresponding column of the exact solution . If is less than machine precision, is returned as unity.

Raises
NagValueError
(errno )

On entry, .

Constraint: .

(errno )

On entry, .

Constraint: .

(errno )

On entry, or : .

(errno )

The principal minor of order of the matrix is not positive definite. The factorization has not been completed and the solution could not be computed.

Warns
NagAlgorithmicWarning
(errno )

A solution has been computed, but is less than machine precision so that the matrix is numerically singular.

Notes

The Cholesky factorization is used 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 .

References

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

Higham, N J, 2002, Accuracy and Stability of Numerical Algorithms, (2nd Edition), SIAM, Philadelphia