Intel® oneAPI Math Kernel Library Developer Reference - Fortran
Creates a tree of subproblems for bidiagonal divide and conquer. Used by ?bdsdc.
call slasdt( n, lvl, nd, inode, ndiml, ndimr, msub )
call dlasdt( n, lvl, nd, inode, ndiml, ndimr, msub )
The routine creates a tree of subproblems for bidiagonal divide and conquer.
INTEGER. On entry, the number of diagonal elements of the bidiagonal matrix.
INTEGER. On entry, the maximum row dimension each subproblem at the bottom of the tree can be of.
INTEGER. On exit, the number of levels on the computation tree.
INTEGER. On exit, the number of nodes on the tree.
INTEGER.
Array, DIMENSION (n). On exit, centers of subproblems.
INTEGER.
Array, DIMENSION (n). On exit, row dimensions of left children.
INTEGER.
Array, DIMENSION (n). On exit, row dimensions of right children.