Visible to Intel only — GUID: GUID-932F90D7-8352-4242-A212-3E34BAA533A4
Visible to Intel only — GUID: GUID-932F90D7-8352-4242-A212-3E34BAA533A4
?lasdt
Creates a tree of subproblems for bidiagonal divide and conquer. Used by ?bdsdc.
void slasdt( lapack_int *n, lapack_int *lvl, lapack_int *nd, lapack_int *inode, lapack_int *ndiml, lapack_int *ndimr, lapack_int *msub );
void dlasdt( lapack_int *n, lapack_int *lvl, lapack_int *nd, lapack_int *inode, lapack_int *ndiml, lapack_int *ndimr, lapack_int *msub );
- mkl.h
The routine creates a tree of subproblems for bidiagonal divide and conquer.
- n
-
On entry, the number of diagonal elements of the bidiagonal matrix.
- msub
-
On entry, the maximum row dimension each subproblem at the bottom of the tree can be of.
- lvl
-
On exit, the number of levels on the computation tree.
- nd
-
On exit, the number of nodes on the tree.
- inode
-
Array, DIMENSION (n). On exit, centers of subproblems.
- ndiml
-
Array, DIMENSION (n). On exit, row dimensions of left children.
- ndimr
-
Array, DIMENSION (n). On exit, row dimensions of right children.