Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error analysis”

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 739 records · Page 41
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

CAFE: A NEW RELATIVISTIC MHD CODE

We introduce CAFE, a new independent code designed to solve the equations of relativistic ideal magnetohydrodynamics (RMHD) in three dimensions. We present the standard tests for an RMHD code and for the relativistic hydrodynamics regime because we have not reported them before. The tests include the one-dimensional Riemann problems related to blast waves, head-on collisions of streams, and states with transverse velocities, with and without magnetic field, which is aligned or transverse, constant or discontinuous across the initial discontinuity. Among the two-dimensional (2D) and 3D tests without magnetic field, we include the 2D Riemann problem, a one-dimensional shock tube along a diagonal, the high-speed Emery wind tunnel, the Kelvin–Helmholtz (KH) instability, a set of jets, and a 3D spherical blast wave, whereas in the presence of a magnetic field we show the magnetic rotor, the cylindrical explosion, a case of Kelvin–Helmholtz instability, and a 3D magnetic field advection loop. The code uses high-resolution shock-capturing methods, and we present the error analysis for a combination that uses the Harten, Lax, van Leer, and Einfeldt (HLLE) flux formula combined with a linear, piecewise parabolic method and fifth-order weighted essentially nonoscillatory reconstructors. We use the flux-constrained transport and the divergence cleaning methods to control the divergence-free magnetic field constraint.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Second release of the CoRe database of binary neutron star merger waveforms

Abstract We present the second data release of gravitational waveforms from binary neutron star (BNS) merger simulations performed by the Computational Relativity ( CoRe ) collaboration. The current database consists of 254 different BNS configurations and a total of 590 individual numerical-relativity simulations using various grid resolutions. The released waveform data contain the strain and the Weyl curvature multipoles up to ℓ = m = 4 . They span a significant portion of the mass, mass-ratio, spin and eccentricity parameter space and include targeted configurations to the events GW170817 and GW190425. CoRe simulations are performed with 18 different equations of state, seven of which are finite temperature models, and three of which account for non-hadronic degrees of freedom. About half of the released data are computed with high-order hydrodynamics schemes for tens of orbits to merger; the other half is computed with advanced microphysics. We showcase a standard waveform error analysis and discuss the accuracy of the database in terms of faithfulness. We present ready-to-use fitting formulas for equation of state-insensitive relations at merger (e.g. merger frequency), luminosity peak, and post-merger spectrum.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2013

Solving large scale structure in ten easy steps with COLA

We present the COmoving Lagrangian Acceleration (COLA) method: an N-body method for solving for Large Scale Structure (LSS) in a frame that is comoving with observers following trajectories calculated in Lagrangian Perturbation Theory (LPT). Unlike standard N-body methods, the COLA method can straightforwardly trade accuracy at small-scales in order to gain computational speed without sacrificing accuracy at large scales. This is especially useful for cheaply generating large ensembles of accurate mock halo catalogs required to study galaxy clustering and weak lensing, as those catalogs are essential for performing detailed error analysis for ongoing and future surveys of LSS. As an illustration, we ran a COLA-based N-body code on a box of size 100 Mpc/h with particles of mass ≈ 5 × 10{sup 9}M{sub s}un/h. Running the code with only 10 timesteps was sufficient to obtain an accurate description of halo statistics down to halo masses of at least 10{sup 11}M{sub s}un/h. This is only at a modest speed penalty when compared to mocks obtained with LPT. A standard detailed N-body run is orders of magnitude slower than our COLA-based code. The speed-up we obtain with COLA is due to the fact that we calculate the large-scale dynamics exactly using LPT, while letting the N-body code solve for the small scales, without requiring it to capture exactly the internal dynamics of halos. Achieving a similar level of accuracy in halo statistics without the COLA method requires at least 3 times more timesteps than when COLA is employed.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Least H 2 norm updating of quadratic interpolation models for derivative-free trust-region algorithms

One particular class of derivative-free optimization algorithms is trust-region algorithms based on quadratic models given by the under-determined interpolation. Different techniques in updating the quadratic model from iteration to iteration will give different interpolation models. We propose a new way to update the quadratic model by minimizing the $H^{2}$ norm of the difference between neighboring quadratic models. The motivation for applying the $H^{2}$ norm is given. The theoretical properties of our new updating technique are also presented. We propose the projection in the sense of $H^{2}$ norm and the interpolation error analysis of our model function. We obtain the coefficients of the quadratic model function using the Karush–Kuhn–Tucker (KKT) conditions. Numerical results show the advantages of our model on the test set considered, and the derivative-free algorithms based on our least $H^{2}$ norm updating quadratic model functions can solve test problems with fewer function evaluations than the algorithm based on the least Frobenius norm updating model and the other compared methods.

derivative-free optimization↗
DOE OSTI2026

Linear complexity

We present factorization and solution phases for a new linear complexity direct solver designed for concurrent batch operations on fine-grained parallel architectures, for matrices amenable to hierarchical representation. We focus on the strong-admissibility-based $\mathscr{H}^{2}$ format, where strong recursive skeletonization factorization compresses remote interactions. We build upon previous implementations of $\mathscr{H}^{2}$ matrix construction for efficient factorization and solution algorithm design, which are illustrated graphically in stepwise detail. The algorithms are ‘blackbox’ in the sense that the only inputs are the matrix and right-hand side, without analytical or geometrical information about the origin of the system. We demonstrate linear complexity scaling in both time and memory on four representative families of dense matrices up to one million in size. Parallel scaling up to 16 threads is enabled by a multi-level matrix graph coloring and avoidance of dynamic memory allocations thanks to prefix-sum memory management. An experimental backward error analysis is included. We break down the timings of different phases, identify phases that are memory-bandwidth limited, and discuss alternatives for phases that may be sensitive to the trend to employ lower precisions for performance.

Boukaram, Wajih↗
DOE OSTI2018

On the time growth of the error of the DG method for advective problems

Abstract In this paper we derive a priori $L^{\infty }(L^{2})$ and L2(L2) error estimates for a linear advection–reaction equation with inlet and outlet boundary conditions. The goal is to derive error estimates for the discontinuous Galerkin method that do not blow up exponentially with respect to time, unlike the usual case when Gronwall’s inequality is used. While this is possible in special cases, such as divergence-free advection fields, we take a more general approach using exponential scaling of the exact and discrete solutions. Here we use a special scaling function, which corresponds to time taken along individual pathlines of the flow. For advection fields, where the time that massless particles carried by the flow spend inside the spatial domain is uniformly bounded from above by some $\widehat{T}$, we derive $\mathcal{O}$(hp+1/2) error estimates where the constant factor depends only on $\widehat{T}$, but not on the final time T. This can be interpreted as applying Gronwall’s inequality in the error analysis along individual pathlines (Lagrangian setting), instead of physical time (Eulerian setting).

Mathematics↗
DOE OSTI2021

GAMA/DEVILS: constraining the cosmic star formation history from improved measurements of the 0.3–2.2 μm extragalactic background light

We present a revised measurement of the optical extragalactic background light (EBL), based on the contribution of resolved galaxies to the integrated galaxy light (IGL). The cosmic optical background radiation (COB), encodes the light generated by star formation, and provides a wealth of information about the cosmic star formation history (CSFH). We combine wide and deep galaxy number counts from the Galaxy And Mass Assembly survey (GAMA) and Deep Extragalactic VIsible Legacy Survey (DEVILS), along with the Hubble Space Telescope (HST) archive and other deep survey data sets, in nine multiwavelength filters to measure the COB in the range from 0.35 μm to 2.2 μm. We derive the luminosity density in each band independently and show good agreement with recent and complementary estimates of the optical-EBL from very high-energy (VHE) experiments. Our error analysis suggests that the IGL and γ-ray measurements are now fully consistent to within $\sim 10{{\ \rm per\ cent}}$, suggesting little need for any additional source of diffuse light beyond the known galaxy population. We use our revised IGL measurements to constrain the CSFH, and place amplitude constraints on a number of recent estimates. As a consistency check, we can now demonstrate convincingly, that the CSFH, stellar mass growth, and the optical-EBL provide a fully consistent picture of galaxy evolution. Here, we conclude that the peak of star formation rate lies in the range 0.066–0.076 M ⊙ yr -1 Mpc -3 at a lookback time of 9.1 to 10.9 Gyr.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Nuclear properties with semilocal momentum-space regularized chiral interactions beyond N 2 LO

We present a comprehensive investigation of few-nucleon systems as well as light and medium-mass nuclei up to A = 48 using the current Low Energy Nuclear Physics International Collaboration two-nucleon interactions in combination with the third-order (N 2 LO) three-nucleon forces. To address the systematic overbinding of nuclei starting from A ≈ 10 found in our earlier study utilizing the N 2 LO two- and three-nucleon forces, we take into account higher-order corrections to the two-nucleon potentials up through fifth order in chiral effective field theory. Here, the resulting Hamiltonian can be completely determined using the A = 3 binding energies and selected nucleon-deuteron cross sections as input. It is then shown to predict other nucleon-deuteron scattering observables and spectra of light p-shell nuclei, for which a detailed correlated truncation error analysis is performed, in agreement with experimental data. Moreover, the predicted ground state energies of nuclei in the oxygen isotopic chain from 14 O to 26 O as well as 40 Ca and 48 Ca show a remarkably good agreement with experimental values, given that the Hamiltonian is fixed completely from the A ≤ 3 data, once the fourth-order (N 3 LO) corrections to the two-nucleon interactions are taken into account. On the other hand, the charge radii are found to be underpredicted by ≈10% for the oxygen isotopes and by almost 20% for 40 Ca and 48 Ca.

20 ≤ A ≤ 38↗
DOE OSTI2021

Lattice determination of 𝐼=0 and 2 𝜋⁢𝜋 scattering phase shifts with a physical pion mass

Phase shifts for 𝑠-wave 𝜋⁢𝜋 scattering in both the 𝐼 =0 and 𝐼 =2 channels are determined from a lattice QCD calculation performed on 741 gauge configurations obeying G-parity boundary conditions with a physical pion mass and lattice size of 32 3 ×64. These results support our recent 2021 study of direct 𝐶⁢𝑃 violation in 𝐾 → 𝜋⁢𝜋 decay, improving our earlier 2015 calculation. The phase shifts are determined for both stationary and moving 𝜋⁢𝜋 systems, at three (𝐼 = 0) and four (𝐼 = 2) different total momenta. We implement several 𝜋⁢𝜋 interpolating operators including a scalar bilinear “𝜎” operator and paired single-pion bilinear operators with the constituent pions carrying various relative momenta. Several techniques, including correlated fitting and a bootstrap determination of p-values have been used to refine the results and a comparison with the generalized eigenvalue problem method is given. A detailed systematic error analysis is performed which allows phase shift results to be presented at a fixed energy.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Towards Quantum Computing Phase Diagrams of Gauge Theories with Thermal Pure Quantum States

The phase diagram of strong interactions in nature at finite temperature and chemical potential remains largely theoretically unexplored due to inadequacy of Monte-Carlo–based computational techniques in overcoming a sign problem. Quantum computing offers a sign-problem-free approach, but evaluating thermal expectation values is generally resource intensive on quantum computers. To facilitate thermodynamic studies of gauge theories, we propose a generalization of the thermal-pure-quantum-state formulation of statistical mechanics applied to constrained gauge-theory dynamics, and numerically demonstrate that the phase diagram of a simple low-dimensional gauge theory is robustly determined using this approach, including mapping a chiral phase transition in the model at finite temperature and chemical potential. Quantum algorithms, resource requirements, and algorithmic and hardware error analysis are further discussed to motivate future implementations. Thermal pure quantum states, therefore, may present a suitable candidate for efficient thermal simulations of gauge theories in the era of quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

The Number of Accumulated Photons and the Quality of Stimulated Emission Depletion Lifetime Images

Time binning is used to increase the number of photon counts in the peak channel of stimulated emission depletion (STED) fluorescence lifetime decay curves to determine how it affects the resulting lifetime image. The fluorescence lifetime of the fluorophore, Alexa Fluor 594 phalloidin, bound to F-actin is probed in cultured S2 cells at a spatial resolution of ~40 nm. This corresponds to a tenfold smaller probe volume compared to confocal imaging, and a reduced number of photons contributing to the signal. Pixel-by-pixel fluorescence lifetime measurements and error analysis show that an average of 40 ± 30 photon counts in the peak channel with a signal-to-noise ratio of 20 is enough to calculate a reliable fluorescence lifetime from a single exponential fluorescence decay. No heterogeneity in the actin cytoskeleton in different regions of the cultured cells was measured in the 40- to 400-nm spatial regime.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Ytterbium ion trap quantum computing: The current state-of-the-art

In this work, we present an overview of contemporary quantum computing with ytterbium ion traps, placing the emphasis on industry implementations. We provide brief, concrete descriptions of various key features, such as trap loading, electronic structure, qubit function, gates, error analysis, and benchmarking. We focus on the underlying science and current technologies to provide readers with a holistic picture of available techniques for using ytterbium in contemporary ion trap designs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Generic method for automatic bladder segmentation on cone beam CT using a patient-specific bladder shape model

Purpose: The aim of this study is to develop and validate a generic method for automatic bladder segmentation on cone beam computed tomography (CBCT), independent of gender and treatment position (prone or supine), using only pretreatment imaging data. Methods: Data of 20 patients, treated for tumors in the pelvic region with the entire bladder visible on CT and CBCT, were divided into four equally sized groups based on gender and treatment position. The full and empty bladder contour, that can be acquired with pretreatment CT imaging, were used to generate a patient-specific bladder shape model. This model was used to guide the segmentation process on CBCT. To obtain the bladder segmentation, the reference bladder contour was deformed iteratively by maximizing the cross-correlation between directional grey value gradients over the reference and CBCT bladder edge. To overcome incorrect segmentations caused by CBCT image artifacts, automatic adaptations were implemented. Moreover, locally incorrect segmentations could be adapted manually. After each adapted segmentation, the bladder shape model was expanded and new shape patterns were calculated for following segmentations. All available CBCTs were used to validate the segmentation algorithm. The bladder segmentations were validated by comparison with the manual delineations and the segmentation performance was quantified using the Dice similarity coefficient (DSC), surface distance error (SDE) and SD of contour-to-contour distances. Also, bladder volumes obtained by manual delineations and segmentations were compared using a Bland-Altman error analysis. Results: The mean DSC, mean SDE, and mean SD of contour-to-contour distances between segmentations and manual delineations were 0.87, 0.27 cm and 0.22 cm (female, prone), 0.85, 0.28 cm and 0.22 cm (female, supine), 0.89, 0.21 cm and 0.17 cm (male, supine) and 0.88, 0.23 cm and 0.17 cm (male, prone), respectively. Manual local adaptations improved the segmentation results significantly (p < 0.01) based on DSC (6.72%) and SD of contour-to-contour distances (0.08 cm) and decreased the 95% confidence intervals of the bladder volume differences. Moreover, expanding the shape model improved the segmentation results significantly (p < 0.01) based on DSC and SD of contour-to-contour distances. Conclusions: This patient-specific shape model based automatic bladder segmentation method on CBCT is accurate and generic. Our segmentation method only needs two pretreatment imaging data sets as prior knowledge, is independent of patient gender and patient treatment position and has the possibility to manually adapt the segmentation locally.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2014

SU-E-T-189: First Experimental Verification of the Accuracy of Absolute Dose Reconstruction From PET-CT Imaging of Yttrium 90 Microspheres

Purpose: In the past few years there have been numerous proposals for 3D dose reconstruction from the PET-CT imaging of patients undergoing radioembolization treatment of the liver with yttrium-90 microspheres. One of the most promising techniques uses convolution of the measured PET activity distribution with a pre-calculated Monte Carlo dose deposition kernel. The goal of the present study is to experimentally verify the accuracy of this method and to analyze the significance of various error sources. Methods: Optically stimulated luminescence detectors (OSLD) were used (NanoDot, Landauer) in this experiment. Two detectors were mounted on the central axis of a cylinder filled with water solution of yttrium-90 chloride. The total initial activity was 90mCi. The cylinder was inserted in a larger water phantom and scanned on a Siemens Biograph 16 Truepoint PET-CT scanner. Scans were performed daily over a period of 20 days to build a calibration curve for the measured absolute activity spanning 7 yttrium-90 half-lives. The OSLDs were mounted in the phantom for a predetermined period of time in order to record 2Gy dose. The measured dose was then compared to the dose reconstructed from the activity density at the location of each dosimeter. Results: Thorough error analysis of the dose reconstruction algorithm takes into account the uncertainties in the absolute PET activity, branching ratios, and nonlinearity of the calibration curve. The measured dose for 105-minute exposure on day 10 of the experiment was 219(11)cGy, while the reconstructed dose at the location of the detector was 215(47)cGy. Conclusion: We present the first experimental verification of the accuracy of the convolution algorithm for absolute dose reconstruction of yttrium-90 microspheres. The excellent agreement between the measured and calculated point doses will encourage the broad clinical adoption of the convolution-based dose reconstruction algorithm, making future quantitative dose/outcome studies possible.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2020

SNS: A Solution-Based Nonlinear Subspace Method for Time-Dependent Model Order Reduction

Several reduced order models have been successfully developed for nonlinear dynamical systems. To achieve a considerable speed-up, a hyper-reduction step is needed to reduce the computational complexity due to nonlinear terms. Many hyper-reduction techniques require the construction of nonlinear term basis, which introduces a computationally expensive offline phase. A novel way of constructing nonlinear term basis within the hyper-reduction process is introduced. In contrast to the traditional hyper-reduction techniques where the collection of nonlinear term snapshots is required, the SNS method avoids collecting the nonlinear term snapshots. Instead, it uses the solution snapshots that are used for building a solution basis, which enables avoiding an extra data compression of nonlinear term snapshots. As a result, the SNS method provides a more efficient offline strategy than the traditional model order reduction techniques, such as the DEIM, GNAT, and ST-GNAT methods. The SNS method is theoretically justified by the conforming subspace condition and the subspace inclusion relation. It is useful for model order reduction of large-scale nonlinear dynamical problems to reduce the offline cost. It is especially useful for ST-GNAT that has shown promising results, such as a good accuracy with a considerable online speed-up for hyperbolic problems in a recent paper by Choi and Carlberg [SIAM J. Sci. Comput., 41 (2019), pp. A26--A58], because ST-GNAT involves an expensive offline cost related to collecting nonlinear term snapshots. Error analysis for the SNS method is presented. Numerical results support that the accuracy of the solution from the SNS method is comparable to the traditional methods and a considerable speed-up (i.e., a factor of two to a hundred) is achieved in the offline phase.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Fast Time-Stepping Strategy for Dynamical Systems Equipped with a Surrogate Model

Simulation of complex dynamical systems arising in many applications is computationally challenging due to their size and complexity. Model order reduction, machine learning, and other types of surrogate modeling techniques offer cheaper and simpler ways to describe the dynamics of these systems but are inexact and introduce additional approximation errors. In order to overcome the computational difficulties of the full complex models, on one hand, and the limitations of surrogate models, on the other, this work proposes a new accelerated time-stepping strategy that combines information from both. This approach is based on the multirate infinitesimal general-structure additive Runge--Kutta framework. The inexpensive surrogate model is integrated with a small time step to guide the solution trajectory, and the full model is treated with a large time step to occasionally correct for the surrogate model error and ensure convergence. Here, we provide a theoretical error analysis, and several numerical experiments, to show that this approach can be significantly more efficient than using only the full or only the surrogate model for the integration.

Surrogate models↗
DOE OSTI2024

Parallel Randomized Tucker Decomposition Algorithms

The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. Here, we propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two algorithms that scale to large data and many processors, significantly reduce both computation and communication cost compared to previous deterministic and randomized approaches, and obtain nearly the same approximation errors. The key idea in our algorithms is to perform randomized sketches with Kronecker-structured random matrices, which reduces computation compared to unstructured matrices and can be implemented using a fundamental tensor computational kernel. We provide probabilistic error analysis of our algorithms and implement a new parallel algorithm for the structured randomized sketch. Our experimental results demonstrate that our combination of randomization and parallelization achieves accurate Tucker decompositions much faster than alternative approaches. We observe up to a 16X speedup over the fastest deterministic parallel implementation on 3D simulation data.

Tucker decompositions↗
DOE OSTI2019

Considerations on the design of a rare isotope beam facility based on superconducting heavy ion linacs

To establish an accelerator facility based on superconducting linear accelerator (linac) for nuclear and applied sciences in Korea, the rare isotope science project started in December 2011 under the auspices of the Institute for Basic Science (IBS). The layout of the facility has been mostly frozen since 2013 and civil construction began in 2016. On the other hand, an alternative linac design option was recently investigated in collaboration with the linac development group of Argonne National Lab in search of a further optimized configuration. A new linac lattice was developed and evaluated against realistic machine errors using TRACK. The beam optics simulations and error analysis then proved the soundness of this alternative design. In addition, beam optics of the injector was studied for simultaneous acceleration of both stable and rare isotope beams with the use of an electron beam ion source (EBIS). Additionally considered are alternative options of high-power cyclotrons as ISOL driver in order to enhance the capability of rare isotope beam production and fully exploit the superconducting linac facility built at high cost.

07 ISOTOPE AND RADIATION SOURCES↗