Related papers: Quadrature for Singular Integrals over convex Poly…
This paper presents a new and efficient numerical algorithm for the biharmonic equation by using weak Galerkin (WG) finite element methods. The WG finite element scheme is based on a variational form of the biharmonic equation that is…
We introduce an efficient algorithm for computing fractional integrals and derivatives and apply it for solving problems of the calculus of variations of fractional order. The proposed approximations are particularly useful for solving…
We study the numerical approximation of a coupled hyperbolic-parabolic system by a family of discontinuous Galerkin space-time finite element methods. The model is rewritten as a first-order evolutionary problem that is treated by the…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
In the present work, strong approximation errors are analyzed for both the spatial semi-discretization and the spatio-temporal fully discretization of stochastic wave equations (SWEs) with cubic polynomial nonlinearities and additive…
A second mapping method is introduced in the generalized discrete singular convolution algorithm. The mapping approaches are adopted to regularize singularities for one electron system. The applications of the two mapping methods are…
We introduce a new class of fractional backward orthogonal functions designed for the spectral approximation of weakly singular adjoint Volterra integral equations. These basis functions generate an approximation space that naturally…
In this paper, we present and study $C^1$ Petrov-Galerkin and Gauss collocation methods with arbitrary polynomial degree $k$ ($\ge 3$) for one-dimensional elliptic equations. We prove that, the solution and its derivative approximations…
This paper introduces and rigorously analyzes a least-squares weak Galerkin (LS-WG) finite element method for the severely ill-posed Cauchy problem associated with the Helmholtz equation. By utilizing a weak Laplacian operator defined on a…
Asymptotic approximations to the zeros of Jacobi polynomials are given, with methods to obtain the coefficients in the expansions. These approximations can be used as standalone methods for the non-iterative computation of the nodes of…
We study the order of convergence of Galerkin variational integrators for ordinary differential equations. Galerkin variational integrators approximate a variational (Lagrangian) problem by restricting the space of curves to the set of…
A new weak Galerkin (WG) finite element method for solving the biharmonic equation in two or three dimensional spaces by using polynomials of reduced order is introduced and analyzed. The WG method is on the use of weak functions and their…
The development of fast and accurate image reconstruction algorithms is a central aspect of computed tomography. In this paper we address this issue for photoacoustic computed tomography in circular geometry. We investigate the Galerkin…
The multi-indexed Jacobi polynomials are the main part of the eigenfunctions of exactly solvable quantum mechanical systems obtained by certain deformations of the P\"oschl-Teller potential (Odake-Sasaki). By fine-tuning the parameter(s) of…
In this paper, we introduce a fast Fourier-Galerkin method for solving boundary integral equations on torus-shaped surfaces, which are diffeomorphic to a torus. We analyze the properties of the integral operator's kernel to derive the decay…
We introduce and rigorously analyze a least-squares weak Galerkin (LS-WG) finite element method for the severely ill-posed Cauchy problem of convection--diffusion equations. The proposed framework utilizes weak derivatives defined on a…
We develop a convergence theory for non-monotone approximation schemes for fully nonlinear parabolic partial differential equations. Modern computational methods such as kernel-based collocation, spectral methods, physics-informed neural…
We present W-cycle multigrid algorithms for the solution of the linear system of equations arising from a wide class of $hp$-version discontinuous Galerkin discretizations of elliptic problems. Starting from a classical framework in…
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. We in particular discuss decomposition methods, which reduce the problem to a number of…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…