Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Tensor”

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 649 records · Page 36

Aerodynamic Sensitivities over Separable Shape Tensors

Here, we present a comprehensive aerodynamic sensitivity analysis of airfoil parameterization informed by separable shape tensors. This parameterization approach uniquely benefits the design process by isolating various well-studied shape characteristics, such as airfoil thickness, and providing a well-regulated low-dimensional parameter domain for aerodynamic designs. Exploring the aerodynamic sensitivities of this novel parameterization can provide valuable insights for more robust designs and future manufacturing efforts. We construct a data-driven parameter space of airfoils using principal geodesic analysis of separable shape tensors informed by a curated database containing almost 20,000 suitable engineering airfoils. Analyzing the shape reconstruction error and the maximum mean discrepancy between joint distributions of aerodynamic quantities, we study the dimensionality of the learned parameter space. This simple numerical experiment demonstrates a dramatic dimension reduction that retains design effectiveness and promotes regularity of the shape representations. Finally, we generate new airfoils and use the HAM2D Reynolds-averaged Navier–Stokes solver to predict lift, drag, and moment coefficients. We compute multiple sensitivity metrics to quantify and assert the consistency of parameter influence on the aerodynamic quantities. We also explore low-dimensional polynomial ridge approximations to motivate physical intuitions and offer explanations of the approximated sensitivities.

17 WIND ENERGY↗

Thermal Radiation Transport with Tensor Trains

We present a novel tensor network algorithm to solve the time-dependent, gray thermal radiation transport equation. The method invokes a tensor train (TT) decomposition for the specific intensity. The efficiency of this approach is dictated by the rank of the decomposition. When the solution is “low rank,” the memory footprint of the specific intensity solution vector may be significantly compressed. The algorithm, following a step-then-truncate approach of a traditional discrete ordinates method, operates directly on the compressed state vector, thereby enabling large speedups for low-rank solutions. To achieve these speedups, we rely on a recently developed rounding approach based on the Gram-SVD. We detail how familiar S N algorithms for (gray) thermal transport can be mapped to this TT framework and present several numerical examples testing both the optically thick and thin regimes. The TT framework finds low-rank structure and supplies up to ≃60× speedups and ≃1000× compressions for problems demanding large angle counts, thereby enabling previously intractable SN calculations and supplying a promising avenue to mitigate ray effects.

79 ASTRONOMY AND ASTROPHYSICS↗

Tensor Extraction of Latent Features (TELF)

Tensor ELF is a user-friendly parallel tensor decomposition Python toolbox that includes a suite of machine learning algorithms for CPU and GPU architectures for the analysis of sparse and dense data including utility tools for pre-processing and post-processing.

Eren, Maksim↗

Analytical effective tensor for flow-through composites

A machine, method and computer-usable medium for modeling an average flow of a substance through a composite material. Such a modeling includes an analytical calculation of an effective tensor K.sup.a suitable for use with a variety of media. The analytical calculation corresponds to an approximation to the tensor K, and follows by first computing the diagonal values, and then identifying symmetries of the heterogeneity distribution. Additional calculations include determining the center of mass of the heterogeneous cell and its angle according to a defined Cartesian system, and utilizing this angle into a rotation formula to compute the off-diagonal values and determining its sign.

42 ENGINEERING↗

Tensor Network Quantum Virtual Machine (TNQVM)

There is a lack of state-of-the-art quantum computing simulation software that scales on heterogeneous systems like Titan. Tensor Network Quantum Virtual Machine (TNQVM) provides a quantum simulator that leverages a distributed network of GPUs to simulate quantum circuits in a manner that leverages recent results from tensor network theory.

McCaskey, Alexander J.↗

Tensor-Dictionary Learning with Deep Kruskal-Factor Analysis

We introduce new dictionary learning methods for tensor-variate data of any order. We represent each data item as a sum of Kruskal decomposed dictionary atoms within the framework of beta-process factor analysis (BPFA). Our model is nonparametric and can infer the tensor-rank of each dictionary atom. This Kruskal-Factor Analysis (KFA) is a natural generalization of BPFA. We also extend KFA to a deep convolutional setting and develop online learning methods. We test our approach on image processing and classification tasks achieving state of the art results for 2D & 3D inpainting and Caltech 101. The experiments also show that atom-rank impacts both overcompleteness and sparsity.

Stevens, Andrew J.↗

On the Feasibility of Using Reduced-Precision Tensor Core Operations for Graph Analytics

Today’s data-driven analytics and machine learning workload have been largely driven by the General-PurposeGraphics Processing Units (GPGPUs). To accelerate dense matrix multiplications on the GPUs, Tensor Core Units (TCUs) have been introduced in recent years. In this paper, we study linear-algebra-based and vertex-centric algorithms for various graph kernels on the GPUs with an objective of applying this new hardware feature to graph applications. We identify the potential stages in these graph kernels that can be executed on the Tensor Core Units. In particular, we leverage the reformulation of the reduction and scan operations in terms of matrix multiplication [1]on the TCUs. We demonstrate that executing these operations on the TCUs, available inside different graph kernels, can assist in establishing an end-to-end pipeline on the GPGPUs without depending on hand-tuned external libraries and still can deliver comparable performance for various graph analytics.

Graph algorithms, GPU computing↗

Generic, Sparse Tensor Core for Neural Networks

Sparse neural network attracts more attention for model compression, fast execution, and power reduction. The state-of-the-art designed sparse tensor core for structured and static sparsity, which did not support well for generic or dynamic sparsity. We design a sparse tensor core to support generic sparsity pruning with a novel hybrid and blocked sparse matrix storage format, HB-ELL, which saves computation and storage while keeping the most significant elements, as well as supporting dynamic sparsity for data flow in neural networks. We achieve better performance with preliminary results than the state-of- the-art on an NVIDIA GPU simulator.

Wu, Xiaolong↗

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., algebraically smallest, eigenvalue of an infinite dimensional tensor eigenvalue problem, $H x = \lambda x$, where the infinite dimensional symmetric matrix $H$ exhibits a translational invariant structure. We assume the smallest eigenvalue of $H$ is simple and apply a power iteration of $e^{-H}$ with the eigenvector represented in a compact way as a translational invariant infinite Tensor Ring (iTR). Hence, the infinite dimensional eigenvector can be represented by a finite number of iTR cores of finite rank. In order to implement this power iteration, we use a small parameter $t$ so that the infinite matrix-vector operation $e^{-Ht}x$ can efficiently be approximated by the Lie product formula, also known as Suzuki--Trotter splitting, and we employ a low rank approximation through a truncated singular value decomposition on the iTR cores in order to keep the cost of subsequent power iterations bounded. We also use an efficient way for computing the iTR Rayleigh quotient and introduce a finite size iTR residual which is used to monitor the convergence of the Rayleigh quotient and to modify the timestep $t$. In this paper, we discuss 2 different implementations of the flexible power algorithm and illustrate the automatic timestep adaption approach for several numerical examples.

Beeumen, Roel Van↗

From tensors to qubits

We discuss recent progress in Tensor Lattice Field Theory and economical, symmetry preserving, truncations suitable for quantum computations or simulations. We focus on spin and gauge models with continuous Abelian symmetries such as the Abelian Higgs model and emphasize noise-robust implementations of Gauss's law. We discuss recent progress concerning the comparison between field digitizations and character expansions, symmetry breaking in tensor language, wave-packet preparation and possible new implementations of Abelian models using Rydberg atoms.

Meurice, Yannick↗

Tensor networks for High Energy Physics: contribution to Snowmass 2021

Tensor network methods are becoming increasingly important for high-energy physics, condensed matter physics and quantum information science (QIS). We discuss the impact of tensor network methods on lattice field theory, quantum gravity and QIS in the context of High Energy Physics (HEP). These tools will target calculations for strongly interacting systems that are made difficult by sign problems when conventional Monte Carlo and other importance sampling methods are used. Further development of methods and software will be needed to make a significant impact in HEP. We discuss the roadmap to perform quantum chromodynamics (QCD) related calculations in the coming years. The research is labor intensive and requires state of the art computational science and computer science input for its development and validation. We briefly discuss the overlap with other science domains and industry.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Nucleon Tensor Charge from Collins Azimuthal Asymmetry Measurements

We investigate the nucleon tensor charge from current experiments by a combined analysis of the Collins asymmetries in two hadron production in e+e? annihilations and single inclusive hadron production in deep inelastic scattering processes. The transverse momentum dependent evolution is taken into account, for the first time, in the global fit of the Collins fragmentation functions and the quark transversity distributions at the approximate next-to-leading logarithmic order. We obtain the nucleon tensor charge contribution from up and down quarks as: ?u=+0.30+0.12?0.11 and ?d=?0.20+0.35?0.13 at 90\% of confidence level for momentum fraction 0.0065?xB?0.35 and Q2= 10 GeV2.

Prokudin, A.↗

Gauge-invariant TMD factorization for Drell-Yan hadronic tensor at small x

The Drell-Yan hadronic tensor for electromagnetic (EM) current in the Sudakov region s?Q2?q2? is obtained with 1Q2 accuracy. In the leading order in Nc the higher-twist quark-quark-gluon TMDs reduce to leading-twist TMDs due to QCD equation of motion. The resulting tensor for unpolarized hadrons is EM gauge-invariant and depends on two leading-twist TMDs: f1 responsible for total DY cross section, and Boer-Mulders function h?1. The order-of-magnitude estimates of angular distributions for DY process seem to agree with LHC results at corresponding kinematics.

Balitsky, Ian↗

Phenomenology of Transverse Spin: Nucleon Tensor Charge Determination

We will discuss the present status of the Phenomenology of Transverse spin. In particular we will illustrate the first extraction of the nucleon tensor charge from current experiments by a combined analysis of the Collins asymmetries in two hadron production in $e^+e^-$ annihilations and single inclusive hadron production in deep inelastic scattering processes. The transverse momentum dependent evolution is taken into account, for the first time, in the global fit of the Collins fragmentation functions and the quark transversity distributions at the approximate next-to-leading logarithmic order. We obtain the nucleon tensor charge contribution from up and down quarks as: $\delta u=+0.30^{+0.12}_{-0.11}$ and $\delta d=-0.20_{-0.13}^{+0.35}$ at 90\% of confidence level for momentum fraction $0.0065 \le x_B \le 0.35$ and $Q^2=$ 10 GeV$^2$.

Prokudin, Alexei↗

Moment tensor reconstruction

A seismic monitoring system includes a plurality of seismic monitors and a processing device operatively coupled to the plurality of seismic monitors. The processing device receives recordings of waveforms of motion detected at the plurality of seismic detectors in a geographic area. The processing device applies the respective recordings to corresponding positions of the seismic detectors in a three-dimensional geological model that describes its elastic attributes and tests a plurality of moment tensors at a plurality of locations. Based on the testing, the processing device determines a globally convergent source location and moment tensor in the three-dimensional model based on the testing.

Petrov, Petr↗

Geometry-aware training of factorized layers in tensor Tucker format

Reducing parameter redundancies in neural network architectures is crucial for achieving feasible computational and memory requirements during train and inference of large networks. Given its easy implementation and flexibility, one promising approach is layer factorization, which reshapes weight tensors into a matrix format and parameterizes it as the product of two rank-r matrices. However, this family of approaches often requires an initial full-model warm-up phase, prior knowledge of a feasible rank, and it is sensitive to parameter initialization.In this work, we introduce a novel approach to train the factors of a Tucker decomposition of the weight tensors. Our training proposal proves to be optimal in locally approximating the original unfactorized dynamics and stable for the initialization. Furthermore, the rank of each mode is dynamically updated during training.We provide a theoretical analysis of the algorithm, showing convergence, approximation and local descent guarantees. The method's performance is further illustrated through a variety of experiments, showing remarkable training compression rates and comparable or even better performance than the full baseline and alternative layer factorization strategies.

Zangrando, Emanuele [Gran Sasso Science Institute ↗

Network Sensitivity Solutions for Regional Moment Tensor Inversions

Well-resolved moment tensor solutions reveal information about the sources of seismic waves. Here we introduce a new way of assessing confidence in the regional full moment tensor inversion via the introduction of the network sensitivity solution (NSS). The NSS takes into account the unique station distribution, frequency band, and signal-to-noise ratio of a given event scenario. The NSS compares both a hypothetical pure source (for example an explosion or an earthquake) and the actual data with several thousand sets of synthetic data from a uniform distribution of all possible sources. The comparison with a hypothetical pure source provides the theoretically best-constrained source-type region for a given set of stations, and with it one can determine whether further analysis with the data is warranted. The NSS that employs the actual data gives a direct comparison of all other source-types with the best-fit source. In this way, one can choose a threshold level of fit where the solution is comfortably constrained. The method is tested for the well-recorded nuclear test, JUNCTION, at the Nevada Test Site. Sources that fit comparably well to a hypothetical pure explosion recorded with no noise at the JUNCTION data stations have a large volumetric component and are not described well by a double-couple (DC) source. The NSS using the real data from JUNCTION is even more tightly constrained to an explosion since the data contains some energy that precludes fitting with any type of deviatoric source. We also calculate the NSS for the October 2006 North Korea test and a nearby earthquake, where the station coverage is poor and the event magnitude is small. The earthquake solution is very well fit by a DC source, and the best-fit solution to the nuclear test (M{sub W}4.1) is dominantly explosion.

58 GEOSCIENCES↗

General-Purpose Unsupervised Cyber Anomaly Detection via Non-Negative Tensor Factorization

Distinguishing malicious anomalous activities from unusual but benign activities is a fundamental challenge for cyber defenders. Prior studies have shown that statistical user behavior analysis yields accurate detections by learning behavior profiles from observed user activity. These unsupervised models are able to generalize to unseen types of attacks by detecting deviations from normal behavior, without knowledge of specific attack signatures. However, approaches proposed to date based on probabilistic matrix factorization are limited by the information conveyed in a two-dimensional space. Non-negative tensor factorization, on the other hand, is a powerful unsupervised machine learning method that naturally models multi-dimensional data, capturing complex and multi-faceted details of behavior profiles. Herein, our new unsupervised statistical anomaly detection methodology matches or surpasses state-of-the-art supervised learning baselines across several challenging and diverse cyber application areas, including detection of compromised user credentials, botnets, spam e-mails, and fraudulent credit card transactions.

97 MATHEMATICS AND COMPUTING↗