Basic Linear Algebra Subprograms for Fortran Usage

@article{Lawson1979BasicLA,
  title={Basic Linear Algebra Subprograms for Fortran Usage},
  author={Charles L. Lawson and Richard J. Hanson and David R. Kincaid and Fred T. Krogh},
  journal={ACM Transactions on Mathematical Software (TOMS)},
  year={1979},
  volume={5},
  pages={308 - 323},
  url={https://api.semanticscholar.org/CorpusID:6585321}
}
A package of 38 low level subprograms for many of the basic operations of numerical linear algebra is presented, intended to be used with FORTRAN.
View on ACM
dl.acm.org
1,938 Citations
Highly Influential Citations
196
Background Citations
411
Methods Citations
577
Results Citations
3

Tables from this paper

1,938 Citations

Benchmark of the Extended Basic Linear Algebra Subprograms on the NEC SX-2 Supercomputer

The EBLAS are a set of subprograms that represent basic matrix-vector operations and were written to take advantage of the architecture of today's supercomputers.

Engineering and Scientific Subroutine Library for the IBM 3090 Vector Facility

The contents of ESSL are described and some of the techniques that were used to develop high-performance vector subroutines are presented, as well as key design considerations such as accuracy, ease of use, and error handling.

Linear algebra software on IBM and CRAY computers

Issues relating to extension of the Basic Linear Algebra Subprograms

The authors' views are Lased on their implementation of theBLAS in highly-efficient assembly language for the Cray-1 and Cray X-MP, and use of the BLAS and some of the proposed extensions in a variety of application areas.

Local Basic Linear Algebra Subroutines (LBLAS) for the CM-5/5E

The implementation considerations and performance of the local BLAS, or BLAS local to each node of the system, are presented, irrespective of the data layout in node mem ory.

Algorithm 692: Model implementation and test package for the Sparse Basic Linear Algebra Subprograms

A model implementation and test software are desribed for the Sparse Basic Linear Algebra Subprograms, which provides a portable set of FORTRAN 77 Sparse BLAS for the use on machines where specially tuned implementations do not exist or are not required.

Preface to the special issue on the basic linear algebra subprograms (BLAS)

In this issue of the ACM Transactions on Mathematical Software, a set of research contributions are collected together which provide some of the technical background behind the development of the new BLAS standard.

The Performance of Linear Algebra Subprograms on the Siemens S Series

An outstanding feature of the Siemens S series vector processors is the ability to dynamically reconfigurate the vector registers, which allows an optimal adaptation of a given application program to the VP hardware.

Algorithm 663: Translation of Algorithm 539: basic linear algebra subprograms for FORTRAN usage in FORTRAN 200 for the Cyber 205

This paper describes the vectorization of the BLAS, a set of basic linear algebra subprograms for FORTRAN usage, and admits negative increment values; that is, vectors can also be treated in reverse order.

A proposal for a set of level 3 basic linear algebra subprograms

The Level 3 BLAS are targeted at matrix-matrix operations with the aim of providing more efficient, but portable, implementations of algorithms on high-performance computers, especially those with hierarchical memory and parallel processing capability.
...

17 References

A proposal for standard linear algebra subprograms

A set of FORTRAN callable subprograms are proposed which will be useful in the development of efficient portable ANSI FORTRAN subprograms and applications programs in the area of linear algebra.

A Portable Fortran Program to Find the Euclidean Norm of a Vector

This paper describes a successful version of a subprogram to find the Euclidean norm of an n-vector which is accurate and efficient, and should avoid all overflows and underflows, and is also portable.

ANSI Subcommittee X3J3: Clarification of Fortran Standards-Second Report

Recent technical reports

Certain questions concerning the arithmetic complexity of unlvarlate polynomial evaluation are considered. Given an operator which maps polynomials to sets of polynomials, the objective is toโ€ฆ

A Note on Modifications to the Givens Plane Rotation

It has recently been shown how to perform plane rotations without square roots and with a saving in multiplications. (See for example, Gentleman, 1973). The purpose of this note is to present theโ€ฆ

The economical storage of plane rotations

SummaryPlane rotations, which have long been used in matrix computations to annihilate selected elements of a matrix, have the drawback that their definition requires two numbers. In this note it isโ€ฆ

Least Squares Computations by Givens Transformations Without Square Roots