3,686 research outputs found
Parallel h-p spectral element method for elliptic problems on polygonal domains
It is well known that elliptic problems when posed on non-smooth domains, develop singularities. We examine such problems within the framework of spectral element methods and resolve the singularities with exponential accuracy
hp-adaptive discontinuous Galerkin solver for elliptic equations in numerical relativity
A considerable amount of attention has been given to discontinuous Galerkin methods for hyperbolic problems in numerical relativity, showing potential advantages of the methods in dealing with hydrodynamical shocks and other discontinuities. This paper investigates discontinuous Galerkin methods for the solution of elliptic problems in numerical relativity. We present a novel hp-adaptive numerical scheme for curvilinear and non-conforming meshes. It uses a multigrid preconditioner with a Chebyshev or Schwarz smoother to create a very scalable discontinuous Galerkin code on generic domains. The code employs compactification to move the outer boundary near spatial infinity. We explore the properties of the code on some test problems, including one mimicking Neutron stars with phase transitions. We also apply it to construct initial data for two or three black holes
Spectral/hp element methods: recent developments, applications, and perspectives
The spectral/hp element method combines the geometric flexibility of the
classical h-type finite element technique with the desirable numerical
properties of spectral methods, employing high-degree piecewise polynomial
basis functions on coarse finite element-type meshes. The spatial approximation
is based upon orthogonal polynomials, such as Legendre or Chebychev
polynomials, modified to accommodate C0-continuous expansions. Computationally
and theoretically, by increasing the polynomial order p, high-precision
solutions and fast convergence can be obtained and, in particular, under
certain regularity assumptions an exponential reduction in approximation error
between numerical and exact solutions can be achieved. This method has now been
applied in many simulation studies of both fundamental and practical
engineering flows. This paper briefly describes the formulation of the
spectral/hp element method and provides an overview of its application to
computational fluid dynamics. In particular, it focuses on the use the
spectral/hp element method in transitional flows and ocean engineering.
Finally, some of the major challenges to be overcome in order to use the
spectral/hp element method in more complex science and engineering applications
are discussed
Kernel-based stochastic collocation for the random two-phase Navier-Stokes equations
In this work, we apply stochastic collocation methods with radial kernel
basis functions for an uncertainty quantification of the random incompressible
two-phase Navier-Stokes equations. Our approach is non-intrusive and we use the
existing fluid dynamics solver NaSt3DGPF to solve the incompressible two-phase
Navier-Stokes equation for each given realization. We are able to empirically
show that the resulting kernel-based stochastic collocation is highly
competitive in this setting and even outperforms some other standard methods
Spectral methods for CFD
One of the objectives of these notes is to provide a basic introduction to spectral methods with a particular emphasis on applications to computational fluid dynamics. Another objective is to summarize some of the most important developments in spectral methods in the last two years. The fundamentals of spectral methods for simple problems will be covered in depth, and the essential elements of several fluid dynamical applications will be sketched
Space-time least-squares isogeometric method and efficient solver for parabolic problems
In this paper, we propose a space-time least-squares isogeometric method to
solve parabolic evolution problems, well suited for high-degree smooth splines
in the space-time domain. We focus on the linear solver and its computational
efficiency: thanks to the proposed formulation and to the tensor-product
construction of space-time splines, we can design a preconditioner whose
application requires the solution of a Sylvester-like equation, which is
performed efficiently by the fast diagonalization method. The preconditioner is
robust w.r.t. spline degree and mesh size. The computational time required for
its application, for a serial execution, is almost proportional to the number
of degrees-of-freedom and independent of the polynomial degree. The proposed
approach is also well-suited for parallelization.Comment: 29 pages, 8 figure
- …