Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error estimation”

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 883 records · Page 49

Analysis of the weighted shifted boundary method for the Poisson and Stokes problems

The Shifted Boundary Method (SBM) belongs to the class of unfitted (or immersed, or embedded) finite element methods, and relies on reformulating the original boundary value problem over a surrogate (approximate) computational domain. Accuracy is maintained by properly shifting the location and values of the boundary conditions. This avoids integration over cut cells and the associated implementation issues. Recently, the Weighted SBM (WSBM) was proposed for the Navier-Stokes equations with free surfaces and the Stokes flow with moving boundaries. The attribute “weighted” in the name WSBM stems from the fact that its variational form is weighted with the elemental volume fraction of active fluid. The motivation for the development of the WSBM was the preservation of the volume of active fluid to a higher degree of accuracy, which in turn resulted in improved stability and robustness characteristics in moving-boundary, time-dependent simulations. In this article, we present the numerical analysis of the WSBM formulations for the Poisson and Stokes problems. We give mathematical conditions under which the bilinear forms defining the discrete variational formulations are uniformly coercive (Poisson problem) or inf-sup stable (Stokes problem). By these results, stability and optimal convergence is proven in the natural norm; L2-error estimates can also be derived.

Approximate domain boundaries↗

A Leap-Frog Discontinuous Galerkin Method for the Time-Domain Maxwell's Equations in Metamaterials

Numerical simulation of metamaterials play a very important role in the design of invisibility cloak, and sub-wavelength imaging. In this paper, we propose a leap-frog discontinuous Galerkin method to solve the time-dependent Maxwell’s equations in metamaterials. Conditional stability and error estimates are proved for the scheme. The proposed algorithm is implemented and numerical results supporting the analysis are provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A phase-based interior penalty discontinuous Galerkin method for the Helmholtz equation with spatially varying wavenumber

This paper is concerned with an interior penalty discontinuous Galerkin (IPDG) method based on a flexible type of non-polynomial local approximation space for the Helmholtz equation with varying wavenumber. The local approximation space consists of multiple polynomial-modulated phase functions which can be chosen according to the phase information of the solution. We obtain some approximation properties for this space and a priori L 2 error estimates for the h-convergence of the IPDG method using duality argument. We also provide ample numerical examples to show that, building phase information into the local spaces often gives more accurate results comparing to using the standard polynomial spaces.

42 ENGINEERING↗

An adaptive local reduced basis method for solving PDEs with uncertain inputs and evaluating risk

Many physical systems are modeled using partial differential equations (PDEs) with uncertain or random inputs. For such systems, naively propagating a fixed number of samples of the input probability law (or an approximation thereof) through the PDE is often inadequate to accurately quantify the "risk" associated with critical system responses. In this paper, we develop a goal-oriented, adaptive sampling and local reduced basis approximation for PDEs with random inputs. Our method determines a set of samples and an associated (implicit) Voronoi partition of the parameter domain on which we build local reduced basis approximations of the PDE solution. The samples are selected in an adaptive manner using an a posteriori error indicator. A notable advantage of the proposed approach is that the computational cost of the approximation during the adaptive process remains constant. We provide theoretical error bounds for our approximation and numerically demonstrate the performance of our method when compared to widely used adaptive sparse grid techniques. In addition, we tailor our approach to accurately quantify the risk of quantities of interest that depend on the PDE solution. We demonstrate our method on an advection-diffusion example and a Helmholtz example. Keywords: stochastic partial differential equation, adaptive sampling, reduced basis, a posteriori error estimation, coherent risk measure, conditional value-at-risk.

42 ENGINEERING↗

An embedded variable step IMEX scheme for the incompressible Navier–Stokes equations

This report presents a series of implicit–explicit (IMEX) variable stepsize algorithms for the incompressible Navier–Stokes equations (NSE). Here, IMEX means the nonlinear term is treated fully explicitly while the remaining terms are treated implicitly. With the advent of new computer architectures there has been growing demand for low memory solvers of this type. The addition of time adaptivity improves the accuracy and greatly enhances the efficiency of the algorithm. We prove energy stability of an embedded first–second order IMEX pair. For the first order member of the pair, we prove stability for variable stepsizes, and analyze convergence. We believe this to be the first proof of this type for a variable stepsize IMEX scheme for the incompressible NSE. We then define and test a variable stepsize, variable order IMEX scheme using these methods. Our work contributes several firsts for IMEX NSE schemes, including an energy argument and error analysis of a two-step, variable stepsize method, and embedded error estimation for an IMEX multi-step method.

42 ENGINEERING↗

A comprehensive and fair comparison of two neural operators (with practical extensions) based on $\mathrm{FAIR}$ data

Neural operators can learn nonlinear mappings between function spaces and offer a new simulation paradigm for real-time prediction of complex dynamics for realistic diverse applications as well as for system identification in science and engineering. Herein, we investigate the performance of two neural operators, which have shown promising results so far, and we develop new practical extensions that will make them more accurate and robust and importantly more suitable for industrial-complexity applications. The first neural operator, DeepONet, was published in 2019 (Lu et al., 2019), and its original architecture was based on the universal approximation theorem of Chen & Chen (1995). The second one, named Fourier Neural Operator or FNO, was published in 2020, and it is based on parameterizing the integral kernel in the Fourier space. DeepONet is represented by a summation of products of neural networks (NNs), corresponding to the branch NN for the input function and the trunk NN for the output function; both NNs are general architectures, e.g., the branch NN can be replaced with a CNN or a ResNet. According to Kovachki et al. (2021), FNO in its continuous form can be viewed conceptually as a DeepONet with a specific architecture of the branch NN and a trunk NN represented by a trigonometric basis. In order to compare FNO with DeepONet computationally for realistic setups, we develop several extensions of FNO that can deal with complex geometric domains as well as mappings where the input and output function spaces are of different dimensions. We also develop an extended DeepONet with special features that provide inductive bias and accelerate training, and we present a faster implementation of DeepONet with cost comparable to the computational cost of FNO, which is based on the Fast Fourier Transform. Here we consider 16 different benchmarks to demonstrate the relative performance of the two neural operators, including instability wave analysis in hypersonic boundary layers, prediction of the vorticity field of a flapping airfoil, porous media simulations in complex-geometry domains, etc. We follow the guiding principles of FAIR (Findability, Accessibility, Interoperability, and Reusability) for scientific data management and stewardship. The performance of DeepONet and FNO is comparable for relatively simple settings, but for complex geometries the performance of FNO deteriorates greatly. We also compare theoretically the two neural operators and obtain similar error estimates for DeepONet and FNO under the same regularity assumptions.

42 ENGINEERING↗

A fast and accurate domain decomposition nonlinear manifold reduced order model

Here, this paper integrates nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD). NM ROMs approximate the full order model (FOM) state in a nonlinear-manifold by training a shallow, sparse autoencoder using FOM snapshot data. These NM-ROMs can be advantageous over linear-subspace ROMs (LS-ROMs) for problems with slowly decaying Kolmogorov n-width. However, the number of NM-ROM parameters that need to be trained scales with the size of the FOM. Moreover, for “extreme-scale” problems, the storage of high-dimensional FOM snapshots alone can make ROM training expensive. To alleviate the training cost, this paper applies DD to the FOM, computes NM-ROMs on each subdomain, and couples them to obtain a global NM-ROM. This approach has several advantages: Subdomain NM-ROMs can be trained in parallel, involve fewer parameters to be trained than global NM-ROMs, require smaller subdomain FOM dimensional training data, and can be tailored to subdomain specific features of the FOM. The shallow, sparse architecture of the autoencoder used in each subdomain NM-ROM allows application of hyper-reduction (HR), reducing the complexity caused by nonlinearity and yielding computational speedup of the NM-ROM. This paper provides the first application of NM-ROM (with HR) to a DD problem. In particular, this paper details an algebraic DD reformulation of the FOM, training a NM-ROM with HR for each sub domain, and a sequential quadratic programming (SQP) solver to evaluate the coupled global NM-ROM. Theoretical convergence results for the SQP method and a priori and a posteriori error estimates for the DD NM-ROM with HR are provided. The proposed DD NM-ROM with HR approach is numerically compared to a DD LS-ROM with HR on the 2D steady-state Burgers’ equation, showing an order of magnitude improvement in accuracy of the proposed DD NM-ROM over the DD LS-ROM.

97 MATHEMATICS AND COMPUTING↗

Data-driven reduced-order models for port-Hamiltonian systems with operator inference

Hamiltonian operator inference has been developed in Sharma et al. (2022) to learn structure-preserving reduced-order models (ROMs) for Hamiltonian systems. The method constructs a low-dimensional model using only data and knowledge of the functional form of the Hamiltonian. The resulting ROMs preserve the intrinsic structure of the system, ensuring that the mechanical and physical properties of the system are maintained. In this work, we extend this approach to port-Hamiltonian systems, which generalize Hamiltonian systems by including energy dissipation, external input, and output. Based on snapshots of the system’s state and output, together with the information about the functional form of the Hamiltonian, reduced operators are inferred through optimization and are then used to construct data-driven ROMs. To further alleviate the complexity of evaluating nonlinear terms in the ROMs, a hyper-reduction method via discrete empirical interpolation is applied. Accordingly, we derive error estimates for the ROM approximations of the state and output. Lastly, we demonstrate the structure preservation, as well as the accuracy of the proposed port-Hamiltonian operator inference framework, through numerical experiments on a linear mass–spring-damper problem and a nonlinear Toda lattice problem.

97 MATHEMATICS AND COMPUTING↗

Simulation-driven optimization of high-order meshes in ALE hydrodynamics

Here we propose tools for high-order mesh optimization and demonstrate their benefits in the context of multi-material Arbitrary Lagrangian-Eulerian (ALE) compressible shock hydrodynamic applications. The mesh optimization process is driven by information provided by the simulation which uses the optimized mesh, such as shock positions, material regions, known error estimates, etc. These simulation features are usually represented discretely, for instance, as finite element functions on the Lagrangian mesh. The discrete nature of the input is critical for the practical applicability of the algorithms we propose and distinguishes this work from approaches that strictly require analytical information. Our methods are based on node movement through a high-order extension of the Target-Matrix Optimization Paradigm (TMOP). The proposed formulation is fully algebraic and relies only on local Jacobian matrices, so it is applicable to all types of mesh elements, in 2D and 3D, and any order of the mesh. We discuss the notions of constructing adaptive target matrices and obtaining their derivatives, reconstructing discrete data in intermediate meshes, node limiting that enables improvement of global mesh quality while preserving space-dependent local mesh features, and appropriate normalization of the objective function. The adaptivity methods are combined with automatic ALE triggers that can provide robustness of the mesh evolution and avoid excessive remap procedures. The benefits of the new high-order TMOP technology are illustrated on several simulations performed in the high-order ALE application BLAST.

97 MATHEMATICS AND COMPUTING↗

Revisiting a minimally destructive analytic approach for determining electrochemical kinetic parameters: Measuring aluminum corrosion across a wide pH range based on the Butler-Volmer equation

Here, this study revisits the three-point sampling of the simplified Butler-Volmer equation to address the limitations of strong potentiodynamic polarization, which can introduce irreversible damage and uncertainty in corrosion analysis. The method extracts electrochemical kinetic parameters while minimizing polarization effects, evaluates noise sensitivity relative to overpotential, and accounts for errors from signal noise, OCP drift, ohmic resistance, and mass-transfer constraints. Verified against the Tafel extrapolation method for aluminum corrosion across a wide pH range, this low-polarization approach enables accurate evaluations with specific error estimates, offering a robust alternative to linear polarization resistance methods that assume constant Tafel slopes.

36 MATERIALS SCIENCE↗

Magnus method for electronic structure calculations at extreme conditions

We present the application of Magnus based methods to the solution of first order coupled ordinary differential equations in High Energy Density (HED) physics applications. Our focus is on the application to quantum mechanical methods, specifically on the solution of the radial Dirac equation for real and complex energies. HED applications require accurate solutions across a wide range of spatial and energy domains, including regimes where the solutions exhibit pronounced oscillatory behavior. Such cases pose significant computational challenges. We demonstrate that Magnus-based integrators can efficiently and accurately address these challenges. We discuss the implementation of the Magnus method for the solution of the radial Dirac equation, including practical considerations such as the evaluation of matrix exponentials, numerical integration, error estimation, and adaptive step size control. We also discuss the application of these methods to complex energy Green’s function techniques and the efficient approximation of integrals of the solutions relevant to HED electronic structure calculations. Here, we demonstrate the accuracy and robustness of the resulting method in applications to the free-particle case, for which analytic solutions are available for comparison, as well as the challenging case of gold at HED conditions.

general physics↗

Tumor, Lymph Node, and Lymph Node-to-Tumor Displacements Over a Radiotherapy Series: Analysis of Interfraction and Intrafraction Variations Using Active Breathing Control (ABC) in Lung Cancer

Purpose: To estimate errors in soft tissue-based image guidance due to relative changes between primary tumor (PT) and affected lymph node (LN) position and volume, and to compare the results with bony anatomy-based displacements of PTs and LNs during radiotherapy of lung cancer. Methods and Materials: Weekly repeated breath-hold computed tomography scans were acquired in 17 lung cancer patients undergoing radiotherapy. PTs and affected LNs were manually contoured on all scans after rigid registration. Interfraction and intrafraction displacements in the centers of mass of PTs and LNs relative to bone, as well as LNs relative to PTs (LN-PT), were calculated. Results: The mean volume after 5 weeks was 65% for PTs and 63% for LNs. Systematic and random interfraction displacements were 2.6 to 4.6 mm and 2.7 to 2.9 mm, respectively, for PTs; 2.4 to 3.8 mm and 1.4 to 2.7 mm, respectively, for LNs; and 2.3 to 3.9 mm and 1.9 to 2.8 mm, respectively, for LN-PT. Systematic and random intrafraction displacements were less than 1 mm except in the superoinferior direction. Interfraction LN-PT displacements greater than 3 mm were observed in 67% of fractions and require a safety margin of 12 mm in the lateral direction, 11 mm in the anteroposterior direction, and 9 mm in the superoinferior direction. LN-PT displacements displayed significant time trends (p < 0.0001) and depended on the presence of pathoanatomic conditions of the ipsilateral lung, such as atelectasis. Conclusion: Interfraction LN-PT displacements were mostly systematic and comparable to bony anatomy-based displacements of PTs or LNs alone. Time trends, large volume changes, and the influence of pathoanatomic conditions underline the importance of soft tissue-based image guidance and the potential of plan adaptation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Higher-order adaptive finite-element methods for orbital-free density functional theory

In the present work, we study various numerical aspects of higher-order finite-element discretizations of the non-linear saddle-point formulation of orbital-free density-functional theory. We first investigate the robustness of viable solution schemes by analyzing the solvability conditions of the discrete problem. We find that a staggered solution procedure where the potential fields are computed consistently for every trial electron-density is a robust solution procedure for higher-order finite-element discretizations. We next study the convergence properties of higher-order finite-element discretizations of orbital-free density functional theory by considering benchmark problems that include calculations involving both pseudopotential as well as Coulomb singular potential fields. Our numerical studies suggest close to optimal rates of convergence on all benchmark problems for various orders of finite-element approximations considered in the present study. We finally investigate the computational efficiency afforded by various higher-order finite-element discretizations, which constitutes the main aspect of the present work, by measuring the CPU time for the solution of discrete equations on benchmark problems that include large Aluminum clusters. In these studies, we use mesh coarse-graining rates that are derived from error estimates and an a priori knowledge of the asymptotic solution of the far-field electronic fields. Our studies reveal a significant 100-1000 fold computational savings afforded by the use of higher-order finite-element discretization, alongside providing the desired chemical accuracy. We consider this study as a step towards developing a robust and computationally efficient discretization of electronic structure calculations using the finite-element basis.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

An analytical particle mover for the charge- and energy-conserving, nonlinearly implicit, electrostatic particle-in-cell algorithm

We propose a 1D analytical particle mover for the recent charge- and energy-conserving electrostatic particle-in-cell (PIC) algorithm in Ref. [G. Chen, L. Chacón, D.C. Barnes, An energy- and charge-conserving, implicit, electrostatic particle-in-cell algorithm, Journal of Computational Physics 230 (2011) 7018–7036]. The approach computes particle orbits exactly for a given piece-wise linear electric field. The resulting PIC algorithm maintains the exact charge and energy conservation properties of the original algorithm, but with improved performance (both in efficiency and robustness against the number of particles and timestep). We demonstrate the advantageous properties of the scheme with a challenging multiscale numerical test case, the ion acoustic wave. Using the analytical mover as a reference, we demonstrate that the choice of error estimator in the Crank–Nicolson mover has significant impact on the overall performance of the implicit PIC algorithm. The generalization of the approach to the multi-dimensional case is outlined, based on a novel and simple charge conserving interpolation scheme.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A novel adaptive time stepping variant of the Boris–Buneman integrator for the simulation of particle accelerators with space charge

We show that adaptive time stepping in particle accelerator simulation is an enhancement for certain problems. The new algorithm has been implemented in the OPAL (Object Oriented Parallel Accelerator Library) framework. The idea is to adjust the frequency of costly self-field calculations, which are needed to model Coulomb interaction (space charge) effects. In analogy to a Kepler orbit simulation that requires a higher time step resolution at the close encounter, we propose to choose the time step based on the magnitude of the space charge forces. Inspired by geometric integration techniques, our algorithm chooses the time step proportional to a function of the current phase space state instead of calculating a local error estimate like a conventional adaptive procedure. Building on recent work, a more profound argument is given on how exactly the time step should be chosen. An intermediate algorithm, initially built to allow a clearer analysis by introducing separate time steps for external field and self-field integration, turned out to be useful by its own, for a large class of problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A penalization technique to model plasma facing components in a tokamak with temperature variations

To properly address turbulent transport in the edge plasma region of a tokamak, it is mandatory to describe the particle and heat outflow on wall components, using an accurate representation of the wall geometry. This is challenging for many plasma transport codes, which use a structured mesh with one coordinate aligned with magnetic surfaces. We propose here a penalization technique that allows modeling of particle and heat transport using such structured mesh, while also accounting for geometrically complex plasma-facing components. Solid obstacles are considered as particle and momentum sinks whereas ionic and electronic temperature gradients are imposed on both sides of the obstacles along the magnetic field direction using delta functions (Dirac). Solutions exhibit plasma velocities (M=1) and temperatures fluxes at the plasma–wall boundaries that match with boundary conditions usually implemented in fluid codes. Grid convergence and error estimates are found to be in agreement with theoretical results obtained for neutral fluid conservation equations. The capability of the penalization technique is illustrated by introducing the non-collisional plasma region expected by the kinetic theory in the immediate vicinity of the interface, that is impossible when considering fluid boundary conditions. Axisymmetric numerical simulations show the efficiency of the method to investigate the large-scale transport at the plasma edge including the separatrix and in realistic complex geometries while keeping a simple structured grid.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Implicit filtered P{sub N} for high-energy density thermal radiation transport using discontinuous Galerkin finite elements

In this work, we provide a fully-implicit implementation of the time-dependent, filtered spherical harmonics (FP{sub N}) equations for non-linear, thermal radiative transfer. We investigate local filtering strategies and analyze the effect of the filter on the conditioning of the system, showing in particular that the filter improves the convergence properties of the iterative solver. We also investigate numerically the rigorous error estimates derived in the linear setting, to determine whether they hold also for the non-linear case. Finally, we simulate a standard test problem on an unstructured mesh and make comparisons with implicit Monte Carlo (IMC) calculations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A new weak Galerkin finite element method for elliptic interface problems

We introduce and analyze a new weak Galerkin (WG) finite element method in this paper for solving second order elliptic equations with discontinuous coefficients and interfaces. Comparing with the existing WG algorithm for solving the same type problems, the present WG method has a simpler variational formulation and fewer unknowns. Moreover, the new WG algorithm allows the use of finite element partitions consisting of general polytopal meshes and can be easily generalized to high orders. Optimal order error estimates in both H1 and L2 norms are established for the present WG finite element solutions. We conducted extensive numerical experiments in order to examine the accuracy, flexibility, and robustness of the proposed WG interface approach. In solving regular elliptic interface problems, high order convergences are numerically confirmed by using piecewise polynomial basis functions of high degrees. Moreover, the WG method is shown to be able to accommodate very complicated interfaces, due to its flexibility in choosing finite element partitions. Finally, in dealing with challenging problems with low regularities, the piecewise linear WG method is capable of delivering a second order of accuracy in L∞ norm for both C1 and H2 continuous solutions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗