Parallel information-based complexity

DOI10.1016/0885-064X(91)90024-RMaRDI QIDQ1186504zbMATH OpenFDO

Authors Stefan Heinrich, Jörg-Detlef Kern

Publication date 28 June 1992

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0885-064X(91)90024-R

zbMATH Keywords

function approximationinformation-based complexitynumber of pointsnumber of processorsnumerical integrationparallel processingsolution of Fredholm integral equations

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Parallel information-based complexity of numerical integration on holder classH^s,α_M(Ω)^∗
• scientific article; zbMATH DE number 885767
• The parallel complexity of function approximation

Cites work

• A survey of information-based complexity
• Fast computation of divided differences and parallel Hermite interpolation
• scientific article; zbMATH DE number 3142276 (Why is no real title available?)
• scientific article; zbMATH DE number 3924019 (Why is no real title available?)
• scientific article; zbMATH DE number 3932991 (Why is no real title available?)
• scientific article; zbMATH DE number 3938445 (Why is no real title available?)
• scientific article; zbMATH DE number 3688714 (Why is no real title available?)
• scientific article; zbMATH DE number 3742483 (Why is no real title available?)
• scientific article; zbMATH DE number 44104 (Why is no real title available?)
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 3550114 (Why is no real title available?)
• scientific article; zbMATH DE number 3628385 (Why is no real title available?)
• scientific article; zbMATH DE number 3999284 (Why is no real title available?)
• scientific article; zbMATH DE number 3797175 (Why is no real title available?)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On sequential and parallel solution of initial value problems
• Properties of complexity measures for PRAMs and WRAMs
• The Computational Complexity of Continued Fractions
• The parallel complexity of function approximation
• Variational properties of averaged equations for periodic media

Cited in

(7)

• The parallel complexity of function approximation
• Lower bounds for the complexity of Monte Carlo function approximation
• scientific article; zbMATH DE number 3936481 (Why is no real title available?)
• A parallel information-based complexity approach to visual surface reconstruction
• Parallel information-based complexity of numerical integration on holder classH^s,α_M(Ω)^∗
• A note on level-2 condition numbers
• Full C(N)D-study of computational capabilities of Lagrange polynomials

This page was built for publication: Parallel information-based complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186504)