Developer Reference

Contents

?lasdt

Creates a tree of subproblems for bidiagonal divide and conquer. Used by
?bdsdc
.

Syntax

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
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
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.

Product and Performance Information

1

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