2021
DOI: 10.1016/j.jmaa.2020.124906
|View full text |Cite
|
Sign up to set email alerts
|

A note on orthogonal polynomials described by Chebyshev polynomials

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…In this paper, a response function approximation method based on Chebyshev orthogonal polynomial [7] piecewise fitting [9][10] is proposed. By appropriately increasing the polynomial degree, overlap rate and the number of piecewise interval segments, the high-level noise can be effectively suppressed, which has strong anti-noise performance.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, a response function approximation method based on Chebyshev orthogonal polynomial [7] piecewise fitting [9][10] is proposed. By appropriately increasing the polynomial degree, overlap rate and the number of piecewise interval segments, the high-level noise can be effectively suppressed, which has strong anti-noise performance.…”
Section: Introductionmentioning
confidence: 99%
“…The spectral method is different from other numerical calculation methods, mainly in the selection of a class of globally smooth function clusters as trial functions and test functions. Commonly used function clusters include Chebyshev polynomials [22], Legendre polynomials [23], and Fourier functions [24]. The test function clusters are mainly divided into Galerkin, Tau and collocation types.…”
Section: Introductionmentioning
confidence: 99%