SRC/slarmm.f(3)

📦
version 3.12.1 · 3 versions
, in arch rolling

🌸 NAME 🌸

SRC/slarmm.f — okay so this is the LAPACK Library Functions Manual page for SRC/slarmm.f(3), and it’s all about the SLARMM routine. Bestie, it’s short, it’s auxiliary, and it’s here to keep your linear updates from overflowing. 💖

✨ SYNOPSIS ✨

Functions/Subroutines

  • real function slarmm (anorm, bnorm, cnorm) — this is SLARMM, the main character of this page. 👑

💅 Function/Subroutine Documentation 💅

real function slarmm (real anorm, real bnorm, real cnorm)

This is SLARMM.

🎀 Purpose 🎀

SLARMM returns a factor s in (0, 1] such that the linear updates

   (s * C) - A * (s * B)  and  (s * C) - (s * A) * B

cannot overflow, where A, B, and C are matrices of conforming dimensions.

This is an auxiliary routine so there is no argument checking. No cap, that’s literally the deal. 🫶

🌸 Parameters 🌸

  • ANORM — ANORM is REAL. It’s the infinity norm of A. ANORM >= 0. Also, this page says: “The number of rows of the matrix A. M >= 0.”
  • BNORM — BNORM is REAL. It’s the infinity norm of B. BNORM >= 0.
  • CNORM — CNORM is REAL. It’s the infinity norm of C. CNORM >= 0.

References: C. C. Kjelgaard Mikkelsen and L. Karlsson, Blocked Algorithms for Robust Solution of Triangular Linear Systems. In: International Conference on Parallel Processing and Applied Mathematics, pages 68--78. Springer, 2017.

Definition at line 60 of file slarmm.f.

👑 Author 👑

Generated automatically by Doxygen for LAPACK from the source code.

🫶 That’s the whole page, bestie — brought to you by LAPACK Version 3.12.0, from SRC/slarmm.f(3). Slay and stay overflow-free. 💖✨

📦 where this page comes from