Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “randomization”

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 703 records · Page 39

Examining AGN UV/Optical Variability beyond the Simple Damped Random Walk

We present damped harmonic oscillator (DHO) light-curve modeling for a sample of 12,714 spectroscopically confirmed quasars in the Sloan Digital Sky Survey Stripe 82 region. DHO is a second-order continuous-time autoregressive moving-average process, which can be fully described using four independent parameters: a natural oscillation frequency (ω 0 ), a damping ratio (ξ), a characteristic perturbation timescale (τ perturb ), and an amplitude for the perturbing white noise (σ ϵ ). The asymptotic variability amplitude of a DHO process is quantified by σ DHO —a function of ω 0 , ξ, τ perturb , and σ ϵ . We find that both τ perturb and σ ϵ follow different dependencies with rest-frame wavelength (λ RF ) on either side of 2500 Å, whereas σ DHO follows a single power-law relation with λ RF . After correcting for wavelength dependence, σ DHO exhibits anticorrelations with both the Eddington ratio and the black hole mass, while τ perturb —with a typical value of days in the rest frame—shows an anticorrelation with the bolometric luminosity. Modeling active galactic nuclei (AGN) variability as a DHO offers more insight into the workings of accretion disks close to the supermassive black holes at the center of AGN. The newly discovered short-term variability (characterized by τ perturb and σ ϵ ) and its correlation with bolometric luminosity pave the way for new algorithms that will derive fundamental properties (e.g., Eddington ratio) of AGN using photometric data alone.

79 ASTRONOMY AND ASTROPHYSICS↗

Parallelized domain decomposition for multi-dimensional Lagrangian random walk mass-transfer particle tracking schemes

Lagrangian particle tracking schemes allow a wide range of flow and transport processes to be simulated accurately, but a major challenge is numerically implementing the inter-particle interactions in an efficient manner. This article develops a multi-dimensional, parallelized domain decomposition (DDC) strategy for mass-transfer particle tracking (MTPT) methods in which particles exchange mass dynamically. We show that this can be efficiently parallelized by employing large numbers of CPU cores to accelerate run times. In order to validate the approach and our theoretical predictions we focus our efforts on a well-known benchmark problem with pure diffusion, where analytical solutions in any number of dimensions are well established. In this work, we investigate different procedures for “tiling” the domain in two and three dimensions (2-D and 3-D), as this type of formal DDC construction is currently limited to 1-D. An optimal tiling is prescribed based on physical problem parameters and the number of available CPU cores, as each tiling provides distinct results in both accuracy and run time. We further extend the most efficient technique to 3-D for comparison, leading to an analytical discussion of the effect of dimensionality on strategies for implementing DDC schemes. Increasing computational resources (cores) within the DDC method produces a trade-off between inter-node communication and on-node work. For an optimally subdivided diffusion problem, the 2-D parallelized algorithm achieves nearly perfect linear speedup in comparison with the serial run-up to around 2700 cores, reducing a 5 h simulation to 8 s, while the 3-D algorithm maintains appreciable speedup up to 1700 cores.

97 MATHEMATICS AND COMPUTING↗