The index of comma freedom in kronecker product code dictionaries
Index of comma freedom in Kronecker product code dictionaries - information processing
INFORMATION PROCESSING↗
SEARCH · Engineering Papers
Results for “Kronecker Product”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Coherent States for Kronecker Products of Non Compact Groups: Formulation and Applications
We introduce and study the properties of a class of coherent states for the group SU(1,1) X SU(1,1) and derive explicit expressions for these using the Clebsch-Gordan algebra for the SU(1,1) group. We restrict ourselves to the discrete series representations of SU(1,1). These are the generalization of the 'Barut Girardello' coherent states to the Kronecker Product of two non-compact groups. The resolution of the identity and the analytic phase space representation of these states is presented. This phase space representation is based on the basis of products of 'pair coherent states' rather than the standard number state canonical basis. We discuss the utility of the resulting 'bi-pair coherent states' in the context of four-mode interactions in quantum optics.
Bambah, Bindu A.↗
A generalized technique for spectral analysis
Generalized spectral analysis method implementing orthogonal transformations through Kronecker product representation and matrix factorization
Andrews, H. C.↗
Partitioning sparse matrices with eigenvectors of graphs
The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.
Pothen, Alex↗
Complexity of Kronecker Operations on Sparse Matrices with Applications to the Solution of Markov Models
We present a systematic discussion of algorithms to multiply a vector by a matrix expressed as the Kronecker product of sparse matrices, extending previous work in a unified notational framework. Then, we use our results to define new algorithms for the solution of large structured Markov models. In addition to a comprehensive overview of existing approaches, we give new results with respect to: (1) managing certain types of state-dependent behavior without incurring extra cost; (2) supporting both Jacobi-style and Gauss-Seidel-style methods by appropriate multiplication algorithms; (3) speeding up algorithms that consider probability vectors of size equal to the "actual" state space instead of the "potential" state space.
Buchholz, Peter↗
A Three-Dimensional Variational Data Assimilation Scheme for the Regional Ocean Modeling System: Implementation and Basic Experiments
A three-dimensional variational data assimilation scheme for the Regional Ocean Modeling System (ROMS), named ROMS3DVAR, has been described in the work of Li et al. (2008). In this paper, ROMS3DVAR is applied to the central California coastal region, an area characterized by inhomogeneity and anisotropy, as well as by dynamically unbalanced flows. A method for estimating the model error variances from limited observations is presented, and the construction of the inhomogeneous and anisotropic error correlations based on the Kronecker product is demonstrated. A set of single observation experiments illustrates the inhomogeneous and anisotropic error correlations and weak dynamic constraints used. Results are presented from the assimilation of data gathered during the Autonomous Ocean Sampling Network (AOSN) experiment during August 2003. The results show that ROMS3DVAR is capable of reproducing complex flows associated with upwelling and relaxation, as well as the rapid transitions between them. Some difficulties encountered during the experiment are also discussed.
California coastal ocean↗
Kronecker matrices, computer implementation, and generalized spectra
Closed product form and simplified algorithm for efficient operation of generalized Kronecker matrices, considering role in spectral analysis
Andrews, H. C.↗
A simple algorithm for computing canonical forms
It is well known that all linear time-invariant controllable systems can be transformed to Brunovsky canonical form by a transformation consisting only of coordinate changes and linear feedback. However, the actual procedures for doing this have tended to be overly complex. The technique introduced here is envisioned as an on-line procedure and is inspired by George Meyer's tangent model for nonlinear systems. The process utilizes Meyer's block triangular form as an intermedicate step in going to Brunovsky form. The method also involves orthogonal matrices, thus eliminating the need for the computation of matrix inverses. In addition, the Kronecker indices can be computed as a by-product of this transformation so it is necessary to know them in advance.
Ford, H.↗