Click or drag to resize

DLASDTRun Method

Purpose ======= DLASDT creates a tree of subproblems for bidiagonal divide and conquer.

Namespace: DotNumerics.LinearAlgebra.CSLapack
Assembly: DWSIM.MathOps.DotNumerics (in DWSIM.MathOps.DotNumerics.dll) Version: 1.0.0.0 (1.0.0.0)
Syntax
public void Run(
	int N,
	ref int LVL,
	ref int ND,
	ref int[] INODE,
	int offset_inode,
	ref int[] NDIML,
	int offset_ndiml,
	ref int[] NDIMR,
	int offset_ndimr,
	int MSUB
)
Request Example View Source

Parameters

N  Int32
(input) INTEGER On entry, the number of diagonal elements of the bidiagonal matrix.
LVL  Int32
(output) INTEGER On exit, the number of levels on the computation tree.
ND  Int32
(output) INTEGER On exit, the number of nodes on the tree.
INODE  Int32
(output) INTEGER array, dimension ( N ) On exit, centers of subproblems.
offset_inode  Int32
 
NDIML  Int32
(output) INTEGER array, dimension ( N ) On exit, row dimensions of left children.
offset_ndiml  Int32
 
NDIMR  Int32
(output) INTEGER array, dimension ( N ) On exit, row dimensions of right children.
offset_ndimr  Int32
 
MSUB  Int32
(input) INTEGER. On entry, the maximum row dimension each subproblem at the bottom of the tree can be of.
See Also