Related papers: The eigenstructures of real (skew) circulant matri…
The Lie group SE(3) of isometric orientation preserving transformation is used for modeling multibody systems, robots, and Cosserat continua. The use of these models in numerical simulation and optimization schemes necessitates the…
The subject of Chapter 1 is GKK $\tau$-matrices and related topics. Chapter 2 is devoted to boundedly invertible collections of matrices, with applications to operator norms and spline approximation. Various structured matrices (Toeplitz,…
Building on previous work that provided analytical solutions to generalised matrix eigenvalue problems arising from numerical discretisations, this paper develops exact eigenvalues and eigenvectors for a broader class of $n$-dimensional…
This article is the first of a series of three presenting an alternative method to compute the one-loop scalar integrals. This novel method enjoys a couple of interesting features as compared with the method closely following 't Hooft and…
A common problem in cosmology is to integrate the product of two or more spherical Bessel functions (sBFs) with different configuration-space arguments against the power spectrum or its square, weighted by powers of wavenumber. Naively…
Real-valued transforms such as the discrete cosine, sine, and Hartley transforms play a central role in classical computing, complementing the Fourier transform in applications from signal and image processing to data compression. However,…
Computer simulation plays a central role in modern day materials science. The utility of a given computational approach depends largely on the balance it provides between accuracy and computational cost. Molecular crystals are a class of…
We discuss a generalization of the Cohn-Umans method, a potent technique developed for studying the bilinear complexity of matrix multiplication by embedding matrices into an appropriate group algebra. We investigate how the Cohn-Umans…
The discrete wavelet packet transform (DWPT) and discrete wavelet transform (DWT) are used to extract and study the dynamics of coherent structures in a turbulent rotating fluid. Three-dimensional (3D) turbulence is generated by strong…
We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear systems of equations with these matrices. We study four basic most popular classes, that is, Toeplitz, Hankel,…
A novel approach called Moate Simulation is presented to provide an accurate numerical evolution of probability distribution functions represented on grids arising from stochastic differential processes where initial conditions are…
We investigate the eigenstructure of matrix formulations used for modeling scattering processes within materials in transmission electron microscopy. Dynamical scattering is crucial for describing the interaction between an electron wave…
Structured canonical forms under unitary and suitable structure-preserving similarity transformations for normal and (skew-)Hamiltonian as well as normal and per(skew)-Hermitian matrices are proposed. Moreover, an algorithm for computing…
We extend to infinite dimensional separable Hilbert spaces the Schur convexity property of eigenvalues of a symmetric matrix with real entries. Our framework includes both the case of linear, selfadjoint, compact operators, and that of…
Based on the discrete fractional random transform (DFRNT), we present the discrete fractional random cosine and sine transforms (DFRNCT and DFRNST). We demonstrate that the DFRNCT and DFRNST can be regarded as special kinds of DFRNT and…
As the first component of SPARC (Simulation Package for Ab-initio Real-space Calculations), we present an accurate and efficient finite-difference formulation and parallel implementation of Density Functional Theory (DFT) for isolated…
The Exact Circular Pattern Matching (ECPM) problem consists of reporting every occurrence of a rotation of a pattern $P$ in a text $T$. In many real-world applications, specifically in computational biology, circular rotations are of…
Shor's algorithm for the prime factorization of numbers provides an exponential speedup over the best known classical algorithms. However, nontrivial practical applications have remained out of reach due to experimental limitations. The…
In this paper, we derive a family of fast and stable algorithms for multiplying and inverting $n \times n$ Pascal matrices that run in $O(n log^2 n)$ time and are closely related to De Casteljau's algorithm for B\'ezier curve evaluation.…
Motivated by a host of recent applications requiring some amount of redundancy, frames are becoming a standard tool in the signal processing toolbox. In this paper, we study a specific class of frames, known as discrete Fourier transform…