2014
DOI: 10.1080/00207160.2014.987761
|View full text |Cite
|
Sign up to set email alerts
|

Efficient computation of highly oscillatory integrals with weak singularities by Gauss-type method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 16 publications
(8 citation statements)
references
References 32 publications
0
8
0
Order By: Relevance
“…In conclusion, several starting values for the modified moments for forward recursion and Oliver's algorithm or Lozier's algorithm are needed. In addition, the three end moments can be computed by using asymptotic expansion in [14] or the method in [18].…”
Section: Fast Computations Of the Modified Momentsmentioning
confidence: 99%
See 3 more Smart Citations
“…In conclusion, several starting values for the modified moments for forward recursion and Oliver's algorithm or Lozier's algorithm are needed. In addition, the three end moments can be computed by using asymptotic expansion in [14] or the method in [18].…”
Section: Fast Computations Of the Modified Momentsmentioning
confidence: 99%
“…Remark 3. We choose 10 points for the Gauss-type method in [18] to evaluate I(j, k, ω), j = 0, 1, 2, 3, 4 for ω = 2k. While for ω = 2k, we compute them by using the formula (2.37) through Meijer G-function, which can be efficiently computed with the Matlab code MeijerG.m [36].…”
Section: )mentioning
confidence: 99%
See 2 more Smart Citations
“…A special Gauss-type quadrature, based on the numerical steepest method, has been proposed for the highly oscillatory integrals with algebraic singularities [7,31,32] for linear oscillators, not applied to general oscillators. There is still much work to compute the oscillatory integrals with logarithmic singularities in efficiency and accuracy.…”
Section: Introductionmentioning
confidence: 99%