Search NASA⌕ Search

SEARCH · Search NASA

Results for “computer experiment”

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 325 records · Page 18

A versatile ground data display system for Spacelab experiments

A microprocessor-based data capture and display system suited to the needs of many Spacelab experimenters is described. Although developed specifically for the needs of the FAUST UV astronomy telescope, several features of the system may make it attractive to other groups who need to interact with their Spacelab data in real or near-real time. The display system captures data from the serial data stream originating in the Spacelab experiment computer input/output (ECIO) data channel, and can reformat and display several hundred variables per second in real time. The system offers a combination of CRT display and analog paper strip-chart output. A facility is also provided for simultaneously creating floppy-disk records of short segments of data according to prearranged criteria, to allow detailed examination of critical events in the operation of the experiment. The simplicity, economy, reliability, and flexibility of the display system suggest its use for monitoring a variety of low- and medium-data-rate Spacelab experiments.

Werthimer, D.↗

Effect of grid aspect ratio on convergence

The effects of high-aspect-ratio grids on algorithm convergence are considered by means of vector stability theory and computational experiments. The results indicate that approximately factored implicit schemes experience convergence deterioration because of nonoptimum local time-stepping procedures and increased need for viscous preconditioning. Based on this insight, an enhanced algorithm is devised using improved selection of the local time step, appropriate definition of the viscous preconditioning matrix, and proper implementation of the boundary conditions. The new algorithm provides uniformly efficient convergence at all aspect ratios for both Euler and Navier-Stokes computations for a variety of test problems.

Buelow, P. E. O.↗

Motion Dynamics of Motile Microbes in Pore-Networks and its Implications for Reactive Transport Processes

This report outlines new methods to improve simulations of microbial transport and microbially mediated reactions in porous media. A range of experimental, modeling, and machine learning tools are introduced to make these simulations faster, more reliable, and useful for real-world applications. At the microscopic level, the study investigates how different types of bacteria move through confined spaces. A new artificial intelligence tool called DeepTrackStat, is introduced to track motions dynamics as observed in videos of particles migrating through pore networks. This tool is especially helpful for studying fast-moving microbes and requires less computing power than traditional tracking methods. At larger scales, the research looks at how microbes and chemicals interact in zones where surface water and groundwater meet. To connect the small- and large-scale findings, the study presents a neural network model called STAMNet. This tool helps scale up detailed small-scale microbial motion behaviors to predict large-scale environmental changes more efficiently. By combining lab experiments, computer models, and artificial intelligence, the research presented supports smarter environmental decision-making, especially in bioremediation of contaminated groundwater and protection of water quality.

54 ENVIRONMENTAL SCIENCES↗

Automatic Differentiation of C++ Codes on Emerging Manycore Architectures with Sacado

Automatic differentiation (AD) is a well-known technique for evaluating analytic derivatives of calculations implemented on a computer, with numerous software tools available for incorporating AD technology into complex applications. However, a growing challenge for AD is the efficient differentiation of parallel computations implemented on emerging manycore computing architectures such as multicore CPUs, GPUs, and accelerators as these devices become more pervasive. In this work, we explore forward mode, operator overloading-based differentiation of C++ codes on these architectures using the widely available Sacado AD software package. In particular, we leverage Kokkos, a C++ tool providing APIs for implementing parallel computations that is portable to a wide variety of emerging architectures. Here we describe the challenges that arise when differentiating code for these architectures using Kokkos, and two approaches for overcoming them that ensure optimal memory access patterns as well as expose additional dimensions of fine-grained parallelism in the derivative calculation. We describe the results of several computational experiments that demonstrate the performance of the approach on a few contemporary CPU and GPU architectures. We then conclude with applications of these techniques to the simulation of discretized systems of partial differential equations.

97 MATHEMATICS AND COMPUTING↗

Deep Kronecker neural networks: A general framework for neural networks with adaptive activation functions

Here we propose a new type of neural networks, Kronecker neural networks (KNNs), that form a general framework for neural networks with adaptive activation functions. KNNs employ the Kronecker product, which provides an efficient way of constructing a very wide network while keeping the number of parameters low. Our theoretical analysis reveals that under suitable conditions, KNNs induce a faster decay of the loss than that by the feed-forward networks. This is also empirically verified through a set of computational examples. Furthermore, under certain technical assumptions, we establish global convergence of gradient descent for KNNs. As a specific case, we propose the Rowdy activation function that is designed to get rid of any saturation region by injecting sinusoidal fluctuations, which include trainable parameters. The proposed Rowdy activation function can be employed in any neural network architecture like feed-forward neural networks, Recurrent neural networks, Convolutional neural networks etc. The effectiveness of KNNs with Rowdy activation is demonstrated through various computational experiments including function approximation using feed-forward neural networks, solution inference of partial differential equations using the physics-informed neural networks, and standard deep learning benchmark problems using convolutional and fully-connected neural networks.

97 MATHEMATICS AND COMPUTING↗

Numerical Investigation and Optimization of a Flushwall Injector for Scramjet Applications at Hypervelocity Flow Conditions

An investigation utilizing Reynolds-averaged simulations (RAS) was performed in order to demonstrate the use of design and analysis of computer experiments (DACE) methods in Sandia’s DAKOTA software package for surrogate modeling and optimization. These methods were applied to a flow- path fueled with an interdigitated flushwall injector suitable for scramjet applications at hyper- velocity conditions and ascending along a constant dynamic pressure flight trajectory. The flight Mach number, duct height, spanwise width, and injection angle were the design variables selected to maximize two objective functions: the thrust potential and combustion efficiency. Because the RAS of this case are computationally expensive, surrogate models are used for optimization. To build a surrogate model a RAS database is created. The sequence of the design variables comprising the database were generated using a Latin hypercube sampling (LHS) method. A methodology was also developed to automatically build geometries and generate structured grids for each design point. The ensuing RAS analysis generated the simulation database from which the two objective functions were computed using a one-dimensionalization (1D) of the three-dimensional simulation data. The data were fitted using four surrogate models: an artificial neural network (ANN), a cubic polynomial, a quadratic polynomial, and a Kriging model. Variance-based decomposition showed that both objective functions were primarily driven by changes in the duct height. Multiobjective design optimization was performed for all four surrogate models via a genetic algorithm method. Optimal solutions were obtained at the upper and lower bounds of the flight Mach number range. The Kriging model predicted an optimal solution set that exhibited high values for both objective functions. Additionally, three challenge points were selected to assess the designs on the Pareto fronts. Further sampling among the designs of the Pareto fronts may be required to lower the surrogate model errors and perform more accurate surrogate-model-based optimization.

Shenoy, Rajiv R.↗

A computational study of symmetry and well-posedness of structural topology optimization

We report on computational topological optimization of elastic structures, in particular minimization of compliance subject to a constraint on the mass. Through computational experiments, it is discovered that even very simple optimization problems can exhibit complex behavior such as critical points and bifurcation. In the vicinity of significant points, structural topology optimization problems are not well-posed since infinitesimally small perturbations lead to distinct topologies.

42 ENGINEERING↗

A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems

We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.

97 MATHEMATICS AND COMPUTING↗

An Application of the Difference Potentials Method to Solving External Problems in CFD

Numerical solution of infinite-domain boundary-value problems requires some special techniques that would make the problem available for treatment on the computer. Indeed, the problem must be discretized in a way that the computer operates with only finite amount of information. Therefore, the original infinite-domain formulation must be altered and/or augmented so that on one hand the solution is not changed (or changed slightly) and on the other hand the finite discrete formulation becomes available. One widely used approach to constructing such discretizations consists of truncating the unbounded original domain and then setting the artificial boundary conditions (ABC's) at the newly formed external boundary. The role of the ABC's is to close the truncated problem and at the same time to ensure that the solution found inside the finite computational domain would be maximally close to (in the ideal case, exactly the same as) the corresponding fragment of the original infinite-domain solution. Let us emphasize that the proper treatment of artificial boundaries may have a profound impact on the overall quality and performance of numerical algorithms. The latter statement is corroborated by the numerous computational experiments and especially concerns the area of CFD, in which external problems present a wide class of practically important formulations. In this paper, we review some work that has been done over the recent years on constructing highly accurate nonlocal ABC's for calculation of compressible external flows. The approach is based on implementation of the generalized potentials and pseudodifferential boundary projection operators analogous to those proposed first by Calderon. The difference potentials method (DPM) by Ryaben'kii is used for the effective computation of the generalized potentials and projections. The resulting ABC's clearly outperform the existing methods from the standpoints of accuracy and robustness, in many cases noticeably speed up the multigrid convergence, and at the same time are quite comparable to other methods from the standpoints of geometric universality and simplicity of implementation.

Ryaben 'Kii, Victor S.↗

The effect of secular resonances in the asteroid region between 2.1 and 2.4 AU

The asteroid region between 2.1 and 2.4 AU appears to be depopulated at inclinations i greater than 12 deg. This region is surrounded by the three main secular resonances nu(sub 5), nu(sub 6), and nu(sub 16) and is crossed by higher order secular resonances. Secular resonances appear to overlap in this region. Numerical integrations of the orbits of seventeen fictituous asteroids with initial inclinations 12 deg less than or equal to i less than or equal to 20 deg show the following: (1) this particular asteroid region is not depopulated in our computer experiment on timescales of 2.7 Myrs; (2) inclinations are pumped up by successive crossings through higher order secular resonances while eccentricities are not increased sufficiently to produce planet-crossers; (3) bodies located in the bordering nu(sub 6) resonance with semi-major axes a less than or equal to 2.4 AU become Earth-crossers on a time scale of 1 Myr; and (4) we confirm the result that modes due to higher order secular resonances must be eliminated when proper elements are computed.

Froeschle, Christiane↗

Surrogate Model Selection for Design Space Approximation And Surrogatebased Optimization

Surrogate models are used to map input data to output data when the actual relationship between the two is unknown or computationally expensive to evaluate for sensitivity analysis, uncertainty propagation and surrogate based optimization. This work evaluates the performance of eight surrogate modeling techniques for design space approximation and surrogate based optimization applications over a set of generated datasets with known characteristics. With this work, we aim to provide general rules for selecting an appropriate surrogate model form solely based on the characteristics of the data being modeled. Furthermore, the computational experiments revealed that, in general, multivariate adaptive regression spline models (MARS) and single hidden layer feed forward neural networks (ANN) yielded the most accurate predictions over the design space while Random Forest (RF) models most reliably identified the locations of the optimums when used for surrogate-based optimization.

97 MATHEMATICS AND COMPUTING↗

Goertler instability on an airfoil

An effective computational scheme was developed to study the growth/damping of Goertler vortices along walls of variable curvature. Computational experiments indicate that when the amplification rates for the u-, v-, and w-perturbations are the same, the finite difference approach to solve the initial value problem and the normal mode approach give identical results for the Blasius boundary layer on constant curvature concave walls. The growth of Goertler vortices was rapid in the concave regions and was followed by sharp damping in the convex region. However, multiple sets of counter-rotating vortices were formed and remained far downstream in the convex region. The current computational scheme can be easily extended to more realistic problems including variable pressure gradients and suction effects.

Kalburgi, Vijay↗

Towards Exascale Supernova Simulations with GenASiS

Core-collapse supernovae are worth simulating on leadership computing resources because they are the origin of many elements, are interesting targets for expensive observational programs, and provide valuable computational experience. The need to perform implicit neutrino transport addressing up to six dimensions of phase space makes simulations aimed at the explosion mechanism an exascale problem. The multiscale nature of the problem in space and time can be addressed with adaptive mesh refinement and implicit evolution. Several types of solvers - explicit and implicit, hyperbolic and possibly elliptic - must be deployed with operator splitting to address the multiphysics nature of the problem. While we have some ideas about how parallelism can be exploited, we look to applied mathematicians and computer scientists to work with us and provide libraries that deploy capabilities needed by our solvers on heterogeneous and communication-unfriendly computer architectures.

Cardall, Christian Y↗

A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix

A Euclidean distance matrix (EDM) is a table of distance-square between points on a k-dimensional Euclidean space, with applications in many fields (e.g., engineering, geodesy, economics, genetics, biochemistry, and psychology). A problem that often arises is the absence (or uncertainty) of some EDM elements. In many situations, only a subset of all pairwise distances is available and it is desired to have some procedure to estimate the missing distances. In this paper, we address the problem of missing data in EDM through low-rank matrix completion techniques. We exploit the fact that the rank of a EDM is at most k+2 and does not depend on the number of points, which is, in general, much bigger then k. We use a singular value decomposition approach that considers the rank of the matrix to be completed and computes, in each iteration, a parameter that controls the convergence of the method. After performing a number of computational experiments, we could observe that our proposal was able to recover, with high precision, random EDMs with more than 1000 points and up to 98% of missing data in few minutes. In addition, our method required a smaller number of iterations when compared to other competitive state-of-art technique.

97 MATHEMATICS AND COMPUTING↗

Comparison of some approximations for isotropic turbulence.

Study of several related turbulence approximations with regard to dynamical properties and agreement of numerical predictions with laboratory and computer experiments. The approximations considered include the direct-interaction equations (Kraichnan, 1964), Herring's (1966) self-consistent-field theory, a generalization of Edwards' (1964) theory, the abridged Lagrangian-history, direct-interaction approximation (Kraichnan, 1966), the test-field model (Kraichnan, 1971), and an approximation, not previously described, in which one velocity field passively suffers convection by another. Most of the cited approximations are representable by stochastic model equations for the velocity amplitude. Explicit constructions are given for the stochastic models, in a form that can be approximated on a digital computer. These constructions are used to discuss the physical and mathematical differences between the model dynamics and actual Navier-Stokes dynamics.-

Herring, J. R.↗

Optimization and analysis of large chemical kinetic mechanisms using the solution mapping method - Combustion of methane

A method of systematic optimization, solution mapping, as applied to a large-scale dynamic model is presented. The basis of the technique is parameterization of model responses in terms of model parameters by simple algebraic expressions. These expressions are obtained by computer experiments arranged in a factorial design. The developed parameterized responses are then used in a joint multiparameter multidata-set optimization. A brief review of the mathematical background of the technique is given. The concept of active parameters is discussed. The technique is applied to determine an optimum set of parameters for a methane combustion mechanism. Five independent responses - comprising ignition delay times, pre-ignition methyl radical concentration profiles, and laminar premixed flame velocities - were optimized with respect to thirteen reaction rate parameters. The numerical predictions of the optimized model are compared to those computed with several recent literature mechanisms. The utility of the solution mapping technique in situations where the optimum is not unique is also demonstrated.

Frenklach, Michael↗

Discovery of LaAlO 3 as an efficient catalyst for two-electron water electrolysis towards hydrogen peroxide

Electrochemical two-electron water oxidation reaction (2e-WOR) has drawn significant attention as a promising process to achieve the continuous on-site production of hydrogen peroxide (H 2 O 2 ). However, compared to the cathodic H 2 O 2 generation, the anodic 2e-WOR is more challenging to establish catalysts due to the severe oxidizing environment. In this study, we combine density functional theory (DFT) calculations with experiments to discover a stable and efficient perovskite catalyst for the anodic 2e-WOR. Our theoretical screening efforts identify LaAlO 3 perovskite as a stable, active, and selective candidate for catalyzing 2e-WOR. Our experimental results verify that LaAlO 3 achieves an overpotential of 510 mV at 10 mA cm -2 in 4 M K 2 CO 3 /KHCO 3 , lower than those of many reported metal oxide catalysts. In addition, LaAlO 3 maintains a stable H 2 O 2 Faradaic efficiency with only a 3% decrease after 3 h at 2.7 V vs. RHE. This computation-experiment synergistic approach introduces another effective direction to discover promising catalysts for the harsh anodic 2e-WOR towards H 2 O 2 .

08 HYDROGEN↗

A posteriori superlinear convergence bounds for block conjugate gradient

In this paper, we extend to the block case the a posteriori bound showing superlinear convergence of the conjugate gradient method developed by van der Vorst and Vuik in [J. Comput. Applied Math., 48 (1993), pp. 327–341]. That is, we obtain similar bounds but now for the block conjugate gradient method. We also present a series of computational experiments, illustrating the validity of the bound developed here as well as the bound by Simoncini and Szyld from [SIAM Review, 47 (2005), pp. 247–272] using angles between subspaces. Using these bounds, we make some observations on the onset of superlinearity and how this onset depends on the eigenvalue distribution and the block size.

97 MATHEMATICS AND COMPUTING↗