1978•Defense Technical Information Center (DTIC)Requires access

FORTRAN Subroutines to Solve the Linear Least-Squares Problem and Compute the Complete Orthogonal Factorization.

Wright,Margaret H, Glassman,Steven C

Abstract

This report describes the computational procedures involved in: solution of linear least-squares problems (including systems of non-singular, over- and under-determined linear equations); formation of the complete orthogonal factorization of a general real matrix. Some aspects of implementation and the estimation of rank are discussed. Full documentation (including source code) is given for a modular set of Fortran subroutines to solve these problems and several related problems. (Author)

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Subroutine, Fortran, Rank (graph theory), Computer science, Factorization, Set (abstract data type), Algebra over a field, Least-squares function approximation