## Optimal algorithms: proceedings of the international symposium held in Blagoevgrad, April 21-25, 1986 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

ANDREEV A The lumped mass FEM for sime eigenvalue problems | 15 |

BOULT T Some examples and applications of informationbased | 51 |

BUI T Some optimal results in sorting and merging | 65 |

Copyright | |

11 other sections not shown

### Common terms and phrases

analysis assume average case setting best approximation binary image binary tree Bojanov bounded Bramble-Hilbert lemma Chebyshev approximation coefficients comparison theorem compute consider cost defined denote domain e-complexity elliptic problems equation estimate example finite element method function evaluations Gabriel graph given gradient greedy algorithm incidence matrix inequality information operator information-based complexity integration interpolation interval iteration knots L-monosplines L-spline Lemma linear functionals M-optimal Math matrix merging algorithm Micchelli minimal monosplines nodes norm o-perfect Optimal Algorithms optimal recovery oracle algorithm partition perfect splines points polynomials probabilistic setting problem formulation processors projection algorithms proof proved quadrature formulas quadrature rule regions relative error satisfies sequence sequential algorithm Sofia solving space spline functions strict approximations subset subtrees superconvergence Suppose TeopeMa tion topological degree triangulation vector vertex vertices Voronoi diagram Wasilkowski worst case setting zero