Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed 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,405 records · Page 78

A generalized multi-resolution expansion for uncertainty propagation with application to cardiovascular modeling

Computational models are used in a variety of fields to improve our understanding of complex physical phenomena. Recently, the realism of model predictions has been greatly enhanced by transitioning from deterministic to stochastic frameworks, where the effects of the intrinsic variability in parameters, loads, constitutive properties, model geometry and other quantities can be more naturally included. A general stochastic system may be characterized by a large number of arbitrarily distributed and correlated random inputs, and a limited support response with sharp gradients or event discontinuities. This motivates continued research into novel adaptive algorithms for uncertainty propagation, particularly those handling high dimensional, arbitrarily distributed random inputs and non-smooth stochastic responses. Here, we generalize a previously proposed multi-resolution approach to uncertainty propagation to develop a method that improves computational efficiency, can handle arbitrarily distributed random inputs and non-smooth stochastic responses, and naturally facilitates adaptivity, i.e., the expansion coefficients encode information on solution refinement. Our approach relies on partitioning the stochastic space into elements that are subdivided along a single dimension, or, in other words, progressive refinements exhibiting a binary tree representation. We also show how these binary refinements are particularly effective in avoiding the exponential increase in the multi-resolution basis cardinality and significantly reduce the regression complexity for moderate to high dimensional random inputs. The performance of the approach is demonstrated through previously proposed uncertainty propagation benchmarks and stochastic multi-scale finite element simulations in cardiovascular flow.

59 BASIC BIOLOGICAL SCIENCES↗

Semantic embedding for quantum algorithms

The study of classical algorithms is supported by an immense understructure, founded in logic, type, and category theory, that allows an algorithmist to reason about the sequential manipulation of data irrespective of a computation’s realizing dynamics. As quantum computing matures, a similar need has developed for an assurance of the correctness of high-level quantum algorithmic reasoning. Parallel to this need, many quantum algorithms have been unified and improved using quantum signal processing (QSP) and quantum singular value transformation (QSVT), which characterize the ability, by alternating circuit ansätze, to transform the singular values of sub-blocks of unitary matrices by polynomial functions. However, while the algebraic manipulation of polynomials is simple (e.g., compositions and products), the QSP/QSVT circuits realizing analogous manipulations of their embedded polynomials are non-obvious. This work constructs and characterizes the runtime and expressivity of QSP/QSVT protocols where circuit manipulation maps naturally to the algebraic manipulation of functional transforms (termed semantic embedding). In this way, QSP/QSVT can be treated and combined modularly, purely in terms of the functional transforms they embed, with key guarantees on the computability and modularity of the realizing circuits. We also identify existing quantum algorithms whose use of semantic embedding is implicit, spanning from distributed search to proofs of soundness in quantum cryptography. The methods used, based in category theory, establish a theory of semantically embeddable quantum algorithms, and provide a new role for QSP/QSVT in reducing sophisticated algorithmic problems to simpler algebraic ones.

Physics↗

Faster than Real-Time Dynamic Simulation for Large-Size Power System with Detailed Dynamic Models using High-Performance Computing Platform

This paper presents a faster-than-real-time dynamic simulation software package that is designed for large-size power system dynamic simulation. It was developed on the GridPACKTM high-performance computing (HPC) framework. The key features of the developed software package include (1) faster-than-real-time dynamic simulation for a WECC system (17,000 buses) with different types of detailed generator, controller, and relay dynamic models, (2) a decoupled parallel dynamic simulation algorithm with optimized computation architecture to better leverage HPC resources and technologies, (3) options for HPC-based linear and iterative solvers, (4) hidden HPC details, such as data communication and distribution, to enable development centered on mathematical models and algorithms rather than on computational details for power system researchers, and (5) easy integration of new dynamic models and related algorithms into the software package.

Huang, Renke↗

Markov properties of the magnetic field in the quiet solar photosphere

The observed magnetic field on the solar surface is characterized by a very complex spatial and temporal behavior. Although feature-tracking algorithms have allowed us to deepen our understanding of this behavior, subjectivity plays an important role in the identification and tracking of such features. In this paper, we study the temporal stochasticity of the magnetic field on the solar surface without relying on either the concept of magnetic feature or on the subjective assumptions about their identification and interaction. The analysis is applied to observations of the magnetic field of the quiet solar photosphere carried out with the Imaging Magnetograph eXperiment (IMaX) instrument on board the stratospheric balloon, Sunrise. We show that the joint probability distribution functions of the longitudinal (B{sub ∥}) and transverse (B{sub ⊥}) components of the magnetic field, as well as of the magnetic pressure (B{sup 2}=B{sub ⊥}{sup 2}+B{sub ∥}{sup 2}), verify the necessary and sufficient condition for the Markov chains. Therefore, we establish that the magnetic field as seen by IMaX with a resolution of 0.″15–0.″18 and 33 s cadence, which can be considered as a memoryless temporal fluctuating quantity.

79 ASTRONOMY AND ASTROPHYSICS↗

A new approach to calculate the transport matrix in RF cavities

A realistic approach to calculate the transport matrix in RF cavities is developed. It is based on joint solution of equations of longitudinal and transverse motion of a charged particle in an electromagnetic field of the linac. This field is a given by distribution (measured or calculated) of the component of the longitudinal electric field on the axis of the linac. New approach is compared with other matrix methods to solve the same problem. The comparison with code ASTRA has been carried out. Complete agreement for tracking results for a TESLA-type cavity is achieved. A corresponding algorithm will be implemented into the MARS15 code. A realistic approach to calculate the transport matrix in RF cavities is developed. Complete agreement for tracking results with existed code ASTRA is achieved. New algorithm will be implemented into MARS15 code.

43 PARTICLE ACCELERATORS↗

Motion Planning Algorithms for Safety and Quantum Computing Efficiency

Motion planning remains a fundamental problem in robotics. Sampling-based algorithms use randomization to allow efficient solutions to this complex problem. As mobile robots and autonomous vehicles become more prevalent in everyday life, motion planning must be applied to increasingly challenging scenarios. Safety has become a paramount concern in motion planning for ensuring robotic applications enrich human lives. To date, many motion planning techniques to increase safety in the face of uncertain and dynamic environments have been developed. This dissertation first addresses distributional safety of Rapidly-Exploring Random Trees (RRT) through our algorithm W-Safe RRT. To acknowledge distributional uncertainty and poor modeling, W-Safe RRT uses the Wasserstein metric to provide a probabilistic bound on the distributional distance between a robot and obstacles. Human-interpretable environmental agent classification allows online safety margin adaptation. We propose and analyze an integrating region method for online classification that increases actor labeling accuracy based on behavioral feature values when compared to state of the art methods. The method performs class assignments based on local maximum likelihood in a created behavioral feature-space, allowing a notion of classification uncertainty. Model-based methods with safety guarantees can quickly become computationally in tractable, especially with multiple agents, higher dimensions, and plentiful unknowns. Sampling based algorithms have been parallelized for computation with multi-core computers and GPUs. We consider the use of quantum algorithms and computers for sampling-based motion planning for the first time. Quantum computing performs operations on superpositions of states and can solve certain problems much more efficiently than classical computers, but introduces previously unseen challenges. With Quantum-RRT, we recast the motion planning problem into a database-search structure and use Quantum Amplitude Amplification to find reachable states in the database with a quadratic performance increase over classical methods. We address two error sources with this method: quantum measurement and quantum oracle errors. We then extend this method to Parallel Quantum-RRT, which uses a manager-worker architecture with multiple parallel quantum workers to increase database search efficiency. We compare algorithm architectures and characterize probabilities of multiple workers finding solutions. Lastly, we test in simulation the quantum algorithms against classical versions in a wide variety of scenarios, concluding that a similar parallelization improvement is to be found in the quantum case as was found in the parallelization of classical RRT.

97 MATHEMATICS AND COMPUTING↗

Quantifying the impact of temporal analysis of products reactor initial state uncertainties on kinetic parameters

The temporal analysis of products (TAP) reactor, a transient kinetic tool, provides users with information as the catalyst state evolves. However, the state of the art for TAP uncertainty quantification only considers the experimental noise present in the outlet flow signal. Additional sources of uncertainty, including, but not limited to, initial surface coverages, the catalyst zone location, the inert void fraction, and the gas pulse intensity and pulse delay, are not included. For this reason, a framework for quantifying all uncertainty sources present in TAP experiments is presented and applied to a carbon monoxide oxidation case study. Herein, two methods for quantifying these sources of uncertainty are introduced. The first utilizes initial state sensitivities to approximate the parameter variances, as well as to provide insights into the structural certainty of the model. The second generates parameter confidence distributions through an ensemble-based sampling algorithm. This initial state covariance matrix can ultimately be merged with the experimental noise covariance matrix, providing a unified description of the parameter uncertainties for a single TAP experiment.

36 MATERIALS SCIENCE↗

Thermo-Fluid Modeling of Selective Laser Melting: Single-Track Formation Incorporating Metallic Powder

Selective laser melting (SLM) utilizes a laser source to melt and fuse metallic particles to form dense solid parts. Since molten metals have surface tension gradients, the thermo-capillary effect becomes a driving force of melt flow, which will subsequently determine the molten/solidified track as well as the build surface morphology. In this study, a 3D volume of fluid model has been developed to simulate heat transfer and fluid dynamic during single-track laser scanning. A sequential powder addition algorithm is applied to obtain random powder distribution over a thick substrate. Temperature-dependent thermo-physical properties of Ti-6Al-4V are used to define the material, and a volumetric heat source is included as an approximation to laser irradiation. As a result of continuous melting and solidifying, the thermal behavior, the molten metal flow and the free surface formation can be numerically analyzed. In addition, a two-layer simulation has been carried out to study the interlayer bonding. Simulations results are compared with SLM experiments using the single-track morphology acquired by white-light interferometry. The melt pool widths obtained from simulations are in good agreement with the measured single-track widths. On the other hand, it is observed that single tracks formed in SLM have an elevated bead height, which is not realized numerically.

36 MATERIALS SCIENCE↗

Modeling of reciprocating internal combustion engines for power generation and heat recovery

This paper presents a power generation and heat recovery model for reciprocating internal combustion engines (ICEs). The purpose of the proposed model is to provide realistic estimates of performance/efficiency maps for both electrical power output and useful thermal output for various capacities of engines for use in a preliminary CHP design/simulation process. The proposed model will serve as an alternative to constant engine efficiencies or empirical efficiency curves commonly used in the current literature for simulations of CHP systems. The engine performance/efficiency calculation algorithm has been coded to a publicly distributed FORTRAN Dynamic Link Library (DLL), and a user friendly tool has been developed using Visual Basic programming. Simulation results using the proposed model are validated against manufacturer’s technical data.

combined heat and power, internal combustion engin↗

An Extension of Implicit Monte Carlo Diffusion: Multigroup and The Difference Formulation

Implicit Monte Carlo (IMC) and Implicit Monte Carlo Diffusion (IMD) are approaches to the numerical solution of the equations of radiative transfer. IMD was previously derived and numerically tested on grey, or frequency-integrated problems. In this research, we extend Implicit Monte Carlo Diffusion (IMD) to account for frequency dependence, and we implement the difference formulation as a source manipulation variance reduction technique. We derive the relevant probability distributions and present the frequency dependent IMD algorithm, with and without the difference formulation. The IMD code with and without the difference formulation was tested using both grey and frequency dependent benchmark problems. The Su and Olson semi-analytic Marshak wave benchmark was used to demonstrate the validity of the code for grey problems. The Su and Olson semi-analytic picket fence benchmark was used for the frequency dependent problems. The frequency dependent IMD algorithm reproduces the results of both Su and Olson benchmark problems. Frequency group refinement studies indicate that the computational cost of refining the group structure is likely less than that of group refinement in deterministic solutions of the radiation diffusion methods. Our results show that applying the difference formulation to the IMD algorithm can result in an overall increase in the figure of merit for frequency dependent problems. However, the creation of negatively weighted particles from the difference formulation can cause significant numerical instabilities in regions of the problem with sharp spatial gradients in the solution. An adaptive implementation of the difference formulation may be necessary to focus its use in regions that are at or near thermal equilibrium.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications

Deep neural networks have been successfully employed in an extensive variety of research areas, including solving partial differential equations. Despite its significant success, there are some challenges in effectively training DNN, such as avoiding overfitting in over-parameterized DNNs and accelerating the optimization in DNNs with pathological curvature. Here, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in nonconvex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in the preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning solutions of elliptic PDE, which demonstrate the accuracy and efficiency of the present work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗

Deep Learning for Simultaneous Inference of Hydraulic and Transport Properties

Abstract Identification of a heterogeneous conductivity field and reconstruction of a contaminant release history are key aspects of subsurface remediation. These two goals are achieved by combining model predictions with sparse and noisy hydraulic head and concentration measurements. Solution of this inverse problem is notoriously difficult due to, in part, high dimensionality of the parameter space and high computational cost of repeated forward solves. We use a convolutional adversarial autoencoder (CAAE) to parameterize a heterogeneous non‐Gaussian conductivity field via a low‐dimensional latent representation. A three‐dimensional dense convolutional encoder‐decoder (DenseED) network serves as a forward surrogate of the flow and transport model. The CAAE‐DenseED surrogate is fed into the ensemble smoother with multiple data assimilation (ESMDA) algorithm to sample from the Bayesian posterior distribution of the unknown parameters, forming a CAAE‐DenseED‐ESMDA inversion framework. The resulting CAAE‐DenseED‐ESMDA inversion strategy is used to identify a three‐dimensional contaminant source and conductivity field. A comparison of the inversion results from CAAE‐ESMDA with physical flow and transport simulator and from CAAE‐DenseED‐ESMDA shows that the latter yields accurate reconstruction results at the fraction of the computational cost of the former.

Zhou, Zitong↗

A genetic algorithm approach for reconstructing spectral content from filtered x-ray diode array spectrometers

Filtered diode array spectrometers are routinely employed to infer the temporal evolution of spectral power from x-ray sources, but uniquely extracting spectral content from a finite set of broad, spectrally overlapping channel spectral sensitivities is decidedly nontrivial in these under-determined systems. Here, we present the use of genetic algorithms to reconstruct a probabilistic spectral intensity distribution and compare to the traditional approach most commonly found in the literature. Unlike many of the previously published models, spectral reconstructions from this approach are neither limited by basis functional forms nor do they require a priori spectral knowledge. While the original intent of such measurements was to diagnose the temporal evolution of spectral power from quasi-blackbody radiation sources—where the exact details of spectral content were not thought to be crucial—we demonstrate that this new technique can greatly enhance the utility of the diagnostic by providing more physical spectra and improved robustness to hardware configuration for even strongly non-Planckian distributions.

47 OTHER INSTRUMENTATION↗

Variance Estimation in Monte Carlo Eigenvalue Simulations Using Spectral Analysis Method

Monte Carlo (MC) simulation is widely used to solve the eigenvalue form of the Boltzmann transport equation that mathematically represents the neutron transport process through complex multiplying (fissionable) systems. Monte Carlo eigenvalue simulation starts with an assumed fission source distribution and uses the fission sites from the previous iteration (cycle) as the starting source in the current iteration. Important system parameters (MC tallies) such as fuel pin-power distribution are estimated over several cycles after the convergence of the fission source distribution to a stationary distribution. However, the MC fission source iteration algorithm that uses fission source sites from the previous cycle introduces a cycle-to-cycle correlation. Monte Carlo simulations that do not account for the cycle-to-cycle correlation systematically underestimate the variance of the estimated system parameters (sample mean). This paper presents the relationship between the spectral density in the frequency domain at frequency zero and the variance of the sample mean. This paper introduces a novel method in the frequency domain for the MC variance estimation. For the three test problems used in this paper, researchers have observed that the new method results in an improvement of more than one order of magnitude to the standard deviation of the sample mean. The new method also compares favorably with the previously introduced batch, bootstrap, and covariance-adjusted methods when applied to the three test problems investigated in this paper. This new method does not require modification of the MC eigenvalue algorithm (power iteration), is code agnostic, and is therefore easy to use when implementing in any existing MC code. In conclusion, the new estimate can be calculated without saving tally results of all active/stationary cycles.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Calculation of permanent magnet arrangements for stellarators: a linear least-squares method

A problem arising in several engineering areas is to design magnets outside a volume that produce a desired magnetic field inside it. One instance of this problem is stellarator design, where it has recently been shown that permanent magnets can provide the required shaping of the magnetic field. Here we demonstrate a robust and efficient algorithm REGCOIL_PM to calculate the spatial distribution of these permanent magnets. The procedure involves a small number of fixed-point iterations, with a linear least-squares problem solved at each step. Furthermore, the method exploits the Biot–Savart Law's exact linearity in magnetization density and approximate linearity in magnet size, for magnets far from the target region. No constraint is placed on the direction of magnetization, so Halbach solutions are found naturally, and the magnitude of the magnetization can be made uniformly equal to a target value.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Numerical Oscillation Prevention for PV Inverter Controllers in Quasi-Steady-State Simulators

Droop-based PV inverter control methods are popular for preventing overvoltage in low voltage networks with high installations of PV solar. Quasi-steady-state simulators (QSTS) can be used to reduce the computational burden of conducting long-term techno-economic analyses of such PV inverter controllers. If dynamic models for droop-based controllers are directly implemented in QSTS, numerical oscillation occurs and the controllers fail to converge to their steady-state operation. In this paper, a power network sensitivity-based algorithm is proposed for preventing numerical oscillation while implementing active and reactive droop-based PV inverter controllers in quasisteady state simulation tool (e.g. in GridLAB-D). Convergence of the sensitivity-based algorithm is verified using a typical radial distribution feeder. It is found that all three controllers reached converged state in less than 15 iterations.

GridLAB-D, PV inverter control, quasi-steady-state↗

Planar Transformer With Asymmetric Integrated Leakage Inductance Using Horizontal Air Gap

This article presents a novel planar-based transformer winding and core structure with controllable leakage inductance generation for integrated magnetics applications. As a result of limitations in integrated magnetics from the literature, a new approach is proposed utilizing semi-interleaved windings and controllable leakage via a leakage flux core leg featuring a horizontal air gap. Here, the proposed transformer design is analyzed via detailed reluctance modeling to determine closed-form equations for the magnetizing and asymmetrically distributed leakage inductances. Next, a genetic-algorithm-based multiobjective design optimization problem is developed, seeking to minimize the core and winding losses of the proposed transformer subject to a set of parametric and geometric constraints in a dc-ac dual-active-bridge topology for microinverter applications. The optimization was extended to include other integrated magnetic structures from the literature, where it is determined that the proposed transformer is superior from the perspectives of efficiency, footprint area, and parasitic capacitance. Based on the results of the optimization analysis, two designs with theoretical transformer California Energy Commission (CEC) efficiency drops (i.e., CEC efficiency reduction specifically due to the transformer loss mechanisms) of 1.19% and 0.83% were fabricated and evaluated for electrical and thermal performance in the proposed 40 V, 400 W microinverter.

42 ENGINEERING↗