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 163 records · Page 9

The Best Rank-(R{sub 1},R{sub 2},R{sub 3}) Approximation of Tensors by Means of a Geometric Newton Method

In the matrix case, the best low-rank approximation can be obtained directly from the truncated singular value decomposition. However, the best rank-(R{sub 1},R{sub 2},...,R{sub N}) approximation of higher-order tensors cannot be computed in a straightforward way. An additional difficulty comes from an invariance property of the cost function by the action of the orthogonal group. This means that the zeros of the cost function are not isolated and the plain Newton method might have difficulties. In this paper, we derive a geometric Newton method using the theory of quotient manifolds. Our algorithm has fast convergence in a neighborhood of the solution and is useful for a large class of problems. We mention some applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Rank reduced coupled cluster theory. I. Ground state energies and wavefunctions

We propose a compression of the opposite-spin coupled cluster doubles amplitudes of the form τ ab ij ≡ U V ia T VW U W jb , where U V ia are the n V -highest magnitude eigenvectors of the MP2 or MP3 doubles amplitudes. Together with a corresponding parameterization of the opposite-spin coupled cluster Lagrange multipliers of the form λ ij ab ≡ U V ia L VW U W jb , this yields a fully self-consistent parameterization of reduced-rank coupled cluster equations in terms of the Lagrangian L 0 ( T VW ,L VW ). Making this Lagrangian stationary with respect to the L VW parameters yields a perfectly determined set of equations for the T VW equations and coupled cluster energy. These equations can be solved using a Lyapunov equation for the first-order amplitude updates. We test this “rank-reduced coupled cluster” method for coupled cluster singles and doubles in medium sized molecules and find that substantial compression of the $\hat{T} $ 2 amplitudes is possible with acceptable accuracy.

74 ATOMIC AND MOLECULAR PHYSICS↗

Rank-reduced coupled-cluster. III. Tensor hypercontraction of the doubles amplitudes

In this work, we develop a quartic-scaling implementation of coupled-cluster singles and doubles (CCSD) based on low-rank tensor hypercontraction (THC) factorizations of both the electron repulsion integrals (ERIs) and the doubles amplitudes. This extends our rank-reduced (RR) coupled-cluster method to incorporate higher-order tensor factorizations. The THC factorization of the doubles amplitudes accounts for most of the gain in computational efficiency as it is sufficient, in conjunction with a Cholesky decomposition of the ERIs, to reduce the computational complexity of most contributions to the CCSD amplitude equations. Further THC factorization of the ERIs reduces the complexity of certain terms arising from nested commutators between the doubles excitation operator and the two-electron operator. We implement this new algorithm using graphical processing units and demonstrate that it enables CCSD calculations for molecules with 250 atoms and 2500 basis functions using a single computer node. Furthermore, we show that the new method computes correlation energies with comparable accuracy to the underlying RR-CCSD method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On the third cohomology of algebraic groups of rank two in positive characteristic

We evaluate the third cohomology of simple simply connected algebraic groups of rank 2 over an algebraically closed field of positive characteristic with coefficients in simple modules. It is assumed that the characteristic p of the field is greater than 3 for SL{sub 3}, greater than 5 for Sp{sub 4}, and greater than 11 for G{sub 2}. It follows from the main result that the dimensions of the cohomology spaces do not exceed the rank of the algebraic group in question. To prove the main results we study the properties of the first-quadrant Lyndon-Hochschild-Serre spectral sequence with respect to an infinitesimal subgroup, namely, the Frobenius kernel of the given algebraic group. Bibliography: 49 titles.

97 MATHEMATICS AND COMPUTING↗

Rings whose p-ranks do not exceed 1

We consider associative torsion-free rings of finite rank whose p-ranks do not exceed 1. For these rings, certain analogues of Wedderburn's theorem on finite-dimensional algebras are found. Bibliography: 11 titles. (paper)

97 MATHEMATICS AND COMPUTING↗

Hierarchical off-diagonal low-rank approximation of Hessians in inverse problems, with application to ice sheet model initialization

Obtaining lightweight and accurate approximations of discretized objective functional Hessians in inverse problems governed by partial differential equations (PDEs) is essential to make both deterministic and Bayesian statistical large-scale inverse problems computationally tractable. The cubic computational complexity of dense linear algebraic tasks, such as Cholesky factorization, that provide a means to sample Gaussian distributions and determine solutions of Newton linear systems is a computational bottleneck at large-scale. These tasks can be reduced to log-linear complexity by utilizing hierarchical off-diagonal low-rank (HODLR) matrix approximations. In this work, we show that a class of Hessians that arise from inverse problems governed by PDEs are well approximated by the HODLR matrix format. In particular, we study inverse problems governed by PDEs that model the instantaneous viscous flow of ice sheets. In these problems, we seek a spatially distributed basal sliding parameter field such that the flow predicted by the ice sheet model is consistent with ice sheet surface velocity observations. Here, we demonstrate the use of HODLR Hessian approximation to efficiently sample the Laplace approximation of the posterior distribution with covariance further approximated by HODLR matrix compression. Computational studies are performed which illustrate ice sheet problem regimes for which the Gauss–Newton data-misfit Hessian is more efficiently approximated by the HODLR matrix format than the low-rank (LR) format. We then demonstrate that HODLR approximations can be favorable, when compared to global LR approximations, for large-scale problems by studying the data-misfit Hessian associated with inverse problems governed by the first-order Stokes flow model on the Humboldt glacier and Greenland ice sheet.

97 MATHEMATICS AND COMPUTING↗

Towards dynamical low-rank approximation for neutrino kinetic equations. Part I: Analysis of an idealized relaxation model

Dynamical low-rank approximation (DLRA) is an emerging tool for reducing computational costs and provides memory savings when solving high-dimensional problems. Here, in this work, we propose and analyze a semi-implicit dynamical low-rank discontinuous Galerkin (DLR-DG) method for the space homogeneous kinetic equation with a relaxation operator, modeling the emission and absorption of particles by a background medium. Both DLRA and the discontinuous Galerkin (DG) scheme can be formulated as Galerkin equations. To ensure their consistency, a weighted DLRA is introduced so that the resulting DLR-DG solution is a solution to the fully discrete DG scheme in a subspace of the standard DG solution space. Similar to the standard DG method, we show that the proposed DLR-DG method is well-posed. We also identify conditions such that the DLR-DG solution converges to the equilibrium. Numerical results are presented to demonstrate the theoretical findings.

97 MATHEMATICS AND COMPUTING↗

Exploration of a Potential Desirability of Outcome Ranking Endpoint for Complicated Intra-Abdominal Infections Using 9 Registrational Trials for Antibacterial Drugs

Abstract Background Desirability of outcome ranking (DOOR) is a novel approach to clinical trial design that incorporates safety and efficacy assessments into an ordinal ranking system to evaluate overall outcomes of clinical trial participants. Here, we derived and applied a disease-specific DOOR endpoint to registrational trials for complicated intra-abdominal infection (cIAI). Methods Initially, we applied an a priori DOOR prototype to electronic patient-level data from 9 phase 3 noninferiority trials for cIAI submitted to the US Food and Drug Administration between 2005 and 2019. We derived a cIAI-specific DOOR endpoint based on clinically meaningful events that trial participants experienced. Next, we applied the cIAI-specific DOOR endpoint to the same datasets and, for each trial, estimated the probability that a participant assigned to the study treatment would have a more desirable DOOR or component outcome than if assigned to the comparator. Results Three key findings informed the cIAI-specific DOOR endpoint: (1) a significant proportion of participants underwent additional surgical procedures related to their baseline infection; (2) infectious complications of cIAI were diverse; and (3) participants with worse outcomes experienced more infectious complications, more serious adverse events, and underwent more procedures. DOOR distributions between treatment arms were similar in all trials. DOOR probability estimates ranged from 47.4% to 50.3% and were not significantly different. Component analyses depicted risk-benefit assessments of study treatment versus comparator. Conclusions We designed and evaluated a potential DOOR endpoint for cIAI trials to further characterize overall clinical experiences of participants. Similar data-driven approaches can be utilized to create other infectious disease–specific DOOR endpoints.

Immunology↗

Strong bound between trace distance and Hilbert-Schmidt distance for low-rank states

The trace distance between two quantum states, ρ and σ, is an operationally meaningful quantity in quantum information theory. However, in general it is difficult to compute, involving the diagonalization of ρ–σ. In contrast, the Hilbert-Schmidt distance can be computed without diagonalization, although it is less operationally significant. Here, we relate the trace distance and the Hilbert-Schmidt distance with a bound that is particularly strong when either ρ or σ is low rank. Our bound is stronger than the bound one could obtain via the norm equivalence of the Frobenius and trace norms. We also consider bounds that are useful not only for low-rank states but also for low-entropy states. Here, our results have relevance to quantum information theory, quantum algorithm design, and quantum complexity theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Deterministic transformations of multipartite entangled states with tensor rank 2

Transformations involving only local operations assisted with classical communication are investigated for multipartite entangled pure states having tensor rank 2. All necessary and sufficient conditions for the possibility of deterministically converting truly multipartite, rank-2 states into each other are given. Furthermore, a chain of local operations that successfully achieves the transformation has been identified for all allowed transformations. The identified chains have two nice features: (1) each party needs to carry out at most one local operation and (2) all of these local operations are also deterministic transformations by themselves. Finally, it is found that there are disjoint classes of states, all of which can be identified by a single real parameter, which remain invariant under deterministic transformations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accelerating self-consistent field iterations in Kohn-Sham density functional theory using a low-rank approximation of the dielectric matrix

We present an efficient preconditioning technique for accelerating the fixed-point iteration in real-space Kohn-Sham density functional theory (DFT) calculations. The preconditioner uses a low-rank approximation of the dielectric matrix (LRDM) based on Gâteaux derivatives of the residual of fixed-point iteration along appropriately chosen direction functions. We develop a computationally efficient method to evaluate these Gâteaux derivatives in conjunction with the Chebyshev filtered subspace iteration procedure, an approach widely used in large-scale Kohn-Sham DFT calculations. Further, we propose a variant of LRDM preconditioner based on adaptive accumulation of low-rank approximations from previous self-consistent field iterations, and also extend the LRDM preconditioner to spin-polarized Kohn-Sham DFT calculations. We demonstrate the robustness and efficiency of the LRDM preconditioner against other widely used preconditioners on a range of benchmark systems with sizes ranging from ~100 to 1100 atoms (~500–20,000 electrons). The benchmark systems include various combinations of metal-insulating-semiconducting heterogeneous material systems, nanoparticles with localized d orbitals near the Fermi energy, nanofilm with metal dopants, and magnetic systems. In all benchmark systems, the LRDM preconditioner converges robustly within 20–30 iterations. In contrast, other widely used preconditioners show slow convergence in many cases, as well as divergence of the fixed-point iteration in some cases. Lastly, we demonstrate the computational efficiency afforded by the LRDM method, with up to 3.4-fold reduction in computational cost for the total ground-state calculation compared to other preconditioners.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Integrated Metrics for County-Level Resilience Ranking Using Entropy and TOPSIS

In the face of atypical weather events, power infrastructure failures, and limited resources for resilience investment, energy decision-makers need data-driven metrics to allocate resilience investments and maximize the reduction of power outage impacts. For state-level planning, for instance, ranking the resilience of each county is key to ensuring effective distribution of resources. In such cases, resilience for each spatial unit is multifaceted and is captured by a set of indicators (i.e., metrics) that can be combined into an overall score that reduces the complexity of power outage dynamics to a single decision metric. However, weighting of these indicators is often addressed by simplifying assumptions (i.e., equal weights) or semi-subjective methods that rely on user-defined weights that can introduce biases (e.g., weighted average score). Within the disaster risk reduction and resilience engineering community, a recurring challenge in multicriteria decision-making is the objective weighting of indicators for composite indices. To address this issue, we have leveraged a Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) combined with an entropy-based weighting approach to calculated the integrated scores. This method objectively determines the importance of each metric, better discerns between spatial units (i.e., counties), and offers a more reliable ranking of counties according to their relative resilience attributes. By improving methods for integrating resilience indicators, our approach helps planners and decision-makers prioritize resources more effectively for more efficient resilience investments.

Bhusal, Narayan [Oak Ridge National Laboratory (OR↗

Accelerating the Global Arrays ComEx Runtime using Multiple Progress Ranks

Partitioned Global Address Space (PGAS) models are part of system software that are being designed to support communication runtime for exascale applications. Suitability of using MPI as a scalable PGAS communication subsystem has been shown as a viable option due to its standardization and higher performance. We used MPI two-sided semantics with a combination of automatic and user defined splitting of MPI communicators to achieve asynchronous progress. Our implementation can make use of multiple asynchronous progress ranks (PR) per node that can be mapped to the computing architecture of a node in a distributed cluster. We are able to show significant speed up of over 2.0X and scaling of communication bound computational chemistry application over 1024 nodes of state- of-the-art HPC clusters. Our results show that while running a communication bound application workload on a certain number of cluster nodes, a use of optimum number of ranks dedicated for communication may be used to achieve asynchronous communication progress and obtain highest performance.

PGAS, global-arrays, NWCHEM, NWChemEx, HPC, GPGPU↗

Low-rank Tensor Completion for PMU Data Recovery

This paper proposes a tensor completion method for the recovery of missing phasor measurement unit (PMU) measurements. Tensor completion as the general case of matrix completion has attracted increasing attention in recent years. The imputation accuracy for the existing matrix completion methods may be significantly reduced when there are consecutive data losses across multiple data channels. To tackle this issue, we explore the multi-way characteristics of PMU measurements by using a tensor model. We leverage the low-rank property of the PMU measurements and formulate the missing PMU data recovery problem as a low-rank tensor completion problem. An efficient algorithm based on alternating direction method of multipliers (ADMM) is developed to solve the tensor completion problem. The experiments using the real PMU dataset show that the proposed method exhibits better imputation accuracy compared with the conventional data recovery methods.

Ghasemkhani, Amir↗

Rank-Limiting Strategies for Optimizing Tensor-Train Finite-Difference Time-Domain Simulations

We introduce rank-limiting strategies to optimize tensor-train decompositions for three-dimensional finite-difference time-domain simulations using the relationship between the tensors and their specific dimensionality. These include the use of hard caps on the inner ranks of the tensor train decomposition and the use of a group rounding algorithm taking into account all field components simultaneously. Here, several numerical examples are considered to verify the efficacy of the proposed optimization strategies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Stochastic correlation analysis to rank the impact of intermittent wind generation on unreliability margins of power systems

Power systems are vulnerable to extreme contingencies (like an outage of a major generating substation or transmission line) that can cause significant generation and load loss and can lead to further cascading outages of other transmission facilities and generators in the system. Power systems operators take time-ahead actions (real time to day ahead) actions based on forecasted data as well as telemetry. However, there is a probability of extreme swings in wind generation that can push the power system that is already close to system boundaries into unreliable states. Increasing penetration on wind generation and uncertainties in short term forecast can move the system into operational states that can violate N-1 reliability criteria. While the power system planning accounts for worst case analyses to mitigate such emergencies, it is necessary to understand the spatial and temporal correlation of load buses with intermittent wind generation. The ranking of wind generators based on stochastic correlation to unreliability margins of load buses provides an insight of system vulnerabilities that can be corrected by appropriate emergency controls. A Monte-Carlo simulation of wind uncertainty forecast is performed to identify the probability distributions of unreliability margins. Ranking of wind generators is performed based on stochastic correlation analysis of the wind power generated and the load losses at the buses. This helps in not only identifying weak buses in the power system but also in identifying the vulnerable wind locations to plan for system reinforcements. Power system modeling and hybrid simulation to calculate unreliability margins are performed using DCAT and demonstrated on the 32-bus Nordic test system.

generators, wind forecasting, wind power generatio↗

On low-rank updates to the singular value and Tucker decompositions

The singular value decomposition is widely used in signal processing and data mining. Since the data often arrives in a stream, the problem of updating matrix decompositions under low-rank modification has been widely studied. Brand developed a technique in 2006 that has many advantages. However, the technique does not directly approximate the updated matrix, but rather its previous low-rank approximation added to the new update, which needs justification. Further, the technique is still too slow for large information processing problems. We show that the technique minimizes the change in error per update, so if the error is small initially it remains small. We show that an updating algorithm for large sparse matrices should be sub-linear in the matrix dimension in order to be practical for large problems, and demonstrate a simple modification to the original technique that meets the requirements.

99 GENERAL AND MISCELLANEOUS↗

Scalable Failure Masking for Stencil Computations using Ghost Region Expansion and Cell to Rank Remapping

In order to achieve exascale systems, application resilience needs to be addressed. Some programming models, such as task-DAG (directed acyclic graphs) architectures, currently embed resilience features whereas traditional SPMD (single program, multiple data) and message-passing models do not. Since a large part of the community's code base follows the latter models, it is still required to take advantage of application characteristics to minimize the overheads of fault tolerance. To that end, this paper explores how recovering from hard process/node failures in a local manner is a natural approach for certain applications to obtain resilience at lower costs in faulty environments. In particular, this paper targets enabling online, semitransparent local recovery for stencil computations on current leadership-class systems as well as presents programming support and scalable runtime mechanisms. Also described and demonstrated in this paper is the effect of failure masking, which allows the effective reduction of impact on total time to solution due to multiple failures. Furthermore, we discuss, implement, and evaluate ghost region expansion and cell-to-rank remapping to increase the probability of failure masking. To conclude, this paper shows the integration of all aforementioned mechanisms with the S3D combustion simulation through an experimental demonstration (using the Titan system) of the ability to tolerate high failure rates (i.e., node failures every five seconds) with low overhead while sustaining performance at large scales. In addition, this demonstration also displays the failure masking probability increase resulting from the combination of both ghost region expansion and cell-to-rank remapping.

97 MATHEMATICS AND COMPUTING↗