Related papers: A High-Order Lower-Triangular Pseudo-Mass Matrix f…
In [Heimann, Lehrenfeld, Preu{\ss}, SIAM J. Sci. Comp. 45(2), 2023, B139 - B165] new geometrically unfitted space-time Finite Element methods for partial differential equations posed on moving domains of higher-order accuracy in space and…
We present a computationally efficient approach to solve the time-dependent Kohn-Sham equations in real-time using higher-order finite-element spatial discretization, applicable to both pseudopotential and all-electron calculations. To this…
We consider the efficient numerical approximation of acoustic wave propagation in time domain by a finite element method with mass lumping. In the presence of internal damping, the problem can be reduced to a second order formulation in…
A novel finite element method for the approximation of Maxwell's equations over hybrid two-dimensional grids is studied. The choice of appropriate basis functions and numerical quadrature leads to diagonal mass matrices which allow for…
The finite element method has become a preeminent simulation technique in electromagnetics. For problems involving anisotropic media and metamaterials, proper algorithms should be developed. It has been proved that discretizing in quadratic…
In this paper, we extend the classical quadrilateral based hierarchical Poincar\'e-Steklov (HPS) framework to triangulated geometries. Traditionally, the HPS method takes as input an unstructured, high-order quadrilateral mesh and relies on…
The performance of numerical micromagnetic models is limited by the demagnetizing field computation, which typically accounts for the majority of the computation time. For magnetization dynamics simulations explicit evaluation methods are…
We present a mass lumping approach based on an isogeometric Petrov-Galerkin method that preserves higher-order spatial accuracy in explicit dynamics calculations irrespective of the polynomial degree of the spline approximation. To…
The construction of finite element approximations in $\mathbf{H}(\mbox{div}, {\Omega})$ usually requires the Piola transformation to map vector polynomials from a master element to vector fields in the elements of a partition of the region…
The subspace approximation problem Subspace($k$,$p$) asks for a $k$-dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generalization of the least squares fit and uses the $\ell_{p}$ norm…
This paper serves as our first effort to develop a new triangular spectral element method (TSEM) on unstructured meshes, using the rectangle-triangle mapping proposed in the conference note [21]. Here, we provide some new insights into the…
We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…
We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…
In this paper, we study a generalized finite element method for solving second-order elliptic partial differential equations with rough coefficients. The method uses local approximation spaces computed by solving eigenvalue problems on…
In recent years, various subspace algorithms have been developed to handle large-scale optimization problems. Although existing subspace Newton methods require fewer iterations to converge in practice, the matrix operations and full…
We present an acceleration method for sequences of large-scale linear systems, such as the ones arising from the numerical solution of time-dependent partial differential equations coupled with algebraic constraints. We discuss different…
The Matrix Element Method is a promising multi-variate analysis tool which offers an optimal approach to compare theory and experiment according to the Neyman-Pearson lemma. However, until recently its usage has been limited by the fact…
Finite element methods usually construct basis functions and quadrature rules for multidimensional domains via tensor products of one-dimensional counterparts. While straightforward, this approach results in integration spaces larger than…
We consider the numerical approximation of Maxwell's equations in time domain by a second order $H(curl)$ conforming finite element approximation. In order to enable the efficient application of explicit time stepping schemes, we utilize a…
In this paper, we present a new polygonal finite element method, called the Zipped Finite Element Method, for star-shaped polygons. The proposed approach constructs high-order shape functions as linear combinations of standard finite…