lasdt#
Functions
-
void slasdt(const INT n, INT *lvl, INT *nd, INT *restrict inode, INT *restrict ndiml, INT *restrict ndimr, const INT msub)#
SLASDT creates a tree of subproblems for bidiagonal divide and conquer.
Parameters
innThe number of diagonal elements of the bidiagonal matrix.
outlvlThe number of levels on the computation tree.
outndThe number of nodes on the tree.
outinodeInteger array, dimension (n). On exit, centers of subproblems.
outndimlInteger array, dimension (n). On exit, row dimensions of left children.
outndimrInteger array, dimension (n). On exit, row dimensions of right children.
inmsubThe maximum row dimension each subproblem at the bottom of the tree can be of.
void slasdt(
const INT n,
INT* lvl,
INT* nd,
INT* restrict inode,
INT* restrict ndiml,
INT* restrict ndimr,
const INT msub
);
Functions
-
void dlasdt(const INT n, INT *lvl, INT *nd, INT *restrict inode, INT *restrict ndiml, INT *restrict ndimr, const INT msub)#
DLASDT creates a tree of subproblems for bidiagonal divide and conquer.
Parameters
innThe number of diagonal elements of the bidiagonal matrix.
outlvlThe number of levels on the computation tree.
outndThe number of nodes on the tree.
outinodeInteger array, dimension (n). On exit, centers of subproblems.
outndimlInteger array, dimension (n). On exit, row dimensions of left children.
outndimrInteger array, dimension (n). On exit, row dimensions of right children.
inmsubThe maximum row dimension each subproblem at the bottom of the tree can be of.
void dlasdt(
const INT n,
INT* lvl,
INT* nd,
INT* restrict inode,
INT* restrict ndiml,
INT* restrict ndimr,
const INT msub
);