62,770 research outputs found
Solving eigenvalue problems on curved surfaces using the Closest Point Method
Eigenvalue problems are fundamental to mathematics and science. We present a
simple algorithm for determining eigenvalues and eigenfunctions of the
Laplace--Beltrami operator on rather general curved surfaces. Our algorithm,
which is based on the Closest Point Method, relies on an embedding of the
surface in a higher-dimensional space, where standard Cartesian finite
difference and interpolation schemes can be easily applied. We show that there
is a one-to-one correspondence between a problem defined in the embedding space
and the original surface problem. For open surfaces, we present a simple way to
impose Dirichlet and Neumann boundary conditions while maintaining second-order
accuracy. Convergence studies and a series of examples demonstrate the
effectiveness and generality of our approach
Fast generation of 3D deformable moving surfaces
Dynamic surface modeling is an important subject of geometric modeling due to their extensive applications in engineering design, entertainment and medical visualization. Many deformable objects in the real world are dynamic objects as their shapes change over time. Traditional geometric modeling methods are mainly concerned with static problems, therefore unsuitable for the representation of dynamic objects. Apart from the definition of a dynamic modeling problem, another key issue is how to solve the problem. Because of the complexity of the representations, currently the finite element method or finite difference method is usually used. Their major shortcoming is the excessive computational cost, hence not ideal for applications requiring real-time performance. We propose a representation of dynamic surface modeling with a set of fourth order dynamic partial differential equations (PDEs). To solve these dynamic PDEs accurately and efficiently, we also develop an effective resolution method. This method is further extended to achieve local deformation and produce n-sided patches. It is demonstrated that this new method is almost as fast and accurate as the analytical closed form resolution method and much more efficient and accurate than the numerical methods
A least-squares implicit RBF-FD closest point method and applications to PDEs on moving surfaces
The closest point method (Ruuth and Merriman, J. Comput. Phys.
227(3):1943-1961, [2008]) is an embedding method developed to solve a variety
of partial differential equations (PDEs) on smooth surfaces, using a closest
point representation of the surface and standard Cartesian grid methods in the
embedding space. Recently, a closest point method with explicit time-stepping
was proposed that uses finite differences derived from radial basis functions
(RBF-FD). Here, we propose a least-squares implicit formulation of the closest
point method to impose the constant-along-normal extension of the solution on
the surface into the embedding space. Our proposed method is particularly
flexible with respect to the choice of the computational grid in the embedding
space. In particular, we may compute over a computational tube that contains
problematic nodes. This fact enables us to combine the proposed method with the
grid based particle method (Leung and Zhao, J. Comput. Phys. 228(8):2993-3024,
[2009]) to obtain a numerical method for approximating PDEs on moving surfaces.
We present a number of examples to illustrate the numerical convergence
properties of our proposed method. Experiments for advection-diffusion
equations and Cahn-Hilliard equations that are strongly coupled to the velocity
of the surface are also presented
A general form of the co-moving tensorial derivative
A general expression for the co-moving derivative of a tensor is derived. A variable describing the coordinate velocity field is introduced. Time dependency of the metric elements is expressed in terms of this velocity field. The resulting description of motion is one of which the Eulerian and Lagrangian viewpoints are special cases. This general description is useful in problems involving moving boundaries or discontinuities
ADI splitting schemes for a fourth-order nonlinear partial differential equation from image processing
We present directional operator splitting schemes for the numerical solution of a fourth-order, nonlinear partial differential evolution equation which arises in image processing. This equation constitutes the H−1-gradient flow of the total variation and represents a prototype of higher-order equations of similar type which are popular in imaging for denoising, deblurring and inpainting problems. The efficient numerical solution of this equation is very challenging due to the stiffness of most numerical schemes. We show that the combination of directional splitting schemes with implicit time-stepping provides a stable and computationally cheap numerical realisation of the equation
High-order numerical methods for 2D parabolic problems in single and composite domains
In this work, we discuss and compare three methods for the numerical
approximation of constant- and variable-coefficient diffusion equations in both
single and composite domains with possible discontinuity in the solution/flux
at interfaces, considering (i) the Cut Finite Element Method; (ii) the
Difference Potentials Method; and (iii) the summation-by-parts Finite
Difference Method. First we give a brief introduction for each of the three
methods. Next, we propose benchmark problems, and consider numerical tests-with
respect to accuracy and convergence-for linear parabolic problems on a single
domain, and continue with similar tests for linear parabolic problems on a
composite domain (with the interface defined either explicitly or implicitly).
Lastly, a comparative discussion of the methods and numerical results will be
given.Comment: 45 pages, 12 figures, in revision for Journal of Scientific Computin
- …