A limit theorem of discretization with weights large on nodes
From MaRDI portal
Publication:1064487
DOI10.1016/0021-9045(85)90075-9zbMATH Open0575.41017OpenAlexW2022215802MaRDI QIDQ1064487FDOQ1064487
Authors: Charles B. Dunham, Changzhong Zhu
Publication date: 1985
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(85)90075-9
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniform approximation by rational functions having restricted denominators
- Chebyshev approximation by rationals with constrained denominators
- The limit of non-linear Chebyshev approximation on subsets
- The limit of approximation with weights large on nodes
- A survey of published programs for best approximation
- Discrete Chebyshev Approximation: Alternation and the Remez Algorithm
- Title not available (Why is that?)
- Dependence of Best Rational Chebyshev Approximations on the Domain
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)