eCommons

 

Generalizing the LINPACK Condition Estimator

Other Titles

Abstract

Two generalizations of the Cline-Moler-Stewart-Wilkinson "LINPACK" condition estimator are described. One generalization combines the LINPACK notion of "look-ahead" with a new feature called "look-behind" that results in a more flexibly chosen right-hand side. The other generalization is a "divide-and-conquer" scheme that involves estimating the condition of certain principal submatrices whose dimension repeatedly doubles. Both generalizations require that maximization of simple objective functions. When seeking an L1 condition estimate, these functions are convex while inthe L2 case they are quadratic. All the algorithms considered appear to be at least as reliable as the LINPACK estimator and are equally efficient.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1981-06

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR81-462

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record