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

TU-E-BRB-03: Overview of Proposed TG-132 Recommendations

Deformable image registration (DIR) is developing rapidly and is poised to substantially improve dose fusion accuracy for adaptive and retreatment planning and motion management and PET fusion to enhance contour delineation for treatment planning. However, DIR dose warping accuracy is difficult to quantify, in general, and particularly difficult to do so on a patient-specific basis. As clinical DIR options become more widely available, there is an increased need to understand the implications of incorporating DIR into clinical workflow. Several groups have assessed DIR accuracy in clinically relevant scenarios, but no comprehensive review material is yet available. This session will also discuss aspects of the AAPM Task Group 132 on the Use of Image Registration and Data Fusion Algorithms and Techniques in Radiotherapy Treatment Planning official report, which provides recommendations for DIR clinical use. We will summarize and compare various commercial DIR software options, outline successful clinical techniques, show specific examples with discussion of appropriate and inappropriate applications of DIR, discuss the clinical implications of DIR, provide an overview of current DIR error analysis research, review QA options and research phantom development and present TG-132 recommendations. Learning Objectives: Compare/contrast commercial DIR software and QA options Overview clinical DIR workflow for retreatment To understand uncertainties introduced by DIR Review TG-132 proposed recommendations.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

Convergence of Weak-SINDy Surrogate Models

In this paper, we give an in-depth error analysis for surrogate models generated by a variant of the Sparse Identification of Nonlinear Dynamics (SINDy) method. We start with an overview of a variety of nonlinear system identification techniques, namely SINDy, weak-SINDy, and the occupation kernel method. Under the assumption that the dynamics are a finite linear combination of a set of basis functions, these methods establish a linear system to recover coefficients. We illuminate the structural similarities between these techniques and establish a projection property for the weak-SINDy technique. Following the overview, we analyze the error of surrogate models generated by a simplified version of weak-SINDy. In particular, under the assumption of boundedness of a composition operator given by the solution, we show that (i) the surrogate dynamics converges towards the true dynamics and (ii) the solution of the surrogate model is reasonably close to the true solution. Finally, as an application, we discuss the use of a combination of weak-SINDy surrogate modeling and proper orthogonal decomposition (POD) to build a surrogate model for partial differential equations (PDEs).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Uniform convergence of an upwind discontinuous Galerkin method for solving scaled discrete-ordinate radiative transfer equations with isotropic scattering

Here we present an error analysis for the discontinuous Galerkin (DG) method applied to the discrete-ordinate discretization of the steady-state radiative transfer equation with isotropic scattering. Under some mild assumptions, we show that the DG method converges uniformly with respect to a scaling parameter which characterizes the strength of scattering in the system. However, the rate is not optimal and can be polluted by the presence of boundary layers. In one-dimensional slab geometries, we demonstrate optimal convergence when boundary layers are not present and analyze a simple strategy for balance interior and boundary layer errors. Some numerical tests are also provided in this reduced setting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Developing A Custom-Built Metal Aerosol Processing Chamber: Analysis of Aerosol Coagulation at Low Humidities

We have developed an intermediate size (906 L) aerosol processing chamber, and this work reports on the design and initial characterization of dry aerosol experiments. Specifically, we are determining wall-loss and coagulation correction factors using the observed size distribution measurements for surrogates of common aerosol classes: sodium chloride, sucrose, and biomass burning aerosol smoke. Results show that, on average, sodium chloride, sucrose, and smoke wall-loss rates converge to similar values on relatively short time scales (< 1 h). The fitted coagulation correction factor, W C -1 , for smoke particles (1.23 ± 0.312), indicates that on average they adhere to each other more than sodium chloride (0.969 ± 0.524) and sucrose (1.16 ± 1.38). The relative uncertainty is high for the coagulation correction, but it is consistent with our Monte Carlo error analysis. This study lays the foundation for future experiments at elevated humidity and supersaturation conditions to characterize the influence of particle shape on coagulation and cloud parameters.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Design of a High Flux Beam Characterization Device for Falling Particle Receivers

This paper outlines the design and error analysis for a flux characterization device (i.e. flux wand) which traverses the aperture of a falling particle receiver cavity providing the incident power measurement needed for the calculation of receiver efficiency without significantly disrupting receiver output. The design features a linear actuator, water cooled extension arm, and refractory bar. The refractory bar/flux wand is a diffusely reflective surface which reflects light as it is translated across the receiver aperture to provide a light intensity distribution that is correlated to a measured flux. The component sizing, constrained by a typical 30 frame per second camera and a 4-point average of the measured reflectance, is presented. Simulation reveals the error that results from a 5% variation in flux wand reflectance is within 4% of the true value.

Schroeder, Nathan↗
DOE OSTI2022

RUScal : Software for the analysis of resonant ultrasound spectroscopy measurements

Resonant ultrasound spectroscopy is used to nondestructively measure the elastic resonances of small solids to elucidate the material's elastic properties or other qualities like size, shape, or composition. In this work, we introduce the software RUScal for the purpose of determining elastic properties by analyzing the eigenfrequencies of solid specimens with common shapes, such as rectangular parallelepipeds, cylinders (solid and hollow tube), ellipsoids, and octahedrons, as well as irregularly shaped ellipsoids that can be described analytically. All symmetry classes are supported, from isotropic to triclinic, along with the option to add or remove up to three orthogonal mirror planes as well as the ability to reorient the crystal axes with respect the sample edges via Euler angles. Additional features include tools to help find initial sets of elastic constants, including grid exploration and Monte Carlo methods, a tool to analyze frequencies as a function of sample length or crystal orientation, an error analysis tool to assess fit quality, and formatting of the input and output files for batch fitting, e.g., as a function of temperature. This software was validated with published resonant ultrasound spectroscopy data for various materials, shapes, and symmetries with noted improvements in calculation time compared to finite element methods.

47 OTHER INSTRUMENTATION↗
DOE OSTI2019

Sequenceserver: A Modern Graphical User Interface for Custom BLAST Databases

Comparing newly obtained and previously known nucleotide and amino-acid sequences underpins modern biological research. BLAST is a well-established tool for such comparisons but is challenging to use on new data sets. We combined a user-centric design philosophy with sustainable software development approaches to create Sequenceserver, a tool for running BLAST and visually inspecting BLAST results for biological interpretation. Sequenceserver uses simple algorithms to prevent potential analysis errors and provides flexible text-based and visual outputs to support researcher productivity. Our software can be rapidly installed for use by individuals or on shared servers.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Data-driven linear time advance operators for the acceleration of plasma physics simulation

In this study, we demonstrate the application of data-driven linear operator construction for time advance with a goal of accelerating plasma physics simulation. We apply dynamic mode decomposition (DMD) to data produced by the nonlinear SOLPS-ITER (Scrape-off Layer Plasma Simulator - International Thermonuclear Experimental Reactor) plasma boundary code suite in order to estimate a series of linear operators and monitor their predictive accuracy via online error analysis. We find that this approach defines when these dynamics can be represented by a sequence of approximate linear operators and is essential for providing consistent projections when compared to an unconstrained application. For linear diffusion and advection–diffusion fluid test problems, we construct and apply operators within explicit and implicit time advance schemes, demonstrating that stability can be robustly guaranteed in each case. We further investigate the use of the linear time advance operators within several integration methods including forward Euler, backward Euler, and the matrix exponential. The application of this method to simulation data from SOLPS-ITER, with varying levels of Markov chain Monte Carlo numerical noise, shows that constrained DMD operators yield a capability to identify, extract, and integrate a (slow) subset of the present timescales. Example applications show that for projected speedup factors of [Formula: see text], and [Formula: see text], a mean relative error of 3%, 5%, and 8% and maximum relative error less than 20% are achievable, which appears acceptable for typical SOLPS-ITER steady-state simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

More buck-per-shot: Why learning trumps mitigation in noisy quantum sensing

Quantum sensing is one of the most promising applications for quantum technologies. However, reaching the ultimate sensitivities enabled by the laws of quantum mechanics can be a challenging task in realistic scenarios where noise is present. While several strategies have been proposed to deal with the detrimental effects of noise, these come at the cost of an extra shot budget. Given that shots are a precious resource for sensing – as infinite measurements could lead to infinite precision – care must be taken to truly guarantee that any shot not being used for sensing is actually leading to some metrological improvement. In this work, we study whether investing shots in error-mitigation, inference techniques, or combinations thereof, can improve the sensitivity of a noisy quantum sensor on a (shot) budget. We present a detailed bias–variance error analysis for various sensing protocols. Our results show that the costs of zero-noise extrapolation techniques outweigh their benefits. We also find that pre-characterizing a quantum sensor via inference techniques leads to the best performance, under the assumption that the sensor is sufficiently stable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Time-evolution methods for matrix-product states

Highlights: • Introductory review of time-evolution methods for matrix-product states. • Detailed description of five state-of-the-art algorithms. • Extended comparison of numerical examples. • Extended error analysis of each algorithm. • Pseudo-code examples towards an implementation where necessary. - Abstract: Matrix-product states have become the de facto standard for the representation of one-dimensional quantum many body states. During the last few years, numerous new methods have been introduced to evaluate the time evolution of a matrix-product state. Here, we will review and summarize the recent work on this topic as applied to finite quantum systems. We will explain and compare the different methods available to construct a time-evolved matrix-product state, namely the time-evolving block decimation, the MPO W{sup I,II} method, the global Krylov method, the local Krylov method and the one- and two-site time-dependent variational principle. We will also apply these methods to four different representative examples of current problem settings in condensed matter physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Robustness of the Ensemble Score Filter to the Type of Assimilated Observation Networks

Recent advances in data assimilation (DA) have focused on developing more flexible approaches that can better accommodate nonlinearities in models and observations. However, it remains unclear how the performance of these advanced methods depends on the observation network characteristics. In this study, we present initial experiments with the surface quasi‐geostrophic model, in which we compare a recently developed ensemble filter using score‐based diffusion models with the standard Local Ensemble Transform Kalman Filter (LETKF). Our results show that the analysis solutions respond differently to the number, spatial distribution, and nonlinear fraction of assimilated observations. We also find notable changes in the multiscale characteristics of the analysis errors. Given that standard DA techniques will eventually be replaced by more advanced methods, we hope this study sets the ground for future efforts to reassess the value of Earth observing systems in the context of newly emerging algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

A second-order ensemble method based on a blended backward differentiation formula timestepping scheme for time-dependent Navier-Stokes equations

Here, we present a second-order ensemble method based on a blended three-step backward differentiation formula (BDF) timestepping scheme to compute an ensemble of Navier–Stokes equations. Compared with the only existing second-order ensemble method that combines the two-step BDF timestepping scheme and a special explicit second-order Adams–Bashforth treatment of the advection term, this method is more accurate with nominal increase in computational cost. We give comprehensive stability and error analysis for the method. Numerical examples are also provided to verify theoretical results and demonstrate the improved accuracy of the method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Numerical methods for the inverse problem of density functional theory

Here, the inverse problem of Kohn–Sham density functional theory (DFT) is often solved in an effort to benchmark and design approximate exchange-correlation potentials. The forward and inverse problems of DFT rely on the same equations but the numerical methods for solving each problem are substantially different. We examine both problems in this tutorial with a special emphasis on the algorithms and error analysis needed for solving the inverse problem. Two inversion methods based on partial differential equation constrained optimization and constrained variational ideas are introduced. We compare and contrast several different inversion methods applied to one-dimensional finite and periodic model systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Interior energy error estimates for the weak Galerkin finite element method

Consider the Poisson equation in a polytopal domain ΩRC d (d=2,3) as the model problem. In this paper, we study interior energy error estimates for the weak Galerkin finite element approximation to elliptic boundary value problems. In particular, we show that the interior error in the energy norm is bounded by three components: the best local approximation error, the error in negative norms, and the trace error on the element boundaries. This implies that the interior convergence rate can be polluted by solution singularities on the domain boundary, even when the solution is smooth in the interior region. Numerical results are reported to support the theoretical findings. Lastly, to the best of our knowledge, this is the first local energy error analysis that applies to general meshes consisting of polytopal elements and hanging nodes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A posteriori error estimation and adaptivity in hp virtual elements

An explicit and computable error estimator for the hp version of the virtual element method (VEM), together with lower and upper bounds with respect to the exact energy error, is presented. Such error estimator is employed to provide, following the approach of Melenk and Wohlmuth (Adv Comput Math 15(1–4):311–331, 2001), hp adaptive mesh refinements for very general polygonal meshes. In addition, a novel VEM hp Clément quasi-interpolant, instrumental for the a posteriori error analysis, is introduced. The performances of the adaptive method are validated by a number of numerical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Efficient Quantum Gibbs Samplers with Kubo–Martin–Schwinger Detailed Balance Condition

Lindblad dynamics and other open-system dynamics provide a promising path towards efficient Gibbs sampling on quantum computers. In these proposals, the Lindbladian is obtained via an algorithmic construction akin to designing an artificial thermostat in classical Monte Carlo or molecular dynamics methods, rather than being treated as an approximation to weakly coupled system-bath unitary dynamics. Recently, Chen, Kastoryano, and Gilyén (arXiv:2311.09207) introduced the first efficiently implementable Lindbladian satisfying the Kubo–Martin–Schwinger (KMS) detailed balance condition, which ensures that the Gibbs state is a fixed point of the dynamics and is applicable to non-commuting Hamiltonians. This Gibbs sampler uses a continuously parameterized set of jump operators, and the energy resolution required for implementing each jump operator depends only logarithmically on the precision and the mixing time. In this work, we build upon the structural characterization of KMS detailed balanced Lindbladians by Fagnola and Umanità, and develop a family of efficient quantum Gibbs samplers using a finite set of jump operators (the number can be as few as one), akin to the classical Markov chain-based sampling algorithm. Compared to the existing works, our quantum Gibbs samplers have a comparable quantum simulation cost but with greater design flexibility and a much simpler implementation and error analysis. Moreover, it encompasses the construction of Chen, Kastoryano, and Gilyén as a special instance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Heterogeneous Mixtures of Dictionary Functions to Approximate Subspace Invariance in Koopman Operators: Why Deep Koopman Operators Work

Abstract Koopman operators model nonlinear dynamics as a linear dynamic system acting on a nonlinear function as the state. This nonstandard state is often called a Koopman observable and is usually approximated numerically by a superposition of functions drawn from a dictionary . In a widely used algorithm, extended dynamic mode decomposition (EDMD), the dictionary functions are drawn from a fixed class of functions. Deep learning combined with EDMD has been used to learn novel dictionary functions in an algorithm called deep dynamic mode decomposition (deepDMD). The learned representation both (1) accurately models and (2) scales well with the dimension of the original nonlinear system. In this paper, we analyze the learned dictionaries from deepDMD and explore the theoretical basis for their strong performance. We explore State-Inclusive Logistic Lifting (SILL) dictionary functions to approximate Koopman observables. Error analysis of these dictionary functions show they satisfy a property of subspace approximation, which we define as uniform finite approximate closure. Typically, a Koopman dictionary’s nonlinear functions are homogeneous. In this paper, we discover that structured mixing of heterogeneous dictionary functions drawn from different classes of nonlinear functions achieve the same accuracy and dimensional scaling as the deep-learning-based deepDMD algorithm Yeung et al. ( In: 2019 American Control Conference (ACC), 2019). We specifically show this by building a heterogeneous dictionary comprised of SILL functions and conjunctive radial basis functions (RBFs). This mixed dictionary achieves similar accuracy and dimensional scaling to deepDMD with an order of magnitude reduction in parameters, while maintaining geometric interpretability. These results strengthen the viability of dictionary-based Koopman models to solving high-dimensional nonlinear learning problems.

Johnson, Charles A.↗