Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed computation”

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 937 records · Page 52

Computations of Flow Over a Hump Model Using Higher Order Method With Turbulence Modeling

Turbulent separated flow over a two-dimensional hump is computed by solving the RANS equations with k-omega (SST) turbulence model for the baseline, steady suction and oscillatory blowing/suction flow control cases. The flow equations and the turbulent model equations are solved using a fifth-order accurate weighted essentially nonoscillatory (WENO) scheme for space discretization and a third order, total variation diminishing (TVD) Runge-Kutta scheme for time integration. Qualitatively the computed pressure distributions exhibit the same behavior as they are observed in the experiments. The computed separation regions are much longer than that are observed. However, the percentage reduction in the separation region in the steady suction case is closer to that was measured in the experiment. The computations did not predict the expected reduction in the separation length in the oscillatory case. The predicted turbulent quantities are two to three times smaller than that are measured and it points towards the deficiencies in the existing turbulent models when they are applied to strong steady/unsteady separated flows.

Balakumar, Ponnampalam↗

Velocity distributions among colliding asteroids

The probability distribution for impact velocities between two given asteroids is wide, non-Gaussian, and often contains spikes according to our new method of analysis in which each possible orbital geometry for collision is weighted according to its probability. An average value would give a good representation only if the distribution were smooth and narrow. Therefore, the complete velocity distribution we obtain for various asteroid populations differs significantly from published histograms of average velocities. For all pairs among the 682 asteroids in the main-belt with D greater than 50 km, we find that our computed velocity distribution is much wider than previously computed histograms of average velocities. In this case, the most probable impact velocity is approximately 4.4 km/sec, compared with the mean impact velocity of 5.3 km/sec. For cases of a single asteroid (e.g., Gaspra or Ida) relative to an impacting population, the distribution we find yields lower velocities than previously reported by others. The width of these velocity distributions implies that mean impact velocities must be used with caution when calculating asteroid collisional lifetimes or crater-size distributions. Since the most probable impact velocities are lower than the mean, disruption events may occur less frequently than previously estimated. However, this disruption rate may be balanced somewhat by an apparent increase in the frequency of high-velocity impacts between asteroids. These results have implications for issues such as asteroidal disruption rates, the amount/type of impact ejecta available for meteoritical delivery to the Earth, and the geology and evolution of specific asteroids like Gaspra.

Bottke, William F., Jr.↗

Environmental dependence of the galaxy stellar mass function in the Dark Energy Survey Science Verification Data

Measurements of the galaxy stellar mass function are crucial to understand the formation of galaxies in the Universe. In a hierarchical clustering paradigm it is plausible that there is a connection between the properties of galaxies and their environments. Evidence for environmental trends has been established in the local Universe. The Dark Energy Survey (DES) provides large photometric datasets that enable further investigation of the assembly of mass. In this study we use ~3.2 million galaxies from the (South Pole Telescope) SPT-East field in the DES science verification (SV) dataset. From grizY photometry we derive galaxy stellar masses and absolute magnitudes, and determine the errors on these properties using Monte-Carlo simulations using the full photometric redshift probability distributions. We compute galaxy environments using a fixed conical aperture for a range of scales. We construct galaxy environment probability distribution functions and investigate the dependence of the environment errors on the aperture parameters. We compute the environment components of the galaxy stellar mass function for the redshift range 0.15 < z < 1.05. For z < 0.75 we find that the fraction of massive galaxies is larger in high density environment than in low density environments. We show that the low density and high density components converge with increasing redshift up to z ~ 1.0 where the shapes of the mass function components are indistinguishable. As a result, our study shows how high density structures build up around massive galaxies through cosmic time.

79 ASTRONOMY AND ASTROPHYSICS↗

A redshift survey of IRAS galaxies. V - The acceleration on the Local Group

The acceleration on the Local Group is calculated based on a full-sky redshift survey of 5288 galaxies detected by IRAS. A formalism is developed to compute the distribution function of the IRAS acceleration for a given power spectrum of initial perturbations. The computed acceleration on the Local Group points 18-28 deg from the direction of the Local Group peculiar velocity vector. The data suggest that the CMB dipole is indeed due to the motion of the Local Group, that this motion is gravitationally induced, and that the distribution of IRAS galaxies on large scales is related to that of dark matter by a simple linear biasing model.

Strauss, Michael A.↗

Sparse, iterative simulation methods for one-dimensional laminar flames

Sparse, iterative simulation methods for one-dimensional laminar flames are proposed. The resulting steady and unsteady flame solvers exploit approximate Jacobians to greatly reduce the computational cost associated with matrix operations. The constant, non-unity Lewis number assumption is introduced to further reduce the computational cost. The solvers are also parallelized to reduce time-to-solution on distributed memory computer systems. Computed laminar flame speeds and species profiles for a range of chemical mechanisms (from 10 to 2878 species) are compared against a well-validated commercial code and are found to be consistent within solver tolerances. The computation times of both the unsteady and steady solutions increase only linearly with the number of species, which is a significant improvement over the quadratic or cubic scaling of existing steady-state flame solvers. For the largest mechanism tested, the steady-state flame solver is two orders of magnitude faster than commonly-used codes. The use of an approximate Jacobian is shown to reduce the rate of convergence for the steady-state solver, but does not significantly affect the domain of convergence. The steady-state solver with approximate Jacobian is thus well suited for computationally efficient laminar flame speed sweeps with large kinetic mechanisms.

42 ENGINEERING↗

Mixtures of Gaussian wells: Theory, computation, and application

A primary challenge in unsupervised clustering using mixture models is the selection of a family of basis distributions flexible enough to succinctly represent the distributions of the target subpopulations. We introduce a new family of Gaussian well distributions (GWDs) for clustering applications where the target subpopulations are characterized by hollow (hyper-)elliptical structures. We develop the primary theory pertaining to the GWD, including mixtures of GWDs, selection of prior distributions, and computationally efficient inference strategies using Markov chain Monte Carlo. We demonstrate the utility of our approach, as compared to standard Gaussian mixture methods on a synthetic dataset, and exemplify its applicability on an example from immunofluorescence imaging, emphasizing the improved interpretability and parsimony of the GWD-based model.

59 BASIC BIOLOGICAL SCIENCES↗

Simulation of spacecraft charging environments by monoenergetic beams

To simulate the distributed spectra of plasmas in space, the differential current density spectrum of the plasma was divided into a number of energy bands and the beam energy and current were calculated for each band to provide a piecewise reproduction of the distributed spectrum. Beam energies and current densities were chosen to match the velocity moments of the plasma distribution function. The velocity moments are averages related to physical quantities such as particle density, flux, pressure, and energy flux, and have been used extensively to characterize the measured properties of plasmas in space. Combinations of one, two, and three beams were found to match two to six velocity moments of Maxwellian distributions. A computational model was used to compare the charging of a spacecraft by plasmas with distributed spectra and by monoenergetic beams.

Halverson, W.↗

Gamma-ray burst astrometry III - More results

In continuation of previous work, new computations are presented for the PVO/Ulysses/GRO/GRANAT case. Since timing errors dominate this problem, error distributions are computed analytically for the source position direction cosines. Taff's method is shown to be numerically robust, accurate, and analytically convenient.

Taff, L. G.↗

Optimal Communication Topology Construction and Sensor Selection for Independent Airspace Surveillance

The paper presents an approach with no estimation feedback to sensors selection and communication network topology computation for independent airspace surveillance with maximum outcome and minimum cost using ground based distributed sensing, computing and communication network infrastructure. The selection criteria includes maximum airspace coverage with minimal resources, minimum communication time and power consumption while guaranteeing the system observability and providing in-time high quality information to both stationary and mobile users. The developed algorithms use multi-objective optimization strategy taking into account trade-offs between conflicting objectives and are implemented using off-the-shelf computational tools. The algorithms are validated in a desktop simulation environment using synthetic sensors data generated for a simulated multi-vehicle flight scenario in the selected regional airspace and parameters of a notional wireless communication network.

Distributed sensing↗

Flight test and numerical simulation of transonic flow around YAV-8B Harrier II wing

A computational fluid dynamics (CFD) method is used to study the aerodynamics of the YAV-8B Harrier II wing in the transonic region. A numerical procedure is developed to compute the flow field around the complicated wing-pylon-fairing geometry. The surface definition of the wing and pylons were obtained from direct measurement using theodolite triangulation. A thin-layer Navier-Stokes code with the Chimera technique is used to compute flow solutions. The computed pressure distributions at several span stations are compared with flight test data and show good agreement. Computed results are correlated with flight test data that show the flow is severely separated in the vicinity of the wing-pylon junction. Analysis shows that shock waves are induced by pylon swaybrace fairings, that the flow separation is much stronger at the outboard pylon and that the separation is caused mainly by the crossflow passing the geometry of wing-pylon junction.

Gea, Lie-Mine↗

Computational technique for compressible vortex flows using the integral equation solution

The steady full-potential equation is written in the form of Poisson's equation, and the solution for the velocity field is expressed in terms of an integral equation. The integral solution consists of two surface integrals and one volume integral. The solution is obtained through successive iteration cycles. Each cycle of iteration consists of two sub-cycles, an inner cycle for wake relaxation and an out cycle for the strength of the source distribution integrals representing the flow compressibility. The density gradients in the source distribution is computed by using a type-differencing scheme of the Murman-Cole type. The method is applied to delta wings and the numerical examples show that a curved shock is captured on the wing suction side beneath the leading edge vortex sheet. Recently, a modified version of the scheme was applied to rectangular wings. In this modified scheme, the surface integral terms were computed by using a bilinear distribution of vorticity on triangular vortex panels which represent the wing and its wake. The results were compared with the available experimental data and they are in good agreement.

Kandil, Osama A.↗

A strategy for improved computational efficiency of the method of anchored distributions

This paper proposes a strategy for improving the computational efficiency of model inversion using the method of anchored distributions by “bundling” similar model parametrizations in the likelihood function. Inferring the likelihood function typically requires a large number of forward model simulations for each possible model parametrization; as a result, the process is quite expensive. To ease this prohibitive cost, we present an approximation for the likelihood function – called “bundling” – that relaxes the requirement for high quantities of forward model simulations. This approximation redefines the conditional statement of the likelihood function as the probability of sets of similar model parametrizations – “bundles” – replicating field measurements. To evaluate the effectiveness of these modifications, we compare the quality of predictions and computational cost of bundling relative to a baseline method of anchored distributions inversion of three-dimensional flow and transport model parameters. For our synthetic experiment, bundling achieved a 35% reduction in overall computational cost and had a limited negative on predicted probability distributions of the model parameters. Strategies for minimizing error in the bundling approximation, for enforcing similarity amongst the sets of model parametrizations, and for identifying convergence of the likelihood function are also presented.

Bayesian Inversion, SVD, computational efficiency↗

Effect of solar proton events in 1978 and 1979 on the odd nitrogen abundance in the middle atmosphere

Daily average solar proton flux data for 1978 and 1979 are used in a proton energy degradation scheme to derive ion pair production rates and atomic nitrogen production rates. The latter are computed in a form suitable for inclusion in an atmopheric, two-dimensional, time-dependent photochemical model. Odd nitrogen distributions are computed from the model, including atomic nitrogen production from solar protons, and are compared with baseline distributions. The comparisons show that the average effect of the solar protons in 1978 and 1979 was to cause changes in odd nitrogen only above 10 mbar and at latitudes only above about 50 deg in both hemispheres. The influence of the solar proton-produced odd nitrogen on the local abundance of odd nitrogen depends primarily on the background odd nitrogen abundance as well as the altitude and season.

Jackman, Charles H.↗

Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures

Here, we investigate how to port the standard interior-point method to new exascale architectures for block-structured nonlinear programs with state equations. Computationally, we decompose the interior-point algorithm into two successive operations: the evaluation of the derivatives and the solution of the associated Karush-Kuhn-Tucker (KKT) linear system. Our method accelerates both operations using two levels of parallelism. First, we distribute the computations on multiple processes using coarse parallelism. Second, each process uses SIMD/GPU accelerators locally to accelerate the operations using fine-grained parallelism. The KKT system is reduced by eliminating the inequalities and the state variables from the corresponding equations. We demonstrate our method's capability on the supercomputer Polaris, a testbed for the future exascale Aurora system. Each node is equipped with four GPUs, a setup amenable to our two-level approach. Our experiments on the stochastic optimal power flow problem show that the reduction method is 50x faster than the sparse linear solver HSL MA57 running in serial on the CPU, and 6x faster than Pardiso running in parallel on CPU on the same number of processes.

97 MATHEMATICS AND COMPUTING↗

A cloud computing approach to massively-parallel distributed stochastic optimization with application to geomechanical reservoir characterization

Many search strategies used to optimize parameters during hydrologic model calibration are inherently limited in that simulations must be performed sequentially in order for the algorithm to converge. As a result, the overall time required to reach a solution increases linearly with the number of steps necessary. In contrast, sampling strategies that attempt to approximate the posterior distribution of the parameters do not require the model simulations to be run in sequence and therefore invite the use of a massively parallel approach across heterogeneous computing environments. We apply a cloud computing methodology to this problem where a head node running on Amazon Web Services continuously produces candidate models that are distributed to arbitrary compute environments to run the simulation, in our case Clemson’s Palmetto cluster computer. Thus the time required to obtain a sufficient number of samples to produce an adequate approximation of the posterior distribution of the parameters is limited by the number of available compute sites. Monte Carlo sampling of the posterior space would be duplicative and inefficient, thus we combine Latin hypercube methods with genetic algorithms to ensure that no large regions of the parameter space are left unexplored, and that high probability regions are investigated thoroughly. We independently assess the fit to different types of data sets without the need to construct a single objective function. Sets of Pareto optimal models are particularly valuable when the quality and information content of data is poorly known or conceptual model errors exist in our simulation. We illustrate our approach for a problem where in situ strain data are used to calibrate the parameters of an oil reservoir in the Avant oil field in Oklahoma. We use well injection and shut-in to stress a deep (500m) confined formation, and observe the geomechanical response using borehole strainmeters installed in the shallow subsurface (30m). These data were then used to calibrate the poroelastic properties of the reservoir and caprock along with the geometry of an elliptic channel associated with the formation. Using our approach we are able to identify issues with model error as well as substantial tradeoffs that occur within the parameters.

inversion, stochastic, geomechanics, poroelastic, ↗

Implementing Software Resiliency in HPX for Extreme Scale Computing

The DOE Office of Science Exascale Computing Project (ECP) outlines the next milestones in the supercomputing domain. The target computing systems under the project will deliver 10x performance while keeping the power budget under 30 megawatts. With such large machines, the need to make applications resilient has become paramount. The benefits of adding resiliency to mission critical and scientific applications, includes the reduced cost of restarting the failed simulation both in terms of time and power. Most of the current implementation of resiliency at the software level makes use of a Coordinated Checkpoint and Restart (C/R). This technique of resiliency generates a consistent global snapshot, also called a checkpoint. Generating snapshots involves global communication and coordination and is achieved by synchronizing all running processes. The generated checkpoint is then stored in some form of persistent storage. On failure detection, the runtime initiates a global rollback to the most recent previously saved checkpoint. This involves aborting all running processes, rolling them back to the previous state and restarting them.

97 MATHEMATICS AND COMPUTING↗

Deriving Lifetime Maps in the Time/Frequency Domain of Coherent Structures in the Turbulent Boundary Layer

The lifetimes of coherent structures are derived from data correlated over a 3 sensor array sampling streamwise sidewall pressure at high Reynolds number (> 10(exp 8)). The data were acquired at subsonic, transonic and supersonic speeds aboard a Tupolev Tu-144. The lifetimes are computed from a variant of the correlation length termed the lifelength. Characteristic lifelengths are estimated by fitting a Gaussian distribution to the sensors cross spectra and are shown to compare favorably with Efimtsov s prediction of correlation space scales. Lifelength distributions are computed in the time/frequency domain using an interval correlation technique on the continuous wavelet transform of the original time data. The median values of the lifelength distributions are found to be very close to the frequency averaged result. The interval correlation technique is shown to allow the retrieval and inspection of the original time data of each event in the lifelength distributions, thus providing a means to locate and study the nature of the coherent structure in the turbulent boundary layer. The lifelength data are converted to lifetimes using the convection velocity. The lifetime of events in the time/frequency domain are displayed in Lifetime Maps. The primary purpose of the paper is to validate these new analysis techniques so that they can be used with confidence to further characterize the behavior of coherent structures in the turbulent boundary layer.

Palumbo, Dan↗