Solves a symmetric or Hermitian positive definite tridiagonal system of linear equations.
routinesolves a system of linear equations
nreal tridiagonal symmetric positive definite distributed matrix.
Cholesky factorization is used to factor a reordering of the matrix into
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)The order of matrixINTEGER.A(.n≥0)
- (global)The number of right-hand sides; the number of columns of the distributed submatrixINTEGER.B(.nrhs≥0)
- (local)REALforpsptsvDOUBLE PRECISONforpdptsvCOMPLEXforpcptsvDOUBLE COMPLEXforpzptsv.Pointer to local part of global vector storing the main diagonal of the matrix.
- (local)REALforpsptsvDOUBLE PRECISONforpdptsvCOMPLEXforpcptsvDOUBLE COMPLEXforpzptsv.Pointer to local part of global vector storing the upper diagonal of the matrix. Globally,is not referenced, anddu(n)dumust be aligned withd.
- (global)The index in the global matrixINTEGER.Aindicating the start of the matrix to be operated on (which may be either all ofAor a submatrix ofA).
- (global and local)array of sizeINTEGERdlen.If1dtype (dtype_a=501