DLASDT(3)

NAME 💖

DLASDT(3) — hey bestie, this one lives in the Library Functions Manual, and the file is /home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/dlasdt.f. Slay.

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. Periodt.

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. iconic behavior 💅

Purpose 🦋

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

Parameters 💅

• N — INTEGER. On entry, it's the number of diagonal elements of the bidiagonal matrix.
• LVL — INTEGER. On exit, it's the number of levels on the computation tree.
• ND — INTEGER. On exit, it's the number of nodes on the tree.
• INODE — INTEGER array, dimension ( N ). On exit, these are the centers of subproblems.
• NDIML — INTEGER array, dimension ( N ). On exit, these are the row dimensions of left children.
• NDIMR — INTEGER array, dimension ( N ). On exit, these are the row dimensions of right children.
• MSUB — INTEGER. On entry, it's 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.

---

Okay bestie, that's the whole flex 💖 Footer sign-off: LAPACK Version 3.12.0, path /home/abui...RC/dlasdt.f(3) — date line: not present in this footer, so no extra date tea. Mwah 💋✨