Related papers: Sparse Spectral-Galerkin Method on An Arbitrary Te…
The purpose of the research is to find the numerical solutions to the system of time dependent nonlinear parabolic partial differential equations (PDEs) utilizing the Modified Galerkin Weighted Residual Method (MGWRM) with the help of…
We present a novel Galerkin method for solving partial differential equations on the sphere. The problem is discretized by a highly localized basis which is easily constructed. The stiffness matrix entries are computed by a recently…
The goal of this paper is to create a fruitful bridge between the numerical methods for approximating partial differential equations (PDEs) in fluid dynamics and the (iterative) numerical methods for dealing with the resulting large linear…
This paper studies generalized semi-infinite programs (GSIPs) defined with polyhedral parameter sets. Assume these GSIPs are given by polynomials. We propose a new approach to solve them as a disjunctive program. This approach is based on…
This paper presents a fully discrete numerical scheme for one-dimensional nonlocal wave equations and provides a rigorous theoretical analysis. To facilitate the spatial discretization, we introduce an auxiliary variable analogous to the…
In this paper, we develop sparse grid central discontinuous Galerkin (CDG) scheme for linear hyperbolic systems with variable coefficients in high dimensions. The scheme combines the CDG framework with the sparse grid approach, with the aim…
Standard sparse pseudo-input approximations to the Gaussian process (GP) cannot handle complex functions well. Sparse spectrum alternatives attempt to answer this but are known to over-fit. We suggest the use of variational inference for…
The finite element method, finite difference method, finite volume method and spectral method have achieved great success in solving partial differential equations. However, the high accuracy of traditional numerical methods is at the cost…
In this paper, we study the generalized polynomial chaos (gPC) based stochastic Galerkin method for the linear semiconductor Boltzmann equation under diffusive scaling and with random inputs from an anisotropic collision kernel and the…
In this paper we study fast iterative solvers for the large sparse linear systems resulting from the stochastic Galerkin discretization of stochastic partial differential equations. A block triangular preconditioner is introduced and…
Standard discontinuous Galerkin methods, based on piecewise polynomials of degree $ \qq=0,1$, are considered for temporal semi-discretization for second order hyperbolic equations. The main goal of this paper is to present a simple and…
We introduce a discontinuous Galerkin method for the mixed formulation of the elasticity eigenproblem with reduced symmetry. The analysis of the resulting discrete eigenproblem does not fit in the standard spectral approximation framework…
We present a new line-based discontinuous Galerkin (DG) discretization scheme for first- and second-order systems of partial differential equations. The scheme is based on fully unstructured meshes of quadrilateral or hexahedral elements,…
We present a new tunably-accurate Laguerre Petrov-Galerkin spectral method for solving linear multi-term fractional initial value problems with derivative orders at most one and constant coefficients on the half line. Our method results in…
Explicit, unconditionally stable, high-order schemes for the approximation of some first- andsecond-order linear, time-dependent partial differential equations (PDEs) are proposed.The schemes are based on a weak formulation of a…
We introduce a family of discontinuous Galerkin methods to approximate the eigenvalues and eigenfunctions of a Stokes-Brinkman type of problem based in the interior penalty strategy. Under the standard assumptions on the meshes and a…
In this paper, we present a numerical scheme to solve the initial-boundary value problem for backward stochastic partial differential equations of parabolic type. Based on the Galerkin method, we approximate the original equation by a…
Sparse (or toric) elimination exploits the structure of polynomials by measuring their complexity in terms of Newton polytopes instead of total degree. The sparse, or Newton, resultant generalizes the classical homogeneous resultant and its…
We use a concept of weak asymptotic solution for homogeneous as well as non-homogeneous fractional advection dispersion type equations. Using Legendre scaling functions as basis, a numerical method based on Galerkin approximation is…
A wide range of problems in computational science and engineering require estimation of sparse eigenvectors for high dimensional systems. Here, we propose two variants of the Truncated Orthogonal Iteration to compute multiple leading…