Search NASA⌕ Search

SEARCH · Search NASA

Results for “rank”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

A low-rank power iteration scheme for neutron transport criticality problems

Computing effective eigenvalues for neutron transport often requires a fine numerical resolution. Here, the main challenge of such computations is the high memory effort of classical solvers, which limits the accuracy of chosen discretizations. In this work, we derive a method for the computation of effective eigenvalues when the underlying solution has a low-rank structure. This is accomplished by utilizing dynamical low-rank approximation (DLRA), which is an efficient strategy to derive time evolution equations for low-rank solution representations. The main idea is to interpret the iterates of the classical inverse power iteration as pseudo-time steps and apply the DLRA concepts in this framework. In our numerical experiment, we demonstrate that our method significantly reduces memory requirements while achieving the desired accuracy. Analytic investigations show that the proposed iteration scheme inherits the convergence speed of the inverse power iteration, at least for a simplified setting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Incorporating uncertainty for enhanced leaderboard scoring and ranking in data competitions

Data competitions have become a popular and cost-effective approach for crowdsourcing versatile solutions from diverse expertise. Current practice relies on the simple leaderboard scoring based on a given set of competition data for ranking competitors and distributing the prize. However, a disadvantage of this practice in many competitions is that a slight difference in the scores due to the natural variability of the observed data could result in a much larger difference in the prize amounts. In this article, we propose a new strategy to quantify the uncertainty in the rankings and scores from using different data sets that share common characteristics with the provided competition data. By using a bootstrap approach to generate many comparable data sets, the new method has four advantages over current practice. Furthermore, during the competition, it provides a mechanism for competitors to get feedback about the uncertainty in their relative ranking. After the competition, it allows the host to gain a deeper understanding of the algorithm performance and their robustness across representative data sets. It also offers a transparent mechanism for prize distribution to reward the competitors more fairly with superior and robust performance. Finally, it has the additional advantage of being able to explore what results might have looked like if competition goals evolved from their original choices. The implementation of the strategy is illustrated with a real data competition hosted by Topcoder on urban radiation search.

42 ENGINEERING↗
DOE OSTI2022

Factorization of Binary Matrices: Rank Relations, Uniqueness and Model Selection of Boolean Decomposition

The application of binary matrices are numerous. Representing a matrix as a mixture of a small collection of latent vectors via low-rank decomposition is often seen as an advantageous method to interpret and analyze data. In this work, we examine the factorizations of binary matrices using standard arithmetic (real and nonnegative) and logical operations (Boolean and $\mathbb{Z}$ 2 ). We examine the relationships between the different ranks, and discuss when factorization is unique. In particular, we characterize when a Boolean factorization X = W$\land$H has a unique W, a unique H (for a fixed W), and when both W and H are unique, given a rank constraint. We introduce a method for robust Boolean model selection, called BMFk, and show on numerical examples that BMFk not only accurately determines the correct number of Boolean latent features but reconstruct the pre-determined factors accurately.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2021

Seasonal Disorder in Urban Traffic Patterns: A Low Rank Analysis

This article proposes several advances to sparse nonnegative matrix factorization (SNMF) as a way to identify large-scale patterns in urban traffic data. The input to our model is traffic counts organized by time and location. Nonnegative matrix factorization additively decomposes this information, organized as a matrix, into a linear sum of temporal signatures. Penalty terms encourage this factorization to concentrate on only a few temporal signatures, with weights which are not too large. Our interest here is to quantify and compare the regularity of traffic behavior, particularly across different broad temporal windows. In addition to the rank and error, we adapt a measure introduced by Hoyer to quantify sparsity in the representation. Combining these, we construct several curves which quantify error as a function of rank (the number of possible signatures) and sparsity; as rank goes up and sparsity goes down, the approximation can be better and the error should decreases. Plots of several such curves corresponding to different time windows leads to a way to compare disorder/order at different time scalewindows. In this paper, we apply our algorithms and procedures to study a taxi traffic dataset from New York City. In this dataset, we find weekly periodicity in the signatures, which allows us an extra framework for identifying outliers as significant deviations from weekly medians. We then apply our seasonal disorder analysis to the New York City traffic data and seasonal (spring, summer, winter, fall) time windows. We do find seasonal differences in traffic order.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A ranking methodology for the coupling of pressurized water nuclear reactors and molten salt thermal energy storage

Thermal energy storage (TES) systems are a proposed solution to electricity market demand fluctuations and can be coupled to nuclear power plants to enable load following. Here, this work focuses on developing a methodology for evaluating potential designs for integrating a TES system into an existing pressurized water nuclear power plant. The proposed ranking methodology allows a group of experts to postulate and weigh designs based on ranking criteria derived from literature. The methodology developed in this study can aid in the final selection of a TES design for an existing nuclear power plant. The same process could be used to analyze other TES and nuclear reactor designs. The determined optimum design from this methodology was to place the TES system after the steam generator and to utilize the steam generated from the nuclear power plant to heat a molten salt TES unit. Another conclusion of this research was that human bias is prevalent during design selection, and actions such as standardized ranking criteria and large groups of experts should be used to minimize this error.

25 ENERGY STORAGE↗
DOE OSTI2021

A Ranked-Orbital Approach to Select Active Spaces for High-Throughput Multireference Computation

The past decade has seen a great increase in the application of high-throughput computation to a variety of important problems in chemistry. However, one area which has been resistant to the high-throughput approach is multireference wave function methods, in large part due to the technicalities of setting up these calculations and in particular the not always intuitive challenge of active space selection. As we look toward a future of applying high-throughput computation to all areas of chemistry, it is important to prepare these methods for large-scale automation. Here, we propose a ranked-orbital approach to select active spaces with the goal of standardizing multireference methods for high-throughput computation. This method allows for the meaningful comparison of different active space selection schemes and orbital localizations, and we demonstrate the utility of this approach across 1120 multireference calculations for the excitation energies of small molecules. Our results reveal that it is helpful to distinguish the method used to generate orbitals from the method of ranking orbitals in terms of importance for the active space. Additionally, we propose our own orbital ranking scheme that estimates the importance of an orbital for the active space through a pair-interaction framework from orbital energies and features of the Hartree–Fock exchange matrix. Here, we call this new scheme the “approximate pair coefficient” (APC) method and we show that it performs quite well for the test systems presented.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Low-rank Sachdev-Ye-Kitaev models

Motivated by recent proposals of experimental realization of fast scramblers, we study a family of solvable variants of the ($\textit{q}$ = 4) Sachdev-Ye-Kitaev model in which the rank and eigenvalue distribution of the coupling matrix $J_{ ij,kl}$ are tuneable. When the rank is proportional to the number of fermions, the low temperature behavior is sensitive to the eigenvalue distribution. We obtain a complete classification of the possible non-Fermi liquid quantum phases. These include two previously studied phases whose fermion scaling dimension depends continuously on the rank; we show that they are maximally chaotic, but necessitate an extensively degenerate or negative semidefinite coupling matrix. In this work, more generic distributions give rise to “almost Fermi liquids” with a scaling dimension Δ = 1/2, but which differ from a genuine Fermi liquid in quasiparticle decay rate, quantum Lyapunov exponent, and/or specific heat.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

PLANC: Parallel Low-rank Approximation with Nonnegativity Constraints

In this work, we consider the problem of low-rank approximation of massive dense nonnegative tensor data, for example, to discover latent patterns in video and imaging applications. As the size of data sets grows, single workstations are hitting bottlenecks in both computation time and available memory. We propose a distributed-memory parallel computing solution to handle massive data sets, loading the input data across the memories of multiple nodes, and performing efficient and scalable parallel algorithms to compute the low-rank approximation. We present a software package called Parallel Low-rank Approximation with Nonnegativity Constraints, which implements our solution and allows for extension in terms of data (dense or sparse, matrices or tensors of any order), algorithm (e.g., from multiplicative updating techniques to alternating direction method of multipliers), and architecture (we exploit GPUs to accelerate the computation in this work). We describe our parallel distributions and algorithms, which are careful to avoid unnecessary communication and computation, show how to extend the software to include new algorithms and/or constraints, and report efficiency and scalability results for both synthetic and real-world data sets.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗
DOE OSTI2025

Evaluation of data driven low-rank matrix factorization for accelerated solutions of the Vlasov equation

Low-rank methods have shown success in accelerating simulations of a collisionless plasma described by the Vlasov equation, but still rely on computationally costly linear algebra every time step. We propose a data-driven factorization method using artificial neural networks, specifically with convolutional layer architecture, that trains on existing simulation data. At inference time, the model outputs a low-rank decomposition of the distribution field of the charged particles, and we demonstrate that this step is faster than the standard linear algebra technique. Numerical experiments show that the method achieves comparable reconstruction accuracy for interpolation tasks, generalizing to unseen test data in a manner beyond just memorizing training data; patterns in factorization also inherently followed the same numerical trend as those within algebraic methods (e.g., truncated singular-value decomposition). However, when training on the first 70% of a time-series data and testing on the remaining 30%, the method fails to meaningfully extrapolate. Despite this limiting result, the technique may have benefits for simulations in a statistical steady-state or otherwise showing temporal stability. These results suggest that while the model offers a computationally efficient alternative for datasets with temporal stability, its current formulation is best suited for interpolation rather than for predicting future states in time-evolving systems. This study thus lays the groundwork for further refinement of neural network-based approaches to low-rank matrix factorization in high-dimensional plasma simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Volume-preserving diffeomorphism as nonabelian higher-rank gauge symmetry

We propose nonabelian higher-rank gauge theories in 2+1D and 3+1D. The gauge group is constructed from the volume-preserving diffeomorphisms of space. We show that the intriguing physics of the lowest Landau level (LLL) limit can be interpreted as the consequences of the symmetry. We derive the renowned Girvin-MacDonald-Platzman (GMP) algebra as well as the topological Wen-Zee term within our formalism. Using the gauge symmetry in 2+1D, we derive the LLL effective action of vortex crystal in rotating Bose gas as well as Wigner crystal of electron in an applied magnetic field. We show that the nonlinear sigma models of ferromagnets in 2+1D and 3+1D exhibit the higher-rank gauge symmetries that we introduce in this paper. We interpret the fractonic behavior of the excitations on the lowest Landau level and of skyrmions in ferromagnets as the consequence of the higher-rank gauge symmetry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Quality Ranking of Unary Fluoride Salt Property Data in MSTDB-TP

Molten salt reactor developers rely on thermal property data to design, license and operate the reactors they are developing. The Molten Salt Thermal Database-Thermophysical Properties (MSTDB-TP) is being developed under the DOE Nuclear Energy Advanced Modeling and Simulation (NEAMS) program and managed by Oak Ridge National Laboratory. The MSTDB-TP is intended to serve as a single source of measured thermophysical property values for a wide variety of molten salt systems available to researchers, molten salt reactor developers, and regulators. These properties include melting and boiling points, heat capacity, density, viscosity and thermal diffusivity and conductivity. Published measurements of molten salt properties are lacking for many salts and the data that are available are often inconsistent. This creates a challenge for MSR developers in determining which property values to select when designing their reactors. The MSDTDB-TP collects all available property data and down-selects to preferred data sets or correlations. It is the purpose of this work to apply a recently developed ranking system that indicates the quality of property values listed in the database to inform decisions about how to use the available data. Quality assessments and rankings are being applied to data in MSTDB-TP to provide an indication of the quality of the data available. A previous report detailed the ranking system that was followed.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Dynamic Low-Rank Training with Spectral Regularization: Achieving Robustness in Compressed Representations

Deployment of neural networks on resource-constrained devices demands models that are both compact and robust to adversarial inputs. However, compression and adversarial robustness often conflict. In this work, we introduce a dynamical low-rank training scheme enhanced with a novel spectral regularizer that controls the condition number of the low-rank core in each layer. This approach mitigates the sensitivity of compressed models to adversarial perturbations without sacrificing clean accuracy. The method is model- and data-agnostic, computationally efficient, and supports rank adaptivity to automatically compress the network at hand. Extensive experiments across standard architectures, datasets, and adversarial attacks show the regularized networks can achieve over 94\% compression while recovering or improving adversarial accuracy relative to uncompressed baselines.

Schotthoefer, Steffen [ORNL] (ORCID:00000002156965↗
DOE OSTI2025

Dynamical Low-Rank Compression of Neural Networks with Robustness under Adversarial Attacks

Deployment of neural networks on resource-constrained devices demands models that are both compact and robust to adversarial inputs. However, compression and adversarial robustness often conflict. In this work, we introduce a dynamical low-rank training scheme enhanced with a novel spectral regularizer that controls the condition number of the low-rank core in each layer. This approach mitigates the sensitivity of compressed models to adversarial perturbations without sacrificing clean accuracy. The method is model- and data-agnostic, computationally efficient, and supports rank adaptivity to automatically compress the network at hand. Extensive experiments across standard architectures, datasets, and adversarial attacks show the regularized networks can achieve over 94 compression while recovering or improving adversarial accuracy relative to uncompressed baselines.

Schotthoefer, Steffen [ORNL] (ORCID:00000002156965↗
DOE OSTI2020

A low-rank solver for the stochastic unsteady Navier–Stokes problem

Here we study a low-rank iterative solver for the unsteady Navier–Stokes equations for incompressible flows with a stochastic viscosity. The equations are discretized using the stochastic Galerkin method, and we consider an all-at-once formulation where the algebraic systems at all the time steps are collected and solved simultaneously. The problem is linearized with Picard’s method. To efficiently solve the linear systems at each step, we use low-rank tensor representations within the Krylov subspace method, which leads to significant reductions in storage requirements and computational costs. Combined with effective mean-based preconditioners and the idea of inexact solve, we show that only a small number of linear iterations are needed at each Picard step. The proposed algorithm is tested with a model of flow in a two-dimensional symmetric step domain with different settings to demonstrate the computational efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Anomaly detection in PV systems using constrained low-rank and sparse decomposition

PV (photovoltaic) systems, also known as solar panel systems, play an essential role in the mitigation of greenhouse gas emissions and the promotion of renewable energy. Through the conversion of sunlight into usable energy, electricity is generated without emitting greenhouse gases and producing pollutants. Notwithstanding the evolutionary significance of PV systems, the occurrence of defects and anomalies in PV systems may result in diminished power output, consequently impeding the efficiency of the systems and potentially resulting in hazards in certain circumstances. Therefore, early detection of faults and anomalies in PV systems is imperative to guarantee the reliability, efficiency, and safety of the systems. In this article, we develop a signal decomposition for the purpose of anomaly detection in PV systems. The proposed methodology is grounded on the concept of low-rank and sparse decomposition, with consideration given to the signs of the decomposed low-rank and sparse components, as well as the smooth variations within and between periods in the mean signals. Through the implementation of Monte Carlo simulations, we showcase the efficacy of our proposed methodology in identifying anomalies of varying durations and magnitudes in PV systems. A case study is employed to validate the proposed methodology in detecting anomalies in real PV systems.

14 SOLAR ENERGY↗
DOE OSTI2022

Characterization and rank assignment criteria for the anaerobic fungi (Neocallimastigomycota)

Establishing a solid taxonomic framework is crucial for enabling discovery and documentation efforts. This ensures effective communication between scientists as well as reproducibility of results between laboratories, and facilitates the exchange and preservation of biological material. Such framework can only be achieved by establishing clear criteria for taxa characterization and rank assignment. Within the anaerobic fungi (phylum Neocallimastigomycota), the need for such criteria is especially vital. Difficulties associated with their isolation, maintenance and long-term storage often result in limited availability and loss of previously described taxa. To this end, we provide here a list of morphological, microscopic, phylogenetic and phenotypic criteria for assessment and documentation when characterizing newly obtained Neocallimastigomycota isolates. We also recommend a polyphasic rank-assignment scheme for novel genus-, species- and strain-level designations for newly obtained Neocallimastigomycota isolates.

59 BASIC BIOLOGICAL SCIENCES↗