Sufficient condition for the best uniform approximation by simple partial fractions
From MaRDI portal
Publication:354822
Recommendations
- A criterion for the best uniform approximation by simple partial fractions in terms of alternance
- Uniqueness of a simple partial fraction of best approximation
- A criterion for the best uniform approximation by simple partial fractions in terms of alternance. II
- A criterion for the best approximation of constants by simple partial fractions
- scientific article; zbMATH DE number 3881243
- Approximation by simple partial fractions in unbounded domains
- Criteria for the best approximation by simple partial fractions on semi-axis and axis
- Best uniform approximation to a class of rational functions
- An example of non-uniqueness of a simple partial fraction of the best uniform approximation
- Approximation by simple partial fractions with constraints on the poles
Cites work
- scientific article; zbMATH DE number 3755177 (Why is no real title available?)
- scientific article; zbMATH DE number 3202585 (Why is no real title available?)
- Chebyshev's alternance in the approximation of constants by simple partial fractions
- Introduction to algebra. Transl. from the Russian by Neal Koblitz
Cited in
(17)- A criterion for the best approximation of constants by simple partial fractions
- Best approximation rate of constants by simple partial fractions and Chebyshev alternance
- Approximation by the simplest fractions on the real axis
- An analog of the Haar condition for simple partial fractions
- Chebyshev's alternance in the approximation of constants by simple partial fractions
- Estimates of the best approximation of polynomials by simple partial fractions
- Examples related to best approximation by simple partial fractions
- A criterion for the best uniform approximation by simple partial fractions in terms of alternance
- Approximation by simple fractions
- Extremal and approximative properties of simple partial fractions
- A criterion for the best uniform approximation by simple partial fractions in terms of alternance. II
- Criteria for the best approximation by simple partial fractions on semi-axis and axis
- Algorithm for constructing simple partial fractions of the best approximation of constants
- Uniqueness of a simple partial fraction of best approximation
- Least deviation of logarithmic derivatives of algebraic polynomials from zero
- Approximation by linear fractional transformations of simple partial fractions and their differences
- Continuous almost best approximations in \(C[0,1]\)
This page was built for publication: Sufficient condition for the best uniform approximation by simple partial fractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354822)
