slasdt(3S)

SLASDT - create a tree of subproblems for bidiagonal divide and conquer

As shipped in IRIX 6.5.22. Added in IRIX 6.5.15.

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( * )

IMPLEMENTATION
     These routines are part of the SCSL Scientific Library and can be loaded
     using either the -lscs or the -lscs_mp option.  The -lscs_mp option
     directs the linker to use the multi-processor version of the library.

     When linking to SCSL with -lscs or -lscs_mp, the default integer size is
     4 bytes (32 bits). Another version of SCSL is available in which integers
     are 8 bytes (64 bits).  This version allows the user access to larger
     memory sizes and helps when porting legacy Cray codes.  It can be loaded
     by using the -lscs_i8 option or the -lscs_i8_mp option. A program may use
     only one of the two versions; 4-byte integer and 8-byte integer library
     calls cannot be mixed.

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


SEE ALSO
     INTRO_LAPACK(3S), INTRO_SCSL(3S)

     This man page is available only online.