Estimating the quality of computational algorithms. I

DOI10.1016/0045-7825(76)90005-0zbMath0364.65030OpenAlexW1979138517MaRDI QIDQ1241012

K. I. Babenko

Publication date: 1976

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7825(76)90005-0

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Algorithms in computer science (68W99)

Related Items

A survey of information-based complexity ⋮ Estimates of Alexandrov's \(n \)-width of the compact set of \(C^{\infty} \)-smooth functions on a finite segment ⋮ Optimal coding of elements of a metric space ⋮ The problem of constructing unsaturated quadrature formulae on an interval ⋮ Information complexity of equations of the second kind with compact operators in Hilbert space ⋮ s-numbers in information-based complexity

Cites Work

• Über die beste Annäherung von Funktionen einer gegebenen Funktionenklasse
• DIAMETERS OF SETS IN FUNCTION SPACES AND THE THEORY OF BEST APPROXIMATIONS
• APPROXIMATE DIMENSION AND BASES IN NUCLEAR SPACES
• Various approaches to estimating the difficulty of approximate definition and computation of functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item