Thumbnail
Access Restriction
Subscribed

Author Fike, C. T.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1959
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract It has been suggested by Householder [1] and by Householder and Bauer [2] that orthogonal similarity transformations of matrices are particularly stable with respect to the practical computation of proper values. It is the purpose of this note to examine this question and to demonstrate in terms of a “condition number” to be defined below a sense in which this conjecture is true.Broadly speaking, any problem may be termed “ill-conditioned” for which the solution is acutely sensitive to slight variations in the parameters of the problem. Examples of ill-conditioning occur in many contexts. Computers are familiar with the phenomenon as it manifests itself, for example, in the study of matrix inversion. Since our purpose is to study the conditioning of matrices specifically for the proper value problem, it is convenient to have a nomenclature and notation which will avoid confusion with conditioning as it is used in other senses.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1959-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 6
Issue Number 3
Page Count 3
Starting Page 360
Ending Page 362


Open content in new tab

   Open content in new tab
Source: ACM Digital Library