اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدContinuity estimates for Riesz potentials on polygonal boundaries
62
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Riesz potentials are well known objects of study in the theory of singular integrals that have been the subject of recent, increased interest from the numerical analysis community due to their connections with fractional Laplace problems and proposed use in certain domain decomposition methods. While the L$^p$-mapping properties of Riesz potentials on flat geometries are well-established, comparable results on rougher geometries for Sobolev spaces are very scarce. In this article, we study the continuity properties of the surface Riesz potential generated by the $1/sqrt{x}$ singular kernel on a polygonal domain $Omega subset mathbb{R}^2$. We prove that this surface Riesz potential maps L$^{2}(partialOmega)$ into H$^{+1/2}(partialOmega)$. Our proof is based on a careful analysis of the Riesz potential in the neighbourhood of corners of the domain $Omega$. The main tool we use for this corner analysis is the Mellin transform which can be seen as a counterpart of the Fourier transform that is adapted to corner geometries.
قيم البحث
اقرأ أيضاً
In this work we propose a discretisation method for the Reissner--Mindlin plate bending problem in primitive variables that supports general polygonal meshes and arbitrary order. The method is inspired by a two-dimensional discrete de Rham complex fo
r which key commutation properties hold that enable the cancellation of the contribution to the error linked to the enforcement of the Kirchhoff constraint. Denoting by $kge 0$ the polynomial degree for the discrete spaces and by $h$ the meshsize, we derive for the proposed method an error estimate in $h^{k+1}$ for general $k$, as well as a locking-free error estimate for the lowest-order case $k=0$. The theoretical results are validated on a complete panel of numerical tests.
This paper develops manifold learning techniques for the numerical solution of PDE-constrained Bayesian inverse problems on manifolds with boundaries. We introduce graphical Matern-type Gaussian field priors that enable flexible modeling near the bou
ndaries, representing boundary values by superposition of harmonic functions with appropriate Dirichlet boundary conditions. We also investigate the graph-based approximation of forward models from PDE parameters to observed quantities. In the construction of graph-based prior and forward models, we leverage the ghost point diffusion map algorithm to approximate second-order elliptic operators with classical boundary conditions. Numerical results validate our graph-based approach and demonstrate the need to design prior covariance models that account for boundary conditions.
This paper presents a steady-state and transient heat conduction analysis framework using the polygonal scaled boundary finite element method (PSBFEM) with polygon/quadtree meshes. The PSBFEM is implemented with commercial finite element code Abaqus
by the User Element Sub-routine (UEL) feature. The detailed implementation of the framework, defining the UEL element, and solving the stiffness/mass matrix by the eigenvalue decomposition are presented. Several benchmark problems from heat conduction are solved to validate the proposed implementation. Results show that the PSBFEM is reliable and accurate for solving heat conduction problems. Not only can the proposed implementation help engineering practitioners analyze the heat conduction problem using polygonal mesh in Abaqus, but it also provides a reference for developing the UEL to solve other problems using the scaled boundary finite element method.
We propose a novel method to compute a finite difference stencil for Riesz derivative for artibitrary speed of convergence. This method is based on applying a pre-filter to the Grunwald-Letnikov type central difference stencil. The filter is obtained
by solving for the inverse of a symmetric Vandemonde matrix and exploiting the relationship between the Taylors series coefficients and fast Fourier transform. The filter costs Oleft(N^{2}right) operations to evaluate for Oleft(h^{N}right) of convergence, where h is the sampling distance. The higher convergence speed should more than offset the overhead with the requirement of the number of nodal points for a desired error tolerance significantly reduced. The benefit of progressive generation of the stencil coefficients for adaptive grid size for dynamic problems with the Grunwald-Letnikov type difference scheme is also kept because of the application of filtering. The higher convergence rate is verified through numerical experiments.
Modern power systems face a grand challenge in grid management due to increased electricity demand, imminent disturbances, and uncertainties associated with renewable generation, which can compromise grid security. The security assessment is directly
connected to the robustness of the operating condition and is evaluated by analyzing proximity to the power flow solution spaces boundary. Calculating location of such a boundary is a computationally challenging task, linked to the power flow equations non-linear nature, presence of technological constraints, and complicated network topology. In this paper we introduce a general framework to characterize points on the power flow solution space boundary in terms of auxiliary variables subject to algebraic constraints. Then we develop an adaptive continuation algorithm to trace 1-dimensional sections of boundary curves which exhibits robust performance and computational tractability. Implementation of the algorithm is described in detail, and its performance is validated on different test networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
