Linear algorithms with finite deviation
The paper is devoted to the problem of computing the positive functional \(I\) on \(C[a,b ]\) which makes use of function values \((f(x_1),f(x_2),\dots,f(x_n))\) and the more global information of \(f\) belonging to a given set \(K \in C[a,b ]\). A strongly optimal algorithm which makes the fullest use of the input information is studied. It is shown that the studied algorithms in many cases are nonlinear in contradiction to optimal ones. A weakening of the notion of strong optimality leads to algorithms with finite deviation for which almost the same results are obtained. Some examples of linear algorithms with small deviation are given.
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 44907 (Why is no real title available?)
- scientific article; zbMATH DE number 1150000 (Why is no real title available?)
- Linearity of algorithms and a result of Ando
- Numerical Integration of Arbitrarily Spaced Data and Estimation of Errors
- On linearity of spline algorithms
- Optimal Integration for Functions of Bounded Variation
- Zur mechanischen Quadratur
This page was built for publication: Linear algorithms with finite deviation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265140)
