搜索结果: 1-7 共查到“代数学 Arrays”相关记录7条 . 查询时间(0.046 秒)
Orthogonal Arrays Obtained By Generalized Kronecker Product
Orthogonal Arrays Obtained Generalized Kronecker Product
2015/3/20
Orthogonal Arrays Obtained By Generalized Kronecker Product.
An Algorithmic Approach to Constructing Mixed-level Orthogonal and Near-orthogonal Arrays
An Algorithmic Approach Constructing Mixed-level Orthogonal Near-orthogonal Arrays
2015/3/20
An Algorithmic Approach to Constructing Mixed-level Orthogonal and Near-orthogonal Arrays.
Dynamical light control in longitudinally modulated segmented waveguide arrays
ongitudinally modulated segmented waveguide arrays Dynamical light
2011/7/7
We address light propagation in segmented waveguide arrays where the refractive index is longitudinally modulated with an out-of-phase modulation in adjacent waveguides, so that the coupling strength ...
The Generalized Schur Decomposition and the rank-$R$ set of real $I\times J\times 2$ arrays
The Generalized Schur Decomposition the rank-$R$ set
2010/11/22
It is known that a best low-rank approximation to multi-way arrays or higher-order tensors may not exist. This is due to the fact that the set of multi-way arrays with rank at most $R$ is not closed....
Searching monotone multi-dimensional arrays
Search algorithm Complexity Partially ordered set Monotone multi-dimensional array
2012/11/30
A d-dimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d , a monotone increasing d-dimensional array with n entries along each...
A Simple Method for Constructing Orthogonal Arrays By the Kronecker Sum
Difference matrices Kronecker sum mixed-level orthogonal arrays permutation matrices projection matrices
2007/12/11
In this article, we propose a new general approach to constructing asymmetrical orthogonal arrays, namely the Kronecker sum. It is interesting since a lot of new mixed-level orthogonal arrays can be o...
In this paper we prove that the number of translation equivalence classes of linear recurring m-arrays over F_q with period (r,s) is(φ(rs))/(log_q(rs+1)), where φ is Euler function.