2010
DOI: 10.1016/j.jcp.2009.11.020
|View full text |Cite
|
Sign up to set email alerts
|

High-order unconditionally stable FC-AD solvers for general smooth domains I. Basic elements

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
199
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 114 publications
(201 citation statements)
references
References 61 publications
2
199
0
Order By: Relevance
“…As an alternative method for eliminating the ill-conditioning without incurring the high O(N 3 ) computational cost that arises from the evaluation of the singular value decomposition [6] mentioned above (which, in application to solution of PDEs is prohibitively expensive), the contribution [4] proposes the following strategy: at first the restriction of the function f to certain very small subintervals of [0, 1] containing the endpoints 0 and 1 (boundary intervals) are projected onto a space of discrete orthogonal polynomials (Gram polynomials ( [25])) of small degree, and Fourier continuation of orthogonal bases of these spaces are precomputed using fine submeshes. The continuation of the original function then proceeds, at FFT speeds, using the projection coefficients of the function at the boundary segments.…”
Section: The Fourier Continuation Approximationmentioning
confidence: 99%
See 4 more Smart Citations
“…As an alternative method for eliminating the ill-conditioning without incurring the high O(N 3 ) computational cost that arises from the evaluation of the singular value decomposition [6] mentioned above (which, in application to solution of PDEs is prohibitively expensive), the contribution [4] proposes the following strategy: at first the restriction of the function f to certain very small subintervals of [0, 1] containing the endpoints 0 and 1 (boundary intervals) are projected onto a space of discrete orthogonal polynomials (Gram polynomials ( [25])) of small degree, and Fourier continuation of orthogonal bases of these spaces are precomputed using fine submeshes. The continuation of the original function then proceeds, at FFT speeds, using the projection coefficients of the function at the boundary segments.…”
Section: The Fourier Continuation Approximationmentioning
confidence: 99%
“…(As noted in [4], this calculation should be performed in high-precision arithmetic, and the small number of associated coefficients should be stored for use as part of the any general domain PDE solver.) To include the odd modes in the continuation of the basis function we consider functionsζ (x) such that they approximate, in the least squares sense, φ (x) and −φ (x + ∆ + d) in ∆ right and 1 + d + ∆ left , respectively:…”
Section: The Fourier Continuation Approximationmentioning
confidence: 99%
See 3 more Smart Citations