Related papers: Stable Hermite transforms via the Golub-Welsch alg…
In an earlier paper, we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of $n$-by-$n$ matrices can be done by any algorithm in $O(n^{\omega +…
We develop the uniform sparse Fast Fourier Transform (usFFT), an efficient, non-intrusive, adaptive algorithm for the solution of elliptic partial differential equations with random coefficients. The algorithm is an adaption of the sparse…
We construct a family of embedded pairs for optimal strong stability preserving explicit Runge-Kutta methods of order $2 \leq p \leq 4$ to be used to obtain numerical solution of spatially discretized hyperbolic PDEs. In this construction,…
Calculating portions of eigenvalues and eigenvectors of matrices or matrix pencils has many applications. An approach to this calculation for Hermitian problems based on a density matrix has been proposed in 2009 and a software package…
We introduce an enriched analogue of Lam and Pylyavskyy's theory of set-valued $P$-partitions. An an application, we construct a $K$-theoretic version of Stembridge's Hopf algebra of peak quasisymmetric functions. We show that the symmetric…
We present a fast Jacobi-like algorithm for computing the eigenvalues, and optionally the eigenvectors, of a real normal matrix. The method gains a computational advantage by using Paardekooper's method for skew-symmetric matrices The…
The lattice Boltzmann method (LBM) is emerging as a powerful engineering tool for aeroacoustic computations. However, the LBM has been shown to present accuracy and stability issues in the medium-low Mach number range, that is of interest…
In this work we revisit the arithmetic and bit complexity of Hermitian eigenproblems. Recently, [BGVKS, FOCS 2020] proved that a (non-Hermitian) matrix can be diagonalized with a randomized algorithm in $O(n^{\omega}\log^2(n/\epsilon))$…
Many matching, tracking, sorting, and ranking problems require probabilistic reasoning about possible permutations, a set that grows factorially with dimension. Combinatorial optimization algorithms may enable efficient point estimation,…
This paper studies the problem of stability of a parameterized delay differential equations (DDE see equation (0.1)). After discretizing the DDE (0.1), we show that the problem can be equivalently casted into a semi-definite programming…
In this paper, we propose a new trigonometric interpolation algorithm and establish relevant convergent properties. The method adjusts an existing trigonometric interpolation algorithm such that it can better leverage Fast Fourier Transform…
In this paper, we propose a reflected forward-backward splitting algorithic framework for finding a zero of the sum of finitely many monotone op-erators, including maximally monotone operators, cocoercive operators, and monotone and…
We introduce novel techniques to enhance Frank-Wolfe algorithms by leveraging function smoothness beyond traditional short steps. Our study focuses on Frank-Wolfe algorithms with step sizes that incorporate primal-dual guarantees, offering…
We present Wavemoth, an experimental open source code for computing scalar spherical harmonic transforms (SHTs). Such transforms are ubiquitous in astronomical data analysis. Our code performs substantially better than existing publicly…
We present a reduction algorithm that simultaneously extends Hermite's reduction for rational functions and the Hermite-like reduction for hyperexponential functions. It yields a unique additive decomposition and allows to decide…
In this work, we propose and develop efficient and accurate numerical methods for solving the Kirchhoff-Love plate model in domains with complex geometries. The algorithms proposed here employ curvilinear finite-difference methods for…
Fourier matrices naturally appear in many applications and their stability is closely tied to performance guarantees of algorithms. The starting point of this article is a result that characterizes properties of an exponential system on a…
Ihe first author presented an efficient algorithm for computing involutive (and reduced Groebner) bases. In this paper, we consider a modification of this algorithm which simplifies matters to understand it and to implement. We prove…
In this paper, we study the $S$ transforms of Jacobi processes in the frameworks of free and finite free probability theories. We begin by deriving a partial differential equation satisfied by the free $S$ transform of the free Jacobi…
Many standard conversion matrices between coefficients in classical orthogonal polynomial expansions can be decomposed using diagonally-scaled Hadamard products involving Toeplitz and Hankel matrices. This allows us to derive…