On passive and active algorithms of reconstruction of functions
From MaRDI portal
Two interpolation algorithms for continuous functions on a finite interval, satisfying a Hölder condition, are studied. The first, so called ``passive, uses the arbitrary choice of the interpolating nodes. The second, ``active, chooses the nodes step by step, taking into account the previously considered values. The active algorithm guarantees the great precision for monotonic functions fromt the above class.
Recommendations
- An algorithm for reconstructing functions
- scientific article; zbMATH DE number 4026645
- On one algorithm for solving the problem of source function reconstruction
- On reconstructing functions from binary measurements
- On an algorithm for dynamic reconstruction of the input
- Optimal algorithms for the reconstruction of functions and the computation of integrals in a class of infinitely differentiable functions.
- scientific article; zbMATH DE number 3903260
- scientific article; zbMATH DE number 1225024
- Optimization of active algorithms for recovery of monotonic functions from Hölder's class
- Reconstruction of functions on the basis of sequences of linear functionals
Cited in
(4)- Sequential algorithms of optimal order global error for the uniform recovery of functions with monotone (r-1) derivatives
- Optimization of active algorithms for recovery of monotonic functions from Hölder's class
- scientific article; zbMATH DE number 3923972 (Why is no real title available?)
- An algorithm for reconstructing the intensity of a source function
This page was built for publication: On passive and active algorithms of reconstruction of functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1332052)
