اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFast Barycentric-Based Evaluation Over Spectral/hp Elements
66
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
As the use of spectral/$hp$ element methods, and high-order finite element methods in general, continues to spread, community efforts to create efficient, optimized algorithms associated with fundamental high-order operations have grown. Core tasks such as solution expansion evaluation at quadrature points, stiffness and mass matrix generation, and matrix assembly have received tremendousattention. With the expansion of the types of problems to which high-order methods are applied, and correspondingly the growth in types of numerical tasks accomplished through high-order methods, the number and types of these core operations broaden. This work focuses on solution expansion evaluation at arbitrary points within an element. This operation is core to many postprocessing applications such as evaluation of streamlines and pathlines, as well as to field projection techniques such as mortaring. We expand barycentric interpolation techniques developed on an interval to 2D (triangles and quadrilaterals) and 3D (tetrahedra, prisms, pyramids, and hexahedra) spectral/$hp$ element methods. We provide efficient algorithms for their implementations, and demonstrate their effectiveness using the spectral/$hp$ element library Nektar++.
قيم البحث
اقرأ أيضاً
Finite element simulations have been used to solve various partial differential equations (PDEs) that model physical, chemical, and biological phenomena. The resulting discretized solutions to PDEs often do not satisfy requisite physical properties,
such as positivity or monotonicity. Such invalid solutions pose both modeling challenges, since the physical interpretation of simulation results is not possible, and computational challenges, since such properties may be required to advance the scheme. We, therefore, consider the problem of computing solutions that preserve these structural solution properties, which we enforce as additional constraints on the solution. We consider in particular the class of convex constraints, which includes positivity and monotonicity. By embedding such constraints as a postprocessing convex optimization procedure, we can compute solutions that satisfy general types of convex constraints. For certain types of constraints (including positivity and monotonicity), the optimization is a filter, i.e., a norm-decreasing operation. We provide a variety of tests on one-dimensional time-dependent PDEs that demonstrate the methods efficacy, and we empirically show that rates of convergence are unaffected by the inclusion of the constraints.
We study a class of nonlinear eigenvalue problems of Scrodinger type, where the potential is singular on a set of points. Such problems are widely present in physics and chemistry, and their analysis is of both theoretical and practical interest. In
particular, we study the regularity of the eigenfunctions of the operators considered, and we propose and analyze the approximation of the solution via an isotropically refined hp discontinuous Galerkin (dG) method. We show that, for weighted analytic potentials and for up-to-quartic nonlinearities, the eigenfunctions belong to analytic-type non homogeneous weighted Sobolev spaces. We also prove quasi optimal a priori estimates on the error of the dG finite element method; when using an isotropically refined hp space the numerical solution is shown to converge with exponential rate towards the exact eigenfunction. In addition, we investigate the role of pointwise convergence in the doubling of the convergence rate for the eigenvalues with respect to the convergence rate of eigenfunctions. We conclude with a series of numerical tests to validate the theoretical results.
We propose a novel $hp$-multilevel Monte Carlo method for the quantification of uncertainties in the compressible Navier-Stokes equations, using the Discontinuous Galerkin method as deterministic solver. The multilevel approach exploits hierarchies o
f uniformly refined meshes while simultaneously increasing the polynomial degree of the ansatz space. It allows for a very large range of resolutions in the physical space and thus an efficient decrease of the statistical error. We prove that the overall complexity of the $hp$-multilevel Monte Carlo method to compute the mean field with prescribed accuracy is, in best-case, of quadratic order with respect to the accuracy. We also propose a novel and simple approach to estimate a lower confidence bound for the optimal number of samples per level, which helps to prevent overestimating these quantities. The method is in particular designed for application on queue-based computing systems, where it is desirable to compute a large number of samples during one iteration, without overestimating the optimal number of samples. Our theoretical results are verified by numerical experiments for the two-dimensional compressible Navier-Stokes equations. In particular we consider a cavity flow problem from computational acoustics, demonstrating that the method is suitable to handle complex engineering problems.
We design and analyze a coupling of a discontinuous Galerkin finite element method with a boundary element method to solve the Helmholtz equation with variable coefficients in three dimensions. The coupling is realized with a mortar variable that is
related to an impedance trace on a smooth interface. The method obtained has a block structure with nonsingular subblocks. We prove quasi-optimality of the $h$- and $
In this paper, we propose a fast spectral-Galerkin method for solving PDEs involving integral fractional Laplacian in $mathbb{R}^d$, which is built upon two essential components: (i) the Dunford-Taylor formulation of the fractional Laplacian; and (ii
) Fourier-like bi-orthogonal mapped Chebyshev functions (MCFs) as basis functions. As a result, the fractional Laplacian can be fully diagonalised, and the complexity of solving an elliptic fractional PDE is quasi-optimal, i.e., $O((Nlog_2N)^d)$ with $N$ being the number of modes in each spatial direction. Ample numerical tests for various decaying exact solutions show that the convergence of the fast solver perfectly matches the order of theoretical error estimates. With a suitable time-discretization, the fast solver can be directly applied to a large class of nonlinear fractional PDEs. As an example, we solve the fractional nonlinear Schr{o}dinger equation by using the fourth-order time-splitting method together with the proposed MCF-spectral-Galerkin method.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
