Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical algorithm”

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 1,207 records · Page 67

Distributed Optimal Dispatch of Distributed Energy Resources Over Lossy Communication Networks

In this paper, we consider the economic dispatch problem (EDP), where a cost function that is assumed to be strictly convex is assigned to each of distributed energy resources (DERs), over packet dropping networks. The goal of a standard EDP is to minimize the total generation cost while meeting total demand and satisfying individual generator output limit. We propose a distributed algorithm for solving the EDP over networks. The proposed algorithm is resilient against packet drops over communication links. Under the assumption that the underlying communication network is strongly connected with a positive probability and the packet drops are independent and identically distributed (i.i.d.), we show that the proposed algorithm is able to solve the EDP. Numerical simulation results are used to validate and illustrate the main results of the paper.

97 MATHEMATICS AND COMPUTING↗

Multiarea Distribution System State Estimation via Distributed Tensor Completion

Here, this paper proposes a model-free distribution system state estimation method based on tensor completion using canonical polyadic decomposition. In particular, we consider a setting where the network is divided into multiple areas. The measured physical quantities at buses located in the same area are processed by an area controller. A three-way tensor is constructed to collect these measured quantities. The measurements are analyzed locally to recover the full state information of the network. A distributed closed-form iterative algorithm based on the alternating direction method of multipliers is developed to obtain the low-rank factors of the whole network state tensor where information exchange happens only between neighboring areas. The convergence properties of the distributed algorithm and the sufficient conditions on the number of samples for each smaller network that guarantee the identifiability of the factors of the state tensor are presented. To demonstrate the efficacy of the proposed algorithm and to check the identifiability conditions, numerical simulations are carried out using the IEEE 123-bus system and a large-scale real utility feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms

Although mixed precision arithmetic has recently garnered interest for training dense neural networks, many other applications could benefit from the speedups and lower storage cost if applied appropriately. The growing interest in employing mixed precision computations motivates the need for rounding error analysis that properly handles behavior from mixed precision arithmetic. We develop mixed precision variants of existing Householder QR algorithms and show error analyses supported by numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation

For optimization problems with linear equality constraints, we prove that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraint matrix. In this work, we develop reduced compact representations of the limited-memory inverse BFGS Hessian to compute search directions efficiently when the constraint Jacobian is sparse. Orthogonal projections are implemented by a sparse QR factorization or a preconditioned LSQR iteration. In numerical experiments two proposed trust-region algorithms improve in computation times, often significantly, compared to previous implementations of related algorithms and compared to IPOPT.

97 MATHEMATICS AND COMPUTING↗

Space-Split Algorithm for Sensitivity Analysis of Discrete Chaotic Systems With Multidimensional Unstable Manifolds

Accurate approximations of the change of a system's output and its statistics with respect to the input are highly desired in computational dynamics. Ruelle's linear response theory provides breakthrough mathematical machinery for computing the linear response of chaotic dynamical systems. In this paper, we propose an algorithm for sensitivity analysis of discrete chaos with an arbitrary number of positive Lyapunov exponents. We combine the concept of perturbation space-splitting, which regularizes Ruelle's original expression, together with measure-based parameterization of the expanding subspace. We use these tools to rigorously derive trajectory-following recursive relations that converge exponentially fast, and construct a memory-efficient Monte Carlo scheme for derivatives of the output statistics. Thanks to the regularization and lack of simplifying assumptions on the system's behavior, our method is immune to the common problems of other popular methods such as the exploding tangent solutions and unphysical shadowing directions. Here, we provide a ready-to-use algorithm, analyze its complexity, and demonstrate several numerical examples of sensitivity computation using physically-inspired low-dimensional systems.

97 MATHEMATICS AND COMPUTING↗

BoBa

BoBa is a C++ software library for working with large matrices, tensors, and tensor decompositions. The library provides tools for dense matrix and tensor operations, tensor decompositions, and tensor decomposition methods that support modern CPU and GPU architectures. It includes portable abstractions for linear algebra, tensor algebra, and multidimensional computation. BoBa is intended for scientific computing applications that involve large multidimensional data sets or high dimensional mathematical models. Its capabilities support tasks such as data compression, linear algebra, efficient numerical computation, and the development of scalable algorithms for heterogeneous hardware. Tutorials, tests, and example applications are included to help users learn and apply the library.

Yao, Jin [Lawrence Livermore National Laboratory (↗

Final Report---Optimization Under Nonconvexity and Uncertainty: Algorithms and Software

the goal of this work was to develop new algorithmic techniques for solving large-scale numerical optimization problems, focusing on problems classes that have proven to be among the most challenging for practitioners: those involving uncertainty and those involving nonconvexity. This research advanced the state-of-the-art in solving mixed integer linear programs containing symmetry, mixed integer nonlinear programs, and stochastic optimization problems. The focus of the work done in the continuation was on Mixed Integer Nonlinear Programs (MINLP)s and Mixed Integer Linear Programs (MILP)s, especially those containing a great deal of symmetry.

97 MATHEMATICS AND COMPUTING↗

Multilevel Method for Modeling Large-Scale Networks

Understanding the behavior of real complex networks is of great theoretical and practical significance. It includes developing accurate artificial models whose topological properties are similar to the real networks, generating the artificial networks at different scales under special conditions, investigating a network dynamics, reconstructing missing data, predicting network response, detecting anomalies and other tasks. Network generation, reconstruction, and prediction of its future topology are central issues of this field. In this project, we address the questions related to the understanding of the network modeling, investigating its structure and properties, and generating artificial networks. Most of the modern network generation methods are based either on various random graph models (reinforced by a set of properties such as power law distribution of node degrees, graph diameter, and number of triangles) or on the principle of replicating an existing model with elements of randomization such as R-MAT generator and Kronecker product modeling. Hierarchical models operate at different levels of network hierarchy but with the same finest elements of the network. However, in many cases the methods that include randomization and replication elements on the finest relationships between network nodes and modeling that addresses the problem of preserving a set of simplified properties do not fit accurately enough the real networks. Among the unsatisfactory features are numerically inadequate results, non-stability of algorithms on real (artificial) data, that have been tested on artificial (real) data, and incorrect behavior at different scales. One reason is that randomization and replication of existing structures can create conflicts between fine and coarse scales of the real network geometry. Moreover, the randomization and satisfying of some attribute at the same time can abolish those topological attributes that have been undefined or hidden from researchers. We propose to develop multilevel methods to model complex networks. The key point of the proposed strategy is that it will help to preserve part of the unknown structural attributes by guaranteeing the similar behavior of the real and artificial model on different scales.

99 GENERAL AND MISCELLANEOUS↗

Efficient Coupling of Monte-Carlo Neutral and Fluid Plasma Models

The objective of this project was to develop an efficient scheme to couple kinetic Monte-Carlo (MC) neutral-species and fluid plasma-(charged-) species codes for the simulation of transport in the outer edge region of magnetic fusion energy (MFE) edge simulation. There was a need for improvement over existing plasma-neutral transport codes, which are either all-fluid, and insufficiently accurate in some important regimes, or very slow due to their use of simple explicit (operator-split) coupling.The resulting capability will be of great value in the interpretation and design of present-day and future MFE plasma devices (e.g., ITER). We developed and demonstrated several new algorithms that can greatly accelerate coupling between numerical code/model compon ents where the coupling introduces numerical “stiffness” and where there is a Monte-Carlo component.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Multiscale dynamics of reactive fronts in the subsurface

1. Brief summary of progress to date. Major Goals of the Project. Overreaching goals of the proposed activity are to develop an or- ganizing framework to describe nonlinear reactive transport in geologic systems over many length and time scales, and corresponding physics-based adaptive multi-scale hybrid models. We will also provide computational tools for robust uncertainty quantification in hybrid simulations. Major Activities of the Project. The major activities in this reporting period have focused on developing a time-averaging framework for ADR transport (Task 1) and global diagnosis criteria for spatio-temporal algorithm refinement (Task 2), as well as numerical validation and verification of the analytical approaches developed. The main activities are as follows: (a) We use homogenization theory to perform a spatio-temporal upscaling of pore-scale advection- diffusion equation in a periodic porous medium in the presence of fluctuating boundary conditions on some parts of the boundary and nonlinear chemical reaction on the solid-liquid interface and we investigate the constraints under which the macroscopic equation gives an accurate explanation of the underlying physics at the pore scale. We demonstrate that the dynamics at the continuum scale is strongly influenced by the interplay between signal frequency at the boundary and transport processes at the pore level. Furthermore, we show that by choosing appropriate scaling factors, a homogenized equation along with expressions for the effective coefficients reliably describe the concentration of solute at the length and time scales vastly different from physically robust micro-scale provided that some specific scale separation constraints are met. Our analysis proves that if the reaction rate or advection at the micro-scale are large, the effectiveness of the homogenized model is impeded. (b) We test numerically the conditions derived theoretically for advective-diffusive and reactive trans- port in a fracture with planar walls subject to temporally oscillating Dirichlet boundary conditions. The numerical analysis confirms the theoretical predictions. Significant Results. Two paper are in preparation. 2. Description of work yet to be accomplished The Tasks yet to be accomplished are listed below: (a) Quantify the impact of uncertainty in wall geometry of planar fractures on predictions hybrids of ARD transport (b) Develop coupling conditions for time hybridzation (c) Quantify the impact of uncertainty in pore geometry on predictions of hybrids of ARD transport in porous media, i.e. develop stochastic hybrid models (d) Use the hybrids combined with X-Ray tomographic images of pore scale structure (from Dr. Gouze, see letter of collaboration) to model dynamic changes in porosity/permeability

42 ENGINEERING↗

Sandia-UT Academic Alliance Project Summary

This project seeks to leverage various hyperspectral tensor products for the purposes of target classification/detection/prediction. In addition to hyperspectral, these products may be images, time series, geometries, or other modalities. The scenarios in which the targets of interest must be identified are typically from remote sensing platforms such as satellites. As such, there are numerous real-world constraints that drive algorithmic formulation. Cost, complexity, and feasibility of the algorithm should all be considered. Targets of interest are exceedingly rare, and collecting many data samples is prohibitively expensive. Furthermore, model interpretability is paramount due to the application space. The goal of this project is to develop a constrained supervised tensor factorization framework for use on hyperspectral data products. Supervised tensor factorizations already exist in the literature, although they have not seen widespread adoption in the remote sensing domain. The novelty of this project will be the formulation and inclusion of constraints that take into account mission considerations and physics based limits to learn a factorization that is both physically interpretable and mission deployable. This will represent a new contribution to the field of remote sensing for performing supervised learning tasks with hyperspectral data.

97 MATHEMATICS AND COMPUTING↗

Data-driven learning of nonlocal models: from high-fidelity simulations to constitutive laws

We show that machine learning can improve the accuracy of simulations of stress waves in one-dimensional composite materials. We propose a data-driven technique to learn nonlocal constitutive laws for stress wave propagation models. The method is an optimization-based technique in which the nonlocal kernel function is approximated via Bernstein polynomials. The kernel, including both its functional form and parameters, is derived so that when used in a nonlocal solver, it generates solutions that closely match high-fidelity data. The optimal kernel therefore acts as a homogenized nonlocal continuum model that accurately reproduces wave motion in a smaller-scale, more detailed model that can include multiple materials. We apply this technique to wave propagation within a heterogeneous bar with a periodic microstructure. Several one-dimensional numerical tests illustrate the accuracy of our algorithm. The optimal kernel is demonstrated to reproduce high-fidelity data for a composite material in applications that are substantially different from the problems used as training data.

97 MATHEMATICS AND COMPUTING↗

HSRL Liquid cloud base height (nsaC1)

Liquid layers in clouds affect their microphysical processes, as well as the surface energy budget. Studies focusing on these and other areas of research are often in need of skillful estimation of liquid-bearing cloud-layer boundaries. The bases of these layers are predominantly determined by ground-based lidar instruments. Most studies requiring liquid cloud base height (LCBH) information use either fixed lidar depolarization and/or backscatter cross-section thresholds or cloud base height data products that do not distinguish between ice and liquid, all of which might introduce inconsistencies and errors in the resolved LCBH. This data set contains LCBH data at 1-min temoporal resolution based on an explicit LCBH detection algorithm, which uses the high-spectral-resolution lidar (HSRL) data. Examination of this algorithm in multiple cases and scenarios during numerous days and first-order comparison with microwave-radiometer data show satisfactory results.

54 ENVIRONMENTAL SCIENCES↗

HSRL Liquid cloud base height

Liquid layers in clouds affect their microphysical processes, as well as the surface energy budget. Studies focusing on these and other areas of research are often in need of skillful estimation of liquid-bearing cloud-layer boundaries. The bases of these layers are predominantly determined by ground-based lidar instruments. Most studies requiring liquid cloud base height (LCBH) information use either fixed lidar depolarization and/or backscatter cross-section thresholds or cloud base height data products that do not distinguish between ice and liquid, all of which might introduce inconsistencies and errors in the resolved LCBH. This data set contains LCBH data at 1-min temoporal resolution based on an explicit LCBH detection algorithm, which uses the high-spectral-resolution lidar (HSRL) data. Examination of this algorithm in multiple cases and scenarios during numerous days and first-order comparison with microwave radiometer data show satisfactory results.

54 ENVIRONMENTAL SCIENCES↗

Coded Aperture Imaging for Fluorescent X-rays-Biomedical Applications

Employing a coded aperture pattern in front of a charge couple device pixilated detector (CCD) allows for imaging of fluorescent x-rays (6-25KeV) being emitted from samples irradiated with x-rays. Coded apertures encode the angular direction of x-rays and allow for a large Numerical Aperture x- ray imaging system. The algorithm to develop the self-supported coded aperture pattern of the Non Two Holes Touching (NTHT) pattern was developed. The algorithms to reconstruct the x-ray image from the encoded pattern recorded were developed by means of modeling and confirmed by experiments. Samples were irradiated by monochromatic synchrotron x-ray radiation, and fluorescent x-rays from several different test metal samples were imaged through the newly developed coded aperture imaging system. By choice of the exciting energy the different metals were speciated.

07 ISOTOPE AND RADIATION SOURCES↗

TriC: Distributed-memory Triangle Counting by Exploiting the Graph Structure

Graph analytics has emerged as an important tool in the analysis of large scale data from diverse application domains such as social networks, cyber security and bioinformatics. Counting the number of triangles in a graph is a fundamental kernel with several applications such as detecting the community structure of a graph or in identifying important vertices in a graph. The ubiquity of massive datasets is driving the need to scale graph analytics on parallel systems. However, numerous challenges exist in efficiently parallelizing graph algorithms, especially on distributed-memory systems. Irregular memory accesses and communication patterns, low computation to communication ratios, and the need for frequent synchronization are some of the leading challenges. In this paper, we present TriC, our distributed-memory implementation of triangle counting in graphs using the Message Passing Interface (MPI), as a submission to the 2020 GraphChallenge competition. Using a set of synthetic and real-world inputs from the challenge, we demonstrate a speedup of up to 90x relative to previous work on 32 processor-cores of a NERSC Cori node. We also provide details from distributed runs with up to8192 processes along with strong scaling results. The observations presented in this work provide an understanding of the system-level bottlenecks at scale that specifically impact sparse-irregular workloads and will therefore benefit other efforts to parallelize graph algorithms.

Halappanavar, Mahantesh↗

QuadSync: Quadrifocal tensor synchronization via Tucker decomposition

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

Miao, Daniel [University of Minnesota]↗

Modelling Thermodynamics of Alloys for Fusion Application

This research has two main objectives: (1) The development of computational tools to evaluate alloy properties, using the information contained in thermodynamic functions. We aim at improving the ability of classical potentials to account for complex alloy behavior, and (2) The application of these tools to predict properties of alloys under irradiation, in particular the FeCr system. This semester has been very productive in the developments of both tools and algorithms. Our work aims at developing theoretical and numerical methodologies that are directly applicable to multi-scale modeling addressing the specific issues related to multi-component, multi-phase systems in non-equilibrium states, such as solid-solution hardening, point defect-solute interactions, stoichiometry effects, static and dynamic strain aging, dislocation-solute interactions, and in general the aspects of microstructure evolution that are affected by irradiation. At its present stage of development, we have been able to predict numerous thermodynamic properties of FeCr mainly related to ordering and precipitation; we have found new intermetallic phases and suggested the existence of a dependence of the solubility limit on the degree of order of the alloy. At present, we are studying dislocation mobility in the solid solution and the heterogeneous phase, and we are developing a new algorithm to perform Monte Carlo simulations inside the miscibility gap, a technique that will allow us to study interfacial energies and nucleation sizes. We develop a strategy to model radiation damage in FeCr alloys, system in which magnetism introduces an anomaly in the heat of formation of the solid solution that is at the basis of its unique behavior. Magnetism has implications for the precipitation of excess Cr in the a phase in the presence of heterogeneities. These complexities pose many challenges for atomistic (empirical) methods. To address such issues we develop a modified, many-body potential by rigorously fitting thermodynamic properties, including free energy. Multi-million atom displacement Monte Carlo simulations in the transmutation ensemble, using both our new potential and our new MC code, are able to predict properties of non equilibrium processes like heterogeneous precipitation, and dislocation - precipitate interactions, enabling the study of hardening and embrittlement under irradiation.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗