Abstract
We study solution techniques for an evolution equation involving second order derivative in time and the spectral fractional powers, of order $$s \in (0,1)$$ , of symmetric, coercive, linear, elliptic, second-order operators in bounded domains $$\varOmega $$ . We realize fractional diffusion as the Dirichlet-to-Neumann map for a nonuniformly elliptic problem posed on the semi-infinite cylinder $$\mathcal {C}= \varOmega \times (0,\infty )$$ . We thus rewrite our evolution problem as a quasi-stationary elliptic problem with a dynamic boundary condition and derive space, time, and space–time regularity estimates for its solution. The latter problem exhibits an exponential decay in the extended dimension and thus suggests a truncation that is suitable for numerical approximation. We propose and analyze two fully discrete schemes. The discretization in time is based on finite difference discretization techniques: the trapezoidal and leapfrog schemes. The discretization in space relies on the tensorization of a first-degree FEM in $$\varOmega $$ with a suitable hp-FEM in the extended variable. For both schemes we derive stability and error estimates. We consider a first-degree FEM in $$\varOmega $$ with mesh refinement near corners and the aforementioned hp-FEM in the extended variable and extend the a priori error analysis of the trapezoidal scheme for open, bounded, polytopal but not necessarily convex domains $$\varOmega \subset {\mathbb {R}}^2$$ . We discuss implementation details and report several numerical examples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.