A test for Chebyshev systems

DOI10.1007/BF01159892MaRDI QIDQ1081767zbMATH OpenOpenAlexFDO

Authors L. G. Labsker

Publication date 1986

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01159892

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Best approximation, Chebyshev systems (41A50)

Review text

A criterion for the existence of polynomials with a priori given roots (in that a sign is changed or not) depending on a number of functions contained in the system in question and its parity is given.

Recommendations

• scientific article; zbMATH DE number 4210772
• scientific article; zbMATH DE number 3971399
• scientific article; zbMATH DE number 4165584
• scientific article; zbMATH DE number 3967003
• A Chebyshev criterion with applications

Cites work

• scientific article; zbMATH DE number 3951219 (Why is no real title available?)
• scientific article; zbMATH DE number 3691949 (Why is no real title available?)
• Tchebyshev systems that cannot be transformed into Markov systems
• Zum Nullstellensatz von Krein für Haar'sche Räume

Cited in

(2)

• Some criteria and properties of Chebyshev systems
• scientific article; zbMATH DE number 4210772 (Why is no real title available?)

This page was built for publication: A test for Chebyshev systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1081767)