相关论文: Random Generator of Orthogonal Matrices in Finite …
For prime powers q we use "strongly orthogonal" linear Sudoku solutions of order q^2 to construct ordered orthogonal arrays of type OOA (4,s,2,q), and for each q we present a range of values of s for which these constructions are valid.
Golay complementary sequences have been put a high value on the applications in orthogonal frequency-division multiplexing (OFDM) systems since its good peak-to-mean envelope power ratio(PMEPR) properties. However, with the increase of the…
In this paper we provide necessary and sufficient conditions for the mean square approximation of a random field with an ortho-martingale. The conditions are formulated in terms of projective criteria. Applications are given to linear and…
Our aim is to construct high order approximation schemes for general semigroups of linear operators $P_{t},t\geq 0$. In order to do it, we fix a time horizon $T $ and the discretization steps $h_{l}=\frac{T}{n^{l}},l\in \mathbb{N}$ and we…
We present a new construction of ordered orthogonal arrays (OOA) of strength $t$ with $(q + 1)t$ columns over a finite field $\mathbb{F}_{q}$ using linear feedback shift register sequences (LFSRs). OOAs are naturally related to $(t, m,…
In this paper we show how to construct a certain class of orthonormal bases in $L^2({\bf R}^d)$ starting from one or more Gabor orthonormal bases in $L^2({\bf R})$. Each such basis can be obtained acting on a single function…
In this paper we identify a new class of sparse near-quadratic random Boolean matrices that have full row rank over $\mathbb{F}_2=\{0,1\}$ with high probability and can be transformed into echelon form in almost linear time by a simple…
Orthogonal matrix has shown advantages in training Recurrent Neural Networks (RNNs), but such matrix is limited to be square for the hidden-to-hidden transformation in RNNs. In this paper, we generalize such square orthogonal matrix to…
In this paper an approach for finding a sparse incomplete Cholesky factor through an incomplete orthogonal factorization with Givens rotations is discussed and applied to Gaussian Markov random fields (GMRFs). The incomplete Cholesky factor…
Approximate matrix factorization techniques with both nonnegativity and orthogonality constraints, referred to as orthogonal nonnegative matrix factorization (ONMF), have been recently introduced and shown to work remarkably well for…
Assembling stiffness matrices represents a significant cost in many finite element computations. We address the question of optimizing the evaluation of these matrices. By finding redundant computations, we are able to significantly reduce…
Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…
We describe a method for constructing $n$-orthogonal coordinate systems in constant curvature spaces. The construction proposed is a modification of Krichever's method for producing orthogonal curvilinear coordinate systems in the…
In quantum algorithms discovered so far for simulating scattering processes in quantum field theories, state preparation is the slowest step. We present a new algorithm for preparing particle states to use in simulation of Fermionic Quantum…
We study the structure of the algebra of polynomial invariants for the usual conjugation action of the complex special, SO_n, and general, O_n, orthogonal group on the space of traceless n by n complex matrices. (Note that these two…
In this paper we define Ordered Generating System for finite non-abelian groups, which is a generalization of the basis theorem for finite abelian groups. We prove the following: If each composition factor of a group G has Ordered…
We present a methodology for parallel acceleration of learning in the presence of matrix orthogonality and unitarity constraints of interest in several branches of machine learning. We show how an apparently sequential elementary rotation…
Capacities on a finite set are sets functions vanishing on the empty set and being monotonic w.r.t. inclusion. Since the set of capacities is an order polytope, the problem of randomly generating capacities amounts to generating all linear…
We propose a novel method for the construction of orthogonal arrays. The algorithm makes use of the Kronecker Product operator in association with unit column vectors to generate new orthogonal arrays from existing orthogonal arrays. The…
This work presents an optimization method for the synthesis of finite state machines. The focus is on the reduction in the on-chip area and the cost of the circuit. A list of finite state machines from MCNC91 benchmark circuits have been…