A criterion for the best uniform approximation by simple partial fractions in terms of alternance. II
From MaRDI portal
Publication:5349256
Recommendations
- Sufficient condition for the best uniform approximation by simple partial fractions
- A criterion for the best uniform approximation by simple partial fractions in terms of alternance
- An analog of the Haar condition for simple partial fractions
- Chebyshev's alternance in the approximation of constants by simple partial fractions
- Criteria for the best approximation by simple partial fractions on semi-axis and axis
- Best approximation rate of constants by simple partial fractions and Chebyshev alternance
- Approximation by linear fractional transformations of simple partial fractions and their differences
- Uniqueness of a simple partial fraction of best approximation
- scientific article; zbMATH DE number 609992
- Algorithm for constructing simple partial fractions of the best approximation of constants
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
- An example of non-uniqueness of a simple partial fraction of the best uniform approximation
- Approximation by simple fractions
- Approximation by simple partial fractions and the Hilbert transform
- Approximation by simple partial fractions on the semi-axis
- Approximation by the simplest fractions on the real axis
- Approximation properties of the most simple fractions
- Best approximation rate of constants by simple partial fractions and Chebyshev alternance
- Chebyshev's alternance in the approximation of constants by simple partial fractions
- ESTIMATES OF THE DISTANCES FROM THE POLES OF LOGARITHMIC DERIVATIVES OF POLYNOMIALS TO LINES AND CIRCLES
- scientific article; zbMATH DE number 3257621 (Why is no real title available?)
Cited in
(26)- Optimal interval refinement near singularities
- On characterization of solution for a copositive fractionally rational approximation problem
- Approximation by linear fractional transformations of simple partial fractions and their differences
- Extremal and approximative properties of simple partial fractions
- Criteria for the best approximation by simple partial fractions on semi-axis and axis
- Approximation by simple fractions
- Approximation properties of the most simple fractions
- Approximation by sums of the form \(\sigma_k\lambda_k h(\lambda_kz)\) in the disk
- Approximation to constant functions by electrostatic fields due to electrons and positrons
- Approximation by simple partial fractions: universal sets of poles
- Extremal properties of logarithmic derivatives of polynomials
- Gorin's problem for individual simple partial fractions
- An example of non-uniqueness of a simple partial fraction of the best uniform approximation
- scientific article; zbMATH DE number 3881243 (Why is no real title available?)
- Approximation by the simplest fractions on the real axis
- Sufficient condition for the best uniform approximation by simple partial fractions
- Approximation by simple partial fractions and the Hilbert transform
- Approximation by simple partial fractions on the semi-axis
- Approximation by simple partial fractions in unbounded domains
- Greedy approximation by arbitrary sets
- Approximation by special differences of simplest fractions
- A criterion for the best uniform approximation by simple partial fractions in terms of alternance
- Density of simple partial fractions with poles on a circle in weighted spaces for a disk and a segment
- Estimates of the best approximation of polynomials by simple partial fractions
- Examples related to best approximation by simple partial fractions
- Best approximation rate of constants by simple partial fractions and Chebyshev alternance
This page was built for publication: A criterion for the best uniform approximation by simple partial fractions in terms of alternance. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5349256)
