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 19 records

MIONet: Learning Multiple-Input Operators via Tensor Product

As an emerging paradigm in scientific machine learning, neural operators aim to learn operators, via neural networks, that map between infinite-dimensional function spaces. Several neural operators have been recently developed. However, all the existing neural operators are only designed to learn operators defined on a single Banach space; i.e., the input of the operator is a single function. Here, for the first time, we study the operator regression via neural networks for multiple-input operators defined on the product of Banach spaces. We first prove a universal approximation theorem of continuous multiple-input operators. We also provide a detailed theoretical analysis including the approximation error, which provides guidance for the design of the network architecture. Based on our theory and a low-rank approximation, we propose a novel neural operator, MIONet, to learn multiple-input operators. MIONet consists of several branch nets for encoding the input functions and a trunk net for encoding the domain of the output function. Here, we demonstrate that MIONet can learn solution operators involving systems governed by ordinary and partial differential equations. In our computational examples, we also show that we can endow MIONet with prior knowledge of the underlying system, such as linearity and periodicity, to further improve accuracy.

97 MATHEMATICS AND COMPUTING↗

Parallel language constructs for tensor product computations on loosely coupled architectures

A set of language primitives designed to allow the specification of parallel numerical algorithms at a higher level is described. The authors focus on tensor product array computations, a simple but important class of numerical algorithms. They consider first the problem of programming one-dimensional kernel routines, such as parallel tridiagonal solvers, and then look at how such parallel kernels can be combined to form parallel tensor product algorithms.

Mehrotra, Piyush↗

Quantum Tensor-Product Decomposition from Choi-State Tomography

The Schmidt decomposition is the go-to tool for measuring bipartite entanglement of pure quantum states. Similarly, it is possible to study the entangling features of a quantum operation using its operator-Schmidt or tensor-product decomposition. While quantum technological implementations of the former are thoroughly studied, entangling properties on the operator level are harder to extract in the quantum computational framework because of the exponential nature of sample complexity. Here, we present an algorithm for unbalanced partitions into a small subsystem and a large one (the environment) to compute the tensor-product decomposition of a unitary the effect of which on the small subsystem is captured in classical memory, while the effect on the environment is accessible as a quantum resource. This quantum algorithm may be used to make predictions about operator nonlocality and effective open quantum dynamics on a subsystem, as well as for finding low-rank approximations and low-depth compilations of quantum circuit unitaries. We demonstrate the method and its applications on a time-evolution unitary of an isotropic Heisenberg model in two dimensions. Published by the American Physical Society 2024

Mansuroglu, Refik (ORCID:000000017352513X)↗

Tensor-Product Preconditioners for Higher-Order Space-Time Discontinuous Galerkin Methods

space-time discontinuous-Galerkin spectral-element discretization is presented for direct numerical simulation of the compressible Navier-Stokes equat ions. An efficient solution technique based on a matrix-free Newton-Krylov method is developed in order to overcome the stiffness associated with high solution order. The use of tensor-product basis functions is key to maintaining efficiency at high order. Efficient preconditioning methods are presented which can take advantage of the tensor-product formulation. A diagonalized Alternating-Direction-Implicit (ADI) scheme is extended to the space-time discontinuous Galerkin discretization. A new preconditioner for the compressible Euler/Navier-Stokes equations based on the fast-diagonalization method is also presented. Numerical results demonstrate the effectiveness of these preconditioners for the direct numerical simulation of subsonic turbulent flows.

Diosady, Laslo T.↗

Parallel language constructs for tensor product computations on loosely coupled architectures

Distributed memory architectures offer high levels of performance and flexibility, but have proven awkard to program. Current languages for nonshared memory architectures provide a relatively low level programming environment, and are poorly suited to modular programming, and to the construction of libraries. A set of language primitives designed to allow the specification of parallel numerical algorithms at a higher level is described. Tensor product array computations are focused on along with a simple but important class of numerical algorithms. The problem of programming 1-D kernal routines is focused on first, such as parallel tridiagonal solvers, and then how such parallel kernels can be combined to form parallel tensor product algorithms is examined.

Mehrotra, Piyush↗

Non-invertible symmetries and LSM-type constraints on a tensor product Hilbert space

We discuss the exact non-invertible Kramers-Wannier symmetry of 1+1d lattice models on a tensor product Hilbert space of qubits. This symmetry is associated with a topological defect and a conserved operator, and the latter can be presented as a matrix product operator. Importantly, unlike its continuum counterpart, the symmetry algebra involves lattice translations. Consequently, it is not described by a fusion category. In the presence of this defect, the symmetry algebra involving parity/time-reversal is realized projectively, which is reminiscent of an anomaly. Different Hamiltonians with the same lattice non-invertible symmetry can flow in their continuum limits to infinitely many different fusion categories (with different Frobenius-Schur indicators), including, as a special case, the Ising CFT. The non-invertible symmetry leads to a constraint similar to that of Lieb-Schultz-Mattis, implying that the system cannot have a unique gapped ground state. It is either in a gapless phase or in a gapped phase with three (or a multiple of three) ground states, associated with the spontaneous breaking of the lattice non-invertible symmetry.

Seiberg, Nathan (ORCID:000000033897046X)↗

Progress on a generalized coordinates tensor product finite element 3DPNS algorithm for subsonic

A generalized coordinates form of the penalty finite element algorithm for the 3-dimensional parabolic Navier-Stokes equations for turbulent subsonic flows was derived. This algorithm formulation requires only three distinct hypermatrices and is applicable using any boundary fitted coordinate transformation procedure. The tensor matrix product approximation to the Jacobian of the Newton linear algebra matrix statement was also derived. Tne Newton algorithm was restructured to replace large sparse matrix solution procedures with grid sweeping using alpha-block tridiagonal matrices, where alpha equals the number of dependent variables. Numerical experiments were conducted and the resultant data gives guidance on potentially preferred tensor product constructions for the penalty finite element 3DPNS algorithm.

Baker, A. J.↗

Small tensor product distributed active space (STP-DAS) framework for relativistic and non-relativistic multiconfiguration calculations: Scaling from 10 9 on a laptop to 10 12 determinants on a supercomputer

Despite the power and flexibility of configuration interaction (CI) based methods in computational chemistry, their broader application is limited by an exponential increase in both computational and storage requirements, particularly due to the substantial memory needed for excitation lists that are crucial for scalable parallel computing. Here, the objective of this work is to develop a new CI framework, namely, the small tensor product distributed active space (STP-DAS) framework, aimed at drastically reducing memory demands for extensive CI calculations on individual workstations or laptops, while simultaneously enhancing scalability for extensive parallel computing. Moreover, the STP-DAS framework can support various CI-based techniques, such as complete active space (CAS), restricted active space, generalized active space, multireference CI, and multireference perturbation theory, applicable to both relativistic (two- and four-component) and non-relativistic theories, thus extending the utility of CI methods in computational research. We conducted benchmark studies on a supercomputer to evaluate the storage needs, parallel scalability, and communication downtime using a realistic exact-two-component CASCI (X2C-CASCI) approach, covering a range of determinants from 10 9 to 10 12 . Additionally, we performed large X2C-CASCI calculations on a single laptop and examined how the STP-DAS partitioning affects performance.

Complete-active space self-consistent field↗

Tencoder: tensor-product encoder-decoder architecture for predicting solutions of PDEs with variable boundary data

It is widely hoped that artificial intelligence will boost data-driven surrogate models in science and engineering. However, fundamental spatial aspects of AI surrogate models remain under-studied. We investigate the ability of neural-network surrogate models to predict solutions to PDEs under variable boundary values. We do not wish to retrain the model when the boundary values change but to make them inputs to the model and infer the solution of the PDE under those boundary conditions. Such a capability is essential to making AI-based surrogate models practically useful. While simple feedforward networks are used for one-dimensional (1D) Poisson equation, an encoder-decoder architecture with a tensor-product layer is developed for the two-dimensional Poisson equation posed on a rectangular domain. We show that it is indeed possible to infer solutions to PDEs from variable boundary data using neural networks in this relatively simple setting, and point to future directions.

Kashi, Aditya↗

Algebraic grid generation using tensor product B-splines

Finite difference methods are more successful if the accompanying grid has lines which are smooth and nearly orthogonal. The development of an algorithm which produces such a grid when given the boundary description. Topological considerations in structuring the grid generation mapping are discussed. The concept of the degree of a mapping and how it can be used to determine what requirements are necessary if a mapping is to produce a suitable grid is examined. The grid generation algorithm uses a mapping composed of bicubic B-splines. Boundary coefficients are chosen so that the splines produce Schoenberg's variation diminishing spline approximation to the boundary. Interior coefficients are initially chosen to give a variation diminishing approximation to the transfinite bilinear interpolant of the function mapping the boundary of the unit square onto the boundary grid. The practicality of optimizing the grid by minimizing a functional involving the Jacobian of the grid generation mapping at each interior grid point and the dot product of vectors tangent to the grid lines is investigated. Grids generated by using the algorithm are presented.

Saunders, B. V.↗

Ground state of high-density matter

It is shown that if an upper bound to the false vacuum energy of the electroweak Higgs potential is satisfied, the true ground state of high-density matter is not nuclear matter, or even strange-quark matter, but rather a non-topological soliton where the electroweak symmetry is exact and the fermions are massless. This possibility is examined in the standard SU(3) sub C tensor product SU(2) sub L tensor product U(1) sub Y model. The bound to the false vacuum energy is satisfied only for a narrow range of the Higgs boson masses in the minimal electroweak model (within about 10 eV of its minimum allowed value of 6.6 GeV) and a somewhat wider range for electroweak models with a non-minimal Higgs sector.

Copeland, ED↗

Remarks on turbulent constitutive relations

The paper demonstrates that the concept of turbulent constitutive relations can be used to construct general models for various turbulent correlations. Some of the Generalized Cayley-Hamilton formulas for relating tensor products of higher extension to tensor products of lower extension are introduced. The combination of dimensional analysis and invariant theory can lead to 'turbulent constitutive relations' (or general turbulence models) for, in principle, any turbulent correlations. As examples, the constitutive relations for Reynolds stresses and scalar fluxes are derived. The results are consistent with ones from Renormalization Group (RNG) theory and two-scale Direct-Interaction Approximation (DIA) method, but with a more general form.

Shih, Tsan-Hsing↗

Multigrid Preconditioning for a Space-Time Spectral-Element Discontinuous-Galerkin Solver

In this work we examine a multigrid preconditioning approach in the context of a high- order tensor-product discontinuous-Galerkin spectral-element solver. We couple multigrid ideas together with memory lean and efficient tensor-product preconditioned matrix-free smoothers. Block ILU(0)-preconditioned GMRES smoothers are employed on the coarsest spaces. The performance is evaluated on nonlinear problems arising from unsteady scale- resolving solutions of the Navier-Stokes equations: separated low-Mach unsteady ow over an airfoil from laminar to turbulent ow. A reduction in the number of ne space iterations is observed, which proves the efficiency of the approach in terms of preconditioning the linear systems, however this gain was not reflected in the CPU time. Finally, the preconditioner is successfully applied to problems characterized by stiff source terms such as the set of RANS equations, where the simple tensor product preconditioner fails. Theoretical justification about the findings is reported and future work is outlined.

Franciolini, Matteo↗

Preserving Superconvergence of Spectral Elements for Curved Domains

Spectral element methods (SEM), extensions of finite element methods (FEM), have emerged as significant techniques for solving partial differential equations in physics and engineering. SEM can potentially deliver superior accuracy due to the potential superconvergence in nodal solutions for well-shaped tensor-product elements. However, the accuracy of SEM often degrades in complex geometries due to geometric inaccuracies near curved boundaries and the loss of superconvergence with simplicial or non-tensor-product elements. To overcome the first issue, we propose using geometric refinement, which both refines the mesh near high-curvature regions and increases the degree of geometric basis functions. We show that when using mixed-element meshes with tensor-product elements in the interior of the domain, curvature-based geometric refinement near boundaries can improve the accuracy of the interior elements by reducing pollution errors and preserving the superconvergence in nodal solutions. To address the second issue, we introduce ApSEM, a post-processing technique using the adaptive extended stencil finite element method (AES-FEM) to recover the accuracy near the curved boundaries. The combination of curvature-based geometric refinement and accurate post-processing offers an effective and easier-to-implement alternative to methods reliant on exact geometries. We demonstrate our techniques by solving the convection-diffusion equation in 2D and 3D and show up to two orders of magnitude of improvement in the solution accuracy, even when the elements are poorly shaped near boundaries. We also show the efficiency of ApSEM as it can recover superconvergence in nodal solutions without drastically increasing the computational cost.

97 MATHEMATICS AND COMPUTING↗

Preserving Superconvergence of Spectral Elements for Curved Domains via $h$ and $p$-Geometric Refinement

Spectral element methods (SEM), extensions of finite element methods (FEM), have emerged as significant techniques for solving partial differential equations in physics and engineering. SEM can potentially deliver superior accuracy due to the potential superconvergence in nodal solutions for well-shaped tensor-product elements. However, the accuracy of SEM often degrades in complex geometries due to geometric inaccuracies near curved boundaries and the loss of superconvergence with simplicial or non-tensor-product elements. To overcome the first issue, we propose using h- and p-geometric refinement, which refines the mesh near high-curvature regions and increases the degree of geometric basis functions, respectively. We show that when using mixed-element meshes with tensor-product elements in the interior of the domain, curvature-based geometric refinement near boundaries can improve the accuracy of the interior elements by reducing pollution errors and preserving the superconvergence in nodal solutions. To address the second issue, we introduce a post-processing technique using the adaptive extended stencil finite element method (AES-FEM) to recover the accuracy near the curved boundaries. The combination of curvature-based geometric refinement and accurate post-processing offers an effective and easier-to-implement alternative to methods reliant on exact geometries. We demonstrate our techniques by solving the convection-diffusion equation in 2D and show up to two orders of magnitude of improvement in the solution accuracy, even when the elements are poorly shaped near boundaries.

97 MATHEMATICS AND COMPUTING↗

Towards an Entropy Stable Spectral Element Framework for Computational Fluid Dynamics

Entropy stable (SS) discontinuous spectral collocation formulations of any order are developed for the compressible Navier-Stokes equations on hexahedral elements. Recent progress on two complementary efforts is presented. The first effort is a generalization of previous SS spectral collocation work to extend the applicable set of points from tensor product, Legendre-Gauss-Lobatto (LGL) to tensor product Legendre-Gauss (LG) points. The LG and LGL point formulations are compared on a series of test problems. Although being more costly to implement, it is shown that the LG operators are significantly more accurate on comparable grids. Both the LGL and LG operators are of comparable efficiency and robustness, as is demonstrated using test problems for which conventional FEM techniques suffer instability. The second effort generalizes previous SS work to include the possibility of p-refinement at non-conforming interfaces. A generalization of existing entropy stability machinery is developed to accommodate the nuances of fully multi-dimensional summation-by-parts (SBP) operators. The entropy stability of the compressible Euler equations on non-conforming interfaces is demonstrated using the newly developed LG operators and multi-dimensional interface interpolation operators.

Carpenter, Mark H.↗

Variable redundancy product codes.

Variable redundancy tensor product codes, discussing encoder modes implementation for adaptive coding and feedback transmission

Sollman, G. H.↗