Search NASA⌕ Search

SEARCH · Search NASA

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 55 records · Page 3

Error estimates of finite difference methods for the Dirac equation in the massless and nonrelativistic regime

We present four frequently used finite difference methods and establish the error bounds for the discretization of the Dirac equation in the massless and nonrelativistic regime, involving a small dimensionless parameter 0 < ε &NestedLessLess; 1 inversely proportional to the speed of light. In the massless and nonrelativistic regime, the solution exhibits rapid motion in space and is highly oscillatory in time. Specifically, the wavelength of the propagating waves in time is at O(ε), while in space, it is at O(1) with the wave speed at O(ε -1 ). We adopt one leap-frog, two semi-implicit, and one conservative Crank-Nicolson finite difference methods to numerically discretize the Dirac equation in one dimension and establish rigorously the error estimates which depend explicitly on the time step τ, mesh size h, and the small parameter ε. The error bounds indicate that, to obtain the “correct” numerical solution in the massless and nonrelativistic regime, i.e., 0 < ε &NestedLessLess; 1, all these finite difference methods share the same ε-scalability as time step τ = O(ε 3/2 ) and mesh size h = O(ε 1/2 ). A large number of numerical results are reported to verify the error estimates.

97 MATHEMATICS AND COMPUTING↗

Stochastic Richardson Extrapolation Based Numerical Error Estimation for Kinetic Plasma Simulations

We present a numerical error estimation technique specifically formulated to deal with stochastic code output with multiple discretization parameters. This method is based on multiple fits to an error model with arbitrary convergence rates and cross-coupling terms, performed using nonlinear optimization. The fitting approach varies by the type of residual norm which influences the importance of outliers, and weights which influences the relative importance of data points in the coarse and refined regions of discretization parameter space. To account for the influence of stochastic noise, these fits are performed on multiple bootstrap values based on the underlying response data set. Using an automated discretization domain selection scheme, the fits are performed on a series of reduced sets of discretization levels in order to find an optimal fully-converged result estimate in the minimum variance sense; this automated approach enables straightforward analysis of multiple quantities of interest and/or time and spatially-dependent response data. The overall numerical error analysis method is useful for verification and validation problems for stochastic simulation methods and forms a key component in the overall uncertainty quantification process. The method was demonstrated for steady and unsteady electron diode problems simulated using a particle-in-cell kinetic plasma code, demonstrating excellent results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Error Estimates for the Optimal Control of a Parabolic Fractional PDE

In this work, we consider the integral definition of the fractional Laplacian and analyze a linear-quadratic optimal control problem for the so-called fractional heat equation; control constraints are also considered. We derive existence and uniqueness results, first order optimality conditions, and regularity estimates for the optimal variables. To discretize the state equation we propose a fully discrete scheme that relies on an implicit finite difference discretization in time combined with a piecewise linear finite element discretization in space. We derive stability results and a novel $L^2(0,T;L^2(\Omega))$ a priori error estimate. On the basis of the aforementioned solution technique, we propose a fully discrete scheme for our optimal control problem that discretizes the control variable with piecewise constant functions, and we derive a priori error estimates for it. We illustrate the theory with one- and two-dimensional numerical experiments.

97 MATHEMATICS AND COMPUTING↗

mBEEF-vdW: Robust fitting of error estimation density functionals

Here, we propose a general-purpose semilocal/nonlocal exchange-correlation functional approximation, named mBEEF-vdW. The exchange is a meta generalized gradient approximation, and the correlation is a semilocal and nonlocal mixture, with the Rutgers-Chalmers approximation for van der Waals (vdW) forces. The functional is fitted within the Bayesian error estimation functional (BEEF) framework. We improve the previously used fitting procedures by introducing a robust MM-estimator based loss function, reducing the sensitivity to outliers in the datasets. To more reliably determine the optimal model complexity, we furthermore introduce a generalization of the bootstrap 0.632 estimator with hierarchical bootstrap sampling and geometric mean estimator over the training datasets. Using this estimator, we show that the robust loss function leads to a 10% improvement in the estimated prediction error over the previously used least-squares loss function. The mBEEF-vdW functional is benchmarked against popular density functional approximations over a wide range of datasets relevant for heterogeneous catalysis, including datasets that were not used for its training. Overall, we find that mBEEF-vdW has a higher general accuracy than competing popular functionals, and it is one of the best performing functionals on chemisorption systems, surface energies, lattice constants, and dispersion. We also show the potential-energy curve of graphene on the nickel(111) surface, where mBEEF-vdW matches the experimental binding length. mBEEF-vdW is currently available in gpaw and other density functional theory codes through Libxc, version 3.0.0.

36 MATERIALS SCIENCE↗

Intermediate-mass-ratio inspirals in the Einstein Telescope. II. Parameter estimation errors

We explore the precision with which the Einstein Telescope will be able to measure the parameters of intermediate-mass-ratio inspirals, i.e., the inspirals of stellar mass compact objects into intermediate-mass black holes (IMBHs). We calculate the parameter estimation errors using the Fisher Matrix formalism and present results of Monte Carlo simulations of these errors over choices for the extrinsic parameters of the source. These results are obtained using two different models for the gravitational waveform which were introduced in paper I of this series. These two waveform models include the inspiral, merger, and ringdown phases in a consistent way. One of the models, based on the transition scheme of Ori and Thorne [A. Ori and K. S. Thorne, Phys. Rev. D 62, 124022 (2000)], is valid for IMBHs of arbitrary spin; whereas, the second model, based on the effective-one-body approach, has been developed to cross-check our results in the nonspinning limit. In paper I of this series, we demonstrated the excellent agreement in both phase and amplitude between these two models for nonspinning black holes, and that their predictions for signal-to-noise ratios are consistent to within 10%. We now use these waveform models to estimate parameter estimation errors for binary systems with masses 1.4M{sub {circle_dot}}+100M{sub {circle_dot}}, 10M{sub {circle_dot}}+100M{sub {circle_dot}}, 1.4M{sub {circle_dot}}+500M{sub {circle_dot}}, and 10M{sub {circle_dot}}+500M{sub {circle_dot}} and various choices for the spin of the central IMBH. Assuming a detector network of three Einstein Telescopes, the analysis shows that for a 10M{sub {circle_dot}} compact object inspiralling into a 100M{sub {circle_dot}} IMBH with spin q=0.3, detected with a signal-to-noise ratio of 30, we should be able to determine the compact object and IMBH masses, and the IMBH spin magnitude to fractional accuracies of {approx}10{sup -3}, {approx}10{sup -3.5}, and {approx}10{sup -3}, respectively. We also expect to determine the location of the source in the sky and the luminosity distance to within {approx}0.003 steradians and {approx}10%, respectively. We also compute results for several different possible configurations of the detector network to assess how the precision of parameter determination depends on the network configuration.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Solution Irregularity Remediation for Spatial Discretization Error Estimation for S N Transport Solutions

The discrete ordinates linear Boltzmann transport equation is typically solved in its spatially discretized form, incurring spatial discretization error. Quantification of this error for purposes such as adaptive mesh refinement or error analysis requires an a posteriori estimator, which utilizes the numerical solution to the spatially discretized equation to compute an estimate. Because the quality of the numerical solution informs the error estimate, irregularities, present in the true solution for any realistic problem configuration, tend to cause the largest deviation in the error estimate vis-a-vis the true error. In this paper, an analytical partial singular characteristic tracking (pSCT) procedure for reducing the estimator’s error is implemented within our novel residual source estimator for a zeroth-order discontinuous Galerkin scheme, at the additional cost of a single inner iteration. Here, a metric-based evaluation of the pSCT scheme versus the standard residual source estimator is performed over the parameter range of a Method of Manufactured Solutions test suite. The pSCT scheme generates near-ideal accuracy in the estimate in problems where the dominant source of the estimator’s error is the solution irregularity, namely, problems where the true solution is discontinuous and problems where the true solution’s first derivative is discontinuous and the scattering ratio is low. In problems where the scattering ratio is high and the true solution is discontinuous in the first derivative, the error in the scattering source, which is not converged by the pSCT scheme, is greater than the error incurred due to the irregularity. Ultimately, a pSCT scheme is judged to be useful for error estimation in problems where the computational cost of the scheme is justified. In the presence of many irregularities, such a scheme may be intractable for general use, but in benchmarks, as an analytical tool, or in problems that have nondissipative discontinuities, the scheme may prove invaluable.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Anisotropic mesh adaptation for solution of finite element problems using hierarchical edge-based error estimates

We present a new technology for generating meshes minimizing the interpolation and discretization errors or their gradients. The key element of this methodology is construction of a space metric from edge-based error estimates. For a mesh with N{sub h} triangles, the error is proportional to N{sub h}{sup -1} and the gradient of error is proportional to N{sub h}{sup -1/2} which are optimal asymptotics. The methodology is verified with numerical experiments.

99 GENERAL AND MISCELLANEOUS↗

Adaptive reduction of constitutive model-form error using a posteriori error estimation techniques

In engineering practice, models are typically kept as simple as possible for ease of setup and use, computational efficiency, maintenance, and overall reduced complexity to achieve robustness. In solid mechanics, a simple and efficient constitutive model may be favored over one that is more predictive, but is difficult to parameterize, is computationally expensive, or is simply not available within a simulation tool. In order to quantify the modeling error due to the choice of a relatively simple and less predictive constitutive model, we adopt the use of a posteriori model-form error-estimation techniques. Based on local error indicators in the energy norm, an algorithm is developed for reducing the modeling error by spatially adapting the material parameters in the simpler constitutive model. The resulting material parameters are not material properties per se , but depend on the given boundary-value problem. As a first step to the more general nonlinear case, we focus here on linear elasticity in which the “complex” constitutive model is general anisotropic elasticity and the chosen simpler model is isotropic elasticity. As a result, the algorithm for adaptive error reduction is demonstrated using two examples: (1) A transversely-isotropic plate with hole subjected to tension, and (2) a transversely-isotropic tube with two side holes subjected to torsion.

42 ENGINEERING↗

Condition and Error Estimates in Numerical Matrix Computations

This tutorial paper deals with sensitivity and error estimates in matrix computational processes. The main factors determining the accuracy of the result computed in floating--point machine arithmetics are considered. Special attention is paid to the perturbation analysis of matrix algebraic equations and unitary matrix decompositions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enabling Predictive Simulation and UQ of Complex Multiphysics PDE Systems by the Development of Goal-Oriented Variational Sensitivity Analysis and a-Posteriori Error Estimation Methods

This project addressed the challenge of predictive computational analysis of strongly coupled, highly nonlinear multiphysics systems characterized by multiple physical phenomena that span a large range of length- and time-scales. Specifically, the project was focused on computational estimation of numerical error and sensitivity analysis of computational solutions with respect to variations in parameters and data. In addition, the project investigated the use of accurate computational estimates to guide efficient adaptive discretization. The project developed, analyzed and evaluated new variational adjoint-based techniques for integration, model, and data error estimation/control and sensitivity analysis, in evolutionary multiphysics multiscale simulations.

97 MATHEMATICS AND COMPUTING↗

Exploration of efficient reduced-order modeling and a posteriori error estimation

Efficient algorithms are considered for the computation of a reduced-order model based on the proper orthogonal decomposition methodology for the solution of parameterized elliptic partial differential equations. The method relies on partitioning the parameter space into subdomains based on the properties of the solution space and then forming a reduced basis for each of the subdomains. This yields more efficient offline and online stages for the proper orthogonal decomposition method. We extend these ideas for inexpensive adjoint based a posteriori error estimation of both the expensive finite element method solutions and the reduced-order model solutions, for a single and multiple quantities of interest. Finally, various numerical results indicate the efficacy of the approach.

42 ENGINEERING↗

PERIOD ERROR ESTIMATION FOR THE KEPLER ECLIPSING BINARY CATALOG

The Kepler Eclipsing Binary Catalog (KEBC) describes 2165 eclipsing binaries identified in the 115 deg{sup 2} Kepler Field based on observations from Kepler quarters Q0, Q1, and Q2. The periods in the KEBC are given in units of days out to six decimal places but no period errors are provided. We present the PEC (Period Error Calculator) algorithm, which can be used to estimate the period errors of strictly periodic variables observed by the Kepler Mission. The PEC algorithm is based on propagation of error theory and assumes that observation of every light curve peak/minimum in a long time-series observation can be unambiguously identified. The PEC algorithm can be efficiently programmed using just a few lines of C computer language code. The PEC algorithm was used to develop a simple model that provides period error estimates for eclipsing binaries in the KEBC with periods less than 62.5 days: log {sigma}{sub P} Almost-Equal-To - 5.8908 + 1.4425(1 + log P), where P is the period of an eclipsing binary in the KEBC in units of days. KEBC systems with periods {>=}62.5 days have KEBC period errors of {approx}0.0144 days. Periods and period errors of seven eclipsing binary systems in the KEBC were measured using the NASA Exoplanet Archive Periodogram Service and compared to period errors estimated using the PEC algorithm.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

Error Estimates of Residual Minimization Using Neural Networks for Linear PDES

We propose an abstract framework for analyzing the convergence of least-squares methods based on residual minimization when feasible solutions are neural networks. With the norm relations and compactness arguments, we derive error estimates for both continuous and discrete formulations of residual minimization in strong and weak forms. The formulations cover recently developed physicsinformed neural networks based on strong and variational formulations.

97 MATHEMATICS AND COMPUTING↗

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗