Related papers: Numerical Methods for the QCD Overlap Operator: II…
Since numbers in the computer are represented with a fixed number of bits, loss of accuracy during calculation is unavoidable. At high precision where more bits (e.g. 64) are allocated to each number, round-off errors are typically small.…
A hybrid Schwarz/multigrid method for spectral element solvers to the Poisson equation in $\mathbb R^2$ is presented. It extends the additive Schwarz method studied by J. Lottes and P. Fischer (J. Sci. Comput. 24:45--78, 2005) by…
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…
We implement the Numerical Unified Transform Method to solve the Nonlinear Schr\"odinger equation on the half-line. For so-called linearizable boundary conditions, the method solves the half-line problems with comparable complexity as the…
In this paper, we propose distributed solvers for systems of linear equations given by symmetric diagonally dominant M-matrices based on the parallel solver of Spielman and Peng. We propose two versions of the solvers, where in the first,…
In this paper, we present a structured solver based on the preconditioned conjugate gradient method (PCGM) for solving the linear quadratic (LQ) optimal control problem for $K \times N$ sub-systems connected in a two-dimensional (2D) grid…
Randomized linear system solvers have become popular as they have the potential to reduce floating point complexity while still achieving desirable convergence rates. One particularly promising class of methods, random sketching solvers,…
We present a novel approach for the numerical solution of problems of elastic scattering by open arcs in two dimensions. Our methodology relies on the composition of weighted versions of the classical operators associated with Dirichlet and…
In this paper, we present a preconditioned variant of the generalized successive overrelaxation (GSOR) iterative method for solving a broad class of complex symmetric linear systems. We study conditions under which the spectral radius of…
Solving a set of simultaneous linear equations is probably the most important topic in numerical methods. For solving linear equations, iterative methods are preferred over the direct methods especially when the coefficient matrix is…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
This paper solves the Sylvester equation in the form of AX+XB=C in a distributed way, and proposes three distributed continuous-time algorithms for three cases. We start with the basic algorithm for solving a least squares solution of the…
The multi-component nonlinear Schrodinger equation related to C.I=Sp(2p)/U(p) and D.III=SO(2p)/U(p)-type symmetric spaces with non-vanishing boundary conditions is solvable with the inverse scattering method (ISM). As Lax operator L we use…
We consider accelerated versions of the operator Sinkhorn iteration (OSI) for solving scaling problems for completely positive maps. Based on the interpretation of OSI as alternating fixed point iteration, it has been recently proposed to…
When solving PDEs, classical numerical solvers are often computationally expensive, while machine learning methods can suffer from spectral bias, failing to capture high-frequency components. Designing an optimal hybrid iterative…
In the present paper we concentrate on an important issue in constructing a good multigrid solver: the choice of an efficient smoother. We will introduce all-at-once multigrid solvers for optimal control problems which show robust…
We propose a practical formulation of the overlap Dirac operator in lattice QCD that employs the diagonal Kenney-Laub rational iterates - expressed via their partial fraction decomposition - to approximate the matrix sign function. We…
The numerical simulation of structural mechanics applications via finite elements usually requires the solution of large-size and ill-conditioned linear systems, especially when accurate results are sought for derived variables interpolated…
In this paper we present a novel extended Krylov subspace reduced-order modeling technique to efficiently simulate time- and frequency-domain wavefields in open complex structures. To simulate the extension to infinity, we use an optimal…
A q-Gauss-Newton algorithm is an iterative procedure that solves nonlinear unconstrained optimization problems based on minimization of the sum squared errors of the objective function residuals. Main advantage of the algorithm is that it…