Search NASA⌕ Search

SEARCH · Search NASA

Results for “Tucker decompositions”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Parallel Randomized Tucker Decomposition Algorithms

The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. Here, we propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two algorithms that scale to large data and many processors, significantly reduce both computation and communication cost compared to previous deterministic and randomized approaches, and obtain nearly the same approximation errors. The key idea in our algorithms is to perform randomized sketches with Kronecker-structured random matrices, which reduces computation compared to unstructured matrices and can be implemented using a fundamental tensor computational kernel. We provide probabilistic error analysis of our algorithms and implement a new parallel algorithm for the structured randomized sketch. Our experimental results demonstrate that our combination of randomization and parallelization achieves accurate Tucker decompositions much faster than alternative approaches. We observe up to a 16X speedup over the fastest deterministic parallel implementation on 3D simulation data.

Tucker decompositions↗
DOE OSTI2025

SymProp: Scaling Sparse Symmetric Tucker Decomposition via Symmetry Propagation

Sparse symmetric tensors are an important class of tensors, and their decompositions serve as powerful tools for revealing low-rank structures. This paper introduces SymProp, a novel approach for scaling sparse symmetric Tucker decomposition by propagating symmetry through intermediate computations. SymProp optimizes two key computational kernels: Sparse Symmetric Tensor Times Same Matrix chain (S3 TTMc) for Higher-Order Orthogonal Iteration (HOOI) and Sparse Symmetric Tensor Times Same Matrix chain Times Core (S3 TTMcTC) for Higher-Order QR Iteration (HOQRI). Our method employs a metaprogramming-based index iteration approach to efficiently handle the upper triangular parts of intermediate dense symmetric tensors. SymProp achieves up to 50.9× speedup over SPLATT and up to 360.8× over Compressed Sparse Symmetric (CSS) format on the S3 TTMc operation. Moreover, our S3 TTMc and S3 TTMcTC implementations support tensor orders four levels higher than state-of-the-art methods. Our HOQRI demonstrates superior scalability and up to a 33.6× speedup over optimized HOOI. By enabling more scalable Tucker decompositions for higher orders, decomposition ranks, and dimension sizes, SymProp opens new possibilities for analyzing complex hypergraph structures in fields such as network science, data mining, and machine learning.

Li, Zecheng [North Carolina State University]↗
DOE OSTI2026

QuadSync: Quadrifocal tensor synchronization via Tucker decomposition

In structure from motion, quadrifocal tensors capture more information than their pairwise counterparts (essential matrices), yet they have often been thought of as impractical and only of theoretical interest. In this work, we challenge such beliefs by providing a new framework to recover n cameras from the corresponding collection of quadrifocal tensors. We form the block quadrifocal tensor and show that it admits a Tucker decomposition whose factor matrices are the stacked camera matrices, and which thus has a multilinear rank of (4,4,4,4) independent of n. We develop the first synchronization algorithm for quadrifocal tensors, using Tucker decomposition, alternating direction method of multipliers, and iteratively reweighted least squares. We further establish relationships between the block quadrifocal, trifocal, and bifocal tensors, and introduce an algorithm that jointly synchronizes these three entities. Numerical experiments demonstrate the effectiveness of our methods on modern datasets, indicating the potential and importance of using higher-order information in synchronization.

Miao, Daniel [University of Minnesota]↗
DOE OSTI2025

Personalized Tucker Decomposition: Modeling Commonality and Peculiarity on Tensor Data

In this paper, we propose a personalized Tucker decomposition (perTucker) to address the limitations of traditional tensor decomposition methods in capturing heterogeneity across different datasets. perTucker decomposes tensor data into shared global components and personalized local components. We introduce an order orthogonality assumption and develop a proximal gradient regularized block coordinate descent algorithm guaranteed to converge to a stationary point. The unique and common representations learned by perTucker reveal intrinsic statistical patterns in data and provide valuable information for a wide range of downstream analytics, including anomaly detection, source classification, and clustering. We demonstrate perTucker’s effectiveness through a simulation study and two case studies on solar flare detection and tonnage signal classification.

14 SOLAR ENERGY↗
DOE OSTI2024

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 ↗
DOE OSTI2025

A Linear-Complexity Tensor Butterfly Algorithm for Compressing High-Dimensional Oscillatory Integral Operators

This paper presents a multilevel tensor compression algorithm called tensor butterfly algorithm for efficiently representing large-scale and high-dimensional oscillatory integral operators, including Green's functions for wave equations and integral transforms such as Radon transforms and Fourier transforms. The proposed algorithm leverages a tensor extension of the so-called complementary low-rank property of existing matrix butterfly algorithms. The algorithm partitions the discretized integral operator tensor into subtensors of multiple levels and factorizes each subtensor at the middle level as a Tucker-type interpolative decomposition, whose factor matrices are formed in a multilevel fashion. For a d-dimensional (d > 1) integral operator discretized into a 2d-mode tensor with n2d entries, the overall CPU time and memory requirement scale as O(nd), in stark contrast to the O(nd log n) complexity of existing matrix algorithms such as matrix butterfly algorithms and fast Fourier transforms (FFTs), where n is the number of points per direction. When comparing with other tensor algorithms such as quantized tensor train (QTT), the proposed algorithm also shows superior CPU and memory performance for tensor contraction. Remarkably, the tensor butterfly algorithm can efficiently model high-frequency Green's function interactions between two unit cubes, each spanning 512 wavelengths per direction, which represents problems of scale over 512× larger than that existing butterfly algorithms can handle, with the same amount of computation resources. On the other hand, for a problem representing 64 wavelengths per direction, which is the largest size existing algebraic matrix algorithms can handle, our tensor butterfly algorithm exhibits 200x speedups and 30× memory reduction compared with existing ones. Moreover, the tensor butterfly algorithm also permits O(nd)-complexity FFTs and Radon transforms up to d = 6 dimensions.

Kielstra, P Michael↗
DOE OSTI2025

Randomized Algorithms for Low-Rank Matrix and Tensor Decompositions

This paper surveys randomized algorithms in numerical linear algebra for low-rank decompositions of matrices and tensors. The survey begins with a review of classical matrix algorithms that can be accelerated by randomized dimensionality reduction, such as the singular value decomposition (SVD) or interpolative (ID) and CUR decompositions. Recent advances in randomized dimensionality reduction are discussed, including new methods of fast matrix sketching and sampling techniques, which are incorporated into classical matrix algorithms for fast low-rank matrix approximations. The extension of randomized matrix algorithms to tensors is then explored for several low-rank tensor decompositions in the CP and Tucker formats, including the higher-order SVD, ID, and CUR decomposition.

Pearce, Katherine J. [The University of Texas at A↗
DOE OSTI2025

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

mvBayesPy

SAND2025-11476O The mvBayesPy tool is a Python package that performs multivariate Bayesian analysis on generic data. It includes tools for regression modeling, diagnosis, basis decomposition, sensitivity analysis and visualization. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Tucker, James [Sandia National Lab. (SNL-CA), Live↗
NASA NTRS2020

Toward an In-Depth Material Model for Cermet Nuclear Thermal Rocket Fuel Elements

The development and qualification of nuclear thermal propulsion (NTP) fuel element technologies would be aided by an in-depth model of material response and failure modes at operating conditions. Integrated computational materials engineering techniques have the potential to provide such a model, as demonstrated here through three case studies focused on a tungsten-uranium mononitride cermet fuel. The first case focuses on the erosion of tungsten (W, also named wolfram), a nominal coating/cladding material, in hot hydrogen. Ab initio techniques are used to calculate erosion rates and thermal expansion at NTP operating conditions. The second focuses on the stability of uranium mononitride (UN) fuels at high temperature and in the presence of hydrogen. Phase diagram techniques reveal potential instabilities and decomposition pathways at high hydrogen concentrations. The third focuses on using microstructure information to predict high temperature mechanical response and failure of tungsten, used in refractory cermet materials. Combined finite element and discrete dislocation dynamics techniques provide mechanical properties in agreement with experimental methods. The integration of these techniques for an all-encompassing material model is discussed.

cermet↗
DOE OSTI2025

mvBayesR

SAND2025-11559O The mvBayesR tool performs multivariate Bayesian analysis on generic data. It includes tools for regression modeling, diagnosis, basis decomposition, sensitivity analysis, and visualization. The tool compiles state-of-the-art methodology into one easy-to-use package. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Tucker, James [Sandia National Lab. (SNL-CA), Live↗
DOE OSTI2025

Voltage cycling as a dynamic operation mode for high temperature electrolysis solid oxide cells

Solid Oxide Electrolysis Cells (SOECs) have emerged as a promising technology for the efficient production of H2 via high-temperature electrolysis. However, power input from dynamic energy sources remains a significant challenge for their long-term stability. It is important to analyze the tolerance of cells under dynamic operation conditions. This study focuses on evaluating the impact of voltage cycling on the performance and durability of electrode-supported SOECs. We explore the operational limits and degradation mechanisms of SOECs subjected to various voltage conditions and find that the cells have high tolerance for dynamic voltage. Voltage cycling between 1.3 V and 1.5 V for 9000 cycles does not damage the cell. Conversely, cycling to higher voltages (≥1.7 V) results in accelerated degradation. Advanced characterization is used to screen for various degradation modes post operation. Within the oxygen electrode, XRD and STEM EDS find compositional and phase evolution in all voltage cycled samples including increased decomposition of the air electrode resulting in cation migration. Microstructural analysis of the fuel electrode from nano-CT data shows minimal change throughout the sample set and no evidence of Ni migration, indicating the fuel electrode is stable and not impacted by cycling to higher voltages within the timeframe studied.

Zhu, Zhikuan↗
NASA NTRS2006

The NASA Constellation University Institutes Project: Thrust Chamber Assembly Virtual Institute

This paper documents key aspects of the Constellation University Institutes Project (CUIP) Thrust Chamber Assembly (TCA) Virtual Institute (VI). Specifically, the paper details the TCA VI organizational and functional aspects relative to providing support for Constellation Systems. The TCA VI vision is put forth and discussed in detail. The vision provides the objective and approach for improving thrust chamber assembly design methodologies by replacing the current empirical tools with verified and validated CFD codes. The vision also sets out ignition, performance, thermal environments and combustion stability as focus areas where application of these improved tools is required. Flow physics and a study of the Space Shuttle Main Engine development program are used to conclude that the injector is the key to robust TCA design. Requirements are set out in terms of fidelity, robustness and demonstrated accuracy of the design tool. Lack of demonstrated accuracy is noted as the most significant obstacle to realizing the potential of CFD to be widely used as an injector design tool. A hierarchical decomposition process is outlined to facilitate the validation process. A simulation readiness level tool used to gauge progress toward the goal is described. Finally, there is a description of the current efforts in each focus area. The background of each focus area is discussed. The state of the art in each focus area is noted along with the TCA VI research focus in the area. Brief highlights of work in the area are also included.

Tucker, P. Kevin↗
NASA NTRS1992

Contamination of optical surfaces in Earth orbit

Glass and glass ceramic samples exposed to the low earth orbit environment for approximately 5.5 years on the Long Duration Exposure Facility (LDEF) were found to display limited degradation in optical transmission. Commercial optical quality fused silica samples display decreases in transmission in the 200 to 400 nm wavelength region, and this degradation appears to be a consequence of surface contamination. The contamination, found only on internal surfaces of samples, was measured by medium energy backscattering spectrometry and found to be primarily carbon. Additional thin film contamination by a species with atomic mass near 64, which was present at the level of about 8 x 10 exp 14/sq. cm has not been identified. These observations are consistent with the interpretation that organic binders used in the black absorbing paint (Chem Glaze Z-306) inside the sample holding tray were concentrated in the vicinity of the samples and photolytically cracked by solar UV radiation. The resulting decomposition products were deposited on the interior sample surface and gave rise to the optical transmission loss. No detectable contamination was observed on the external or space exposed surface of the samples. No measurable damage was detected which could be attributed to the direct action of gamma or UV radiation on the glass samples. These results emphasize the need for special precautions in the preparation of spacecraft carrying precision optical components on long duration missions.

Donald L Kinser↗
NASA NTRS1990

Production of continuous mullite fiber via sol-gel processing

The development of a continuous ceramic fiber which could be used in rocket engine and rocket boosters applications was investigated at the Marshall Space Flight Center. Methods of ceramic fiber production such as melt spinning, chemical vapor deposition, and precursor polymeric fiber decomposition are discussed and compared with sol-gel processing. The production of ceramics via the sol-gel method consists of two steps, hydrolysis and polycondensation, to form the preceramic, followed by consolidation into the glass or ceramic structure. The advantages of the sol-gel method include better homogeneity and purity, lower preparation temperature, and the ability to form unique compositions. The disadvantages are the high cost of raw materials, large shrinkage during drying and firing which can lead to cracks, and long processing times. Preparation procedures for aluminosilicate sol-gel and for continuous mullite fibers are described.

Tucker, Dennis S.↗