Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical Methods”

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,207 records · Page 67
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

The cosmic web around the Coma cluster from constrained cosmological simulations

Galaxy clusters in the Universe occupy the important position of nodes of the cosmic web. They are connected among them by filaments, elongated structures composed of dark matter, galaxies, and gas. The connection of galaxy clusters to filaments is important, as it is related to the process of matter accretion onto the former. For this reason, investigating the connections to the cosmic web of massive clusters, especially well-known ones for which a lot of information is available, is a hot topic in astrophysics. In a previous work, we performed an analysis of the filament connections of the Coma cluster of galaxies, as detected from the observed galaxy distribution. In this work we resort to a numerical simulation whose initial conditions are constrained to reproduce the local Universe, including the region of the Coma cluster to interpret our observations in an evolutionary context. We detect the filaments connected to the simulated Coma cluster and perform an accurate comparison with the cosmic web configuration we detect in observations. We perform an analysis of the halos’ spatial and velocity distributions close to the filaments in the cluster outskirts. We conclude that, although not significantly larger than the average, the flux of accreting matter on the simulated Coma cluster is significantly more collimated close to the filaments with respect to the general isotropic accretion flux. This paper is the first example of such a result and the first installment in a series of publications which will explore the build-up of the Coma cluster system in connection to the filaments of the cosmic web as a function of redshift.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

DESCQA: An Automated Validation Framework for Synthetic Sky Catalogs

The use of high-quality simulated sky catalogs is essential for the success of cosmological surveys. The catalogs have diverse applications, such as investigating signatures of fundamental physics in cosmological observables, understanding the effect of systematic uncertainties on measured signals and testing mitigation strategies for reducing these uncertainties, aiding analysis pipeline development and testing, and survey strategy optimization. The list of applications is growing with improvements in the quality of the catalogs and the details that they can provide. Given the importance of simulated catalogs, it is critical to provide rigorous validation protocols that enable both catalog providers and users to assess the quality of the catalogs in a straightforward and comprehensive way. For this purpose, we have developed the DESCQA framework for the Large Synoptic Survey Telescope Dark Energy Science Collaboration as well as for the broader community. The goal of DESCQA is to enable the inspection, validation, and comparison of an inhomogeneous set of synthetic catalogs via the provision of a common interface within an automated framework. Here in this paper, we present the design concept and first implementation of DESCQA. In order to establish and demonstrate its full functionality we use a set of interim catalogs and validation tests. We highlight several important aspects, both technical and scientific, that require thoughtful consideration when designing a validation framework, including validation metrics and how these metrics impose requirements on the synthetic sky catalogs.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

The Aemulus Project. I. Numerical Simulations for Precision Cosmology

The rapidly growing statistical precision of galaxy surveys has led to a need for ever more precise predictions of the observables used to constrain cosmological and galaxy formation models. The primary avenue through which such predictions will be obtained is suites of numerical simulations. These simulations must span the relevant model parameter spaces, be large enough to obtain the precision demanded by upcoming data, and be thoroughly validated in order to ensure accuracy. In this paper, we present one such suite of simulations, forming the basis for the AEMULUS Project, a collaboration devoted to precision emulation of galaxy survey observables. We have run a set of 75 (1.05 h(-1) Gpc)(3) simulations with mass resolution and force softening of 3.51 x 10(10) (Omega(m)/0.3) h(-1) M-circle dot and 20 h(-1) kpc, respectively, in 47 different wCDM cosmologies spanning the range of parameter space allowed by the combination of recent cosmic microwave background, baryon acoustic oscillation, and Type Ia supernova results. We present convergence tests of several observables including spherical overdensity halo mass functions, galaxy projected correlation functions, galaxy clustering in redshift space, and matter and halo correlation functions and power spectra. We show that these statistics are converged to 1% (2%) or to the sample variance of the statistic, whichever is larger, for halos with more than 500 (200) particles, respectively, and scales of r > 200 h(-1) kpc. in real space or k similar to 3 h Mpc(-1). in harmonic space for z <= 1. We find that the dominant source of uncertainty comes from varying the particle loading of the simulations. This leads to large systematic errors for statistics using halos with fewer than 200 particles and scales smaller than k similar to 4 h Mpc(-1). We provide the halo catalogs and snapshots detailed in this work to the community at. https://AemulusProject.github.io.

large-scale structure of universe↗
DOE OSTI2018

Numerical multi-scaling method to solve the linear stochastic partial differential equations

In this paper, we propose a multi-scaling method to solve a class of the stochastic partial differential equations (SPDEs) of Itô-type. By this method, we approximate the solution of the SPDEs with strongly elliptic operator on a finite domain. The method is based on B-spline wavelet approximations; some of these functions are reshaped to satisfy on boundary conditions exactly. We prove the consistency and stability of the method. Illustrative examples are included to demonstrate the validity and applicability of our proposed technique.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Memory-optimized shift operator alternating direction implicit finite difference time domain method for plasma

Through introducing the alternating direction implicit (ADI) technique and the memory-optimized algorithm to the shift operator (SO) finite difference time domain (FDTD) method, the memory-optimized SO-ADI FDTD for nonmagnetized collisional plasma is proposed and the corresponding formulae of the proposed method for programming are deduced. In order to further the computational efficiency, the iteration method rather than Gauss elimination method is employed to solve the equation set in the derivation of the formulae. Complicated transformations and convolutions are avoided in the proposed method compared with the Z transforms (ZT) ADI FDTD method and the piecewise linear JE recursive convolution (PLJERC) ADI FDTD method. The numerical dispersion of the SO-ADI FDTD method with different plasma frequencies and electron collision frequencies is analyzed and the appropriate ratio of grid size to the minimum wavelength is given. The accuracy of the proposed method is validated by the reflection coefficient test on a nonmagnetized collisional plasma sheet. The testing results show that the proposed method is advantageous for improving computational efficiency and saving computer memory. The reflection coefficient of a perfect electric conductor (PEC) sheet covered by multilayer plasma and the RCS of the objects coated by plasma are calculated by the proposed method and the simulation results are analyzed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Automated construction of clear-sky dictionary from all-sky imager data

All-sky imagers (ASIs) have significant promise as scalable sensors for short-term solar irradiance forecasting. Many of the current computational techniques that use ASIs for this purpose rely on collections of clear-sky images indexed by time of day, solar angle, or both, called clear-sky dictionaries (CSDs). These CSDs act as baselines against which images can be compared to locate and classify clouds within the image frame. CSDs are often compiled by hand, where individuals visually inspect collections of images one at a time to find clear-sky images. This process is not scalable, and it is prone to error. This paper proposes an automated, nonparametric alternative that uses the principles of digital image processing to find clear-sky images within a set of images taken over several days. We use ground-truth measurements of the clearness index to assess the performance of our method, and we show that the images it selects accurately correspond to clear-sky images. We also compare our proposal, which is nonparametric, with a state-of-the-art parametric method. The numerical results indicate that the performance of the method proposed here is superior.

14 SOLAR ENERGY↗
DOE OSTI2014

A method for embedding circular force-free flux ropes in potential magnetic fields

We propose a method for constructing approximate force-free equilibria in pre-eruptive configurations in which a thin force-free flux rope is embedded into a locally bipolar-type potential magnetic field. The flux rope is assumed to have a circular-arc axis, a circular cross-section, and electric current that is either concentrated in a thin layer at the boundary of the rope or smoothly distributed across it with a maximum of the current density at the center. The entire solution is described in terms of the magnetic vector potential in order to facilitate the implementation of the method in numerical magnetohydrodynamic (MHD) codes that evolve the vector potential rather than the magnetic field itself. The parameters of the flux rope can be chosen so that its subsequent MHD relaxation under photospheric line-tied boundary conditions leads to nearly exact numerical equilibria. To show the capabilities of our method, we apply it to several cases with different ambient magnetic fields and internal flux-rope structures. These examples demonstrate that the proposed method is a useful tool for initializing data-driven simulations of solar eruptions.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2013

Solution of stochastic media transport problems using a numerical quadrature-based method

We present a new conceptual framework for analyzing transport problems in random media. We decompose such problems into stratified subproblems according to the number of material pseudo-interfaces within realizations. For a given subproblem we assign pseudo-interface locations in each realization according to product quadrature rules, which allows us to deterministically generate a fixed number of realizations. Quadrature integration of the solutions of these realizations thus approximately solves each subproblem; the weighted superposition of solutions of the subproblems approximately solves the general stochastic media transport problem. We revisit some benchmark problems to determine the accuracy and efficiency of this approach in comparison to randomly generated realizations. We find that this method is very accurate and fast when the number of pseudo-interfaces in a problem is generally low, but that these advantages quickly degrade as the number of pseudo-interfaces increases. (authors)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Examination of Semi-Analytical Solution Methods in the Coarse Operator of Parareal Algorithm for Power System Simulation

With continuing advances in high-performance parallel computing platforms, parallel algorithms have become powerful tools for development of faster than real-time power system dynamic simulations. In particular, it has been demonstrated in recent years that parallel-in-time (Parareal) algorithms have the potential to achieve such an ambitious goal. Here, the selection of a fast and reasonably accurate coarse operator of the Parareal algorithm is crucial for its effective utilization and performance. This paper examines semi-analytical solution (SAS) methods as the coarse operators of the Parareal algorithm and explores performance of the SAS methods to the standard numerical time integration methods. Two promising time-power series-based SAS methods were considered; Adomian decomposition method and Homotopy analysis method with a windowing approach for improving the convergence. Numerical performance case studies on 10-generator 39-bus system and 327-generator 2383-bus system were performed for these coarse operators over different disturbances, evaluating the number of Parareal iterations, computational time, and stability of convergence. All the coarse operators tested with different scenarios have converged to the same corresponding true solution (if they are convergent) and the SAS methods provide comparable computational speed, while having more stable convergence to the true solution in many cases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Recursive integral method with Cayley transformation

Summary The recently developed RIM (recursive integral method) finds eigenvalues in a region of the complex plane. It computes an indicator to test if the region contains eigenvalues using an approximate spectral projection. If the indicator shows that the region contains eigenvalues, it is subdivided into smaller regions, which are then recursively tested and subdivided until any eigenvalues are isolated to a specified precision. We propose an enhancement to RIM that uses Cayley transformations and Arnoldi's method to greatly decrease the number of factorizations required to solve the linear systems that arise from a discretized contour integral to compute the indicator, which substantially reduces the computational cost. We demonstrate the efficacy of our method with numerical examples and compare with the implicitly restarted Arnoldi method, as implemented in eigs in MATLAB.

Huang, R.↗
DOE OSTI2018

Gaussian process based optimization of molecular geometries using statistically sampled energy surfaces from quantum Monte Carlo

Optimization of atomic coordinates and lattice parameters remains a significant challenge to the wide use of stochastic electronic structure methods such as quantum Monte Carlo (QMC). Measurements of the forces and stress tensor by these methods contain statistical errors, challenging conventional gradient-based numerical optimization methods that assume deterministic results. Additionally, forces are not yet available for some methods, wavefunctions, and basis sets and when available may be expensive to compute to sufficiently high statistical accuracy near energy minima, where the energy surfaces are flat. Here, we explore the use of Gaussian process based techniques to sample the energy surfaces and reduce sensitivity to the statistical nature of the problem. We utilize Latin hypercube sampling, with the number of sampled energy points scaling quadratically with the number of optimized parameters. Furthermore, we show these techniques may be successfully applied to systems consisting of tens of parameters, demonstrating QMC optimization of a benzene molecule starting from a randomly perturbed, broken symmetry geometry.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2022

A phase-field model for quasi-dynamic nucleation, growth, and propagation of rate-and-state faults

Despite its critical role in the study of earthquake processes, numerical simulation of the entire stages of fault rupture remains a formidable task. The main challenges in simulating a fault rupture process include the complex evolution of fault geometry, frictional contact, and off-fault damage over a wide range of spatial and temporal scales. Here, in this paper, we develop a phase-field model for quasi-dynamic fault nucleation, growth, and propagation, which features two standout advantages: (i) it does not require any sophisticated algorithms to represent fault geometry and its evolution; and (ii) it allows for modeling fault nucleation, propagation, and off-fault damage processes with a single formulation. Built on a recently developed phase-field framework for shear fractures with frictional contact, the proposed formulation incorporates rate- and state-dependent friction, radiation damping, and their impacts on fault mechanics and off-fault damage. We show that the numerical results of the phase-field model are consistent with those obtained from well-verified approaches that model the fault as a surface of discontinuity, without suffering from the mesh convergence issue in the existing continuous approaches to fault rupture (e.g., the stress glut method). Further, through numerical examples of fault propagation in various settings, we demonstrate that the phase-field approach may open new opportunities for investigating complex earthquake processes that have remained overly challenging for the existing numerical methods.

58 GEOSCIENCES↗
DOE OSTI2016

Advancing Clouds Lifecycle Representation in Numerical Models Using Innovative Analysis Methods that Bridge ARM Observations and Models Over a Breadth of Scales

This the final report for the DE-SC0007096 - Advancing Clouds Lifecycle Representation in Numerical Models Using Innovative Analysis Methods that Bridge ARM Observations and Models Over a Breadth of Scales - PI: Pavlos Kollias. The final report outline the main findings of the research conducted using the aforementioned award in the area of cloud research from the cloud scale (10-100 m) to the mesoscale (20-50 km).

58 GEOSCIENCES↗