Related papers: Multigrid p-Robustness at Jacobi Speeds: Efficient…
Efficient solution of 3D elasticity problems is an important part of many industrial and scientific applications. Smoothed aggregation algebraic multigrid using rigid body modes for the tentative prolongation operator construction is an…
This paper presents efficient data structures for the implementation of matrix-free finite element methods on block-structured, hybrid tetrahedral grids. It provides a complete categorization of all geometric sub-objects that emerge from…
Recently, the authors have proposed and analyzed isogeometric tearing and interconnecting (IETI-DP) solvers for multi-patch discretizations in Isogeometric Analysis. Conforming and discontinuous Galerkin settings have been considered. In…
In this paper, we propose an innovative isogeometric low-rank solver for the linear elasticity model problem, specifically designed to allow multipatch domains. Our approach splits the domain into subdomains, each formed by the union of…
The first order condition of the constrained minimization problem leads to a saddle point problem. A multigrid method using a multiplicative Schwarz smoother for saddle point problems can thus be interpreted as a successive subspace…
A multigrid method for the Stokes system discretized with an Hdiv-conforming discontinuous Galerkin method is presented. It acts on the combined velocity and pressure spaces and thus does not need a Schur complement approximation. The…
The transfer-matrix technique is a convenient way for studying strip lattices in the Potts model since the compu- tational costs depend just on the periodic part of the lattice and not on the whole. However, even when the cost is reduced,…
We develop efficient and high-order accurate solvers for the Helmholtz equation on complex geometry. The schemes are based on the WaveHoltz algorithm which computes solutions of the Helmholtz equation by time-filtering solutions of the wave…
Simulating and developing large rectangularly shaped arrays with equidistant interspacing is challenging as the computational complexity grows quickly with array size. However, the geometrical shape of the array, appropriately meshed, leads…
A numerical algorithm for solving mantle convection problems with strongly variable viscosity is presented. Equations for conservation of mass and momentum for highly viscous and incompressible fluids are solved iteratively by a multigrid…
We propose a novel a posteriori error estimator for conforming finite element discretizations of two- and three-dimensional Helmholtz problems. The estimator is based on an equilibrated flux that is computed by solving patchwise mixed…
The paper describes a numerical method for solving acoustic multibody scattering problems in two and three dimensions. The idea is to compute a highly accurate approximation to the scattering operator for each body through a local…
The computational efficiency and rapid convergence of fast Fourier transform (FFT)-based solvers render them a powerful numerical tool for periodic cell problems in multiscale modeling. On regular grids, they tend to outperform traditional…
In geometry processing, numerical optimization methods often involve solving sparse linear systems of equations. These linear systems have a structure that strongly resembles to adjacency graphs of the underlying mesh. We observe how…
Stencil computations consume a major part of runtime in many scientific simulation codes. As prototypes for this class of algorithms we consider the iterative Jacobi and Gauss-Seidel smoothers and aim at highly efficient parallel…
Recent hardware-aware matrix-free algorithms for higher-order finite-element (FE) discretized matrix-vector multiplications reduce floating point operations and data access costs compared to traditional sparse matrix approaches. This work…
This work presents and compares efficient implementations of high-order discontinuous Galerkin methods: a modal matrix-free discontinuous Galerkin (DG) method, a hybridizable discontinuous Galerkin (HDG) method, and a primal formulation of…
We analyze the bit complexity of efficient algorithms for fundamental optimization problems, such as linear regression, $p$-norm regression, and linear programming (LP). State-of-the-art algorithms are iterative, and in terms of the number…
We propose a space-efficient algorithm for hidden surface removal that combines one of the fastest previous algorithms for that problem with techniques based on bit manipulation. Such techniques had been successfully used in other settings,…
We present an efficient numerical method, inspired by transformation optics, for solving the Poisson equation in complex and arbitrarily shaped geometries. The approach operates by mapping the physical domain to a uniform computational…