Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1]
DOI10.1145/355841.355848zbMATH Open0412.65023OpenAlexW2084231858WikidataQ130963222 ScholiaQ130963222MaRDI QIDQ4199446FDOQ4199446
Authors: C. L. Lawson, David R. Kincaid, Fred T. Krogh, Richard J. Hanson
Publication date: 1979
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355841.355848
dot productvector normFortranGivens transformationvector scalingsubprogramsbasic operations of numerical linear algebra
Numerical linear algebra (65F99) Software, source code, etc. for problems pertaining to numerical analysis (65-04) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Cited In (5)
- Exploiting separability in large-scale linear support vector machine training
- Parallel algorithms for solving large linear systems
- Self-scaling fast rotations for stiff and equality-constrained linear least squares problems
- Algorithm 539
- High-performance sampling of generic determinantal point processes
This page was built for publication: Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1]
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4199446)