Related papers: Fundamental Data Structures for Matrix-Free Finite…
It is well known that multigrid methods are optimally efficient for solution of elliptic equations (O(N)), which means that effort is proportional to the number of points at which the solution is evaluated). Thus this is an ideal method to…
We present a finite element scheme for fractional diffusion problems with varying diffusivity and fractional order. We consider a symmetric integral form of these nonlocal equations defined on general geometries and in arbitrary bounded…
We develop a finite element discretization for the weakly symmetric equations of linear elasticity on tetrahedral meshes. The finite element combines, for $r \geq 0$, discontinuous polynomials of $r$ for the displacement,…
This paper introduces a highly adaptive and automated approach for generating Finite Element (FE) discretization for a given realistic multi-compartment human head model obtained through magnetic resonance imaging (MRI) dataset. We aim at…
We continue our study [Domain Uncertainty Quantification in Computational Electromagnetics, JUQ (2020), 8:301--341] of the numerical approximation of time-harmonic electromagnetic fields for the Maxwell lossy cavity problem for uncertain…
The accuracy and computational cost of a large eddy simulation are highly dependent on the computational grid. Building optimal grids manually from a priori knowledge is not feasible in most practical use cases; instead, solution-adaptive…
Semidefinite programming (SDP) is a fundamental class of convex optimization problems with diverse applications in mathematics, engineering, machine learning, and related disciplines. This paper investigates the application of the…
We investigate numerical solutions of high order curl problems with various formulations and finite elements. We show that several classical conforming finite elements lead to spurious solutions, while mixed formulations with finite…
We study extensions of piecewise polynomial data prescribed in a patch of tetrahedra sharing an edge. We show stability in the sense that the minimizers over piecewise polynomial spaces with prescribed tangential component jumps across…
A discretization method with non-matching grids is proposed for the coupled Stokes-Darcy problem that uses a mortar variable at the interface to couple the marker and cell (MAC) method in the Stokes domain with the Raviart-Thomas mixed…
We develop a high order accurate numerical method for solving the elastic wave equation in second-order form. We hybridize the computationally efficient Cartesian grid formulation of finite differences with geometrically flexible…
Our goal is to present an elementary approach to the analysis and programming of sparse grid finite element methods. This family of schemes can compute accurate solutions to partial differential equations, but using far fewer degrees of…
This paper presents a novel approach to the construction of the lowest order $H(\mathrm{curl})$ and $H(\mathrm{div})$ exponentially-fitted finite element spaces ${\mathcal{S}_{1^-}^{k}}~(k=1,2)$ on 3D simplicial mesh for corresponding…
In this paper, we deal with the problem of curves clustering. We propose a nonparametric method which partitions the curves into clusters and discretizes the dimensions of the curve points into intervals. The cross-product of these…
Many computational problems admit fast algorithms on special inputs, however, the required properties might be quite restrictive. E.g., many graph problems can be solved much faster on interval or cographs, or on graphs of small…
Matrix Factorization (MF) has been widely applied in machine learning and data mining. A large number of algorithms have been studied to factorize matrices. Among them, stochastic gradient descent (SGD) is a commonly used method.…
This work introduces and assesses the efficiency of a monolithic $ph$MG multigrid framework designed for high-order discretizations of stationary Stokes systems using Taylor-Hood and Scott-Vogelius elements. The proposed approach integrates…
This work introduces an adaptive mesh refinement technique for hierarchical hybrid grids with the goal to reach scalability and maintain excellent performance on massively parallel computer systems. On the block structured hierarchical…
This paper is to introduce a type of full multigrid method for the nonlinear eigenvalue problem. The main idea is to transform the solution of nonlinear eigenvalue problem into a series of solutions of the corresponding linear boundary…
In this paper, we propose and analyze the numerical algorithms for fast solution of periodic elliptic problems in random media in $\mathbb{R}^d$, $d=2,3$. We consider the stochastic realizations using checkerboard configuration of the…