SEARCH · Search NASA
Results for “numerical algorithm computing”
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.
Adaptive time stepping for fluid-structure interaction solvers
In this work, a novel adaptive time stepping scheme for fluid-structure interaction (FSI) problems is proposed that allows for controlling the accuracy of the time-discrete solution. Furthermore, it eases practical computations by providing an efficient and very robust time step size selection. This has proven to be very useful, especially when addressing new physical problems, where no educated guess for an appropriate time step size is available. The fluid and the structure field, but also the fluid-structure interface are taken into account for the purpose of a posteriori error estimation, rendering it easy to implement and only adding negligible additional cost. The adaptive time stepping scheme is incorporated into a monolithic solution framework, but can straightforwardly be applied to partitioned solvers as well. The basic idea can be extended to the coupling of an arbitrary number of physical models. Accuracy and efficiency of the proposed method are studied in a variety of numerical examples ranging from academic benchmark tests to complex biomedical applications like the pulsatile blood flow through an abdominal aortic aneurysm. Finally, the demonstrated accuracy of the time-discrete solution in combination with reduced computational cost make this algorithm very appealing in all kinds of FSI applications.
Fast variance reduction for steady-state simulation and sensitivity analysis of stochastic chemical systems using shadow function estimators
We address the problem of estimating steady-state quantities associated to systems of stochastic chemical kinetics. In most cases of interest, these systems are analytically intractable, and one has to resort to computational methods to estimate stationary values of cost functions. In this work, we introduce a novel variance reduction algorithm for stochastic chemical kinetics, inspired by related methods in queueing theory, in particular the use of shadow functions. Using two numerical examples, we demonstrate the efficiency of the method for the calculation of steady-state parametric sensitivities and evaluate its performance in comparison to other estimation methods.
Efficient field-theoretic simulation of polymer solutions
We present several developments that facilitate the efficient field-theoretic simulation of polymers by complex Langevin sampling. A regularization scheme using finite Gaussian excluded volume interactions is used to derive a polymer solution model that appears free of ultraviolet divergences and hence is well-suited for lattice-discretized field theoretic simulation. We show that such models can exhibit ultraviolet sensitivity, a numerical pathology that dramatically increases sampling error in the continuum lattice limit, and further show that this pathology can be eliminated by appropriate model reformulation by variable transformation. We present an exponential time differencing algorithm for integrating complex Langevin equations for field theoretic simulation, and show that the algorithm exhibits excellent accuracy and stability properties for our regularized polymer model. These developments collectively enable substantially more efficient field-theoretic simulation of polymers, and illustrate the importance of simultaneously addressing analytical and numerical pathologies when implementing such computations.
Fluctuating hydrodynamics of reactive liquid mixtures
Fluctuating hydrodynamics (FHD) provides a framework for modeling microscopic fluctuations in a manner consistent with statistical mechanics and nonequilibrium thermodynamics. This paper presents an FHD formulation for isothermal reactive incompressible liquid mixtures with stochastic chemistry. Fluctuating multispecies mass diffusion is formulated using a Maxwell-Stefan description without assuming a dilute solution, and momentum dynamics is described by a stochastic Navier-Stokes equation for the fluid velocity. We consider a thermodynamically consistent generalization for the law of mass action for non-dilute mixtures and use it in the chemical master equation (CME) to model reactions as a Poisson process. The FHD approach provides remarkable computational efficiency over traditional reaction-diffusion master equation methods when the number of reactive molecules is large, while also retaining accuracy even when there are as few as ten reactive molecules per hydrodynamic cell. We present a numerical algorithm to solve the coupled FHD and CME equations and validate it on both equilibrium and nonequilibrium problems. We simulate a diffusively driven gravitational instability in the presence of an acid-base neutralization reaction, starting from a perfectly flat interface. We demonstrate that the coupling between velocity and concentration fluctuations dominates the initial growth of the instability.
Stiff neural ordinary differential equations
Neural Ordinary Differential Equations (ODEs) are a promising approach to learn dynamical models from time-series data in science and engineering applications. This work aims at learning neural ODEs for stiff systems, which are usually raised from chemical kinetic modeling in chemical and biological systems. We first show the challenges of learning neural ODEs in the classical stiff ODE systems of Robertson’s problem and propose techniques to mitigate the challenges associated with scale separations in stiff systems. We then present successful demonstrations in stiff systems of Robertson’s problem and an air pollution problem. The demonstrations show that the usage of deep networks with rectified activations, proper scaling of the network outputs as well as loss functions, and stabilized gradient calculations are the key techniques enabling the learning of stiff neural ODEs. The success of learning stiff neural ODEs opens up possibilities of using neural ODEs in applications with widely varying time-scales, such as chemical dynamics in energy conversion, environmental engineering, and life sciences.
Simulations of frustrated Ising Hamiltonians using quantum approximate optimization
Novel magnetic materials are important for future technological advances. Theoretical and numerical calculations of ground-state properties are essential in understanding these materials, however, computational complexity limits conventional methods for studying these states. Here we investigate an alternative approach to preparing materials ground states using the quantum approximate optimization algorithm (QAOA) on near-term quantum computers. We study classical Ising spin models on unit cells of square, Shastry-Sutherland and triangular lattices, with varying field amplitudes and couplings in the material Hamiltonian. We find relationships between the theoretical QAOA success probability and the structure of the ground state, indicating that only a modest number of measurements (≲100) are needed to find the ground state of our nine-spin Hamiltonians, even for parameters leading to frustrated magnetism. We further demonstrate the approach in calculations on a trapped-ion quantum computer and succeed in recovering each ground state of the Shastry-Sutherland unit cell with probabilities close to ideal theoretical values. The results demonstrate the viability of QAOA for materials ground state preparation in the frustrated Ising limit, giving important first steps towards larger sizes and more complex Hamiltonians where quantum computational advantage may prove essential in developing a systematic understanding of novel materials.
Percolation critical polynomial as a graph invariant
Every lattice for which the bond percolation critical probability can be found exactly possesses a critical polynomial, with the root in [0; 1] providing the threshold. Recent work has demonstrated that this polynomial may be generalized through a definition that can be applied on any periodic lattice. The polynomial depends on the lattice and on its decomposition into identical finite subgraphs, but once these are specified, the polynomial is essentially unique. On lattices for which the exact percolation threshold is unknown, the polynomials provide approximations for the critical probability with the estimates appearing to converge to the exact answer with increasing subgraph size. In this paper, I show how the critical polynomial can be viewed as a graph invariant like the Tutte polynomial. In particular, the critical polynomial is computed on a finite graph and may be found using the deletion-contraction algorithm. This allows calculation on a computer, and I present such results for the kagome lattice using subgraphs of up to 36 bonds. For one of these, I find the prediction p c = 0:52440572:::, which differs from the numerical value, p c = 0:52440503(5), by only 6:9 X 10 -7 .
Multi-modal Energy-optimal Trip Scheduling in Real-time (METS-R) for Transportation Hubs (Final Report)
This report summarizes the work performed under the award number EE0008524. The project develops the Multi-modal Energy-optimal Trip Scheduling in Real-time (METS-R) platform as the next-generation transportation solution based on autonomous electric vehicles (AEV) serving passenger trips from and to urban transportation hubs, to substantially reduce transportation energy consumption. Extensive data collection and analyses were first conducted to understand the demand patterns and energy consumption of hub-based on-road trips. Then, a data-driven framework that consists of an analytical module and a simulation module was proposed. For the analytical module, five planning + operation tools were developed to support the planning and energy-efficient operations of urban AEV services: the charging station planning that robotically allocates charging supplies based on the stationary charging demand distribution; the transit planning and demand adaptive scheduling model that efficiently generates\ candidate transit routes from hubs to other places and dynamically adjusts the transit time table to fit the current demand; the online energy-efficient routing that learns the energy-optimal paths from observations of link-level energy consumption in real-time; the hub-based ridesharing that matches trip requests together with account for the uncertainty of future trip demand and vehicle supply; and finally, the integrated demand prediction and anomaly detection pipeline that leverages the flight/train time table and support other planning/operation tools. To demonstrate the performance of these tools, a scalable high-performance agent-based simulator was built. We divided the urban space into multiple service zones where each zone was considered as an agent for passenger generation and vehicle charging. Two types of AEV agents were coded to model two types of mobility services: AEV taxi and AEV transit. For the AEV taxi, the team implemented the functions of pickup/drop-off passengers, energy-efficient routing, ridesharing, fleet rebalancing, and recharging. For the AEV bus, the team implemented the functions of demand-adaptive route scheduling, passenger boarding, and recharging. A high-performance computing framework was introduced to receive various profiling information (such as link energy updates, vehicle speed) from the simulator instances and communicate the operational commands back to the instances. The numerical experiments show that each of the proposed operational algorithms can reduce energy consumption and improve system efficiency. Furthermore, there exists the need to collectively consider multiple planning + operational strategies as multiple strategies can influence each other in terms of performance impacts. Recommendations for future work related to AEV planning and simulation are discussed.
A study of the Nordsieck-type predictor-corrector methods
Predictor-corrector schemes are discussed for the numerical integration of initial value problems by computer. Descloux formulas, which are considered modified Nordsieck formulas are studied because of their desirable stability and truncation properties along with the standard Nordsieck formulas. The stability of Nordsieck and modified Nordsieck algorithms are computed, and the results are graphed. Test problems are included as examples for comparing the efficiency of the algorithms.
A polymorphic reconfigurable emulator for parallel simulation
Microprocessor and arithmetic support chip technology was applied to the design of a reconfigurable emulator for real time flight simulation. The system developed consists of master control system to perform all man machine interactions and to configure the hardware to emulate a given aircraft, and numerous slave compute modules (SCM) which comprise the parallel computational units. It is shown that all parts of the state equations can be worked on simultaneously but that the algebraic equations cannot (unless they are slowly varying). Attempts to obtain algorithms that will allow parellel updates are reported. The word length and step size to be used in the SCM's is determined and the architecture of the hardware and software is described.
Analysis of the Scramjet inlet flow field using two-dimensional Navier-Stokes equations
A computer code was developed to solve the full two dimensional Navier-Stokes equations in a scramjet inlet. The analysis uses a numerical coordinate transformation which generates a set of boundary-fitted curvilinear coordinates. The explicit finite difference algorithm of MacCormack is used to solve the governing equations. A two-layer eddy viscosity model is used for the turbulent flow. The code can analyze both inviscid and viscous flows with multiple struts in the flow field. Detailed results are presented for two model problems and two scramjet inlets with one and two struts. The application of the two dimensional analysis in the preliminary design of the actual scramjet inlet is briefly discussed.
Methods for the identification of material parameters in distributed models for flexible structures
Theoretical and numerical results are presented for inverse problems involving estimation of spatially varying parameters such as stiffness and damping in distributed models for elastic structures such as Euler-Bernoulli beams. An outline of algorithms used and a summary of computational experiences are presented.
Incompressible viscous flow computations for the pump components and the artificial heart
A finite difference, three dimensional incompressible Navier-Stokes formulation to calculate the flow through turbopump components is utilized. The solution method is based on the pseudo compressibility approach and uses an implicit upwind differencing scheme together with the Gauss-Seidel line relaxation method. Both steady and unsteady flow calculations can be performed using the current algorithm. Here, equations are solved in steadily rotating reference frames by using the steady state formulation in order to simulate the flow through a turbopump inducer. Eddy viscosity is computed by using an algebraic mixing-length turbulence model. Numerical results are compared with experimental measurements and a good agreement is found between the two.
Conservative Grid-Interface Algorithm For Computing Flows
Best features of structured- and unstructured-grid methods combined. Gaps and overlaps between zonal grids eliminated by grid-interface algorithm, which generates single interfacial grid and corrects fluxes of flow quantities accordingly. Incorporated into two three-dimensional Navier-Stokes finite-volume codes and tested in computations of incompressible and compressible flows about simple bodies. Good numerical results obtained. General enough to be incorporated into other finite-volume codes without restrictions on complexities of shapes of bodies and zonal interfaces.
A Coupled Plasma and Sheath Model for High Density Reactors
We present a coupled plasma and collisionless; sheath model for the simulation of high density plasma processing reactors. Due to inefficiencies in numerical schemes and the resulting computational burden, a coupled multidimensional plasma and sheath simulation has not been possible model for gas mixtures and high density reactors of practical interest. In this work we demonstrate that with a fully implicit algorithm and a refined computational mesh, a self-consistent plasma and sheath simulation is feasible. We discuss the details of the model equations, the importance of ion inertia, and the resulting sheath profiles for argon and chlorine plasmas. We find that at low operating pressures (10-30 mTorr), the charge separation occurs only within a 0.5 mm layer near the surface in a 300 mm inductively coupled plasma etch reactor. A unified model eliminates the use of off-line or loosely coupled sheath models with simplifying assumptions which generally lead to uncertainties in ion flux and sheath electrical properties.
Incompressible Navier-Stokes Computations in Aerospace and Beyond
Challenges in applying CFD to real world problems will be discussed using incompressible flow examples. Despite the remarkable progress made in CFD technology during the past two decades, new challenges are ahead of us. Some of these will be discussed in conjunction with the incompressible Navier-Stokes solver development and their applications. Computed examples include wing tip vortex formation and propagation, flow simulation of an advanced rocket pump, and an extension of the similar technology to biofluid analysis and design. Numerical issues dealing with these applications will be discussed both from algorithm development and from application point of view. The material will be printed in a bound volume after the symposium.
Clean Energy Innovation Ecosystems Discovery - Measuring Innovation Through Data Analytics (MIDAS)
As part of the Mission Innovation rollout at the Paris COP 21, 20 countries announced to double their R&D budgets over 5 years to accelerate lab-to-market clean energy innovations. These innovations must address technical urgency and navigate complex institutional, social and financial environments. To inform budget and program development, policymakers need to understand existing clean energy innovation ecosystems (IE) and their characteristics at the local, state, and regional levels within the US. Researchers at ORNL have implemented a ground-breaking application of natural language processing, link analysis, and other computational techniques to transform text and numerical data into metrics on clean energy innovation activity and geography. The 'Measuring Innovation through Data Analytics' (MIDAS) application uses data to determine where clean energy innovation ecosystems exist and the underlying scoring algorithm "ranks" the strength of the ecosystem for several clean energy technologies. The selection of the data sources is driven by the fact that a clean energy IE can be identified as an intersection of nascent clean technology efforts and financing mechanisms and related large companies located in a geographically concentrated area with an enabling environment to encourage commercialization and networking assets to facilitate communication. MIDAS is a machine-assisted methodology that provides the user with a replicable method to rapidly identify, quantify and characterize clean energy innovation ecosystems. This software application and the underlying datasets have the potential to address many important policy questions. The initial broad list of U.S. clean energy ecosystems, with geographic area, technology focus, and list and types of involved organizations can help describe regional tech activities and capabilities. Other potential applications include understanding the effect of private sector investments on ecosystem activity, and trends analysis.