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
- (global)The number of rows in the distributed matrix sub(A).(.m≥0)
- (global) The number of columns in the distributed matrix sub(A).(.nb_a-mod(ja-1,nb_a)≥n≥0)
- (local).Pointer into the local memory to an array of size.*lld_aLOC(cja+n-1)On entry, this array contains the local pieces of them-by-ndistributed matrix sub(A).
- (global) The row and column indices in the global matrixAindicating the first row and the first column of the matrix sub(A), respectively.
- (global and local) array of sizedlen_. The array descriptor for the distributed matrixA.
- (local)Array of size(. This array contains the pivoting information.LOCr(m_a) +mb_a)The global row that local rowipiv[-i]>(was swapped withi+1),. This array is tied to the distributed matrixi= 0, 1, ... ,LOCr(m_a) +mb_a- 1A.
- (local).If: successful exit.info= 0Ifinfo< 0:
If: Ifinfo>0, the matrix elementinfo=kU(,ia+k-1is exactly zero. The factorization has been completed, but the factorja+k-1)Uis exactly singular, and division by zero will occur if it is used to solve a system of equations.
- if thei-th argument is an array and thej-th entry, indexedhad an illegal value, thenj-1,,info= -(i*100+j)
- if thei-th argument is a scalar and had an illegal value, then.info=- i