Search NASA⌕ Search

SEARCH · Search NASA

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.

At least 19 records

Faster Johnson–Lindenstrauss transforms via Kronecker products

The Kronecker product is an important matrix operation with a wide range of applications in signal processing, graph theory, quantum computing and deep learning. In this work, we introduce a generalization of the fast Johnson–Lindenstrauss projection for embedding vectors with Kronecker product structure, the Kronecker fast Johnson–Lindenstrauss transform (KFJLT). The KFJLT reduces the embedding cost by an exponential factor of the standard fast Johnson–Lindenstrauss transform’s cost when applied to vectors with Kronecker structure, by avoiding explicitly forming the full Kronecker products. Here, we prove that this computational gain comes with only a small price in embedding power: consider a finite set of $p$ points in a tensor product of $d$ constituent Euclidean spaces $\bigotimes _{k=d}^{1}{\mathbb{R}}^{n_k}$, and let $N = \prod _{k=1}^{d}n_k$. With high probability, a random KFJLT matrix of dimension $m \times N$ embeds the set of points up to multiplicative distortion $(1\pm \varepsilon )$ provided $m \gtrsim \varepsilon ^{-2} \, \log ^{2d - 1} (p) \, \log N$. We conclude by describing a direct application of the KFJLT to the efficient solution of large-scale Kronecker-structured least squares problems for fitting the CP tensor decomposition.

Kronecker structure↗

The Kronecker product in terms of Hubbard operators and the Clebsch–Gordan decomposition of SU(2)×SU(2)

We review the properties of the Kronecker (direct, or tensor) product of square matrices A⊗B⊗C⋯ in terms of Hubbard operators. In its simplest form, a Hubbard operator X{sub n}{sup i,j} can be expressed as the n-square matrix which has entry 1 in position (i,j) and zero in all other entries. The algebra and group properties of the observables that define a multipartite quantum system are notably straightforward in such a framework. In particular, we use the Kronecker product in Hubbard notation to get the Clebsch–Gordan decomposition of the product group SU(2)×SU(2). Finally, the n-dimensional irreducible representations so obtained are used to derive closed forms of the Clebsch–Gordan coefficients that rule the addition of angular momenta. Our results can be further developed in many different directions. -- Highlights: •The Kronecker product is studied in terms of Hubbard operators. •Complicated calculations involving large matrices are reduced to simple relations of subscripts. •The algebraic properties of the quantum observables of multipartite systems are studied. •The Clebsch–Gordan coefficients are given in terms of hypergeometric {sub 3}F{sub 2} functions. •The results can be further developed in many different directions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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.↗

Quantum Fourier transform revisited

Summary The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, we show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We analyze the implication of this Kronecker product structure on the discrete Fourier transform of rank‐1 tensors on a classical computer. We also explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer. Further, the connection between the matrix decomposition of the DFT matrix and a quantum circuit is made. We also discuss a natural extension of a radix‐2 QFT decomposition to a radix‐ d QFT decomposition. No prior knowledge of quantum computing is required to understand what is presented in this paper. Yet, we believe this paper may help readers to gain some rudimentary understanding of the nature of quantum computing from a matrix computation point of view.

Camps, Daan↗

Disturbance accommodating control design for wind turbines using solvability conditions

In this study, solvability conditions for disturbance accommodating control (DAC) have been discussed and applied on wind turbine controller design in above-rated wind speed to regulate rotor speed and to mitigate turbine structural loads. DAC incorporates a predetermined waveform model and uses it as part of the state-space formulation, which is known as the internal model principle to reduce or minimize the wind disturbance effects on the outputs of the wind turbine. An asymptotically stabilizing DAC controller with disturbance impact on the wind turbine being totally canceled out can be found if certain conditions are fulfilled. Designing a rotor speed regulation controller without steady-state error is important for applying linear control methodology such as DAC on wind turbines. Therefore, solvability conditions of DAC without steady-state error are attractive and can be taken as examples when designing a multitask turbine controller. DAC controllers solved via Moore-Penrose Pseudoinverse and the Kronecker product are discussed, and solvability conditions of using them are given. Additionally, a new solvability condition based on inverting the feed-through D term is proposed for the sake of reducing computational burden in the Kronecker product. Applications of designing collective pitch and independent pitch controllers based on DAC are presented. Recommendations of designing a DAC-based wind turbine controller are given. A DAC controller motivated by the proposed solvability condition that utilizes the inverse of feed-through D term is developed to mitigate the blade flapwise once-per-revolution bending moment together with a standard proportional integral controller in the control loop to assist rotor speed regulation. Simulation studies verify the discussed solvability conditions of DAC and show the effectiveness of the proposed DAC control design methodology.

17 WIND ENERGY↗

SU-G-TeP1-15: Toward a Novel GPU Accelerated Deterministic Solution to the Linear Boltzmann Transport Equation

Purpose: To develop a Graphic Processor Unit (GPU) accelerated deterministic solution to the Linear Boltzmann Transport Equation (LBTE) for accurate dose calculations in radiotherapy (RT). A deterministic solution yields the potential for major speed improvements due to the sparse matrix-vector and vector-vector multiplications and would thus be of benefit to RT. Methods: In order to leverage the massively parallel architecture of GPUs, the first order LBTE was reformulated as a second order self-adjoint equation using the Least Squares Finite Element Method (LSFEM). This produces a symmetric positive-definite matrix which is efficiently solved using a parallelized conjugate gradient (CG) solver. The LSFEM formalism is applied in space, discrete ordinates is applied in angle, and the Multigroup method is applied in energy. The final linear system of equations produced is tightly coupled in space and angle. Our code written in CUDA-C was benchmarked on an Nvidia GeForce TITAN-X GPU against an Intel i7-6700K CPU. A spatial mesh of 30,950 tetrahedral elements was used with an S4 angular approximation. Results: To avoid repeating a full computationally intensive finite element matrix assembly at each Multigroup energy, a novel mapping algorithm was developed which minimized the operations required at each energy. Additionally, a parallelized memory mapping for the kronecker product between the sparse spatial and angular matrices, including Dirichlet boundary conditions, was created. Atomicity is preserved by graph-coloring overlapping nodes into separate kernel launches. The one-time mapping calculations for matrix assembly, kronecker product, and boundary condition application took 452±1ms on GPU. Matrix assembly for 16 energy groups took 556±3s on CPU, and 358±2ms on GPU using the mappings developed. The CG solver took 93±1s on CPU, and 468±2ms on GPU. Conclusion: Three computationally intensive subroutines in deterministically solving the LBTE have been formulated on GPU, resulting in two orders of magnitude speedup. Funding support from Natural Sciences and Engineering Research Council and Alberta Innovates Health Solutions. Dr. Fallone is a co-founder and CEO of MagnetTx Oncology Solutions (under discussions to license Alberta bi-planar linac MR for commercialization).

60 APPLIED LIFE SCIENCES↗

Independent Blade Pitch Controller Design for a Three-Bladed Turbine Using Disturbance Accommodating Control

Two independent pitch controllers (IPCs) based on the disturbance accommodating control (DAC) algorithm are designed for the three-bladed Controls Advanced Research Turbine to regulate rotor speed and to mitigate blade root flapwise bending loads in above-rated wind speed. One of the DAC-based IPCs is designed based on a transformed symmetrical-asymmetrical (TSA) turbine model, with wind disturbances being modeled as a collective horizontal component and an asymmetrical linear shear component. Another DAC-based IPC is designed based on a multiblade coordinate (MBC) transformed turbine model, with a horizontal component and a vertical shear component being modeled as step waveform disturbance. Both of the DAC-based IPCs are found via a regulation equation solved by Kronecker product. Actuator dynamics are considered in the design processes to compensate for actuator phase delay. The simulation study shows the effectiveness of the proposed DAC-based IPCs compared to a proportional-integral (PI) collective pitch controller (CPC). Improvement on rotor speed regulation and once-per-revolution and twice-per-revolution load reductions has been observed in the proposed IPC designs.

17 WIND ENERGY↗

Deep Kronecker neural networks: A general framework for neural networks with adaptive activation functions

Here we propose a new type of neural networks, Kronecker neural networks (KNNs), that form a general framework for neural networks with adaptive activation functions. KNNs employ the Kronecker product, which provides an efficient way of constructing a very wide network while keeping the number of parameters low. Our theoretical analysis reveals that under suitable conditions, KNNs induce a faster decay of the loss than that by the feed-forward networks. This is also empirically verified through a set of computational examples. Furthermore, under certain technical assumptions, we establish global convergence of gradient descent for KNNs. As a specific case, we propose the Rowdy activation function that is designed to get rid of any saturation region by injecting sinusoidal fluctuations, which include trainable parameters. The proposed Rowdy activation function can be employed in any neural network architecture like feed-forward neural networks, Recurrent neural networks, Convolutional neural networks etc. The effectiveness of KNNs with Rowdy activation is demonstrated through various computational experiments including function approximation using feed-forward neural networks, solution inference of partial differential equations using the physics-informed neural networks, and standard deep learning benchmark problems using convolutional and fully-connected neural networks.

97 MATHEMATICS AND COMPUTING↗

Efficient generation of sum-of-products representations of high-dimensional potential energy surfaces based on multimode expansions

The transformation of multi-dimensional potential energy surfaces (PESs) from a grid-based multimode representation to an analytical one is a standard procedure in quantum chemical programs. Within the framework of linear least squares fitting, a simple and highly efficient algorithm is presented, which relies on a direct product representation of the PES and a repeated use of Kronecker products. It shows the same scalings in computational cost and memory requirements as the POTFIT approach. In comparison to customary linear least squares fitting algorithms, this corresponds to a speed-up and memory saving by several orders of magnitude. Different fitting bases are tested, namely, polynomials, B-splines, and distributed Gaussians. Benchmark calculations are provided for the PESs of a set of small molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods

In this study, we develop a new tensor-product based preconditioner for discontinuous Galerkin methods with polynomial degrees higher than those typically employed. This preconditioner uses an automatic, purely algebraic method to approximate the exact block Jacobi preconditioner by Kronecker products of several small, one-dimensional matrices. Traditional matrix-based preconditioners require O ( p 2d ) storage and O ( p 3d ) computational work, where p is the degree of basis polynomials used, and d is the spatial dimension. Our SVD-based tensor-product preconditioner requires O ( p d+1 ) storage, O ( p d+1 ) work in two spatial dimensions, and O ( p d+2 ) work in three spatial dimensions. Combined with a matrix-free Newton–Krylov solver, these preconditioners allow for the solution of DG systems in linear time in p per degree of freedom in 2D, and reduce the computational complexity from O ( p 9 ) to O ( p 5 ) in 3D. Numerical results are shown in 2D and 3D for the advection, Euler, and Navier–Stokes equations, using polynomials of degree up to p = 30. For many test cases, the preconditioner results in similar iteration counts when compared with the exact block Jacobi preconditioner, and performance is significantly improved for high polynomial degrees p .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MiniApp for Density Matrix Renormalization Group Hamiltonian Application Kernel

We present two miniapps that implement the core computational kernel of the DMRG++ application, a generic C++ code that implements the Density Matrix Renormalization Group (DMRG) algorithm. The DMRG++ core Kronecker multiplication kernel is formulated using a batched BLAS approach, with implementation that targets both multi-core CPUs using OpenMP and GPGPU using the MAGMA library. The kernel evaluates the matrix-vector multiplication of the target Hamiltonian matrix used in Lanczos algorithm for computing the lowest eigenvalue and eigenvector. The Hamiltonian matrix is expressed compactly as sums of Kronecker products of small dense matrices. We demonstrate improved performance of the miniapp on synthetic problem, and show the performance of the DMRG++ application using a plugin based on the miniapp. We also present an OpenMP miniapp that explores the use of nested parallel constructs to implement the Kronecker multiplication kernel, exploring the use of nested OpenMP worksharing and tasking abstractions to implement the multi-level parallel multiplication algorithm. The miniapp has been used as a co-design vehicle for evaluating features in the OpenMP-4.5 and upcoming OpenMP-5.0 standards.

Elwasif, Wael↗

Porting DMRG++ Scientific Application to OpenPOWER

With the rapidly changing microprocessor designs and architectural diversity (multi-cores, many-cores, accelerators) for the next generation HPC systems, scientific applications must adapt to the hardware, to exploit the different types of parallelism and resources available in the architecture. To get the benefit of all the in-node hardware threads, it is important to use a single programming model to map and coordinate the available work to the different heterogeneous execution units in the node (e.g., multi-core hardware threads (latency optimized), accelerators (bandwidth optimized), etc.).Our goal is to show that we can manage the node complexity of these systems by using OpenMP for in-node parallelization by exploiting different “programming styles” supported by OpenMP 4.5 to program CPU cores and accelerators. Finding out the suitable programming-style (e.g., SPMD style, multi-level tasks, accelerator programming, nested parallelism, or a combination of these) using the latest features of OpenMP to maximize performance and achieve performance portability across heterogeneous and homogeneous systems is still an open research problem.We developed a mini-application, Kronecker Product (KP), from the original DMRG++ application (sparse matrix algebra) computational motif to experiment with different OpenMP programming styles on an OpenPOWER architecture and present their results in this paper.

Chatterjee, Ronnie↗

An iris biometric protection scheme using 4D hyperchaotic system and modified equal modulus decomposition in hybrid multi resolution wavelet domain

In this paper, a hybrid iris biometric protection scheme using 4D hyperchaotic system by means of coherent superposition and modified equal modulus decomposition in hybrid multi-resolution wavelet domain is proposed. The 4D hyperchaotic framework is employed for producing the permutation keystream for pixel swap-over mechanism. The hybrid multi-resolution is produced by means of Kronecker product of Walsh transform and fractional Fourier transform of different orders. Fractional orders of the hybrid multiresolution wavelet along with the parameters and initial conditions of the 4D hyperchaotic framework, later fill in as additional keys, thus enhancing the key space of the proposed mechanism. The proposed scheme has nonlinear characteristics and has high robustness against brute-force attack attributable to its enormous key-space. Numerical simulations have been carried out on grayscale images to prove the authenticity and efficacy of the proposed cryptosystem. The functioning of the proposed cryptosystem is investigated against various attacks including special attack. Outcomes display that the proposed iris template protection scheme not only has higher robustness against noise attack but is also unassailable to the iterative transform-based attacks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spin multiplicities

The number of times spin s appears in the Kronecker product of n spin j representations is computed, and the large n asymptotic behavior of the result is obtained. Applications are briefly sketched.

group representations↗

The flavor group {delta}(6n{sup 2})

Many non-Abelian finite subgroups of SU(3) have been used to explain the flavor structure of the standard model. In order to systematize and classify successful models, a detailed knowledge of their mathematical structure is necessary. In this paper, we shall therefore look closely at the series of finite non-Abelian groups known as {delta}(6n{sup 2}), its smallest members being S{sub 3}(n=1) and S{sub 4}(n=2). For arbitrary n, we determine the conjugacy classes, the irreducible representations, the Kronecker products, as well as the Clebsch-Gordan coefficients.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficient real space formalism for hybrid density functionals

We present an efficient real space formalism for hybrid exchange-correlation functionals in generalized Kohn–Sham density functional theory (DFT). In particular, we develop an efficient representation for any function of the real space finite-difference Laplacian matrix by leveraging its Kronecker product structure, thereby enabling the time to solution of associated linear systems to be highly competitive with the fast Fourier transform scheme while not imposing any restrictions on the boundary conditions. We implement this formalism for both the unscreened and range-separated variants of hybrid functionals. We verify its accuracy and efficiency through comparisons with established planewave codes for isolated as well as bulk systems. In particular, we demonstrate up to an order-of-magnitude speedup in time to solution for the real space method. We also apply the framework to study the structure of liquid water using ab initio molecular dynamics, where we find good agreement with the literature. Overall, the current formalism provides an avenue for efficient real-space DFT calculations with hybrid density functionals.

Chemistry↗