Related papers: Efficient parameter-robust preconditioners for lin…
High-order implicit shock tracking (fitting) is a class of high-order numerical methods that use numerical optimization to simultaneously compute a high-order approximation to a conservation law solution and align elements of the…
This paper presents a scalable physics-based block preconditioner for mixed-dimensional models in beam-solid interaction and their application in engineering. In particular, it studies the linear systems arising from a regularized…
We present a scalable approach to solve a class of elliptic partial differential equation (PDE)-constrained optimization problems with bound constraints. This approach utilizes a robust full-space interior-point (IP)-Gauss-Newton…
The Poisson-Boltzmann equation offers an efficient way to study electrostatics in molecular settings. Its numerical solution with the boundary element method is widely used, as the complicated molecular surface is accurately represented by…
We present and analyze a class of nonsymmetric preconditioners within a normal (weighted least-squares) matrix form for use in GMRES to solve nonsymmetric matrix problems that typically arise in finite element discretizations. An example of…
For 2x2 block matrices, it is well-known that block-triangular or block-LDU preconditioners with an exact Schur complement (inverse) converge in at most two iterations for fixed-point or minimal-residual methods. Similarly, for saddle-point…
Compatible finite element discretisations for the atmospheric equations of motion have recently attracted considerable interest. Semi-implicit timestepping methods require the repeated solution of a large saddle-point system of linear…
We present parameter-robust preconditioners for linear systems that arise after applying static condensation to a hybridizable discontinuous Galerkin (HDG) discretization of the time-dependent Stokes problem. Building upon the theoretical…
This paper presents fast solvers for linear systems arising from the discretization of fractional nonlinear Schr\"odinger equations with Riesz derivatives and attractive nonlinearities. These systems are characterized by complex symmetry,…
We address the problem of preconditioning a sequence of saddle point linear systems arising in the solution of PDE-constrained optimal control problems via active-set Newton methods, with control and (regularized) state constraints. We…
This paper addresses the efficient solution of linear systems arising from curl-conforming finite element discretizations of $H(\mathrm{curl})$ elliptic problems with heterogeneous coefficients. We first employ the discrete form of a…
In this paper we analyze an optimization problem with limited observation governed by a convection--diffusion--reaction equation. Motivated by a Schur complement approach, we arrive at continuous norms that enable analysis of well-posedness…
We develop robust solvers for a class of perturbed saddle-point problems arising in the study of a second-order elliptic equation in mixed form (in terms of flux and potential), and of the four-field formulation of Biot's consolidation…
In this paper, we design robust and efficient linear solvers for the numerical approximation of solutions to Maxwell's equations with dissipative boundary conditions. We consider a structure-preserving finite-element approximation with…
We consider symmetric positive definite preconditioners for multiple saddle-point systems of block tridiagonal form, which can be applied within the MINRES algorithm. We describe such a preconditioner for which the preconditioned matrix has…
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 study fast iterative solvers for the solution of fourth order parabolic equations discretized by mixed finite element methods. We propose to use consistent mass matrix in the discretization and use lumped mass matrix to…
We study the solution of large symmetric positive-definite linear systems in a matrix-free setting with a limited iteration budget. We focus on the preconditioned conjugate gradient (PCG) method with spectral preconditioning. Spectral…
In this paper, we consider using Schur complements to design preconditioners for twofold and block tridiagonal saddle point problems. One type of the preconditioners are based on the nested (or recursive) Schur complement, the other is…
Unconditional guaranteed lower and upper eigenvalue bounds are mandatory for the understanding of the Schr\"odinger eigenvalue spectrum and its spectral gaps. While upper eigenvalue bounds are naturally induced by conforming…