dlasdt man page on YellowDog

Man page or keyword search:  
man Server   18644 pages
apropos Keyword Search (all sections)
Output format
YellowDog logo
[printable version]

DLASDT(l)			       )			     DLASDT(l)

NAME
       DLASDT - create 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  bot‐
	      tom 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			     DLASDT(l)
[top]

List of man pages available for YellowDog

Copyright (c) for man pages and the logo by the respective OS vendor.

For those who want to learn more, the polarhome community provides shell access and support.

[legal] [privacy] [GNU] [policy] [cookies] [netiquette] [sponsors] [FAQ]
Tweet
Polarhome, production since 1999.
Member of Polarhome portal.
Based on Fawad Halim's script.
....................................................................
Vote for polarhome
Free Shell Accounts :: the biggest list on the net