Some basic information on information-based complexity theory (Q3992023): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/9201266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-based numerical practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Conjugate Gradient Method for Linear and Nonlinear Operator Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5185900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4127256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimates for Some Computational Techniques in Linear Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Verallgemeinerung einer Ungleichung von L.V. Kantorowitsch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Largest Eigenvalue of a Positive Definite Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3868672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3965490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Software Scene in the Extraction of Eigenvalues from Sparse Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of a refined error bound when updating eigenvalues of tridiagonals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Estimating the Largest Eigenvalue with the Lanczos Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments in information-based complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Make the Lanczos Algorithm Converge Slowly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Optimal Solution of Large Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of multiplications necessary to compute certain functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of information-based complexity / rank
 
Normal rank

Latest revision as of 16:29, 15 May 2024

scientific article
Language Label Description Also known as
English
Some basic information on information-based complexity theory
scientific article

    Statements

    Some basic information on information-based complexity theory (English)
    0 references
    28 June 1992
    0 references
    optimal solution of large linear systems
    0 references
    optimal solution of large eigenpair problems
    0 references
    information-based complexity
    0 references
    approximate solutions to mathematical problems
    0 references
    error analysis
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references