Some basic information on information-based complexity theory

DOI10.1090/S0273-0979-1992-00239-2zbMath0765.65042arXivmath/9201266MaRDI QIDQ3992023

Beresford N. Parlett

Publication date: 28 June 1992

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9201266

zbMATH Keywords

error analysisinformation-based complexityapproximate solutions to mathematical problemsoptimal solution of large eigenpair problemsoptimal solution of large linear systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Complexity and performance of numerical algorithms (65Y20)

Related Items (3)

Perspectives on information-based complexity ⋮ Estimation of model quality ⋮ On the complexity of self-validating numerical integration and approximation of functions with singularities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of information-based complexity
• The use of a refined error bound when updating eigenvalues of tridiagonals
• Information-based numerical practice
• Gaussian elimination is not optimal
• Fast multiplication of large numbers
• Über eine Verallgemeinerung einer Ungleichung von L.V. Kantorowitsch
• The Software Scene in the Extraction of Eigenvalues from Sparse Matrices
• On the Optimal Solution of Large Linear Systems
• Recent developments in information-based complexity
• Estimating the Largest Eigenvalue of a Positive Definite Matrix
• On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
• On Estimating the Largest Eigenvalue with the Lanczos Algorithm
• How to Make the Lanczos Algorithm Converge Slowly
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
• Estimates for Some Computational Techniques in Linear Algebra
• On the number of multiplications necessary to compute certain functions

This page was built for publication: Some basic information on information-based complexity theory