Search NASA⌕ Search

SEARCH · Search NASA

Results for “A priori 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 19 records

A priori error analysis of high-order LL* (FOSLL*) finite element methods

A number of non-standard finite element methods have been proposed in recent years, each of which derives from a specific class of PDE-constrained norm minimization problems. The most notable examples are LL* methods. In this work, we argue that all high-order methods in this class should be expected to deliver substandard uniform h-refinement convergence rates. In fact, one may not even see rates proportional to the polynomial order p > 1 when the exact solution is a constant function. Here, we show that the convergence rate is limited by the regularity of an extraneous Lagrange multiplier variable which naturally appears via a saddle-point analysis. In turn, limited convergence rates appear because the regularity of this Lagrange multiplier is determined, in part, by the geometry of the domain. Numerical experiments support our conclusions.

97 MATHEMATICS AND COMPUTING↗

Domain decomposition and multiscale mortar mixed finite element methods for linear elasticity with weak stress symmetry

Two non-overlapping domain decomposition methods are presented for the mixed finite element formulation of linear elasticity with weakly enforced stress symmetry. The methods utilize either displacement or normal stress Lagrange multiplier to impose interface continuity of normal stress or displacement, respectively. By eliminating the interior subdomain variables, the global problem is reduced to an interface problem, which is then solved by an iterative procedure. The condition number of the resulting algebraic interface problem is analyzed for both methods. A multiscale mortar mixed finite element method for the problem of interest on non-matching multiblock grids is also studied. It uses a coarse scale mortar finite element space on the non-matching interfaces to approximate the trace of the displacement and impose weakly the continuity of normal stress. A priori error analysis is performed. It is shown that, with appropriate choice of the mortar space, optimal convergence on the fine scale is obtained for the stress, displacement, and rotation, as well as some superconvergence for the displacement. Computational results are presented in confirmation of the theory of all proposed methods.

Mathematics↗

A Mixed Discontinuous Galerkin Method for Linear Elasticity with Strongly Imposed Symmetry

In this paper, we study a mixed discontinuous Galerkin (MDG) method to solve linear elasticity problem with arbitrary order discontinuous finite element spaces in d -dimension ( \(d=2,3\) ). This method uses polynomials of degree \(k+1\) for the stress and of degree k for the displacement ( \(k\ge 0\) ). The mixed DG scheme is proved to be well-posed under proper norms. Specifically, we prove that, for any \(k \ge 0\) , the \(H(\mathrm{div})\) -like error estimate for the stress and \(L^2\) error estimate for the displacement are optimal. We further establish the optimal \(L^2\) error estimate for the stress provided that the \({\mathcal {P}}_{k+2}-{\mathcal {P}}_{k+1}^{-1}\) Stokes pair is stable and \(k \ge d\) . Finally, we also provide numerical results of MDG showing that the orders of convergence are actually sharp.

97 MATHEMATICS AND COMPUTING↗

The Adjoint Petrov–Galerkin method for non-linear model reduction

Here, we formulate a new projection-based reduced-order modeling technique for non-linear dynamical systems. The proposed technique, which we refer to as the Adjoint Petrov–Galerkin (APG) method, is derived by decomposing the generalized coordinates of a dynamical system into a resolved coarse-scale set and an unresolved fine-scale set. A Markovian finite memory assumption within the Mori–Zwanzig formalism is then used to develop a reduced-order representation of the coarse scales. This procedure leads to a closed reduced-order model that displays commonalities with the adjoint stabilization method used in finite elements. The formulation is shown to be equivalent to a Petrov–Galerkin method with a non-linear, time-varying test basis, thus sharing some similarities with the Least-Squares Petrov–Galerkin method. Theoretical analysis examining a priori error bounds and computational cost is presented. Numerical experiments on the compressible Navier–Stokes equations demonstrate that the proposed method can lead to improvements in numerical accuracy, robustness, and computational efficiency over the Galerkin method on problems of practical interest. Improvements in numerical accuracy and computational efficiency over the Least-Squares Petrov–Galerkin method are observed in most cases.

42 ENGINEERING↗

Prediction challenge: First principles simulation of the ultrafast electron diffraction spectrum of cyclobutanone

Computer simulation has long been an essential partner of ultrafast experiments, allowing the assignment of microscopic mechanistic detail to low-dimensional spectroscopic data. However, the ability of theory to make a priori predictions of ultrafast experimental results is relatively untested. Herein, as a part of a community challenge, we attempt to predict the signal of an upcoming ultrafast photochemical experiment using state-of-the-art theory in the context of preexisting experimental data. Specifically, we employ ab initio Ehrenfest with collapse to a block mixed quantum–classical simulations to describe the real-time evolution of the electrons and nuclei of cyclobutanone following excitation to the 3s Rydberg state. The gas-phase ultrafast electron diffraction (GUED) signal is simulated for direct comparison to an upcoming experiment at the Stanford Linear Accelerator Laboratory. Following initial ring-opening, dissociation via two distinct channels is observed: the C3 dissociation channel, producing cyclopropane and CO, and the C2 channel, producing CH2CO and C2H4. Direct calculations of the GUED signal indicate how the ring-opened intermediate, the C2 products, and the C3 products can be discriminated in the GUED signal. We also report an a priori analysis of anticipated errors in our predictions: without knowledge of the experimental result, which features of the spectrum do we feel confident we have predicted correctly, and which might we have wrong?

Chemistry↗

Crank–Nicolson WSGI difference scheme with finite element method for multi-dimensional time-fractional wave problem

In this article, a second-order Crank–Nicolson weighted and shifted Grünwald integral (WSGI) time-discrete scheme combined with finite element method is studied for finding the numerical solution of the multi-dimensional time-fractional wave equation. The time-fractional wave equation with Caputo-fractional derivative is transformed into the time-fractional integral equation by integral technique, then the second-order Crank–Nicolson finite element scheme with a time second-order WSGI discrete approximation for fractional integral is formulated. The analysis of stability is made, then a priori error estimate is given by making use of the conversion technique between the WSGI formula and fractional integral. At the end of the article, some numerical examples covering two two-dimensional cases with rectangular element and triangular element and a three-dimensional case with tetrahedral element are shown to test and verify our theoretical results.

97 MATHEMATICS AND COMPUTING↗

A New Modeling Approach for a Priori Uncertainties of Laser Tracker Angle Measurements

Methods for modeling the uncertainty in laser tracker angle measurements vary within the metrology industry, leading to confusion and questionable stochastic modeling for survey network adjustments and error propagation analysis. Interpreting the published laser tracker manufacturer performance specifications to determine an a priori sigma value for weighting azimuth and zenith angle measurements can be confusing and has led to differing implementations. Furthermore, this paper proposes a unique way to model survey network a priori laser tracker angular uncertainties based on laser tracker manufacturers’ published maximum permissible error (MPE) values referenced to current standards for weighting survey network measurements. This paper’s proposed model takes into account the disparate effects that pointing errors, target centering errors, and leveling errors have on azimuth and zenith angular uncertainties for measurements with steep sightings and at near ranges.

42 ENGINEERING↗

The NonConforming Virtual Element Method for the Stokes Equations

In this paper, we present the nonconforming virtual element method (VEM) for the numerical approximation of velocity and pressure in the steady Stokes problem. The pressure is approximated using discontinuous piecewise polynomials, while each component of the velocity is approximated using the nonconforming virtual element space. On each mesh element the local virtual space contains the space of polynomials of up to a given degree, plus suitable nonpolynomial functions. The virtual element functions are implicitly defined as the solution of local Poisson problems with polynomial Neumann boundary conditions. As typical in VEM approaches, the explicit evaluation of the non-polynomial functions is not required. This approach makes it possible to construct nonconforming (virtual) spaces for any polynomial degree regardless of the parity, for two- and three-dimensional problems, and for meshes with very general polygonal and polyhedral elements. We show that the nonconforming VEM is inf-sup stable and establish optimal a priori error estimates for the velocity and pressure approximations. Finally, numerical examples confirm the convergence analysis and the effectiveness of the method in providing high-order accurate approximations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-C-BRD-03: Closing the Loop On Virtual IMRT QA

Purpose: To develop an algorithm that predicts a priori IMRT QA passing rates. Methods: 416 IMRT plans from all treatment sites were planned in Eclipse version 11 and delivered using a dynamic sliding window technique on Clinac iX or TrueBeam linacs (Varian Medical Systems, Palo Alto, CA). The 3%/3mm and 2%/2mm local distance to agreement (DTA) were recorded during clinical operations using a commercial 2D diode array (MapCHECK 2, Sun Nuclear, Melbourne, FL). Each plan was characterized by 37 metrics that describe different failure modes between the calculated and measured dose. Machine-learning algorithms (MLAs) were trained to learn the relation between the plan characteristics and each passing rate. Minimization of the cross validated error, together with maximum a posteriori estimation (MAP), were used to choose the model parameters. Results: 3%/3mm local DTA can be predicted with an error smaller than 3% for 98% of the plans. For the remaining 2% of plans, the residual error was within 5%. For 2%/2mm local DTA passing rates, 96% percent of the plans were successfully predicted with an error smaller than 5%. All high-risk plans that failed the 2%/2mm local criteria were correctly identified by the algorithm. The most important metric to describe the passing rates was determined to be the MU per Gray (modulation factor). Conclusions: Logs files and independent dose calculations have been suggested as possible substitutes for measurement based IMRT QA. However, none of these methods answer the fundamental question of whether a plan can be delivered with a clinically acceptable error given the limitations of the linacs and the treatment planning system. Predicting the IMRT QA passing rates a priori closes that loop. For additional robustness, virtual IMRT QA can be combined with Linac QA and log file analysis to confirm appropriate delivery.

60 APPLIED LIFE SCIENCES↗

Exploiting Kronecker structure in exponential integrators: Fast approximation of the action of φ $-$functions of matrices via quadrature

Here, in this article, we propose an algorithm for approximating the action of φ $-$ functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum structure, which arise from problems admitting a tensor product representation. The method is based on quadrature approximations of the integral form of the φ $-$ functions combined with a scaling and modified squaring method. Owing to the Kronecker sum representation, only actions of 1D matrix exponentials are needed at each quadrature node and assembly of the full matrix can be avoided. Additionally, we derive a priori bounds for the quadrature error, which show that, as expected by classical theory, the rate of convergence of our method is supergeometric. Guided by our analysis, we construct a fast and robust method for estimating the optimal scaling factor and number of quadrature nodes that minimizes the total cost for a prescribed error tolerance. We investigate the performance of our algorithm by solving several linear and semilinear time-dependent problems in 2D and 3D. The results show that our method is accurate and orders of magnitude faster than the current state-of-the-art.

97 MATHEMATICS AND COMPUTING↗

Proton dose calculation on scatter-corrected CBCT image: Feasibility study for adaptive proton therapy

Purpose: To demonstrate the feasibility of proton dose calculation on scatter-corrected cone-beam computed tomographic (CBCT) images for the purpose of adaptive proton therapy. Methods: CBCT projection images were acquired from anthropomorphic phantoms and a prostate patient using an on-board imaging system of an Elekta infinity linear accelerator. Two previously introduced techniques were used to correct the scattered x-rays in the raw projection images: uniform scatter correction (CBCT{sub us}) and a priori CT-based scatter correction (CBCT{sub ap}). CBCT images were reconstructed using a standard FDK algorithm and GPU-based reconstruction toolkit. Soft tissue ROI-based HU shifting was used to improve HU accuracy of the uncorrected CBCT images and CBCT{sub us}, while no HU change was applied to the CBCT{sub ap}. The degree of equivalence of the corrected CBCT images with respect to the reference CT image (CT{sub ref}) was evaluated by using angular profiles of water equivalent path length (WEPL) and passively scattered proton treatment plans. The CBCT{sub ap} was further evaluated in more realistic scenarios such as rectal filling and weight loss to assess the effect of mismatched prior information on the corrected images. Results: The uncorrected CBCT and CBCT{sub us} images demonstrated substantial WEPL discrepancies (7.3 ± 5.3 mm and 11.1 ± 6.6 mm, respectively) with respect to the CT{sub ref}, while the CBCT{sub ap} images showed substantially reduced WEPL errors (2.4 ± 2.0 mm). Similarly, the CBCT{sub ap}-based treatment plans demonstrated a high pass rate (96.0% ± 2.5% in 2 mm/2% criteria) in a 3D gamma analysis. Conclusions: A priori CT-based scatter correction technique was shown to be promising for adaptive proton therapy, as it achieved equivalent proton dose distributions and water equivalent path lengths compared to those of a reference CT in a selection of anthropomorphic phantoms.

60 APPLIED LIFE SCIENCES↗

Data assimilation empowered neural network parametrizations for subgrid processes in geophysical flows

In the past couple of years, there has been a proliferation in the use of machine learning approaches to represent subgrid-scale processes in geophysical flows with an aim to improve the forecasting capability and to accelerate numerical simulations of these flows. Despite its success for different types of flow, the online deployment of a data-driven closure model can cause instabilities and biases in modeling the overall effect of subgrid-scale processes, which in turn leads to inaccurate prediction. To tackle this issue, we exploit the data assimilation technique to correct the physics-based model coupled with the neural network as a surrogate for unresolved flow dynamics in multiscale systems. In particular, we use a set of neural network architectures to learn the correlation between resolved flow variables and the parametrizations of unresolved flow dynamics and formulate a data assimilation approach to correct the hybrid model during their online deployment. We illustrate our framework in a set of applications of the multiscale Lorenz 96 system for which the parametrization model for unresolved scales is exactly known, and the two-dimensional Kraichnan turbulence system for which the parametrization model for unresolved scales is not known a priori. Our analysis, therefore, comprises a predictive dynamical core empowered by (i) a data-driven closure model for subgrid-scale processes, (ii) a data assimilation approach for forecast error correction, and (iii) both data-driven closure and data assimilation procedures. We show significant improvement in the long-term prediction of the underlying chaotic dynamics with our framework compared to using only neural network parametrizations for future prediction. Moreover, we demonstrate that these data-driven parametrization models can handle the non-Gaussian statistics of subgrid-scale processes, and effectively improve the accuracy of outer data assimilation workflow loops in a modular nonintrusive way.

42 ENGINEERING↗

Holographic phase retrieval and reference design

Here, a general mathematical framework and recovery algorithm is introduced for the holographic phase retrieval problem. In this problem, which arises in holographic coherent diffraction imaging, a 'reference' portion of the signal to be recovered via phase retrieval is a priori known from experimental design. A generic formula is additionally derived for the expected recovery error when the measurement data is corrupted by Poisson shot noise. This facilitates an optimization perspective towards reference design and analysis. We employ this optimization perspective towards quantifying the performance of various reference choices.

97 MATHEMATICS AND COMPUTING↗

Sensitivity and Uncertainty Analysis of Plutonium and Cesium Isotopes in Modeling of BR3 Reactor Spent Fuel

Nuclear forensics has a broad task to characterize recovered nuclear or radiological material and interpret the results of investigation. One approach to isotopic characterization of nuclear material obtained from a reactor is to chemically separate and perform isotopic measurements on the sample and verify the results with modeling of the sample history, for example, operation of a nuclear reactor. The major actinide plutonium and fission product cesium are commonly measured signatures of the fuel history in a reactor core. This study investigates the uncertainty of the plutonium and cesium isotope ratios of a fuel rod discharged from a research pressurized water reactor when the location of the sample is not known a priori. A sensitivity analysis showed overpredicted values for the 240 Pu/ 239 Pu ratio toward the axial center of the rod and revealed a lower probability of the rod of interest (ROI) being on the periphery of the assembly. The uncertainty analysis found the relative errors due to only the rod position and boron concentration to be 17% to 36% and 7% to 15% for the 240 Pu/ 239 Pu and 137 Cs/ 135 Cs ratios, respectively. Lastly, this study provides a method for uncertainty quantification of isotope concentrations due to the location of the ROI. Similar analyses can be performed to verify future chemical and isotopic analyses.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Multilevel Convergence Analysis of Multigrid-Reduction-in-Time

This study presents a multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles, with different relaxation schemes, by deriving the respective residual and error propagation operators. The residual and error operators are functions of the time-stepping operator, analyzed directly and bounded in the norm, both numerically and analytically. We present various upper bounds of different computational cost and varying sharpness. These upper bounds are complemented by proposing analytic formulae for the approximate convergence factor of V-cycle algorithms that take the number of fine grid time points, the temporal coarsening factors, and the eigenvalues of the time-stepping operator as parameters. The paper concludes with supporting numerical investigations of parabolic (anisotropic diffusion) and hyperbolic (wave equation) model problems. We assess the sharpness of the bounds and the quality of the approximate convergence factors. Observations from these numerical investigations demonstrate the value of the proposed multilevel convergence framework for estimating MGRIT convergence a priori and for the design of a convergent algorithm. We further highlight that observations in the literature are captured by the theory, including that two-level Parareal and multilevel MGRIT with F-relaxation do not yield scalable algorithms and the benefit of a stronger relaxation scheme. An important observation is that with increasing numbers of levels MGRIT convergence deteriorates for the hyperbolic model problem, while constant convergence factors can be achieved for the diffusion equation. The theory also indicates that L-stable Runge--Kutta schemes are more amendable to multilevel parallel-in-time integration with MGRIT than A-stable Runge--Kutta schemes.

97 MATHEMATICS AND COMPUTING↗

An Evolve-Then-Correct Reduced Order Model for Hidden Fluid Dynamics

In this paper, we put forth an evolve-then-correct reduced order modeling approach that combines intrusive and nonintrusive models to take hidden physical processes into account. Specifically, we split the underlying dynamics into known and unknown components. In the known part, we first utilize an intrusive Galerkin method projected on a set of basis functions obtained by proper orthogonal decomposition. We then present two variants of correction formula based on the assumption that the observed data are a manifestation of all relevant processes. The first method uses a standard least-squares regression with a quadratic approximation and requires solving a rank-deficient linear system, while the second approach employs a recurrent neural network emulator to account for the correction term. We further enhance our approach by using an orthonormality conforming basis interpolation approach on a Grassmannian manifold to address off-design conditions. The proposed framework is illustrated here with the application of two-dimensional co-rotating vortex simulations under modeling uncertainty. The results demonstrate highly accurate predictions underlining the effectiveness of the evolve-then-correct approach toward real-time simulations, where the full process model is not known a priori.

long short-term memory↗