Related papers: An iterative solver for the HPS discretization app…
In this paper, we will consider an $hp$-finite elements discretization of a highly indefinite Helmholtz problem by some dG formulation which is based on the ultra-weak variational formulation by Cessenat and Depr\'{e}s. We will introduce an…
When solving linear systems arising from PDE discretizations, iterative methods (such as Conjugate Gradient, GMRES, or MINRES) are often the only practical choice. To converge in a small number of iterations, however, they have to be…
In this paper we are concerned with numerical methods for nonhomogeneous Helmholtz equations in inhomogeneous media. We design a least squares method for discretization of the considered Helmholtz equations. In this method, an auxiliary…
We propose in this paper a Proper Generalized Decomposition (PGD) solver for reduced-order modeling of linear elastodynamic problems. It primarily focuses on enhancing the computational efficiency of a previously introduced PGD solver based…
We consider filtered subspace iteration for approximating a cluster of eigenvalues (and its associated eigenspace) of a (possibly unbounded) selfadjoint operator in a Hilbert space. The algorithm is motivated by a quadrature approximation…
We present a monolithic hp space-time multigrid method (hp-STMG) for tensor-product space-time finite element discretizations of the incompressible Navier-Stokes equations. We employ mapped inf-sup stable pairs $\mathbb Q_{r+1}/\mathbb…
This paper introduces a discretization-accurate stopping criterion of symmetric iterative methods for solving systems of algebraic equations resulting from the finite element approximation. The stopping criterion consists of the evaluations…
In this article, we introduce a fast and memory efficient solver for sparse matrices arising from the finite element discretization of elliptic partial differential equations (PDEs). We use a fast direct (but approximate) multifrontal…
Nonlinear least-squares problems are a special class of unconstrained optimization problems in which their gradient and Hessian have special structures. In this paper, we exploit these structures and proposed a matrix-free algorithm with a…
In this article a unified approach to iterative soft-thresholding algorithms for the solution of linear operator equations in infinite dimensional Hilbert spaces is presented. We formulate the algorithm in the framework of generalized…
We provide an iterative solution approach for the indefinite Helmholtz equation discretised using finite elements, based upon a Hermitian Skew-Hermitian Splitting (HSS) iteration applied to the shifted operator, and prove that the iteration…
An implicit algorithm for solving the equations of general relativistic hydrodynamics in conservative form in three-dimensional axi-symmetry is presented. This algorithm is a direct extension of the pseudo-Newtonian implicit radiative…
In this paper, we present a fully discretized Calder\'{o}n Calculus for the two dimensional Helmholtz equation. This full discretization can be understood as highly non-conforming Petrov-Galerkin methods, based on two staggered grids of…
We present an indirect higher order boundary element method utilising NURBS mappings for exact geometry representation and an interpolation-based fast multipole method for compression and reduction of computational complexity, to counteract…
A new idea for iterative solution of the Helmholtz equation is presented. We show that the iteration which we denote WaveHoltz and which filters the solution to the wave equation with harmonic data evolved over one period, corresponds to a…
Scaling hyperparameter optimisation to very large datasets remains an open problem in the Gaussian process community. This paper focuses on iterative methods, which use linear system solvers, like conjugate gradients, alternating…
An exact discretization method is being developed for solving linear systems of ordinary fractional-derivative differential equations with constant matrix coefficients (LSOFDDECMC). It is shown that the obtained linear discrete system in…
We propose an adaptive multigrid preconditioning technology for solving linear systems arising from Discontinuous Petrov-Galerkin (DPG) discretizations. Unlike standard multigrid techniques, this preconditioner involves only trace spaces…
In this paper, we use an implicit two-derivative deferred correction time discretization approach and combine it with a spatial discretization of the discontinuous Galerkin spectral element method to solve (non-)linear PDEs. The resulting…
We consider the efficient solution of strongly elliptic partial differential equations with random load based on the finite element method. The solution's two-point correlation can efficiently be approximated by means of an…