naginterfaces.library.lapacklin.zpftrs

naginterfaces.library.lapacklin.zpftrs(transr, uplo, n, ar, b)

zpftrs solves a complex Hermitian positive definite system of linear equations with multiple right-hand sides,

$$AX=B\text{,}$$

using the Cholesky factorization computed by zpftrf() stored in Rectangular Full Packed (RFP) format.

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

https://www.nag.com/numeric/nl/nagdoc_29.3/flhtml/f07/f07wsf.html

Parameters

transrstr, length 1

Specifies whether the normal RFP representation of $A$ or its conjugate transpose is stored.

$transr=\text{'N'}$

The matrix $A$ is stored in normal RFP format.

$transr=\text{'C'}$

The conjugate transpose of the RFP representation of the matrix $A$ is stored.

uplostr, length 1

Specifies how $A$ has been factorized.

$uplo=\text{'U'}$

$A=U^{H}U$, where $U$ is upper triangular.

$uplo=\text{'L'}$

$A=L{L}^H$, where $L$ is lower triangular.

nint

$n$, the order of the matrix $A$.

arcomplex, array-like, shape $(n\times (n+1)/2)$

The Cholesky factorization of $A$ stored in RFP format, as returned by zpftrf().

bcomplex, array-like, shape $(n,\text{nrhs})$

The $n\times r$ right-hand side matrix $B$.

Returns

bcomplex, ndarray, shape $(n,\text{nrhs})$

The $n\times r$ solution matrix $X$.

Raises

NagValueError

(errno $-1$)

On entry, error in parameter $transr$.

Constraint: $transr=\text{'N'}$ or $\text{'C'}$.

(errno $-2$)

On entry, error in parameter $uplo$.

Constraint: $uplo=\text{'U'}$ or $\text{'L'}$.

(errno $-3$)

On entry, error in parameter $n$.

Constraint: $n\ge 0$.

(errno $-4$)

On entry, error in parameter $\text{nrhs}$.

Constraint: $\text{nrhs}\ge 0$.

Notes

zpftrs is used to solve a complex Hermitian positive definite system of linear equations $AX=B$, the function must be preceded by a call to zpftrf() which computes the Cholesky factorization of $A$, stored in RFP format. The RFP storage format is described in the F07 Introduction. The solution $X$ is computed by forward and backward substitution.

If $uplo=\text{'U'}$, $A=U^{H}U$, where $U$ is upper triangular; the solution $X$ is computed by solving $U^{H}Y=B$ and then $UX=Y$.

If $uplo=\text{'L'}$, $A=L{L}^H$, where $L$ is lower triangular; the solution $X$ is computed by solving $LY=B$ and then $L^{H}X=Y$.

References

Gustavson, F G, Waśniewski, J, Dongarra, J J and Langou, J, 2010, Rectangular full packed format for Cholesky’s algorithm: factorization, solution, and inversion, ACM Trans. Math. Software (37, 2)