Developer Reference for Intel® oneAPI Math Kernel Library for Fortran
?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.fi
Description
slasdt dlasdt
The routine creates a tree of subproblems for bidiagonal divide and conquer.
Input Parameters
n
INTEGER . On entry, the number of diagonal elements of the bidiagonal matrix.
msub
INTEGER . On entry, the maximum row dimension each subproblem at the bottom of the tree can be of.
Output Parameters
lvl
INTEGER . On exit, the number of levels on the computation tree.
nd
INTEGER . 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.