Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The length of the alternation set as a factor in determining when a best real rational approximation is also a best complex rational approximation

From MaRDI portal
Publication:1168517
Jump to:navigation, search

DOI10.1016/0021-9045(81)90093-9zbMath0493.41017OpenAlexW2004364978MaRDI QIDQ1168517

Arden Ruttan

Publication date: 1981

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(81)90093-9


zbMATH Keywords

alternation setbest uniform rational approximants


Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by rational functions (41A20)


Related Items (4)

Real VS. Complex Rational Chebyshev Approximation on an Interval ⋮ A characterization of best complex rational approximants in a fundamental case ⋮ Complex Approximation of Real Functions by Reciprocals of Polynomials ⋮ Optimality and uniqueness conditions in complex rational Chebyshev approximation with examples



Cites Work

  • On the characterization of complex rational approximations
  • Nonuniqueness of best complex rational approximations to real functions on real intervals
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: The length of the alternation set as a factor in determining when a best real rational approximation is also a best complex rational approximation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1168517&oldid=13238875"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:07.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki