Algorithm 741: least-squares solution of a linear, bordered, block-diagonal system of equations

Authors:
Richard D. Ray
Affiliations:
Goddard Space Flight Center
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1995

Citing 6
Cited 0

Large sparse numerical optimization

Large sparse numerical optimization
An extended set of FORTRAN basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
A set of level 3 basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
LAPACK's user's guide

LAPACK's user's guide
Algorithm 653: Translation of algorithm 539: PC-BLAS, basic linear algebra subprograms for FORTRAN usage with the INTEL 8087, 80287 numeric data processor

ACM Transactions on Mathematical Software (TOMS)
Basic Linear Algebra Subprograms for Fortran Usage

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A package of Fortran subroutines is presented for the least-squares solution of a system of overdetermined, full-rank, linear equations with single-bordered block-diagonal structure. This structure allows for a natural sequential processing, one block diagonal at a time, so that large systems can be handled even on smaller machines. Orthogonal transformations in the form of Householder reflections are used to factor the system. The routines make heavy use of the Levels 1, 2, and 3 BLAS.