2012
DOI: 10.1137/110857404
|View full text |Cite
|
Sign up to set email alerts
|

High-Order Numerical Integration over Discrete Surfaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
12
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
7
2

Relationship

3
6

Authors

Journals

citations
Cited by 15 publications
(13 citation statements)
references
References 8 publications
1
12
0
Order By: Relevance
“…We addressed the fundamental question of whether one can achieve high-order accuracy given a piecewise linear approximation to the surface. We proposed a novel method, which can compute the surface integrals to high-order of accuracy over piecewise-linear meshes [29,9]. We proved theoretically that high-order of accuracy can be achieved for surface integrals using a least-squares based approximation over linear meshes and demonstrated numerical experiments achieving the predicted order of accuracy.…”
Section: Numerical Tools For Complex Dynamic Geometrymentioning
confidence: 91%
“…We addressed the fundamental question of whether one can achieve high-order accuracy given a piecewise linear approximation to the surface. We proposed a novel method, which can compute the surface integrals to high-order of accuracy over piecewise-linear meshes [29,9]. We proved theoretically that high-order of accuracy can be achieved for surface integrals using a least-squares based approximation over linear meshes and demonstrated numerical experiments achieving the predicted order of accuracy.…”
Section: Numerical Tools For Complex Dynamic Geometrymentioning
confidence: 91%
“…The remap method in this work utilizes two high-order reconstruction techniques, known as CMF (Continuous Moving Frames) and WALF (Weighted Average of Least-squares Fittings) [52], both of which are based on weighted least squares (WLS ). These techniques were first proposed for reconstructing surfaces and later adapted to reconstruct functions on surfaces [81]. CMF shares some similarities with some variant of MMLS (such as that in [94]), in that CMF constructs a least-squares fitting at each reconstruction point and it achieves accuracy and stability through some local adaptivity (instead of the global construction of the original MLS for smoothness [65]).…”
Section: High-order Reconstructionsmentioning
confidence: 99%
“…As shown in [53] and [81], if the condition number of the rescaled Vandermonde system à is bounded, then the function values of a smooth function f : Γ → R can be reconstructed to O(h p+1 ) on a discrete surface Γ, where h is proportional to the "radius" of the stencil. Furthermore, if the stencils are (nearly) symmetric about the origin of the local coordinate system, the reconstruction can superconverge at O(h p+2 ) for even-degree p due to error cancellation [53,52], analogous to the error cancellation in centered differences.…”
Section: Optimizing Weights For Remapmentioning
confidence: 99%
“…Here, we address three issues: the application programming interface (API), a conservative version of the API and a graceful end to the tracking of the interface in overly complex frontal topologies. Before going into the details, we describe the front or interface software, a product of Jiao and students [21][22][23], and replacing our older interface software. Conceptually the ideas are simple.…”
Section: An Application Programming Interface For Front Trackingmentioning
confidence: 99%