Approximation by simple partial fractions: universal sets of poles
From MaRDI portal
Publication:2113389
Recommendations
- Approximation by simple partial fractions with constraints on the poles. II
- Approximation by simple partial fractions in unbounded domains
- Approximation properties of the most simple fractions
- Approximation by simple partial fractions with constraints on the poles
- A criterion for the best uniform approximation by simple partial fractions in terms of alternance. II
Cites work
- Approximation by polynomials with restricted zeros
- Approximation by simple fractions
- Approximation by simple partial fractions in unbounded domains
- Approximation by simple partial fractions with constraints on the poles
- Approximation by simple partial fractions with constraints on the poles. II
- Asymptotically neutral distributions of electrons and polynomial approximation
- Extremal and approximative properties of simple partial fractions
Cited in
(6)- Approximation by simple partial fractions in unbounded domains
- Density of quantized approximations
- Approximation by simple partial fractions with constraints on the poles. II
- A Mergelyan-Vitushkin approximation theorem for rational modules
- S. R. Nasyrov's problem of approximation by simple partial fractions on an interval
- Approximation by simple partial fractions with constraints on the poles
This page was built for publication: Approximation by simple partial fractions: universal sets of poles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113389)
