Related papers: Jacobi-accelerated FFT-based solver for smooth hig…
We introduce a new general purpose multiresolution preconditioner for symmetric linear systems. Most existing multiresolution preconditioners use some standard wavelet basis that relies on knowledge of the geometry of the underlying domain.…
Vertex-patch smoothers are essential for the robust convergence of geometric multigrid methods in high-order finite element applications, yet their adoption is traditionally hindered by the prohibitive cost of solving local patch problems.…
One of the most efficient ways to produce unconditional simulations is with the kernel convolution using fast Fourier transform (FFT) [1]. However, when data is located on a surface, this approach is not efficient because data needs to be…
IFOSMONDI iterative algorithm for implicit co-simulation of coupled physical systems (introduced by the authors in july 2019 during the Simultech conference, p.176-186) enables us to solve the nonlinear coupling function while keeping the…
Preconditioning techniques are crucial for enhancing the efficiency of solving large-scale linear equation systems that arise from partial differential equation (PDE) discretization. These techniques, such as Incomplete Cholesky…
Numeric modeling of electromagnetics and acoustics frequently entails matrix-vector multiplication with block Toeplitz structure. When the corresponding block Toeplitz matrix is not highly sparse, e.g. when considering the electromagnetic…
The Fast Fourier Transform (FFT) is a computationally intensive digital signal processing (DSP) function widely used in applications such as imaging, software-defined radio, wireless communication, instrumentation. In this paper, a…
The fast Fourier transform, FFT, is a useful and prevalent algorithm in signal processing. It characterizes the spectral components of a signal, or is used in combination with other operations to perform more complex computations such as…
We give two algebro-geometric inspired approaches to fast algorithms for Fourier transforms in algebraic signal processing theory based on polynomial algebras in several variables. One is based on module induction and one is based on a…
Communication efficiency is a widely recognised research problem in Federated Learning (FL), with recent work focused on developing techniques for efficient compression, distribution and aggregation of model parameters between clients and…
An implicit causal space-time Galerkin scheme applied to the contrast current density volume integral equation gives rise to a marching-on-in-time scheme known as the MOT-JVIE, which is accelerated and stabilized via a fully embedded FIR…
We address a linear fractional differential equation and develop effective solution methods using algorithms for inversion of triangular Toeplitz matrices and the recently proposed QTT format. The inverses of such matrices can be computed…
Phase-field fracture models lead to variational problems that can be written as a coupled variational equality and inequality system. Numerically, such problems can be treated with Galerkin finite elements and primal-dual active set…
For the numerical solution of the Lippmann-Schwinger equation, while the pre-corrected trapezoidal rule converges with high-order for smooth compactly supported densities, it exhibits only the linear convergence in the case of discontinuity…
The Finitely Extensible Nonlinear Elastic (FENE) dumbbell model is a widely used mathematical model for complex fluids. Direct simulation of the FENE Fokker--Planck equation is computationally challenging due to high dimensionality and…
The reason why Cooley-Tukey Fast Fourier Transform (FFT) over $\mathbb{Q}$ can be efficiently implemented using complex roots of unity is that the cyclotomic extensions of the completion $\mathbb{R}$ of $\mathbb{Q}$ are at most quadratic,…
Bayesian inference, while foundational to probabilistic reasoning, is often hampered by the computational intractability of posterior distributions, particularly through the challenging evidence integral. Conventional approaches like Markov…
We discuss techniques for accelerating the self consistent field (SCF) iteration for solving the Kohn-Sham equations. These techniques are all based on constructing approximations to the inverse of the Jacobian associated with a fixed point…
The problem of barycentric Hermite interpolation is highly susceptible to overflows or underflows. In this paper, based on Sturm-Liouville equations for Jacobi orthogonal polynomials, we consider the fast implementation on the second…
A fluid-structure interaction (FSI) problem is solved via a monolithic coupling of the fluid, structure, and geometry subproblems. The iterative GMRES solver is accelerated with the FaCSI block preconditioner. In the FaCSI factorization,…