1. Manuals
  2. Tumbleweed
  3. lapack-man
  4. dlasdt.f(3)

Scroll to navigation

/home/abuild/rpmbuild/BUILD/lapack-3.12.0/SRC/dlasdt.f(3) Library Functions Manual /home/abuild/rpmbuild/BUILD/lapack-3.12.0/SRC/dlasdt.f(3)

NAME

/home/abuild/rpmbuild/BUILD/lapack-3.12.0/SRC/dlasdt.f

SYNOPSIS

Functions/Subroutines


subroutine DLASDT (n, lvl, nd, inode, ndiml, ndimr, msub)
DLASDT creates a tree of subproblems for bidiagonal divide and conquer. Used by sbdsdc.

Function/Subroutine Documentation

subroutine DLASDT (integer n, integer lvl, integer nd, integer, dimension( * ) inode, integer, dimension( * ) ndiml, integer, dimension( * ) ndimr, integer msub)

DLASDT creates a tree of subproblems for bidiagonal divide and conquer. Used by sbdsdc.

Purpose:

!>
!> DLASDT creates a tree of subproblems for bidiagonal divide and
!> conquer.
!>

Parameters

N 

!>          N is INTEGER
!>          On entry, the number of diagonal elements of the
!>          bidiagonal matrix.
!>

LVL

!>          LVL is INTEGER
!>          On exit, the number of levels on the computation tree.
!>

ND

!>          ND is INTEGER
!>          On exit, the number of nodes on the tree.
!>

INODE

!>          INODE is INTEGER array, dimension ( N )
!>          On exit, centers of subproblems.
!>

NDIML

!>          NDIML is INTEGER array, dimension ( N )
!>          On exit, row dimensions of left children.
!>

NDIMR

!>          NDIMR is INTEGER array, dimension ( N )
!>          On exit, row dimensions of right children.
!>

MSUB

!>          MSUB is INTEGER
!>          On entry, the maximum row dimension each subproblem at the
!>          bottom of the tree can be of.
!>

Author

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

Contributors:

Ming Gu and Huan Ren, Computer Science Division, University of California at Berkeley, USA

Definition at line 104 of file dlasdt.f.

Author

Generated automatically by Doxygen for LAPACK from the source code.

Version 3.12.0 LAPACK