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 73 records · Page 4

Marine Hydrokinetic Energy Site Identification and Ranking Methodology Part I: Wave Energy

Marine hydrokinetic energy is a promising and growing piece of the renewable energy sector that offers high predictability and additional energy sources for a diversified energy economy. This report investigates the market opportunities for wave energy along the U.S. coastlines. It is part one of a two-part investigation into the United State's two largest marine hydrokinetic resources (wave and tidal). Wave energy technology is still an emerging form of renewable energy for which large-scale, grid-connected project costs are currently poorly defined. Ideally, device designers would like to know the resource conditions at economical project sites so they can optimize device designs. On the other hand, project developers need detailed device cost data to identify sites where projects are economical. That is, device design and siting are, to some extent, a coupled problem. This work describes a methodology for identifying likely deployment locations based on a set of criteria that wave energy experts in industry, academia, and national laboratories agree are likely to be important factors for all technology types. This work groups the data for the six criteria into 'locales' that are defined as the smaller of either the local transmission grid or a state boundary. The former applies to U.S. islands (e.g., Hawaii, American Samoa) and rural villages (e.g., in Alaska); the latter applies to states in the contiguous United States. These data are then scored from 0 to 10 according to scoring functions that were developed with input from wave energy industry and academic experts. The scores are aggregated using a simple product method that includes a weighting factor for each criterion. This work presents two weighting scenarios: a long-term scenario that does not include energy price (weighted zero) and a near term scenario that includes energy price. The aggregated scores are then used to produce ranked lists of likely deployment locales. In both scenarios, Hawaii and the Pacific Northwest (northern California, Oregon, and Washington) rank at the top of the lists. Hawaii ranks highest in the near-term scenario because it has high energy costs. In the long-term scenario, Oregon ranks highest because it has a large market and an energetic resource. Several East Coast states and Puerto Rico are also identified as potential wave energy deployment sites if technological innovations make it possible to efficiently generate electricity from the modest resource there. There are also several small-market sites in Alaska and U.S. Pacific Islands that rank particularly well in the near-term analysis due to their high energy prices. These locations may represent opportunities to demonstrate economical wave energy conversion as a stepping-stone to larger markets. Several factors that will affect wave project costs and siting have not been considered here -- including permitting constraints, conflicting use, seasonal resource variability, extreme event likelihood, and distance to ports -- because consistent data are unavailable or technology-independent scoring could not be identified. As the industry continues to mature and converge around a subset of device archetypes with well-defined costs, more precise investigations of project siting that include these factors will be possible. For now, these results provide a high-level guide pointing to the regions where markets and resource will one day support commercial wave energy projects.

16 TIDAL AND WAVE POWER↗

Risk Importance Ranking of Fire Data Parameters to Enhance Fire PRA Model Realism

Fire is historically and analytically a significant contributor to nuclear power plant risk. The level of fire risk and the methods, tools and data for modeling this risk is highly debated by experts. One area of debate is the input data used in fire modeling and how to deal with this data’s high uncertainty. This report outlines initial work performed for determining the key parameters causing this uncertainty and how it propagates into nuclear power plant models. This research paves the way for the development of methods to reduce fire data uncertainty used in modeling. The Nuclear Regulatory Commission has mandated that nuclear power plants perform fire risk modeling. However, there are several issues with the current risk modeling implementation that affect the results. Approved modeling methods can be overly conservative and often do not match plant experience. Also, the data used in the modeling can have high uncertainties and is influenced by expert judgement. To evaluate input data uncertainty, researchers performed an initial review of several fire experiments done at Sandia National Laboratories. Uncertainties for fire data can come from many sources, such as experiment design constraints, environmental conditions, or other plant-specific aspects. There are many different significant and insignificant parameters driving the uncertainty. Additionally, the uncertainty of the different input data used in the fire modeling could have a significant or insignificant effect on the entire plant risk. A four-step methodology was developed to perform Integrated Probabilistic Risk Assessment Importance Ranking. A demonstration case using these steps was set up and three of the four steps were completed in fiscal year (FY) 2019 and the fourth step done FY 2020. These steps are: 1. The qualitative analysis of potential sources was conducted with the following items identified for the demonstration. • Maximum heat release rate • Time to maximum heat release rate • Duration of max heat release rate • Time to decay • Thermal conductivity of concrete • Specific heat of concrete • Density of concrete • Cable jacket thickness 2. A quantitative characterization of dominant sources of uncertainty was performed. A list of distributions and determined values of the dominant sources is shown in Appendix A. 3. A quantitative screening of the potential sources of uncertainty using Morris Elementary Effects Analysis was completed. An experimental model using the physics-based fire modeling tool Fire Dynamics Simulator was developed and coupled with the Risk Analysis Virtual Environment. The Morris analysis identified at least two parameters that can be eliminated as significant contributors (specific heat of concrete and cable jacket thickness). 4. Global importance measure (Global IM) analysis to generate a comprehensive ranking based on their influence on the plant risk. In this research, a moment-independent Global IM is used since it can address (a) uncertainty in the input parameters of the fire model, (b) uncertainty in the risk outputs, and (c) non-linearity and interactions among input parameters in the fire model, more accurately than the correlation-based and variance-based global methods. The observations from the research showed that, depending on the initial and boundary conditions of the fire scenarios, fire-induced damage could have a very small probability and could be dominated by the tail of the uncertainty distribution; hence, the accuracy of the correlation-based and variance-based methods is questionable. The moment-independent Global IM analysis in this research provides a better understanding of how experimental uncertainty data affects industry’s plant models and where improvements in that data will have the largest benefit for improving fire modeling accuracy in causing core damage. Among the five unscreened parameters obtained from the Morris EE analysis, the Global IM analysis results for the case study indicated that max heat release rate and fire location are the most important parameters. The report also outlines benefits of using a unified computational platform that integrates the underlying simulations (e.g., a fire progression model), quantitative screening (using the Morris EE method), and the Global IM analysis. A unified platform can (i) facilitate the ranking of input parameters considering multiple key fire scenarios simultaneously, rather than considering one scenario at a time, (ii) contribute to more explicit and accurate treatment of dependencies at multiple levels of Fire PRA, (iii) facilitate the sampling-based uncertainty quantification for Fire PRA, and (iv) help generating both “industry-wide” and "plant-specific" ranking of uncertainty sources in Fire PRA. Future research should be done to include additional parameters such as detection/suppression or cable fire spread. Adding a PRA software such as SAPHIRE to the RAVEN platform would help with plant model integration and improve treatment of fire-induced dependency. The I-PRA risk importance ranking methodology offered in this report can provide valuable information for efficiently (a) enhancing the realism of Fire PRA for existing plants and (b) supporting the development of Dynamic Fire PRA for advanced reactors and new plants.

97 MATHEMATICS AND COMPUTING↗

Quality Ranking System for Molten Salt Thermal Property Data

A simple ranking system for use with data and property values compiled in the Molten Salt Thermal Database-Thermophysical Properties (MSTDB-TP) is presented. The approach includes assessments of five features of data collection: the method used to measure the property value, calibration of devices used to make the measurements, the quantified uncertainty of the results, control of the environmental conditions, and determination of the salt composition. The verifiability of how the property value was determined is also assessed based on information provided or cited within the data set. The quality of each facet is ranked as High, Moderate, or Incomplete based on objective metrics. The overall quality of the dataset is ranked based on rankings of the five data features and the reported property value, with rankings of A and B indicating the data and property value are deemed suitable for quantitative use and U indicating uncertainties that restrict the recommended use to qualitative purposes. The system is suitable for assessing data already in the MSTDB-TP and screening new entries.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Human Systems Risk Network - A Ranking Analysis of Risks

INTRODUCTION The Human Systems Risk Board (HSRB) is responsible for understanding, managing, and mitigating the risks associated with spaceflight. For a particular mission, the HSRB assigns each human system risk a rating on a 5x5 grid assessing its likelihood and consequence, which is ultimately used to compare and rank the risks. The HSRB approaches risk management by primarily establishing the context of each human system risk individually with the understanding that mitigating one risk might affect the likelihood, consequence, and mitigation approaches of another. To support this effort the HSRB, subject matter experts, and risk custodian teams created directed acyclic graphs (DAG), often called a causal graph, for the twenty-nine risks. In this presentation, we propose a new ranking algorithm for the risks which includes the downstream influence of each risk according to the information in the DAGs and provide an application of graph theoretic tools. METHODS In 2014, Mindock and Klaus proposed a taxonomy for human system risk influences which we have adopted to categorize the nodes in each DAG. Analyzing the nodes that correspond to the risks in this taxonomy allows us to analyze and understand how each risk influences the others. We construct an auxiliary network, which we call the Primary Risk Network (PRN), where the nodes are the twenty-nine space flight risks and, a directed edge connects Risk A to Risk B if Risk A has some influence on the likelihood or consequence of Risk B as described in the DAGS. We perform a variety of graph theoretic ranking methods on the nodes (or risks) in the PRN, including Katz centrality. RESULTS We rank the nodes in the PRN using the Katz centrality score. The ten risks with the highest score are pictured in Figure 1, colored (light to dark) according to their score. We analyze other centrality measures like betweenness centrality, eigenvector centrality, and the Estrada index, and provide the meaning of the corresponding rankings in terms of the risks. Future work includes analyzing the other categories in the taxonomy defined by Mindock and Klaus [1]. For example, we are interested in analyzing the nodes that are labeled as countermeasures or capabilities and perform similar analysis to measure their effect on certain medical conditions.

dag↗

Low rank approach to computing first and higher order derivatives using automatic differentiation

This manuscript outlines a new approach for increasing the efficiency of applying automatic differentiation (AD) to large scale computational models. By using the principles of the Efficient Subspace Method (ESM), low rank approximations of the derivatives for first and higher orders can be calculated using minimized computational resources. The output obtained from nuclear reactor calculations typically has a much smaller numerical rank compared to the number of inputs and outputs. This rank deficiency can be exploited to reduce the number of derivatives that need to be calculated using AD. The effective rank can be determined according to ESM by computing derivatives with AD at random inputs. Reduced or pseudo variables are then defined and new derivatives are calculated with respect to the pseudo variables. Two different AD packages are used: OpenAD and Rapsodia. OpenAD is used to determine the effective rank and the subspace that contains the derivatives. Rapsodia is then used to calculate derivatives with respect to the pseudo variables for the desired order. The overall approach is applied to two simple problems and to MATWS, a safety code for sodium cooled reactors. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A geometric framework for momentum-based optimizers for low-rank training

Low-rank pre-training and fine-tuning have recently emerged as promising techniques for reducing the computational and storage costs of large neural networks. Training low-rank parameterizations typically relies on conventional optimizers such as heavy ball momentum methods or Adam. In this work, we identify and analyze potential difficulties that these training methods encounter when used to train low-rank parameterizations of weights. In particular, we show that classical momentum methods can struggle to converge to a local optimum due to the geometry of the underlying optimization landscape. To address this, we introduce novel training strategies derived from dynamical low-rank approximation, which explicitly account for the underlying geometric structure. Our approach leverages and combines tools from dynamical low-rank approximation and momentum-based optimization to design optimizers that respect the intrinsic geometry of the parameter space. We validate our methods through numerical experiments, demonstrating faster convergence, and stronger validation metrics at given parameter budgets.

Schotthoefer, Steffen [ORNL] (ORCID:00000002156965↗

Asymptotic-preserving dynamical low-rank method for the stiff nonlinear Boltzmann equation

In kinetic theory, numerically solving the full Boltzmann equation is extremely expensive. This is because the Boltzmann collision operator involves a high-dimensional, nonlinear integral that must be evaluated at each spatial grid point and every time step. The challenge becomes even more pronounced in the fluid (strong collisionality) regime, where the collision operator exhibits strong stiffness, causing explicit time integrators to impose severe stability restrictions. In this paper, we propose addressing this problem through a dynamical low-rank (DLR) approximation. The resulting algorithm requires evaluating the Boltzmann collision operator only r 2 times, where r, the rank of the approximation, is much smaller than the number of spatial grid points. We propose a novel DLR integrator, called the XL integrator, which reduces the number of steps compared to the available alternatives (such as the projector splitting or basis update & Galerkin (BUG) integrator). For a class of problems including the Boltzmann collision operator which enjoys a separation property between physical and velocity space, we further propose a specialized version of the XL integrator, called the sXL integrator. This version requires solving only one differential equation to update the low-rank factors. Furthermore, the proposed low-rank schemes are asymptotic-preserving, meaning they can capture the asymptotic fluid limit in the case of strong collisionality. Our numerical experiments demonstrate the efficiency and accuracy of the proposed methods across a wide range of regimes, from non-stiff (kinetic) to stiff (fluid).

97 MATHEMATICS AND COMPUTING↗

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↗

A Sparse and Low Rank Penalized Signal Decomposition Model with Constraints: Anomaly Detection in PV Systems

Recently, robust PCA has seen its wide application in various industries for its ability to perform the task of anomaly detection. The essence of robust PCA approach is to break down the signal into a low rank component and sparse component. In many applications, a simple breakdown of the signal without accounting for the signs of low rank components and sparse components would violate the physical constraints of the decomposed signal. In addition, often times, the signals in the real world collected for a long duration has smooth changes within a day and between days. As an example, the power signals collected in a photovoltaic (PV) system are cyclostationary, exhibiting these characteristics. Neglecting the smoothness of signals would result in miss detection of anomalous signals which are smooth within a day but non-smooth between days and vice versa. In this paper, we developed a signal decomposition approach for the purpose of anomaly detection based on the idea of low rank and sparse decomposition taking into consideration the signs of the decomposed low rank and sparse components and the within-day and between-day smooth changes in the original signals. The proposed unsupervised approach for fault detection eliminates the need for faulty samples required by other machine learning methods. It does not require the full I-V characteristics to work. Furthermore, there is no need for complex modelling of PV systems as in the case of power loss analysis. Using Monte Carlo simulations, we demonstrate the ability of our proposed approach for detecting anomalies of different duration and severity in PV systems.

14 SOLAR ENERGY↗

Towards a classification of rank r $\mathscr{N}$ = 2 SCFTs. Part II. Special Kahler stratification of the Coulomb branch

We study the stratification of the singular locus of four dimensional $\mathscr{N}$ = 2 Coulomb branches. We present a set of self-consistency conditions on this stratification which can be used to extend the classification of scale-invariant rank 1 Coulomb branch geometries to two complex dimensions, and beyond. The calculational simplicity of the arguments presented here stems from the fact that the main ingredients needed - the rank 1 deformation patterns and the pattern of inclusions of rank 2 strata - are discrete topological data which satisfy strong self-consistency conditions through their relationship to the central charges of the SCFT. This relationship of the stratification data to the central charges is used here, but is derived and explained in a companion paper by one of the authors. We illustrate the use of these conditions by re-analyzing many previously-known examples of rank 2 SCFTs, and also by finding examples of new theories. The power of these conditions stems from the fact that for Coulomb branch stratifications a conjecturally complete list of physically allowed “elementary slices” is known. By contrast, constraining the possible elementary slices of symplectic singularities relevant for Higgs branch stratifications remains an open problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Homomorphisms of Rank-1 Quotient Divisible Groups

Torsion-free quotient divisible groups were introduced by R. Beaumont and R. Pierce in 1961. In 1998, A. A. Fomin and W. Wickless defined quotient divisible mixed groups and proved that categories of mixed quotient divisible groups and finite-rank torsion-free groups with quasihomomorphisms as morphisms are dual. In studying finite-rank torsion-free groups, rank-1 torsion-free groups play an important role, as many problems that are being solved in this class arise from them. This paper is devoted to the study of the homomorphism groups of rank-1 quotient divisible groups. The main achieved result is a full description of the homomorphism group in the language of characteristics.

97 MATHEMATICS AND COMPUTING↗

On Classification of Modular Categories by Rank: Table A.1

The feasibility of a classification-by-rank program for modular categories follows from the Rank-Finiteness Theorem. We develop arithmetic, representation theoretic and algebraic methods for classifying modular categories by rank. As an application, we determine all possible fusion rules for all rank=5 modular categories and describe the corresponding monoidal equivalence classes.

Bruillard, Paul↗

Tensor rank of the tripartite state |W>{sup xn}

Tensor rank refers to the number of product states needed to express a given multipartite quantum state. Its nonadditivity as an entanglement measure has recently been observed. In this Brief Report, we estimate the tensor rank of multiple copies of the tripartite state |W>=(1/sq root(3))(|100>+|010>+|001>). Both an upper bound and a lower bound of this rank are derived. In particular, it is proven that the rank of |W>{sup x}2 is 7, thus resolving a previously open problem. Some implications of this result are discussed in terms of transformation rates between |W>{sup xn} and multiple copies of the state |GHZ>=(1/sq root(2))(|000>+|111>).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Low-rank extremal positive-partial-transpose states and unextendible product bases

It is known how to construct, in a bipartite quantum system, a unique low-rank entangled mixed state with positive partial transpose (a PPT state) from an unextendible product basis (UPB), defined as an unextendible set of orthogonal product vectors. We point out that a state constructed in this way belongs to a continuous family of entangled PPT states of the same rank, all related by nonsingular unitary or nonunitary product transformations. The characteristic property of a state {rho} in such a family is that its kernel Ker {rho} has a generalized UPB, a basis of product vectors, not necessarily orthogonal, with no product vector in Im {rho}, the orthogonal complement of Ker {rho}. The generalized UPB in Ker {rho} has the special property that it can be transformed to orthogonal form by a product transformation. In the case of a system of dimension 3x3, we give a complete parametrization of orthogonal UPBs. This is then a parametrization of families of rank 4 entangled (and extremal) PPT states, and we present strong numerical evidence that it is a complete classification of such states. We speculate that the lowest rank entangled and extremal PPT states also in higher dimensions are related to generalized, nonorthogonal UPBs in similar ways.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Randomized low-rank decompositions of nuclear three-body interactions

First-principles simulations of many-fermion systems are commonly limited by the computational requirements of processing large data objects. As a remedy, we propose the use of low-rank approximations of three-body interactions, which are the dominant such limitation in nuclear physics. We introduce a randomized decomposition technique to handle the excessively large matrix dimensions and study the sensitivity of low-rank properties to interaction details. The developed low-rank three-nucleon interactions are benchmarked in ab initio simulations of few- and many-body systems. Exploiting low-rank properties provides a promising route to extend the microscopic description of atomic nuclei to large systems where storage requirements exceed the computational capacities of the most advanced high-performance computing facilities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

On Rank Selection for Nonnegative Matrix Factorization

Rank selection, i.e. the choice of factorization rank, is the first step in constructing Nonnegative Matrix Factorization (NMF) models. It is a long-standing problem which is not unique to NMF, but arises in most models which attempt to decompose data into its underlying components. Since these models are often used in the unsupervised setting, the rank selection problem is further complicated by the lack of ground truth labels. In this paper, we review and empirically evaluate the most commonly used schemes for NMF rank selection.

Eswar, Srinivas [Argonne National Laboratory]↗

SU-G-IeP1-13: Sub-Nyquist Dynamic MRI Via Prior Rank, Intensity and Sparsity Model (PRISM)

Purpose: Accelerated dynamic MRI is important for MRI guided radiotherapy. Inspired by compressive sensing (CS), sub-Nyquist dynamic MRI has been an active research area, i.e., sparse sampling in k-t space for accelerated dynamic MRI. This work is to investigate sub-Nyquist dynamic MRI via a previously developed CS model, namely Prior Rank, Intensity and Sparsity Model (PRISM). Methods: The proposed method utilizes PRISM with rank minimization and incoherent sampling patterns for sub-Nyquist reconstruction. In PRISM, the low-rank background image, which is automatically calculated by rank minimization, is excluded from the L1 minimization step of the CS reconstruction to further sparsify the residual image, thus allowing for higher acceleration rates. Furthermore, the sampling pattern in k-t space is made more incoherent by sampling a different set of k-space points at different temporal frames. Results: Reconstruction results from L1-sparsity method and PRISM method with 30% undersampled data and 15% undersampled data are compared to demonstrate the power of PRISM for dynamic MRI. Conclusion: A sub- Nyquist MRI reconstruction method based on PRISM is developed with improved image quality from the L1-sparsity method.

60 APPLIED LIFE SCIENCES↗

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗