Best approximation rate of constants by simple partial fractions and Chebyshev alternance
From MaRDI portal
(Redirected from Publication:745607)
Recommendations
- Chebyshev's alternance in the approximation of constants by simple partial fractions
- 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
- Sufficient condition for the best uniform approximation by simple partial fractions
- Estimates of the best approximation of polynomials by simple partial fractions
Cites work
- A criterion for the best approximation of constants by simple partial fractions
- A criterion for the best uniform approximation by simple partial fractions in terms of alternance
- Approximation properties of the most simple fractions
- Chebyshev's alternance in the approximation of constants by simple partial fractions
- Criterion for the appearance of singular nodes under interpolation by simple partial fractions
- Examples related to best approximation by simple partial fractions
- Inequalities for the Logarithmic Derivatives of a Polynomial
- Optimization of methods of solving ordinary differential equations with strongly oscillating solutions
- Sufficient condition for the best uniform approximation by simple partial fractions
- Uniqueness of a simple partial fraction of best approximation
Cited in
(11)- Approximation by linear fractional transformations of simple partial fractions and their differences
- Extremal and approximative properties of simple partial fractions
- A criterion for the best approximation of constants by simple partial fractions
- Approximation to constant functions by electrostatic fields due to electrons and positrons
- Algorithm for constructing simple partial fractions of the best approximation of constants
- A criterion for the best uniform approximation by simple partial fractions in terms of alternance. II
- Approximation by special differences of simplest fractions
- A criterion for the best uniform approximation by simple partial fractions in terms of alternance
- Chebyshev's alternance in the approximation of constants by simple partial fractions
- Density of quantized approximations
- Estimates of the best approximation of polynomials by simple partial fractions
This page was built for publication: Best approximation rate of constants by simple partial fractions and Chebyshev alternance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q745607)
