
Computes the Cholesky factorization , or . (Specification)
Pure function interface for computing the Cholesky triangular factors.
This interface provides methods for computing the lower- or upper- triangular matrix from the
Cholesky factorization of a real symmetric or complex Hermitian matrix.
Supported data types include real and complex.
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| complex(kind=sp), | intent(in) | :: | a(:,:) |
Input matrix a[m,n] |
||
| logical(kind=lk), | intent(in), | optional | :: | lower |
[optional] is the lower or upper triangular factor required? Default = lower |
|
| logical(kind=lk), | intent(in), | optional | :: | other_zeroed |
[optional] should the unused half of the return matrix be zeroed out? Default: yes |
Output matrix with Cholesky factors c[n,n]
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| real(kind=dp), | intent(in) | :: | a(:,:) |
Input matrix a[m,n] |
||
| logical(kind=lk), | intent(in), | optional | :: | lower |
[optional] is the lower or upper triangular factor required? Default = lower |
|
| logical(kind=lk), | intent(in), | optional | :: | other_zeroed |
[optional] should the unused half of the return matrix be zeroed out? Default: yes |
Output matrix with Cholesky factors c[n,n]
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| real(kind=sp), | intent(in) | :: | a(:,:) |
Input matrix a[m,n] |
||
| logical(kind=lk), | intent(in), | optional | :: | lower |
[optional] is the lower or upper triangular factor required? Default = lower |
|
| logical(kind=lk), | intent(in), | optional | :: | other_zeroed |
[optional] should the unused half of the return matrix be zeroed out? Default: yes |
Output matrix with Cholesky factors c[n,n]
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| complex(kind=dp), | intent(in) | :: | a(:,:) |
Input matrix a[m,n] |
||
| logical(kind=lk), | intent(in), | optional | :: | lower |
[optional] is the lower or upper triangular factor required? Default = lower |
|
| logical(kind=lk), | intent(in), | optional | :: | other_zeroed |
[optional] should the unused half of the return matrix be zeroed out? Default: yes |
Output matrix with Cholesky factors c[n,n]