Estimating the quality of computational algorithms. II

DOI10.1016/0045-7825(76)90009-8zbMath0374.65018OpenAlexW2916629541MaRDI QIDQ1244973

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)90009-8

Mathematics Subject Classification ID

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

Related Items

Estimates of Alexandrov's \(n\)-width of a compact set for some infinitely differentiable periodic functions, Superconvergent algorithms for the numerical solution of the Laplace equation in smooth axisymmetric domains, Unnamed Item, The problem of constructing unsaturated quadrature formulae on an interval, Stability and computation time in the variational-difference, s-numbers in information-based complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item