2022
DOI: 10.1016/j.aml.2022.108328
|View full text |Cite
|
Sign up to set email alerts
|

Constrained mock-Chebyshev least squares quadrature

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 11 publications
0
6
0
Order By: Relevance
“…and let the function f be known only at the points of X n . The main idea of the constrained mock-Chebyshev least squares method [9,13] is to construct an interpolant of f on a proper subset of X n , formed by m +1 nodes, chosen as "closest" to Chebyshev-Lobatto nodes, and use the remaining n − m points of X n to improve the accuracy of approximation by a process of simultaneous regression of degree p ≥ 0. To be more precise, let m = π n 2 , and denote by X C L m the set of Chebyshev-Lobatto nodes of order m + 1…”
Section: Constrained Mock-chebyshev Least Squares Interpolantmentioning
confidence: 99%
See 2 more Smart Citations
“…and let the function f be known only at the points of X n . The main idea of the constrained mock-Chebyshev least squares method [9,13] is to construct an interpolant of f on a proper subset of X n , formed by m +1 nodes, chosen as "closest" to Chebyshev-Lobatto nodes, and use the remaining n − m points of X n to improve the accuracy of approximation by a process of simultaneous regression of degree p ≥ 0. To be more precise, let m = π n 2 , and denote by X C L m the set of Chebyshev-Lobatto nodes of order m + 1…”
Section: Constrained Mock-chebyshev Least Squares Interpolantmentioning
confidence: 99%
“…, ẑm+1 ] T the Lagrange multipliers vector. In defining V and C in (11) the assumption is that the nodes ξ i have been reordered so that ξ i = ξ i , i = 0, . .…”
Section: Constrained Mock-chebyshev Least Squares Interpolantmentioning
confidence: 99%
See 1 more Smart Citation
“…In order to adopt the values of f at equidistant nodes, a widely used technique is based on composite quadrature rules of "lower" degree, such as Filon's type rules, whose degree of approximation cannot be improved over the saturation class of the approximation process. Recently, in [3] starting from the knowledge of f at a finite set of equally spaced nodes, an approach has been introduced to efficiently compute weighted integrals, but not advisable in the case of oscillating integrands. For a short review on the main techniques the interested reader can consult [1].…”
Section: Introductionmentioning
confidence: 99%
“…In order to adopt the values of f at equidistant nodes, a widely used technique is based on composite quadrature rules of "lower" degree, such as Filón type rules, whose degree of approximation cannot be improved over the saturation class of the approximation process. Recently, in [3] starting from the knowledge of f at a finite set of equally spaced nodes, an approach has been introduced to efficiently compute weighted integrals, but not advisable in the case of oscillating integrands. For a short review on the main techniques the interested reader can consult [1].…”
Section: Introductionmentioning
confidence: 99%