Developer Reference for Intel® oneAPI Math Kernel Library for C
?lasdt
Creates a tree of subproblems for bidiagonal divide and conquer. Used by ?bdsdc .
Syntax
call slasdt ( n , lvl , nd , inode , ndiml , ndimr , msub )
call dlasdt ( n , lvl , nd , inode , ndiml , ndimr , msub )
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 );
Include Files
mkl.h
Description
slasdt dlasdt
The routine creates a tree of subproblems for bidiagonal divide and conquer.
Input Parameters
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.
Output Parameters
lvl
On exit, the number of levels on the computation tree.
nd
On exit, the number of nodes on the tree.
- inode
-
INTEGER . Array, DIMENSION ( n ). On exit, centers of subproblems.
- ndiml
-
INTEGER . Array, DIMENSION ( n ). On exit, row dimensions of left children.
- ndimr
-
INTEGER . Array, DIMENSION ( n ). On exit, row dimensions of right children.