Related papers: Jacobi-accelerated FFT-based solver for smooth hig…
A new method is presented for solving Poisson's equation inside an open-ended rectangular pipe. The method uses Fast Fourier Transforms (FFTs) to perform mixed convolutions and correlations of the charge density with the Green function.…
The special unitary group SU(2) plays a fundamental role in the description of symmetries in quantum mechanics, theoretical physics, and spherical signal processing. In this paper, we address the computational challenges of performing…
Analytic methods are emerging in solid and configuration modeling, while providing new insights into a variety of shape and motion related problems by exploiting tools from group morphology, convolution algebras, and harmonic analysis.…
The well-known discrete Fourier transform (DFT) can easily be generalized to arbitrary nodes in the spatial domain. The fast procedure for this generalization is referred to as nonequispaced fast Fourier transform (NFFT). Various…
Guaranteed upper-lower bounds on homogenized coefficients, arising from the periodic cell problem, are calculated in a scalar elliptic setting. Our approach builds on the recent variational reformulation of the Moulinec-Suquet (1994) Fast…
We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…
A preconditioning framework for the coupled problem of frictional contact mechanics and fluid flow in the fracture network is presented. The porous medium is discretized using low-order continuous finite elements, with cell-centered…
Estimating camera geometry typically involves solving minimal problems formulated as systems of multivariate polynomial equations, which often pose computational challenges when using existing Gr\"obner-basis or resultant-based methods due…
We have applied the Fast Fourier transform (FFT), which allows to compute efficiently convolution sums, to solve the set of self-consistent T-matrix equations to get the Green function of the two dimensional attractive-U Hubbard modelbelow…
The hierarchical interpolative factorization for elliptic partial differential equations is a fast algorithm for approximate sparse matrix inversion in linear or quasilinear time. Its accuracy can degrade, however, when applied to strongly…
We extend the classical third-order Halley iteration to the setting of generalized equations of the form \[ 0 \in f(x) + F(x), \] where \(f\colon X\longrightarrow Y\) is twice continuously Fr\'echet-differentiable on Banach spaces and…
We present a spectrally accurate method for the rapid evaluation of free-space Stokes potentials, i.e. sums involving a large number of free space Green's functions. We consider sums involving stokeslets, stresslets and rotlets that appear…
Purpose: Recent developments in hardware design enable the use of Fast Field-Cycling (FFC) techniques in MRI to exploit the different relaxation rates at very low field strength, achieving novel contrast. The method opens new avenues for in…
In recent research, the parallel performances of sweeping-type algorithms for high-frequency time-harmonic wave problems have been improved by departing from standard layer-type domain decomposition and introducing a new sweeping strategy…
Extremely large-scale multiple-input-multipleoutput (XL-MIMO) has been reviewed as a promising technology for future sixth-generation (6G) networks to achieve higher performance. In practice, various linear precoding schemes, such as…
The numerical modeling of fracture contact thermo-poromechanics is crucial for advancing subsurface engineering applications, including CO2 sequestration, production of geo-energy resources, energy storage and wastewater disposal…
Purpose: Design of a preconditioner for fast and efficient parallel imaging and compressed sensing reconstructions. Theory: Parallel imaging and compressed sensing reconstructions become time consuming when the problem size or the number of…
The performance of multivariate kernel density estimation (KDE) depends strongly on the choice of bandwidth matrix. The high computational cost required for its estimation provides a big motivation to develop fast and accurate methods. One…
An integrated photonic circuit architecture to perform a modified-convolution operation based on the Discrete Fractional Fourier Transform (DFrFT) is introduced. This is accomplished by utilizing two nonuniformly-coupled waveguide lattices…
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…