lasd_comp_grp(3)

πŸ’– NAME πŸ’–

okay so this is lasd_comp_grp(3), from the Library Functions Manual, and the name is literally lasd_comp_grp β€” bidiag D&C routines. That's the whole vibe: a group page for the bidiagonal divide-and-conquer gang. πŸ¦‹

✨ SYNOPSIS ✨

πŸŽ€ Topics πŸŽ€

bestie, this is the whole lineup β€” every routine in the group, no skips, no cuts:

  • lasd0 β€” D&C step: top level solver
  • lasdt β€” D&C step: tree
  • lasd1 β€” D&C step: merge subproblems
  • lasd2 β€” D&C step: deflation
  • lasd3 β€” D&C step: secular equation
  • lasd4 β€” D&C step: secular equation nonlinear solver
  • lasd5 β€” D&C step: secular equation, 2x2
  • lasdq β€” D&C step: leaf using bdsqr
  • — β€” singular values only or factored form β€” —
  • lasda β€” D&C step: top level solver
  • lasd6 β€” D&C step: merge subproblems
  • lasd7 β€” D&C step: deflation
  • lasd8 β€” D&C step: secular equation

🌸 Detailed Description 🌸

This section is literally just the heading in the original β€” no extra prose hiding in there. Not me staring at a blank section like it owes me money πŸ’€

πŸ‘‘ Author πŸ‘‘

The author line says, exactly: Generated automatically by Doxygen for LAPACK from the source code.


catch u later, bestie 🫢 β€” this page is from LAPACK, Version 3.12.0, and its manual name is lasd_comp_grp(3). The source footer has no date, so I'm not inventing one, periodt πŸ’œβœ¨