dlasdt (l)  Linux Manuals
dlasdt: creates a tree of subproblems for bidiagonal divide and conquer
Command to display dlasdt
manual in Linux: $ man l dlasdt
NAME
DLASDT  creates a tree of subproblems for bidiagonal divide and conquer
SYNOPSIS
 SUBROUTINE DLASDT(

N, LVL, ND, INODE, NDIML, NDIMR, MSUB )

INTEGER
LVL, MSUB, N, ND

INTEGER
INODE( * ), NDIML( * ), NDIMR( * )
PURPOSE
DLASDT creates a tree of subproblems for bidiagonal divide and
conquer.
ARGUMENTS
 N (input) INTEGER

On entry, the number of diagonal elements of the
bidiagonal matrix.
 LVL (output) INTEGER

On exit, the number of levels on the computation tree.
 ND (output) INTEGER

On exit, the number of nodes on the tree.
 INODE (output) INTEGER array, dimension ( N )

On exit, centers of subproblems.
 NDIML (output) INTEGER array, dimension ( N )

On exit, row dimensions of left children.
 NDIMR (output) INTEGER array, dimension ( N )

On exit, row dimensions of right children.
 MSUB (input) INTEGER.

On entry, the maximum row dimension each subproblem at the
bottom of the tree can be of.
FURTHER DETAILS
Based on contributions by
Ming Gu and Huan Ren, Computer Science Division, University of
California at Berkeley, USA
Pages related to dlasdt
 dlasdt (3)
 dlasd0 (l)  a divide and conquer approach, DLASD0 computes the singular value decomposition (SVD) of a real upper bidiagonal NbyM matrix B with diagonal D and offdiagonal E, where M = N + SQRE
 dlasd1 (l)  computes the SVD of an upper bidiagonal NbyM matrix B,
 dlasd2 (l)  merges the two sets of singular values together into a single sorted set
 dlasd3 (l)  finds all the square roots of the roots of the secular equation, as defined by the values in D and Z
 dlasd4 (l)  subroutine compute the square root of the Ith updated eigenvalue of a positive symmetric rankone modification to a positive diagonal matrix whose entries are given as the squares of the corresponding entries in the array d, and that 0 <= D(i) < D(j) for i < j and that RHO > 0
 dlasd5 (l)  subroutine compute the square root of the Ith eigenvalue of a positive symmetric rankone modification of a 2by2 diagonal matrix diag( D ) * diag( D ) + RHO The diagonal entries in the array D are assumed to satisfy 0 <= D(i) < D(j) for i < j
 dlasd6 (l)  computes the SVD of an updated upper bidiagonal matrix B obtained by merging two smaller ones by appending a row
 dlasd7 (l)  merges the two sets of singular values together into a single sorted set
 dlasd8 (l)  finds the square roots of the roots of the secular equation,
 dlasd9 (l)  find the square roots of the roots of the secular equation,