Computes the Cholesky factorization of a symmetric (Hermitian) positive-definite banded distributed matrix.
routinecomputes the Cholesky factorization of an
nreal symmetric or complex Hermitian positive-definite banded distributed matrix
The resulting factorization is not the same factorization as returned from LAPACK. Additional permutations are performed on the matrix for the sake of parallelism.
The factorization has the form:
Pis a permutation matrix and
Lare banded upper and lower triangular matrices, respectively.
Intel's compilers may or may not optimize to the same degree for non-Intel microprocessors for optimizations that are not unique to Intel microprocessors. These optimizations include SSE2, SSE3, and SSSE3 instruction sets and other optimizations. Intel does not guarantee the availability, functionality, or effectiveness of any optimization on microprocessors not manufactured by Intel. Microprocessor-dependent optimizations in this product are intended for use with Intel microprocessors. Certain optimizations not specific to Intel microarchitecture are reserved for Intel microprocessors. Please refer to the applicable product User and Reference Guides for more information regarding the specific instruction sets covered by this notice.
Notice revision #20110804
This notice covers the following instruction sets: SSE2, SSE4.2, AVX2, AVX-512.
- (global)Must beCHARACTER*1.'U'or'L'.If, upper triangle ofuplo='U'A(1:n,ja:ja+n-1) is stored;Ifuplo=