slasdt (l) - Linux Manuals
slasdt: creates a tree of subproblems for bidiagonal divide and conquer
Command to display slasdt
manual in Linux: $ man l slasdt
NAME
SLASDT - creates a tree of subproblems for bidiagonal divide and conquer
SYNOPSIS
- SUBROUTINE SLASDT(
-
N, LVL, ND, INODE, NDIML, NDIMR, MSUB )
-
INTEGER
LVL, MSUB, N, ND
-
INTEGER
INODE( * ), NDIML( * ), NDIMR( * )
PURPOSE
SLASDT 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 slasdt
- slasdt (3)
- slasd0 (l) - a divide and conquer approach, SLASD0 computes the singular value decomposition (SVD) of a real upper bidiagonal N-by-M matrix B with diagonal D and offdiagonal E, where M = N + SQRE
- slasd1 (l) - computes the SVD of an upper bidiagonal N-by-M matrix B,
- slasd2 (l) - merges the two sets of singular values together into a single sorted set
- slasd3 (l) - finds all the square roots of the roots of the secular equation, as defined by the values in D and Z
- slasd4 (l) - subroutine compute the square root of the I-th updated eigenvalue of a positive symmetric rank-one 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
- slasd5 (l) - subroutine compute the square root of the I-th eigenvalue of a positive symmetric rank-one modification of a 2-by-2 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
- slasd6 (l) - computes the SVD of an updated upper bidiagonal matrix B obtained by merging two smaller ones by appending a row
- slasd7 (l) - merges the two sets of singular values together into a single sorted set
- slasd8 (l) - finds the square roots of the roots of the secular equation,
- slasd9 (l) - find the square roots of the roots of the secular equation,