lasdt(3)

📦
version 3.12.1 · 9 versions
, in arch rolling

💅 lasdt(3) — bestie, it's the D&C tree builder ✨

okay so first things first — the manual name is lasdt, and the NAME section literally just says: lasdt - lasdt: D&C step: tree. that's it. that's the whole name section. iconic minimalism tbh 🎀

✨ SYNOPSIS ✨

🌸 Functions

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

🦋 DESCRIPTION 🦋

Detailed Description ✨

💜 Function Documentation

👑 subroutine dlasdt

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

okay so DLASDT creates a tree of subproblems for bidiagonal divide and conquer. Used by sbdsdc. that's the whole vibe, no cap 🫶

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. so like, how many diagonal girlies we're working with 💅
  • LVL — LVL is INTEGER. On exit, the number of levels on the computation tree. the tree's height, basically 🌈
  • ND — ND is INTEGER. On exit, the number of nodes on the tree. how many lil node besties live in there ⭐
  • INODE — INODE is INTEGER array, dimension ( N ). On exit, centers of subproblems. the main character of each subproblem tbh 👑
  • NDIML — NDIML is INTEGER array, dimension ( N ). On exit, row dimensions of left children. left-side babies' row dims ✨
  • NDIMR — NDIMR is INTEGER array, dimension ( N ). On exit, row dimensions of right children. right-side babies' row dims ✨
  • MSUB — MSUB is INTEGER. On entry, the maximum row dimension each subproblem at the bottom of the tree can be of. the floor, the cutoff, the "stop splitting here" limit 🛑

🌸 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. 📍

💖 subroutine slasdt

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

and SLASDT creates a tree of subproblems for bidiagonal divide and conquer. Used by sbdsdc. same energy, different letter bestie 💀

Purpose:

!>
!> SLASDT 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 slasdt.f. 📍

🌟 Author

Generated automatically by Doxygen for LAPACK from the source code. not a human wrote this one, it's a bot doing its lil thing 🤖✨

ok that's the whole page bestie, you ate that 🍽️💅

sign-off szn: this is LAPACK, Version 3.12.0, dated right there in the footer — mwah, love that for us 💖🦋🌸

📦 where this page comes from