Search NASA⌕ Search

SEARCH · Search NASA

Results for “matrix-based method”

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 37 records · Page 2

Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods

In this study, we develop a new tensor-product based preconditioner for discontinuous Galerkin methods with polynomial degrees higher than those typically employed. This preconditioner uses an automatic, purely algebraic method to approximate the exact block Jacobi preconditioner by Kronecker products of several small, one-dimensional matrices. Traditional matrix-based preconditioners require O ( p 2d ) storage and O ( p 3d ) computational work, where p is the degree of basis polynomials used, and d is the spatial dimension. Our SVD-based tensor-product preconditioner requires O ( p d+1 ) storage, O ( p d+1 ) work in two spatial dimensions, and O ( p d+2 ) work in three spatial dimensions. Combined with a matrix-free Newton–Krylov solver, these preconditioners allow for the solution of DG systems in linear time in p per degree of freedom in 2D, and reduce the computational complexity from O ( p 9 ) to O ( p 5 ) in 3D. Numerical results are shown in 2D and 3D for the advection, Euler, and Navier–Stokes equations, using polynomials of degree up to p = 30. For many test cases, the preconditioner results in similar iteration counts when compared with the exact block Jacobi preconditioner, and performance is significantly improved for high polynomial degrees p .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robustness Analysis and Reliable Flight Regime Estimation of an Integrated Resilent Control System for a Transport Aircraft

Formal robustness analysis of aircraft control upset prevention and recovery systems could play an important role in their validation and ultimate certification. As a part of the validation process, this paper describes an analysis method for determining a reliable flight regime in the flight envelope within which an integrated resilent control system can achieve the desired performance of tracking command signals and detecting additive faults in the presence of parameter uncertainty and unmodeled dynamics. To calculate a reliable flight regime, a structured singular value analysis method is applied to analyze the closed-loop system over the entire flight envelope. To use the structured singular value analysis method, a linear fractional transform (LFT) model of a transport aircraft longitudinal dynamics is developed over the flight envelope by using a preliminary LFT modeling software tool developed at the NASA Langley Research Center, which utilizes a matrix-based computational approach. The developed LFT model can capture original nonlinear dynamics over the flight envelope with the ! block which contains key varying parameters: angle of attack and velocity, and real parameter uncertainty: aerodynamic coefficient uncertainty and moment of inertia uncertainty. Using the developed LFT model and a formal robustness analysis method, a reliable flight regime is calculated for a transport aircraft closed-loop system.

Shin, Jong-Yeob↗

A new method for detecting abrupt changes in the dependence among multivariate hydrological series based on moving cut total correlation

Knowledge of how to define and estimate the dependence among multivariate hydrological series is essential for detecting abrupt changes in the dependence. Here, in this paper, a new method (BMCTC) is proposed to detect all possible abrupt change points in the dependence among multivariate hydrological series. The total correlation estimated by the matrix-based Renyi's alpha-order entropy functional is firstly introduced to define and measure the dependence strength among multivariate hydrological series. Then, the moving cut total correlation (MCTC) sequence is built by the moving window technique, which is used to measure changes in the dependence strength among multivariate hydrological series. Finally, the Bernaola-Galvan algorithm is used to detect all change points of the MCTC sequence. Simulations are performed to compare the effectiveness of BMCTC with Pearson correlation (BMCPC) and Spearman correlation (BMCSC), Cramer-von Mises (CvM) and copula-based likelihood-ratio (CLR). The results show that all change points are detected by BMCTC regardless of the samples size, but wrong change points or no change points are detected by other methods in most cases. BMCTC is applied to detect change points in the dependence among annual runoff, precipitation and sediment discharge series in the Xiliugou and the Kuyehe River, China. It is found that the dependence among runoff, precipitation and sediment discharge changed abruptly in 1980 and 1996 in the Kuyehe River and in 1999 in the Xiliugou River. These changes are mainly caused by human activities such as construction of water conservancy projects and coal mining.

54 ENVIRONMENTAL SCIENCES↗

Integrated Model, Batch and Domain Parallelism in Training Neural Networks

We propose a new integrated method of exploiting model, batch and domain parallelism for the training of deep neural networks (DNNs) on large distributed-memory computers using minibatch stochastic gradient descent (SGD). Our goal is to find an efficient parallelization strategy for a fixed batch size using $P$ processes. Our method is inspired by the communication-avoiding algorithms in numerical linear algebra. We see $P$ processes as logically divided into a $P_r \times P_c$ grid where the $P_r$ dimension is implicitly responsible for model/domain parallelism and the $P_c$ dimension is implicitly responsible for batch parallelism. In practice, the integrated matrix-based parallel algorithm encapsulates these types of parallelism automatically. We analyze the communication complexity and analytically demonstrate that the lowest communication costs are often achieved neither with pure model nor with pure data parallelism. We also show how the domain parallel approach can help in extending the theoretical scaling limit of the typical batch parallel method.

97 MATHEMATICS AND COMPUTING↗

Scalable Tensor Methods for Nonuniform Hypergraphs

While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers. A recently proposed adjacency tensor is applicable to nonuniform hypergraphs, but is prohibitively costly to form and analyze in practice. We develop tensor times same vector (TTSV) algorithms for this tensor which improve complexity from $O(n^r)$ to a low-degree polynomial in $r$, where $n$ is the number of vertices and $r$ is the maximum hyperedge size. Our algorithms are implicit, avoiding formation of the order $r$ adjacency tensor. Here, we demonstrate the flexibility and utility of our approach in practice by developing tensor-based hypergraph centrality and clustering algorithms. We also show these tensor measures offer complementary information to analogous graph-reduction approaches on data, and are also able to detect higher-order structure that many existing matrix-based approaches provably cannot.

97 MATHEMATICS AND COMPUTING↗

Statistical learning for predicting density–matrix-based electron dynamics

In this study, we consider the problem of learning density-dependent molecular Hamiltonian matrices from time series of electron density matrices, all in the context of Hartree–Fock theory. Prior work developed a solution to this problem for small molecular systems with density and Hamiltonian matrices of size at most 6 × 6. Here, using a battery of techniques, we scale prior methods to larger molecular systems with, for example, 29 × 29 matrices. This includes systems that either have more electrons or are expressed in large basis sets such as 6-311++G**. Scaling the method to larger systems enhances its relevance for realistic applications in chemistry and physics. To achieve this scaling, we apply dimensionality reduction, ridge regression and analytic computation of Hessians. Through the combination of these techniques, we are able to learn Hamiltonians by minimizing an objective function that encodes local propagation error. Importantly, these learned Hamiltonians can then be used to predict electron dynamics for thousands of steps: When we use our learned Hamiltonians to numerically solve the time-dependent Hartree–Fock equation, we obtain predicted dynamics that are in close quantitative agreement with ground truth dynamics. This includes field-off trajectories similar to the training data and field-on trajectories outside of the training data.

59 BASIC BIOLOGICAL SCIENCES↗

S -matrix calculations of energy levels of sodiumlike ions

A recent S -matrix-based QED calculation of energy levels of the lithium isoelectronic sequence is extended to the general case of a valence electron outside an arbitrary filled core. Emphasis is placed on modifications of the lithiumlike formulas required because more than one core state is present, and an unusual feature of the two-photon exchange contribution involving autoionizing states is discussed. Here, the method is illustrated with a calculation of the energy levels of sodiumlike ions, with results for 3s 1/2 , 3p 1/2 , and 3p 3/2 energies tabulated for the range Z = 30 – 100 . Comparison with experiment and other calculations is given, and prospects for extension of the method to ions with more complex electronic structure discussed.

74 ATOMIC AND MOLECULAR PHYSICS↗

Phase identification using co‐association matrix ensemble clustering

Calibrating distribution system models to aid in the accuracy of simulations such as hosting capacity analysis is increasingly important in the pursuit of the goal of integrating more distributed energy resources. The recent availability of smart meter data is enabling the use of machine learning tools to automatically achieve model calibration tasks. This research focuses on applying machine learning to the phase identification task, using a co‐association matrix‐based, ensemble spectral clustering approach. The proposed method leverages voltage time series from smart meters and does not require existing or accurate phase labels. This work demonstrates the success of the proposed method on both synthetic and real data, surpassing the accuracy of other phase identification research.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimizing observables with machine learning for better unfolding

Most measurements in particle and nuclear physics use matrix-based unfolding algorithms to correct for detector effects. In nearly all cases, the observable is defined analogously at the particle and detector level. We point out that while the particle-level observable needs to be physically motivated to link with theory, the detector-level need not be and can be optimized. We show that using deep learning to define detector-level observables has the capability to improve the measurement when combined with standard unfolding methods.

47 OTHER INSTRUMENTATION↗

Gamma-ray spectrometry analysis methods for radioisotope dissolution and mixing for nuclear forensics applications

We report the production of surrogate nuclear explosive debris involves the dissolution of irradiated fissile material, elemental isolation, and recombination based on required fission product ratios. Gamma-ray spectrometry is used following each step to assess the radioactive fission product inventory. A high-purity germanium detector is used to measure each sample, and the detector efficiencies are determined prior to sample measurements. Through radiochemical techniques, elements are isolated and recombined into samples with specific fission product ratios. As a result, a matrix-based approach can account for imperfect chemical separations to calculate the proper mixture volumes to obtain intended volatile-to-refractory fission product ratios, or R-values.

07 ISOTOPE AND RADIATION SOURCES↗

Matrix-free subcell residual distribution for Bernstein finite element discretizations of linear advection equations

In this work, we introduce a new residual distribution (RD) framework for the design of bound-preserving high-resolution finite element schemes. The continuous and discontinuous Galerkin discretizations of the linear advection equation are modified to construct local extremum diminishing (LED) approximations. To that end, we perform mass lumping and redistribute the element residuals in a manner which guarantees the LED property. The hierarchical correction procedure for high-order Bernstein finite element discretizations involves localization to subcells and definition of bound-preserving weights for subcell contributions. Using strong stability preserving (SSP) Runge–Kutta methods for time integration, we prove the validity of discrete maximum principles under CFL-like time step restrictions. The low-order version of our method has roughly the same accuracy as the one derived from a piecewise (multi)-linear approximation on a submesh with the same nodal points. In high-order extensions, we use an element-based flux-corrected transport (FCT) algorithm which can be interpreted as a nonlinear RD scheme. The proposed LED corrections are tailor-made for matrix-free implementations which avoid the rapidly growing cost of matrix assembly for high-order Bernstein elements. The results for 1D, 2D, and 3D test problems compare favorably to those obtained with the best matrix-based approaches.

97 MATHEMATICS AND COMPUTING↗

The Geocybernetic Assessment Matrix (GAM) — A new assessment tool for evaluating the level and nature of sustainability or unsustainability

Evaluating sustainability from EIA-based assessments has been problematic at best. This is due to the use of reductionist and qualitative approaches which is dependent upon the perspective of the assessor(s). Therefore, a more rigorous and holistic approach is required to evaluate sustainability in a more consistent way. In this paper, a matrix-based methodology in order to assess the indicated level and nature of sustainability for any project, policy, indicators, legislation, regulation, or other framework is described. The Geocybernetic Assessment Matrix (GAM) is designed to evaluate the level and nature of sustainability or unsustainability occurring in respect the fundamental and complex geocybernetic paradigms. The GAM method is described in detail in respect to the theory behind it and the methodology. The GAM is then demonstrated using an appropriate case study — Part 1 of the UK Climate Change Act (2008) concerning carbon budgets and targets. The results indicate that the Part 1 of Act may not achieve the desired goals in contributing towards sustainable development through the stated mechanisms for carbon budgets and targets. The paper then discusses the broader context of the GAM with respect to the core themes evident in the development and application of the GAM of: sustainability science; sustainability assessment; application value of the GAM; and future research and development. - Highlights: • A new assessment tool called the Geocybernetic Assessment Matrix (GAM) described. • GAM evaluates the level and nature of sustainability or unsustainability. • GAM demonstrated by application to Part 1 of the UK Climate Change Act (CCA). • Part 1 of CCA has significant flaws in achieving a sustainable pathway. • GAM offers a potentially useful tool for quantitatively evaluating sustainability.

54 ENVIRONMENTAL SCIENCES↗

ROM-Based Surrogate Systems Modeling of EBR-II

We report the System Analysis Module (SAM), developed and maintained by Argonne National Laboratory, is designed to provide whole-plant transient safety analysis capabilities for a number of advanced non-light water reactors, including sodium-cooled fast reactor (SFR), lead-cooled fast reactor (LFR), and molten salt reactor (MSR)/fluoride-salt-cooled high-temperature reactor (FHR) designs. SAM is primarily constructed as a systems-level analysis tool, with the potential to incorporate reduced order models from three-dimensional computational fluid dynamics (CFD) simulations to improve characterization of complex, multidimensional physics. It is recognized that the computational expense associated with CFD can be intractable for various engineering analyses, such as uncertainty quantification, inference, and design optimization. This paper explores the reducibility of a SAM model using recent advances in randomized linear algebra techniques, which attempt to find recurring patterns in the various realizations generated by a model after randomly perturbing all its input parameters. The reduction is described in terms of fewer degrees of freedom (DOFs), referred to as the active DOFs, for the model variables such as input model parameters and model responses. The results indicate that there is significant room for additional reduction that may be leveraged for additional computational gains when employing SAM for engineering-intensive analyses that require repeated model executions. Different from physics-based reduction approaches, the proposed approach allows one to estimate upper bounds on the reduction errors, which are rigorously developed in this work. Finally, different methods for surrogate model construction, such as regression and neural network-based training, are employed to correlate the input and output active DOFs, which are related back to the original variables using matrix-based linear transformations.

42 ENGINEERING↗

3D-ReG: A 3D ReRAM-based Heterogeneous Architecture for Training Deep Neural Networks

Deep neural network (DNN) models are being expanded to a broader range of applications. The computational capability of traditional hardware platforms cannot accommodate the growth of model complexity. Among recent technologies to accelerate DNN, resistive memory (ReRAM)-based processing-in-memory (PIM) emerged as a promising solution for DNN inference due to its high efficiency for matrix-based computation. We face two major technical challenges in extending the use of ReRAM-based accelerators for training: (1) full-precision data is essential in back-propagation; (2) the need to support both feed-forward and back-propagation aggravates the data-movement burden. We propose a heterogeneous architecture named as 3D-ReG, which leverages full-precision GPU to ensure training accuracy and low-overhead 3D integration to provide low-cost data movements. Moreover, we introduce conservative and aggressive task-mapping schemes, which partition the computation phases in different ways to balance execution efficiency and training accuracy. We evaluate 3D-ReG implemented with two 3D integration technologies, through-silicon vias (TSVs) and monolithic inter-tier vias (MIVs), and compare them with GPU-only and PIM-only counterparts. Various GPU-only platforms using two main-memory technologies (DRAM, ReRAM) and three interconnect technologies (2D, TSV, MIV) are evaluated as well. Experimental results show that 3D-ReG can achieve on average 5.64× training speedup and 3.56× higher energy efficiency compared with the GPU with DRAM as main memory, at the cost of 0.05%–3.39% accuracy drop. We define a new metric, gain-loss ratio (GLR), which quantitatively evaluates the capability of a DNN training hardware in terms of the model accuracy and hardware efficiency. The results of our comparison show that the aggressive task-mapping scheme on MIV-based 3D-ReG outperforms the other methods.

Computer Science↗

Matrix-based Parallel Redistribution

MatRed is a parallel redistribution tool for HPC applications. It provides a simple approach that only requires a few relation matrices between entities to build redistribution matrices in parallel simulation codes. In particular, MatRed is well-suited for simulation codes based on finite element/volume methods.

Kalchev, DelyanZ [Lawrence Livermore National Labo↗

From IEC 61853 power measurements to PV system simulations.

The IEC 61853 PV module energy rating standard requires measuring module power (and hence efficiency) over a matrix of irradiance and temperature conditions. These matrix points represent nearly the full range of operating conditions encountered in the field in all but the most extreme locations, and create an opportunity to develop alternative approaches to existing modelssuch as the single-diode models and the Sandia Array Performance Modelfor calculating system performance. This report begins by discussing the bilinear interpolation and extrapolation method from IEC 61853-3, and then describes four existing model-based methods that could be used with matrix measurements. Then a new model is developed and all options are compared according to seven objective criteria using the matrix measurements of four PV modules of different technologies. The results show that the new model is an excellent candidate for launching power matrix-based PV system simulations.

14 SOLAR ENERGY↗

Matrix-based, finite-difference algorithms for computational acoustics

A compact numerical algorithm is introduced for simulating multidimensional acoustic waves. The algorithm is expressed in terms of a set of matrix coefficients on a three-point spatial grid that approximates the acoustic wave equation with a discretization error of O(h exp 5). The method is based on tracking a local phase variable and its implementation suggests a convenient coordinate splitting along with natural intermediate boundary conditions. Results are presented for oblique plane waves and compared with other procedures. Preliminary computations of acoustic diffraction are also considered.

Davis, Sanford↗

Uncertainty Modeling for Robustness Analysis of Control Upset Prevention and Recovery Systems

Formal robustness analysis of aircraft control upset prevention and recovery systems could play an important role in their validation and ultimate certification. Such systems (developed for failure detection, identification, and reconfiguration, as well as upset recovery) need to be evaluated over broad regions of the flight envelope and under extreme flight conditions, and should include various sources of uncertainty. However, formulation of linear fractional transformation (LFT) models for representing system uncertainty can be very difficult for complex parameter-dependent systems. This paper describes a preliminary LFT modeling software tool which uses a matrix-based computational approach that can be directly applied to parametric uncertainty problems involving multivariate matrix polynomial dependencies. Several examples are presented (including an F-16 at an extreme flight condition, a missile model, and a generic example with numerous crossproduct terms), and comparisons are given with other LFT modeling tools that are currently available. The LFT modeling method and preliminary software tool presented in this paper are shown to compare favorably with these methods.

Belcastro, Christine M.↗