Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithms”

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 883 records · Page 49

Harnessing the predicted maize pan-interactome for putative gene function prediction and prioritization of candidate genes for important traits

Abstract The recent assembly and annotation of the 26 maize nested association mapping population founder inbreds have enabled large-scale pan-genomic comparative studies. These studies have expanded our understanding of agronomically important traits by integrating pan-transcriptomic data with trait-specific gene candidates from previous association mapping results. In contrast to the availability of pan-transcriptomic data, obtaining reliable protein–protein interaction (PPI) data has remained a challenge due to its high cost and complexity. We generated predicted PPI networks for each of the 26 genomes using the established STRING database. The individual genome-interactomes were then integrated to generate core- and pan-interactomes. We deployed the PPI clustering algorithm ClusterONE to identify numerous PPI clusters that were functionally annotated using gene ontology (GO) functional enrichment, demonstrating a diverse range of enriched GO terms across different clusters. Additional cluster annotations were generated by integrating gene coexpression data and gene description annotations, providing additional useful information. We show that the functionally annotated PPI clusters establish a useful framework for protein function prediction and prioritization of candidate genes of interest. Our study not only provides a comprehensive resource of predicted PPI networks for 26 maize genomes but also offers annotated interactome clusters for predicting protein functions and prioritizing gene candidates. The source code for the Python implementation of the analysis workflow and a standalone web application for accessing the analysis results are available at https://github.com/eporetsky/PanPPI.

Genetics & Heredity↗

Geometric versus numerical optimal control of a dissipative spin-(1/2) particle

We analyze the saturation of a nuclear magnetic resonance (NMR) signal using optimal magnetic fields. We consider both the problems of minimizing the duration of the control and its energy for a fixed duration. We solve the optimal control problems by using geometric methods and a purely numerical approach, the grape algorithm, the two methods being based on the application of the Pontryagin maximum principle. A very good agreement is obtained between the two results. The optimal solutions for the energy-minimization problem are finally implemented experimentally with available NMR techniques.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Distributed Automatic Load-Frequency Control with Optimality in Power Systems

With the increasing penetration of renewable energy resources, power systems face new challenges in balancing power supply and demand and maintaining the nominal frequency. This paper studies load control to handle these challenges. In particular, a fully distributed automatic load control algorithm, which only needs local measurement and local communication, is proposed. We prove that the control algorithm globally converges to an optimal operating point which minimizes the total disutility of users, restores the nominal frequency and the scheduled tie-line power flows, and respects the thermal constraints of transmission lines. It is also shown that the convergence still holds even when inaccurate system parameters are used in the control algorithm. Lastly, the effectiveness, optimality, and robustness of the proposed algorithm are demonstrated via numerical simulations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Coordinating Multiple Sources for Service Restoration to Enhance Resilience of Distribution Systems

When a major outage occurs on a distribution system due to extreme events, microgrids, distributed generators, storage devices, and other local resources can be used to restore critical loads and enhance resiliency. This paper proposes a decision-making method to determine the optimal restoration strategy coordinating multiple sources to serve critical loads after a major outage. The critical load restoration problem is formulated as a mixed -integer semidefinite program. The objective is maximizing the number of loads restored, weighted by their priority. The unbalanced three-phase power flow constraint and operational constraints are considered. An iterative algorithm is proposed to deal with integer variables and can attain the global optimum of the critical load restoration problem by solving a few semidefinite programs under mild conditions. The effectiveness of the proposed models and algorithm is validated by numerical simulation with the modified IEEE 13-node test feeder and the modified IEEE123-node test feeder under a large number of scenarios. The results indicate that the optimal restoration strategy can be determined efficiently in most scenarios

Wang, Ying↗

Algorithms for propagating uncertainty across heterogeneous domains

We address an important research area in stochastic multi-scale modeling, namely the propagation of uncertainty across heterogeneous domains characterized by partially correlated processes with vastly different correlation lengths. This class of problems arise very often when computing stochastic PDEs and particle models with stochastic/stochastic domain interaction but also with stochastic/deterministic coupling. The domains may be fully embedded, adjacent or partially overlapping. The fundamental open question we address is the construction of proper transmission boundary conditions that preserve global statistical properties of the solution across different subdomains. Often, the codes that model different parts of the domains are black-box and hence a domain decomposition technique is required. No rigorous theory or even effective empirical algorithms have yet been developed for this purpose, although interfaces defined in terms of functionals of random fields (e.g., multi-point cumulants) can overcome the computationally prohibitive problem of preserving sample-path continuity across domains. The key idea of the different methods we propose relies on combining local reduced-order representations of random fields with multi-level domain decomposition. Specifically, we propose two new algorithms: The first one enforces the continuity of the conditional mean and variance of the solution across adjacent subdomains by using Schwarz iterations. The second algorithm is based on PDE-constrained multi-objective optimization, and it allows us to set more general interface conditions. The effectiveness of these new algorithms is demonstrated in numerical examples involving elliptic problems with random diffusion coefficients, stochastically advected scalar fields, and nonlinear advection-reaction problems with random reaction rates.

Cho, Heyrim↗

Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication

Sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high-performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. The scaling of existing parallel implementations of SpGEMM is heavily bound by communication. Even though 3D (or 2.5D) algorithms have been proposed and theoretically analyzed in the flat MPI model on Erdös-Rényi matrices, those algorithms had not been implemented in practice and their complexities had not been analyzed for the general case. In this work, we present the first implementation of the 3D SpGEMM formulation that exploits multiple (intranode and internode) levels of parallelism, achieving significant speedups over the state-of-the-art publicly available codes at all levels of concurrencies. We extensively evaluate our implementation and identify bottlenecks that should be subject to further research.

2.5D algorithms↗

Butterfly Factorization Via Randomized Matrix-Vector Multiplications

This paper presents an adaptive randomized algorithm for computing the butterfly factorization of an m × n matrix with m ≈ n provided that both the matrix and its transpose can be rapidly applied to arbitrary vectors. The resulting factorization is composed of O(log n) sparse factors, each containing O(n) nonzero entries. The factorization can be attained using O(n 3/2 log n) computation and O(n log n) memory resources. Furthermore, the proposed algorithm can be implemented in parallel and can apply to matrices with strong or weak admissibility conditions arising from surface integral equation solvers as well as multi-frontal-based finite-difference, finite-element, or finite-volume solvers. A distributed-memory parallel implementation of the algorithm demonstrates excellent scaling behavior.

97 MATHEMATICS AND COMPUTING↗

CyGutz

This software is an efficient computational package of the Gutzwiller variational method. It solves the Gutzwiller variational problem for general multiband models with arbitrary on-site interaction in a fully self-consistent numerical approach. The underlying algorithm drastically reduces the problem of the high-dimensional Gutzwiller minimization by mapping it to a minimization only in the variational density matrix. For fixed density the Gutzwiller renormalization matrix is determined as a fix-point of a proper functional, whose evaluation requires only ground-state calculations of matrices defined in the Gutzwiller variational space. Furthermore, the package is able to account for the symmetries of the variational function in a controlled way, reducing the number of variational parameters. The software is highly efficient and robust, and is particularly suitable for first-principles studies (e.g., in combination with DFT) of many complex real materials, where the full intra-atomic interaction is important to obtain correct results.

Yao, Yongxin↗

Delaunay density diagnostic

The Delaunay density diagnostic helps detect and assess geometric scales within unstructured numerical data sets. The algorithm was first introduced in the paper "Data-driven geometric scale detection via Delaunay interpolation" by Andrew Gillette and Eugene Kur, 2022. More details can be found in that paper, as well as the included README file.

Gillette, AndrewK↗

Correction of Dual-PRF Doppler Velocity Outliers in the Presence of Aliasing

Abstract In Doppler weather radars, the presence of unfolding errors or outliers is a well-known quality issue for radial velocity fields estimated using the dual–pulse repetition frequency (PRF) technique. Postprocessing methods have been developed to correct dual-PRF outliers, but these need prior application of a dealiasing algorithm for an adequate correction. This paper presents an alternative procedure based on circular statistics that corrects dual-PRF errors in the presence of extended Nyquist aliasing. The correction potential of the proposed method is quantitatively tested by means of velocity field simulations and is exemplified in the application to real cases, including severe storm events. The comparison with two other existing correction methods indicates an improved performance in the correction of clustered outliers. The technique proposed is well suited for real-time applications requiring high-quality Doppler radar velocity fields, such as wind shear and mesocyclone detection algorithms, or assimilation in numerical weather prediction models.

58 GEOSCIENCES↗

Steady-State Gyrokinetics Transport Code (SSGKT), A Scientific Application Partnership with the Framework Application for Core-Edge Transport Simulations, Final Report

This project initiated the development of TGYRO - a steady-state Gyrokinetic transport code (SSGKT) that integrates micro-scale GYRO turbulence simulations into a framework for practical multi-scale simulation of conventional tokamaks as well as future reactors. Using a lightweight master transport code, multiple independent (each massively parallel) gyrokinetic simulations are coordinated. The capability to evolve profiles using the TGLF model was also added to TGYRO and represents a more typical use-case for TGYRO. The goal of the project was to develop a steady-state Gyrokinetic transport code (SSGKT) that integrates micro-scale gyrokinetic turbulence simulations into a framework for practical multi-scale simulation of a burning plasma core ? the International Thermonuclear Experimental Reactor (ITER) in particular. This multi-scale simulation capability will be used to predict the performance (the fusion energy gain, Q) given the H-mode pedestal temperature and density. At present, projections of this type rely on transport models like GLF23, which are based on rather approximate fits to the results of linear and nonlinear simulations. Our goal is to make these performance projections with precise nonlinear gyrokinetic simulations. The method of approach is to use a lightweight master transport code to coordinate multiple independent (each massively parallel) gyrokinetic simulations using the GYRO code. This project targets the practical multi-scale simulation of a reactor core plasma in order to predict the core temperature and density profiles given the H-mode pedestal temperature and density. A master transport code will provide feedback to O(16) independent gyrokinetic simulations (each massively parallel). A successful feedback scheme offers a novel approach to predictive modeling of an important national and international problem. Success in this area of fusion simulations will allow US scientists to direct the research path of ITER over the next two decades. The design of an efficient feedback algorithm is a serious numerical challenge. Although the power source and transport balance coding in the master are standard, it is nontrivial to design a feedback loop that can cope with outputs that are both intermittent and extremely expensive. A prototypical feedback scheme has already been successfully demonstrated for a single global GYRO simulation, although the robustness and efficiency are likely far from optimal. Once the transport feedback scheme is perfected, it could, in principle, be embedded into any of the more elaborate transport codes (ONETWO, TRANSP, and CORSICA), or adopted by other FSP-related multi-scale projects.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

National Computational Infrastructure for Lattice Gauge Theory: SciDAC-2 Closeout Report

Under its SciDAC-1 and SciDAC-2 grants, the USQCD Collaboration developed software and algorithmic infrastructure for the numerical study of lattice gauge theories. This work was carried out jointly by high energy and nuclear physicists within USQCD, in collaboration with applied mathematicians and computer scientists. The software and its documentation is publicly available at the USQCD software web site http://www.usqcd.org/usqcd-software. The code has been widely adopted within the United States, and is used extensively abroad. It has been instrumental in our effective use of leadership class computers, and of the dedicated computers funded for USQCD through the LQCD Computing Project. The committees which review our hardware program on a yearly basis have consistently emphasized the importance of the work done under our SciDAC grants, and the need for their continuation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Impact of Integration Scheme on Performance of Anisotropic Plasticity Models

Given the prevalent role of metals in a variety of industries, schemes to integrate corresponding constitutive models in finite element applications have long been studied. A number of formulations have been developed to accomplish this task; each with their own advantages and costs. Often the focus has been on ensuring the accuracy and numerical stability of these algorithms to enable robust integration. While important, emphasis on these performance metrics may often come at the cost of computational expense potentially neglecting the needs of individual problems. In the current work, the performance of two of the most common integration methods for anisotropic plasticity -- the convex cutting plane (CCP) and closest point projection (CPP) -- across a variety of metrics is assessed; including accuracy and cost. A variety of problems are considered ranging from single elements to large representative simulations including both implicit quasistatic and explicit transient dynamic type responses. The relative performance of each scheme in the different instances is presented with an eye towards guidance on when the different algorithms may be beneficial.

36 MATERIALS SCIENCE↗

A Hybrid Method for Tensor Decompositions that Leverages Stochastic and Deterministic Optimization

In this paper, we propose a hybrid method that uses stochastic and deterministic search to compute the maximum likelihood estimator of a low-rank count tensor with Poisson loss via state-of-theart local methods. Our approach is inspired by Simulated Annealing for global optimization and allows for fine-grain parameter tuning as well as adaptive updates to algorithm parameters. We present numerical results that indicate our hybrid approach can compute better approximations to the maximum likelihood estimator with less computation than the state-of-the-art methods by themselves.

97 MATHEMATICS AND COMPUTING↗

GPU Accelerated Event Detection Algorithm

Smart grid external require new algorithmic approaches as well as parallel formulations. One of the critical components is the prediction of changes and detection of anomalies within the power grid. The state-of-the-art algorithms are not suited to handle the demands of streaming data analysis. (i) need for events detection algorithms that can scale with the size of data, (ii) need for algorithms that can not only handle multi dimensional nature of the data, but also model both spatial and temporal dependencies in the data, which, for the most part, are highly nonlinear, (iii) need for algorithms that can operate in an online fashion with streaming data. The GAEDA code is a new online anomaly detection techniques that take into account spatial, temporal, multi-dimensional aspects of the data set. The basic idea behind the proposed approach is to (a) to convert a multi-dimensional sequence into a univariate time series that captures the changes between successive windows extracted from the original sequence using singular value decomposition (SVD), and then (b) to apply known anomaly detection techniques for univariate time series. A key challenge for the proposed approach is to make the algorithm scalable to huge datasets by adopting techniques from perturbation theory, incremental SVD analysis. We used recent advances in tensor decomposition techniques which reduce computational complexity to monitor the change between successive windows and detect anomalies in the same manner as described above. Therefore we propose to develop the parallel solutions on many core systems such as GPUs, because these algorithms involve lot of numerical operations and are highly data-parallelizable.

Source record↗

CyGutz

This software is an efficient computational package of the Gutzwiller variational method. It solves the Gutzwiller variational problem for general multiband models with arbitrary on-site interaction in a fully self-consistent numerical approach. The underlying algorithm drastically reduces the problem of the high-dimensional Gutzwiller minimization by mapping it to a minimization only in the variational density matrix. For fixed density the Gutzwiller renormalization matrix is determined as a fix-point of a proper functional, whose evaluation requires only ground-state calculations of matrices defined in the Gutzwiller variational space. Furthermore, the package is able to account for the symmetries of the variational function in a controlled way, reducing the number of variational parameters. The software is highly efficient and robust, and is particularly suitable for first-principles studies (e.g., in combination with DFT) of many complex real materials, where the full intra-atomic interaction is important to obtain correct results.

Yao, Yongxin↗

Analysis-Software for Hyperspectral Algal Reflectance Probes v. 1.0

This software provides onsite analysis of the hyperspectral reflectance data acquired on an outdoor algal pond by a multichannel, fiber-coupled spectroradiometer. The analysis algorithm is based on numerical inversion of a reflectance model, in which the above-water reflectance is expressed as a function of the single backscattering albedo, which is dependent on the backscatter and absorption coefficients of the algal culture, which are in turn related to the algal biomass and pigment optical activity, respectively. Prior to the development of this software, while raw multichannel data were displayed in real time, analysis required a post-processing procedure to extract the relevant parameters. This software provides the capability to track the temporal variation of such culture parameters in real time, as raw data are being acquired, or can be run in a post processing mode. The software allows the user to select between different algal species, incorporate the appropriate calibration data, and observe the quality of the resulting model inversions.

Timlin, Jerilyn A.↗