A limit theorem of discretization with weights large on nodes
From MaRDI portal
(Redirected from Publication:1064487)
Consider uniform approximation on compact metric spaces by approximating functions (F,P) satisfying Young's condition. By combining discretization and weighting on nodes, one can in the limit approximate on infinite sets under Lagrange-type interpolatory constraints. Comparable results for linear approximation were given by the first author in Int. J. Comput. Math. 17, 317-323 (1985). Further examples of approximating functions satisfying Young's condition are under development.
Recommendations
Cites work
- A survey of published programs for best approximation
- Chebyshev approximation by rationals with constrained denominators
- Dependence of Best Rational Chebyshev Approximations on the Domain
- Discrete Chebyshev Approximation: Alternation and the Remez Algorithm
- scientific article; zbMATH DE number 3753935 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- scientific article; zbMATH DE number 3186062 (Why is no real title available?)
- The limit of approximation with weights large on nodes
- The limit of non-linear Chebyshev approximation on subsets
- Uniform approximation by rational functions having restricted denominators
Cited in
(4)
This page was built for publication: A limit theorem of discretization with weights large on nodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1064487)