Related papers: On preconditioning the self-consistent field itera…
We investigate numerically efficient approximations of eigenspaces associated to symmetric and general matrices. The eigenspaces are factored into a fixed number of fundamental components that can be efficiently manipulated (we consider…
Time-resolved electronic spectra can be obtained as the Fourier transform of a special type of time correlation function known as fidelity amplitude, which, in turn, can be evaluated approximately and efficiently with the dephasing…
In this work we focus on the preconditioning of a Galerkin space-time isogeometric discretization of the heat equation. Exploiting the tensor product structure of the basis functions in the parametric domain, we propose a preconditioner…
We propose a $1/N$ expansion of Starobinsky and Yokoyama's effective stochastic approach for light quantum fields on superhorizon scales in de Sitter spacetime. We explicitly compute the spectrum and the eigenfunctions of the Fokker-Planck…
The relaxed physical factorization (RPF) preconditioner is a recent algorithm allowing for the efficient and robust solution to the block linear systems arising from the three-field displacement-velocity-pressure formulation of coupled…
In this paper a sublinear time algorithm is presented for the reconstruction of functions that can be represented by just few out of a potentially large candidate set of Fourier basis functions in high spatial dimensions, a so-called…
We propose a new approximate factorization for solving linear systems with symmetric positive definite sparse matrices. In a nutshell the algorithm is to apply hierarchically block Gaussian elimination and additionally compress the fill-in.…
This paper presents an efficient Krylov subspace iterative solver for the three-dimensional (3D) Helmholtz equation with non-constant coefficients and absorbing boundary conditions, combining high-resolution compact schemes with low-order…
Large sparse linear algebraic systems can be found in a variety of scientific and engineering fields, and many scientists strive to solve them in an efficient and robust manner. In this paper, we propose an interpretable neural solver, the…
In this paper, we focus on solving a sequence of linear systems with an identical (or similar) coefficient matrix. For this type of problems, we investigate the subspace correction and deflation methods, which use an auxiliary matrix…
This paper deals with the fast solution of linear systems associated with the mass matrix, in the context of isogeometric analysis. We propose a preconditioner that is both efficient and easy to implement, based on a diagonal-scaled…
The rigorous solution to the grating diffraction problem is a cornerstone step in many scientific fields and industrial applications ranging from the study of the fundamental properties of metasurfaces to the simulation of photolithography…
We present a new class of preconditioned iterative methods for solving linear systems of the form $Ax = b$. Our methods are based on constructing a low-rank Nystr\"om approximation to $A$ using sparse random matrix sketching. This…
Efficiently modeling spatio-temporal (ST) physical processes and observations presents a challenging problem for the deep learning community. Many recent studies have concentrated on meticulously reconciling various advantages, leading to…
High frequency integral equation methodologies display the capability of reproducing single-scattering returns in frequency-independent computational times and employ a Neumann series formulation to handle multiple-scattering effects. This…
Recently, Garcke et al.[Garcke, Hinze, Kahle, A stable and linear time discretization for a thermodynamically consistent model for two-phase incompressible flow, Applied Numerical Mathematics 99, pp. 151-171, 2016] developed a consistent…
Implicit solvers for atmospheric models are often accelerated via the solution of a preconditioned system. For block preconditioners this typically involves the factorisation of the (approximate) Jacobian resulting from linearization of the…
We propose domain decomposition preconditioners for the solution of an integral equation formulation of forward and inverse acoustic scattering problems with point scatterers. We study both forward and inverse problems and propose…
In this paper we propose an efficiently preconditioned Newton method for the computation of the leftmost eigenpairs of large and sparse symmetric positive definite matrices. A sequence of preconditioners based on the BFGS update formula is…
This paper develops the preconditioning technique as a method to address the accuracy issue caused by ill-conditioning. Given a preconditioner $M$ for an ill-conditioned linear system $Ax=b$, we show that, if the inverse of the…