Complexity theory of numerical linear algebra (Q1103328): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-0427(88)90402-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006459820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4275389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fundamental theorem of algebra and complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5561562 / rank
 
Normal rank

Latest revision as of 16:26, 18 June 2024

scientific article
Language Label Description Also known as
English
Complexity theory of numerical linear algebra
scientific article

    Statements

    Complexity theory of numerical linear algebra (English)
    0 references
    0 references
    1988
    0 references
    Statistical properties of random matrices and random systems of linear equations are investigated. Bounds are given for the average performance of the power method for calculating the eigenvectors of symmetric and Hermitian matrices and for the loss of precision when a system of linear equations is solved.
    0 references
    computational complexity
    0 references
    random matrices
    0 references
    random systems
    0 references
    power method
    0 references

    Identifiers