A numerical algorithm for constructing polynomials deviating least from zero with a given weight
The article considers numerical algorithms for determining the coefficients of polynomials with a fixed leading coefficient, the algorithms supplying a minimum deviation from zero in a minimax norm with a given weight function. The polynomials serve as a useful tool in many numerical methods, in par...
Main Authors: | Berdnikov Alexander, Solovyev Konstantin |
---|---|
Format: | Article |
Language: | English |
Published: |
Peter the Great St.Petersburg Polytechnic University
2023-06-01
|
Series: | St. Petersburg Polytechnical University Journal: Physics and Mathematics |
Subjects: | |
Online Access: | https://physmath.spbstu.ru/article/2023.66.13/ |
Similar Items
-
Chebyshev polynomials [kesetvideo]
Published: (1971) -
Chebyshev polynomials [filem]
Published: (1971) -
Towards the Sign Function Best Approximation for Secure Outsourced Computations and Control
by: Mikhail Babenko, et al.
Published: (2022-06-01) -
Chebyshev polynomials in numerical analysis
by: Fox, L. (Leslie), et al. -
Approximation Properties of Chebyshev Polynomials in the Legendre Norm
by: Cuixia Niu, et al.
Published: (2021-12-01)