اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDiscretization of the Koch Snowflake Domain with Boundary and Interior Energies
58
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the discretization of a Dirichlet form on the Koch snowflake domain and its boundary with the property that both the interior and the boundary can support positive energy. We compute eigenvalues and eigenfunctions, and demonstrate the localization of high energy eigenfunctions on the boundary via a modification of an argument of Filoche and Mayboroda. Holder continuity and uniform approximation of eigenfunctions are also discussed.
قيم البحث
اقرأ أيضاً
In this paper we numerically solve the eigenvalue problem $Delta u + lambda u = 0$ on the fractal region defined by the Koch Snowflake, with zero-Dirichlet or zero-Neumann boundary conditions. The Laplacian with boundary conditions is approximated by
a large symmetric matrix. The eigenvalues and eigenvectors of this matrix are computed by ARPACK. We impose the boundary conditions in a way that gives improved accuracy over the previous computations of Lapidus, Neuberger, Renka & Griffith. We extrapolate the results for grid spacing $h$ to the limit $h rightarrow 0$ in order to estimate eigenvalues of the Laplacian and compare our results to those of Lapdus et al. We analyze the symmetry of the region to explain the multiplicity-two eigenvalues, and present a canonical choice of the two eigenfunctions that span each two-dimensional eigenspace.
In this paper we study $L_2$-norm sampling discretization and sampling recovery of complex-valued functions in RKHS on $D subset R^d$ based on random function samples. We only assume the finite trace of the kernel (Hilbert-Schmidt embedding into $L_2
$) and provide several concrete estimates with precise constants for the corresponding worst-case errors. In general, our analysis does not need any additional assumptions and also includes the case of non-Mercer kernels and also non-separable RKHS. The fail probability is controlled and decays polynomially in $n$, the number of samples. Under the mild additional assumption of separability we observe improved rates of convergence related to the decay of the singular values. Our main tool is a spectral norm concentration inequality for infinite complex random matrices with independent rows complementing earlier results by Rudelson, Mendelson, Pajor, Oliveira and Rauhut.
We consider the multidimensional space-fractional diffusion equations with spatially varying diffusivity and fractional order. Significant computational challenges are encountered when solving these equations due both to the kernel singularity in the
fractional integral operator and to the resulting dense discretized operators, which quickly become prohibitively expensive to handle because of their memory and arithmetic complexities. In this work, we present a singularity-aware discretization scheme that regularizes the singular integrals through a singularity subtraction technique adapted to the spatial variability of diffusivity and fractional order. This regularization strategy is conveniently formulated as a sparse matrix correction that is added to the dense operator, and is applicable to different formulations of fractional diffusion equations. We also present a block low rank representation to handle the dense matrix representations, by exploiting the ability to approximate blocks of the resulting formally dense matrix by low rank factorizations. A Cholesky factorization solver operates directly on this representation using the low rank blocks as its atomic computational tiles, and achieves high performance on multicore hardware. Numerical results show that the singularity treatment is robust, substantially reduces discretization errors, and attains the first-order convergence rate allowed by the regularity of the solutions. They also show that considerable savings are obtained in storage ($O(N^{1.5})$) and computational cost ($O(N^2)$) compared to dense factorizations. This translates to orders-of-magnitude savings in memory and time on multi-dimensional problems, and shows that the proposed methods offer practical tools for tackling large nonlocal fractional diffusion simulations.
We consider a discretization of Caputo derivatives resulted from deconvolving a scheme for the corresponding Volterra integral. Properties of this discretization, including signs of the coefficients, comparison principles, and stability of the corres
ponding implicit schemes, are proved by its linkage to Volterra integrals with completely monotone kernels. We then apply the backward scheme corresponding to this discretization to two time fractional dissipative problems, and these implicit schemes are helpful for the analysis of the corresponding problems. In particular, we show that the overdamped generalized Langevin equation with fractional noise has a unique limiting measure for strongly convex potentials and establish the convergence of numerical solutions to the strong solutions of time fractional gradient flows. The proposed scheme and schemes derived using the same philosophy can be useful for many other applications as well.
This article investigates residual a posteriori error estimates and adaptive mesh refinements for time-dependent boundary element methods for the wave equation. We obtain reliable estimates for Dirichlet and acoustic boundary conditions which hold fo
r a large class of discretizations. Efficiency of the error estimate is shown for a natural discretization of low order. Numerical examples confirm the theoretical results. The resulting adaptive mesh refinement procedures in 3d recover the adaptive convergence rates known for elliptic problems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
