Approximation by simple partial fractions: universal sets of poles

DOI10.1134/S0001434622010011zbMATH Open1486.30106OpenAlexW4213444055MaRDI QIDQ2113389FDOQ2113389

Petr A. Borodin

Publication date: 14 March 2022

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434622010011

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

zbMATH Keywords

approximation by simple partial fractions

Mathematics Subject Classification ID

Approximation in the complex plane (30E10)

Cites Work

• Approximation by simple partial fractions with constraints on the poles
• Approximation by simple partial fractions in unbounded domains
• Approximation by simple fractions
• Approximation by simple partial fractions with constraints on the poles. II
• Extremal and approximative properties of simple partial fractions
• Asymptotically neutral distributions of electrons and polynomial approximation
• Approximation by polynomials with restricted zeros

Cited In (2)

• A Mergelyan-Vitushkin approximation theorem for rational modules
• Density of quantized approximations

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)