Skip to main content
SpringerLink
Log in

A criterion for the solvability of the multiple interpolation problem by simple partial fractions

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

Abstract

Using reduction to polynomial interpolation, we study the multiple interpolation problem by simple partial fractions. Algebraic conditions are obtained for the solvability and the unique solvability of the problem. We introduce the notion of generalized multiple interpolation by simple partial fractions of order ≤ n. The incomplete interpolation problems (i.e., the interpolation problems with the total multiplicity of nodes strictly less than n) are considered; the unimprovable value of the total multiplicity of nodes is found for which the incomplete problem is surely solvable. We obtain an order n differential equation whose solution set coincides with the set of all simple partial fractions of order ≤ n.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Danchenko V. I. and Danchenko D. Ya., “Approximation by simplest fractions,” Math. Notes, 70,No. 4, 502–507 (2001).

    Article  MATH  MathSciNet  Google Scholar 

  2. Danchenko V. I. and Kondakova E. N., “Criterion for the appearance of singular nodes under interpolation by simple partial fractions,” Proc. Steklov Inst. Math., 278, 41–50 (2012).

    Article  MathSciNet  Google Scholar 

  3. Danchenko V. I. and Chunaev P. V., “Approximation by simple partial fractions and their generalizations,” J. Math. Sci., 176,No. 6, 844–859 (2011).

    Article  MATH  MathSciNet  Google Scholar 

  4. Komarov M. A., “Interpolation of rational functions by simple partial fractions,” J. Math. Sci., 181,No. 5, 600–612 (2012).

    Article  MATH  MathSciNet  Google Scholar 

  5. Kondakova E. N., “Interpolation by simple partial fractions,” Izv. Saratov Gos. Univ., Ser. Mat. Mekh. Inf., 9,No. 2, 30–37 (2009).

    Google Scholar 

  6. Kosukhin O. N., On Some Nontraditional Approximation Methods That Are Connected with Complex Polynomials [in Russian], Dis. Kand. Fiz.-Mat. Nauk, Moscow Univ., Moscow (2005).

    Google Scholar 

  7. Bakhvalov N. S., Numerical Methods: Analysis, Algebra, Ordinary Differential Equations, Mir, Moscow (1977).

    Google Scholar 

  8. Danchenko V. I. and Kondakova E. N., “Chebyshev’s alternance in the approximation of constants by simple partial fractions,” Proc. Steklov Inst. Math., 270, 80–90 (2010).

    Article  MATH  MathSciNet  Google Scholar 

  9. Komarov M. A., “An example of nonuniqueness of a simple partial fraction of the best uniform approximation,” Russian Math. (Iz. VUZ), 57,No. 9, 22–30 (2013).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Vladimir State University, Vladimir, Russia

    M. A. Komarov

Authors
  1. M. A. Komarov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. A. Komarov.

Additional information

Original Russian Text Copyright © 2014 Komarov M.A.

The author was financially supported by the Russian Foundation for Basic Research (Grant 12-01-31471mol a) and the Ministry for Education and Science (Grant 14.V37.21.0369).

__________

Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 55, No. 4, pp. 750–763, July–August, 2014.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Komarov, M.A. A criterion for the solvability of the multiple interpolation problem by simple partial fractions. Sib Math J 55, 611–621 (2014). https://doi.org/10.1134/S0037446614040041

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0037446614040041

Keywords

Search

Navigation