Related papers: The eigenstructures of real (skew) circulant matri…
Motivated mainly by applications to partial differential equations with random coefficients, we introduce a new class of Monte Carlo estimators, called Toeplitz Monte Carlo (TMC) estimator for approximating the integral of a multivariate…
We establish the joint $*$-convergence of a random circulant matrix and a specific deterministic diagonal matrix. We also show that the empirical spectral distributions of skew-circulant and left skew-circulant random matrices converge…
We exploit the truncated singular value decomposition and the recently proposed circulant decomposition for an efficient first-order approximation of the multiplication of large dense matrices. A decomposition of each matrix into a sum of a…
Foundation models have achieved tremendous success in different domains. However, their huge computation and storage complexity make these models difficult to fine-tune and also less applicable in practice. Recent study shows training in…
In this paper, we present four constructions of {general} self-orthogonal matrix-product codes associated with Toeplitz matrices. The first one relies on the {dual} of a known {general} dual-containing matrix-product code; the second one is…
Cut-based directed graph (digraph) clustering often focuses on finding dense within-cluster or sparse between-cluster connections, similar to cut-based undirected graph clustering methods. In contrast, for flow-based clusterings the edges…
This paper presents an interesting property of the matrices that may be obtained with the use of direct Trefftz method. It is proved analytically for 2D Laplace problem that values of the elements of matrices describing the capacitance of…
A circulant weighing matrix $W = (w_{i,j})$ is a square matrix of order $n$ and entries $w_{i,j}$ in $\{0, \pm 1\}$ such that $WW^T=kI_n$. In his thesis, Strassler gave a table of existence results for such matrices with $n \leq 200$ and $k…
We present a class of symplectic matrices which transform by similarity given $2n\times 2n$ -dimensional matrix into Bunse-Gerstner form. If the given matrix is skew-Hamiltonian, the transformation gives a solution of an antisymmetric…
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classical computing there is another class of unitary transforms,…
This paper deals with the Elliptical Wishart and Inverse Elliptical Wishart distributions, which play a major role when handling covariance matrices. Similarly to multivariate elliptical distributions, these form a large family of…
Green technologies rely on green solvents and fluids. Among them, supercritical CO2 already finds many important applications. The molecular level understanding of the dynamics and structure of this supercritical fluid is a prerequisite to…
We present a general class of compressed sensing matrices which are then demonstrated to have associated sublinear-time sparse approximation algorithms. We then develop methods for constructing specialized matrices from this class which are…
Using Monte Carlo simulations on different system sizes we determine with high precision the critical thresholds of two families of directed percolation models on a square lattice. The thresholds decrease exponentially with the degree of…
This work deals with the numerical solution of systems of oscillatory second-order differential equations which often arise from the semi-discretization in space of partial differential equations. Since these differential equations exhibit…
In this paper we explore the practical use of the corner transfer matrix and its higher-dimensional generalization, the corner tensor, to develop tensor network algorithms for the classical simulation of quantum lattice systems of infinite…
Sine-skewed circular distributions are identifiable and have easily-computable trigonometric moments and a simple random number generation algorithm, whereas they are known to have relatively low levels of asymmetry. This study proposes a…
Discrete cosine transform (DCT) and other Fourier-related transforms have broad applications in scientific computing. However, off-the-shelf high-performance multi-dimensional DCT (MD DCT) libraries are not readily available in parallel…
New real structure-preserving decompositions are introduced to develop fast and robust algorithms for the (right) eigenproblem of general quaternion matrices. Under the orthogonally JRS-symplectic transformations, the Francis JRS-QR step…
A versatile method is described for the practical computation of the discrete Fourier transforms (DFT) of a continuous function $g(t)$ given by its values $g_{j}$ at the points of a uniform grid $F_{N}$ generated by conjugacy classes of…