POTRF2: computes the Cholesky factorization of a Hermitian positive definite matrix A using the recursive algorithm. The factorization has the form A = U**H * U, if UPLO = 'U', or A = L * L**H, if UPLO = 'L', where U is an upper triangular matrix and L is lower triangular. This is the recursive version of the algorithm. It divides the matrix into four submatrices: [ A11 | A12 ] where A11 is n1 by n1 and A22 is n2 by n2 A = [ --—|--— ] with n1 = n/2 [ A21 | A22 ] n2 = n-n1 The subroutine calls itself to factor A11. Update and scale A21 or A12, update A22 then calls itself to factor A22.
More...
|
pure recursive subroutine | cpotrf2 (uplo, n, a, lda, info) |
|
| la_cpotrf2 |
|
pure recursive subroutine | dpotrf2 (uplo, n, a, lda, info) |
|
| la_dpotrf2 |
|
| la_qpotrf2 |
|
pure recursive subroutine | spotrf2 (uplo, n, a, lda, info) |
|
| la_spotrf2 |
|
| la_wpotrf2 |
|
pure recursive subroutine | zpotrf2 (uplo, n, a, lda, info) |
|
| la_zpotrf2 |
|
POTRF2: computes the Cholesky factorization of a Hermitian positive definite matrix A using the recursive algorithm. The factorization has the form A = U**H * U, if UPLO = 'U', or A = L * L**H, if UPLO = 'L', where U is an upper triangular matrix and L is lower triangular. This is the recursive version of the algorithm. It divides the matrix into four submatrices: [ A11 | A12 ] where A11 is n1 by n1 and A22 is n2 by n2 A = [ --—|--— ] with n1 = n/2 [ A21 | A22 ] n2 = n-n1 The subroutine calls itself to factor A11. Update and scale A21 or A12, update A22 then calls itself to factor A22.
◆ cpotrf2()
pure recursive subroutine la_lapack::potrf2::cpotrf2 |
( |
character, intent(in) |
uplo, |
|
|
integer(ilp), intent(in) |
n, |
|
|
complex(sp), dimension(lda,*), intent(inout) |
a, |
|
|
integer(ilp), intent(in) |
lda, |
|
|
integer(ilp), intent(out) |
info |
|
) |
| |
◆ dpotrf2()
pure recursive subroutine la_lapack::potrf2::dpotrf2 |
( |
character, intent(in) |
uplo, |
|
|
integer(ilp), intent(in) |
n, |
|
|
real(dp), dimension(lda,*), intent(inout) |
a, |
|
|
integer(ilp), intent(in) |
lda, |
|
|
integer(ilp), intent(out) |
info |
|
) |
| |
◆ la_cpotrf2()
la_lapack::potrf2::la_cpotrf2 |
◆ la_dpotrf2()
la_lapack::potrf2::la_dpotrf2 |
◆ la_qpotrf2()
la_lapack::potrf2::la_qpotrf2 |
◆ la_spotrf2()
la_lapack::potrf2::la_spotrf2 |
◆ la_wpotrf2()
la_lapack::potrf2::la_wpotrf2 |
◆ la_zpotrf2()
la_lapack::potrf2::la_zpotrf2 |
◆ spotrf2()
pure recursive subroutine la_lapack::potrf2::spotrf2 |
( |
character, intent(in) |
uplo, |
|
|
integer(ilp), intent(in) |
n, |
|
|
real(sp), dimension(lda,*), intent(inout) |
a, |
|
|
integer(ilp), intent(in) |
lda, |
|
|
integer(ilp), intent(out) |
info |
|
) |
| |
◆ zpotrf2()
pure recursive subroutine la_lapack::potrf2::zpotrf2 |
( |
character, intent(in) |
uplo, |
|
|
integer(ilp), intent(in) |
n, |
|
|
complex(dp), dimension(lda,*), intent(inout) |
a, |
|
|
integer(ilp), intent(in) |
lda, |
|
|
integer(ilp), intent(out) |
info |
|
) |
| |
The documentation for this interface was generated from the following file: