redhat man page for slasdt

Query: slasdt

OS: redhat

Section: l

Format: Original Unix Latex Style Formatted with HTML and a Horizontal Scroll Bar

SLASDT(l)								 )								 SLASDT(l)

NAME
SLASDT - create 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 LAPACK version 3.0 15 June 2000 SLASDT(l)
Related Man Pages
slasd0(l) - redhat
slasdt(3) - debian
slasd0.f(3) - debian
slasdt.f(3) - debian
dlasdt(3) - centos
Similar Topics in the Unix Linux Community
Make all words begin with capital letter?
About TODO
Package
Shopt -s histappend
Issue with events occuring in DST window