Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “tensor 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 73 records · Page 4

Wave functions of multiquark hadrons from representations of the symmetry groups S n

Construction of the wave functions of multiquark hadrons by a traditional method based on the tensor products of colors, flavors, spins (and orbital) parts becomes quite complex when quark numbers grow n = 5 , 6 … 12 , as it gets difficult to satisfy the requirements of Fermi statistics. Our novel approach is focused directly on representations of the permutation symmetry generators. After showing how C 3 is manifested in the wave functions of (excited) baryons, we use it to construct the wave functions for a set of pentaquarks and hexaquarks ( n = 5 , 6 ). We also have some partial results for larger systems, with n = 9 and 12, and even beyond that as far as n = 24 . Published by the American Physical Society 2024

Miesch, Nicholas (ORCID:0000000205937535)↗

Loop-string-hadron approach to SU(3) lattice Yang-Mills theory: Hilbert space of a trivalent vertex

The construction of gauge-invariant states of SU(3) lattice gauge theories has garnered new interest in recent years, but implementing them is complicated by the need for SU(3) Clebsch-Gordon coefficients. In the loop-string-hadron (LSH) approach to lattice gauge theories, the elementary excitations are strictly gauge invariant, and constructing the basis requires no knowledge of Clebsch-Gordon coefficients. Originally developed for SU(2), the LSH formulation was recently generalized to SU(3), but limited to one spatial dimension. In this work, we generalize the LSH approach to constructing the basis of SU(3) gauge-invariant states at a trivalent vertex—the essential building block to multidimensional space. A direct generalization from the SU(2) vertex yields a legitimate basis; however, in certain sectors of the Hilbert space, the naive LSH basis vectors so defined suffer from being nonorthogonal. The issues with orthogonality are directly related to the “missing label” or “outer multiplicity” problem associated with SU(3) tensor products and may also be phrased in terms of Littlewood-Richardson coefficients or the need for a “seventh Casimir” operator. The states that are unaffected by the problem are orthonormalized in closed form. For the sectors that are afflicted, we discuss the nonorthogonal bases and their orthogonalization. A few candidates for seventh Casimir operators are readily constructed from the suite of LSH gauge-singlet operators. The diagonalization of a seventh Casimir represents one prescriptive solution toward obtaining a complete orthonormal basis, but a closed-form general solution remains to be found. Published by the American Physical Society 2025

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Fully Scalable Randomized Benchmarking Without Motion Reversal

We introduce , a protocol that streamlines traditional RB by using circuits consisting almost entirely of independent identically distributed (IID) layers of gates. BiRB reliably and efficiently extracts the average error rate of a Clifford gate set by sending tensor-product eigenstates of random Pauli operators through random circuits with IID layers. Unlike existing RB methods, BiRB does not use motion reversal circuits—i.e., circuits that implement the identity (or a Pauli) operator—which simplifies both the method and the theory proving its reliability. Furthermore, this simplicity enables scaling BiRB to many more qubits than the most widely used RB methods. Published by the American Physical Society 2024

Hines, Jordan (ORCID:0000000151267256)↗

Spectral Equivalence of Low-Order Discretizations for High-Order H(curl) and H(div) Spaces

In this paper, we present spectral equivalence results for high-order tensor product edge- and face-based finite elements for the H(curl) and H(div) function spaces. Specifically, we show for certain choices of shape functions that the mass and stiffness matrices of the high-order elements are spectrally equivalent to those for an assembly of low-order elements on the associated Gauss--Lobatto--Legendre mesh. Based on this equivalence, efficient preconditioners can be designed with favorable computational complexity. Numerical results are presented which confirm the theory and demonstrate the benefits of the equivalence results for overlapping Schwarz preconditioners.

97 MATHEMATICS AND COMPUTING↗

Analytic error analysis of cross section interpolation methods in nodal diffusion codes - I : Theory

This paper discusses two cross section interpolation methods commonly found in popular nodal codes; the partial derivatives and multiple tables models. The motivation for choosing a model, and thus a case matrix structure, is a trade off between accuracy and computational cost. Due to decades of experience, there are default structures that are sufficient for current light water reactor analysis. However, this is not necessarily the case for advanced reactor designs. Therefore, it is advantageous to understand the sources of error in cross section interpolation models so that the quality of a case matrix may be improved. A mathematical framework for these models is presented in this work that provides a more rigorous connection between the nuclear engineering field's cross section interpolation methods and the broader mathematical field of function approximation. The two cross section models examined in this paper were found to utilize Lagrange interpolation and are a subset of Lagrange tensor products. Classical results of Lagrange polynomial error analysis were then applied to the partial derivative and multiple tables models to derive expressions for the total point-wise error. The analytical results classify the total error into two parts: the model form error and interpolation error. Finally, based on our observations, a better foundation for improving the quality of a case matrix is proposed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A simple coin for a 2d entangled walk

We analyze the effect of a simple coin operator, built out of Bell pairs, in a 2d Discrete Quantum Random Walk (DQRW) problem. The specific form of the coin enables us to find analytical and closed form solutions to the recursion relations of the DQRW. The coin induces entanglement between the spin and position degrees of freedom, which oscillates with time and reaches a constant value asymptotically. We probe the entangling properties of the coin operator further, by two different measures. First, by integrating over the space of initial tensor product states, we determine the Entangling Power of the coin operator. Secondly, we compute the Generalized Relative Rényi Entropy between the corresponding density matrices for the entangled state and the initial pure unentangled state. Both the Entangling Power and Generalized Relative Rényi Entropy behaves similar to the entanglement with time. Finally, in the continuum limit, the specific coin operator reduces the 2d DQRW into two 1d massive fermions coupled to synthetic gauge fields, where both the mass term and the gauge fields are built out of the coin parameters.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Permutation-adapted complete and independent basis for atomic cluster expansion descriptors

In many recent applications, particularly in the field of atom-centered descriptors for interatomic potentials, tensor products of spherical harmonics have been used to characterize complex atomic environments. When coupled with a radial basis, the atomic cluster expansion (ACE) basis is obtained. However, symmetrization with respect to both rotation and permutation results in an overcomplete set of ACE descriptors with linear dependencies occurring within blocks of functions corresponding to particular generalized Wigner symbols. All practical applications of ACE employ semi-numerical constructions to generate a complete, fully independent basis. While computationally tractable, the resultant basis cannot be expressed analytically, is susceptible to numerical instability, and thus has limited reproducibility. Here we present a procedure for generating explicit analytic expressions for a complete and independent set of ACE descriptors. The procedure uses a coupling scheme that is maximally symmetric w.r.t. permutation of the atoms, exposing the permutational symmetries of the generalized Wigner symbols, and yields a permutation-adapted rotationally and permutationally invariant basis (PA-RPI ACE). Theoretical support for the approach is presented, as well as numerical evidence of completeness and independence. A summary of explicit enumeration of PA-RPI functions up to rank 6 and polynomial degree 32 is provided. The PA-RPI blocks corresponding to particular generalized Wigner symbols may be either larger or smaller than the corresponding blocks in the simpler rotationally invariant basis. Finally, we demonstrate that basis functions of high polynomial degree persist under strong regularization, indicating the importance of not restricting the maximum degree of basis functions in ACE models a priori.

74 ATOMIC AND MOLECULAR PHYSICS↗

Deterministic and Monte Carlo Nuclear Data Adjustment Methods [Slides]

For the Bayesian Monte Carlo methodology, a need to understand convergence of the posterior moments as a function of the number of parameter realizations is required. In high-dimensional systems, it can be very costly to sample entire parameter space and perform functional evaluation for every realization. Bayesian Monte Carlo allows one to relax the GLLS approximations of model linearity and prior/posterior PDF shape. The Bayesian Stochastic Collocation Method is a deterministic approach to “sample” the parameter space. It allows one to relax the GLLS approximations of model linearity and posterior PDF shape. Higher-order posterior moments (i.e., skewness, kurtosis, etc.) can be studied through polynomial expansion. Tensor product quadrature scales poorly and can use sparse grid quadrature methods.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Neutron (and other Particle) Transport at LANL: An Overview [Presentation]

For decades, Los Alamos National Laboratory has been at the forefront of neutron transport methods research and code development. One such code is PARTISN, the LANL parallel time-dependent discrete ordinate neutron transport code. In this presentation, we describe the various research efforts currently underway by the PARTISN and other code teams. Some examples of current research are a block automated mesh refinement scheme, the application of tensor trains to the discretized neutron transport equation, and GPU code porting. The block automated mesh refinement scheme uses cross section information to refine and coarsen the solution mesh to improve time to solution and reduce memory. The tensor train approach expresses discretized transport operators as tensor products of vectors and matrices to compress the size of linear systems being solved by transport codes. Rather than relying on matrix-free methods such as the transport sweep, we have access to an operator that can be inverted, reshaped, or manipulated algebraically. Finally, we describe how PARTISN is used, what problems we are looking to solve, and what the future holds for neutron transport at LANL. In addition to this, we briefly describe the various research efforts in other particle transport teams using both deterministic and Monte Carlo methods. In the presentation, we list possible opportunities for collaboration between the laboratory and faculty and students.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Preserving Superconvergence of Spectral Elements for Curved Domains [Slides]

Finite Element Methods (FEM) and Spectral Element Methods (SEM) are crucial for solving partial differential equations (PDEs) on complex geometries. SEM offers superior accuracy due to potential superconvergence for simple domains. Challenges persist for domains with curved boundaries, restricting SEM’s advantages in real-world applications. A proposed solution is the introduction of a novel strategy to enhance accuracy and maintain superconvergence of SEM in curved domains. The strategy includes a mesh-generation procedure with geometrically refined elements near curved boundaries and a post-processing phase using the Adaptive Extended Stencil Finite Element Method (AES-FEM). The method, named AES-FEM post-processed Spectral Element Method (ApSEM), aligns the accuracy of non-tensor-product elements with superconvergent spectral elements.

97 MATHEMATICS AND COMPUTING↗

Spectrally Stabilized Interface Capturing Formulation and Implementation in Nek5000/NekRS

This report documents the formulation of a novel level-set method for incompressible two-phase flows in the continuous Galerkin (CG) high order spectral element framework. The overall method hinges on a novel implementation of the spectral vanishing viscosity (SVV) operator for the stabilization of linear/non-linear hyperbolic problems. The multidimensional SVV convolution kernels, which in essence, have a similar effect as a high pass filter applied to the derivatives, are formulated by exploiting the tensor product form, analogous to the construction of the usual stiffness matrix system. The resulting kernels are directionally decoupled and ensure a linear, symmetric positive definite, elliptic matrix operator. The SVV formulation is demonstrated to provide a robust stabilizing mechanism through challenging linear and non-linear hyperbolic problems, including problems pertinent to the level-set formulation. The two-phase framework conceptualized herein is based on the conservative level-set (CLS) method which represents the interface between the fluids by the 0.5 iso-contour of the smoothed Heaviside function. The CLS method is augmented with a preconditioning procedure for interface normals using the signed distance function which precludes the manifestation of spurious oscillations in the vicinty of the interface. Further, the existing mixed explicit-implicit approach for the solution of Navier-Stokes equations in Nek5000, as described in Tomboulides et al, is augmented with a pressure coefficient splitting approach for the Poisson equation, which greatly accelerated the convergence of pressure solver for two-phase systems with large density ratio. The robustness and accuracy of the overall two-phase method is demonstrated through canonical challenging problems involving high density and viscosity ratios, with and without surface tension. The two-phase formulation is wholly implemented in Nek5000 and the SVV stabilization method is implemented in NekRS, which is the essential precursor to the two-phase framework, undergoing active development.

97 MATHEMATICS AND COMPUTING↗

Dimensionality Reduction with Variational Encoders Based on Subsystem Purification

Efficient methods for encoding and compression are likely to pave the way toward the problem of efficient trainability on higher-dimensional Hilbert spaces, overcoming issues of barren plateaus. Here, we propose an alternative approach to variational autoencoders to reduce the dimensionality of states represented in higher dimensional Hilbert spaces. To this end, we build a variational algorithm-based autoencoder circuit that takes as input a dataset and optimizes the parameters of a Parameterized Quantum Circuit (PQC) ansatz to produce an output state that can be represented as a tensor product of two subsystems by minimizing $Tr(ρ^2)$. The output of this circuit is passed through a series of controlled swap gates and measurements to output a state with half the number of qubits while retaining the features of the starting state in the same spirit as any dimension-reduction technique used in classical algorithms. The output obtained is used for supervised learning to guarantee the working of the encoding procedure thus developed. We make use of the Bars and Stripes (BAS) dataset for an 8 × 8 grid to create efficient encoding states and report a classification accuracy of 95% on the same. Thus, the demonstrated example provides proof for the working of the method in reducing states represented in large Hilbert spaces while maintaining the features required for any further machine learning algorithm that follows.

97 MATHEMATICS AND COMPUTING↗

Characterization of measurements in quantum communication

A characterization of quantum measurements by operator valued measures is presented. The generalized measurements include simultaneous approximate measurement of noncommuting observables. This characterization is suitable for solving problems in quantum communication. Two realizations of such measurements are discussed. The first is by adjoining an apparatus to the system under observation and performing a measurement corresponding to a self-adjoint operator in the tensor-product Hilbert space of the system and apparatus spaces. The second realization is by performing, on the system alone, sequential measurements that correspond to self-adjoint operators, basing the choice of each measurement on the outcomes of previous measurements. Simultaneous generalized measurements are found to be equivalent to a single finer grain generalized measurement, and hence it is sufficient to consider the set of single measurements. An alternative characterization of generalized measurement is proposed. It is shown to be equivalent to the characterization by operator-values measures, but it is potentially more suitable for the treatment of estimation problems. Finally, a study of the interaction between the information-carrying system and a measurement apparatus provides clues for the physical realizations of abstractly characterized quantum measurements.

Chan, V. W. S.↗

A tensor approach to modeling of nonhomogeneous nonlinear systems

Model following control methodology plays a key role in numerous application areas. Cases in point include flight control systems and gas turbine engine control systems. Typical uses of such a design strategy involve the determination of nonlinear models which generate requested control and response trajectories for various commands. Linear multivariable techniques provide trim about these motions; and protection logic is added to secure the hardware from excursions beyond the specification range. This paper reports upon experience in developing a general class of such nonlinear models based upon the idea of the algebraic tensor product.

Yurkovich, S.↗

Fitting multidimensional splines using statistical variable selection techniques

This report demonstrates the successful application of statistical variable selection techniques to fit splines. Major emphasis is given to knot selection, but order determination is also discussed. Two FORTRAN backward elimination programs using the B-spline basis were developed, and the one for knot elimination is compared in detail with two other spline-fitting methods and several statistical software packages. An example is also given for the two-variable case using a tensor product basis, with a theoretical discussion of the difficulties of their use.

Smith, P. L.↗

Curve fitting and modeling with splines using statistical variable selection techniques

The successful application of statistical variable selection techniques to fit splines is demonstrated. Major emphasis is given to knot selection, but order determination is also discussed. Two FORTRAN backward elimination programs, using the B-spline basis, were developed. The program for knot elimination is compared in detail with two other spline-fitting methods and several statistical software packages. An example is also given for the two-variable case using a tensor product basis, with a theoretical discussion of the difficulties of their use.

Smith, P. L.↗

Contouring Trivariate Data

In many applications, the data consist of discrete 3-D points at which one or more parameters are given. To display contours, the data are represented by a continuous function which is evaluated at any point as needed for contouring. Contouring results are presented which are applicable both to artitrarily spaced data and to data which lie on a topologically rectangular three dimensional grid. the contours are assumed to be described by 3-D display lists for viewing on a dynamic color graphics device; that is, they will not simply be projected into 2-D and viewed as a static image on a frame buffer. Dynamic viewing of color contours may be essential to the proper interpretation of results. The gridded data lie on a topologically rectangular grid although two or more nodes may be the same point. Parametric tensor product methods may be used to fit the gridded data and to generate the contours. Rectangular elements are convenient but not necessary. For example, there are other methods which are effective for contouring over tetrahedral elements.

Stead, S. E.↗