Search NASA⌕ Search

SEARCH · Search NASA

Results for “Discretization error”

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 325 records · Page 18

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↗

Error minimizing algorithms for nearest eighbor classifiers

Stack Filters define a large class of discrete nonlinear filter first introd uced in image and signal processing for noise removal. In recent years we have suggested their application to classification problems, and investigated their relationship to other types of discrete classifiers such as Decision Trees. In this paper we focus on a continuous domain version of Stack Filter Classifiers which we call Ordered Hypothesis Machines (OHM), and investigate their relationship to Nearest Neighbor classifiers. We show that OHM classifiers provide a novel framework in which to train Nearest Neighbor type classifiers by minimizing empirical error based loss functions. We use the framework to investigate a new cost sensitive loss function that allows us to train a Nearest Neighbor type classifier for low false alarm rate applications. We report results on both synthetic data and real-world image data.

97 MATHEMATICS AND COMPUTING↗

Physics-Informed Neural Network Method for Forward and Backward Advection-Dispersion Equations

Advection-dispersion equations (ADEs) are commonly used to describe transport phenomena in porous media. Even though mature discretization-based numerical methods for ADEs exist, some challenges still remain, especially when it comes to solving advection-dominated forward ADEs and diffusion-dominated backward ADEs. The latter problem usually arises in the source identification context and leads to numerically unstable grid-based solutions that require a form of regularization or should be treated as an inverse problem that is computationally more expensive because it requires solving the forward problem multiple times. In this study, we propose a discretization-free approach based on the physics-informed neural network (PINN) method for solving coupled ADE and Darcy flow equations with space-dependent hydraulic conductivity. In this approach, the hydraulic conductivity, hydraulic head, and concentration fields are approximated with deep neural networks (DNNs). We assume that the conductivity field is given by its values on a grid, and we use these values to train the conductivity DNN. The head and concentration DNNs are trained by minimizing the residuals of the flow equation and ADE and using the initial and boundary conditions as additional constraints. The PINN method is applied to one- and two-dimensional forward ADE problems, where its performance for various P\'{e}clet numbers ($Pe$) is compared with the analytical and numerical solutions. We find that the PINN method is accurate with errors of less than 1\% and outperforms some conventional discretization-based methods for $Pe$ larger that 100. Next, we demonstrate that the PINN method remains accurate for the backward ADEs, with the relative errors in most cases staying under 5\% compared to the reference concentration field. Finally, we show that when available, the concentration measurements can be easily incorporated in the PINN method and significantly improve (by more than 50\% in the considered cases) the accuracy of the PINN solution of the backward ADE.

He, Qizhi↗

Adaptive mesh refinement versus subgrid friction interpolation in simulations of Antarctic ice dynamics

At least in conventional hydrostatic ice-sheet models, the numerical error associated with grounding line dynamics can be reduced by modifications to the discretization scheme. These involve altering the integration formulae for the basal traction and/or driving stress close to the grounding line and exhibit lower – if still first-order – error in the MISMIP3d experiments. MISMIP3d may not represent the variety of real ice streams, in that it lacks strong lateral stresses, and imposes a large basal traction at the grounding line. We study resolution sensitivity in the context of extreme forcing simulations of the entire Antarctic ice sheet, using the BISICLES adaptive mesh ice-sheet model with two schemes: the original treatment, and a scheme, which modifies the discretization of the basal traction. The second scheme does indeed improve accuracy – by around a factor of two – for a given mesh spacing, but $\lesssim 1$ km resolution is still necessary. For example, in coarser resolution simulations Thwaites Glacier retreats so slowly that other ice streams divert its trunk. In contrast, with $\lesssim 1$ km meshes, the same glacier retreats far more quickly and triggers the final phase of West Antarctic collapse a century before any such diversion can take place.

54 ENVIRONMENTAL SCIENCES↗

Tracking and Rejection of Biased Sinusoidal Signals Using Generalized Predictive Controller

Some novel applications require the tracking/rejection of biased sinusoidal reference/distur-bances. According to the internal model principle (IMP), a controller must embed the model of a biased sinusoidal signal to track references and also reject perturbations modeled through the aforementioned signal. However, the design of that kind of controller is not straightforward, especially when they are implemented in digital processors. This paper presents a controller, based on generalized predictive control (GPC), designed for tracking/rejection of biased sinusoidal signals. In general, GPC is based on the prediction of the plant responses through an augmented prediction model. The proposed approach develops an augmented model that predicts the future errors. The prediction model and the control law used in the proposed approach embed the discrete-time model of a biased sinusoidal signal. Thus, the proposed controller can track/reject biased sinusoidal references/disturbances. The predicted errors and the future inputs of the proposed augmented model are used to define the cost function that measures the control performance. An optimization technique was applied to obtain the solution of the cost function, which is the optimal sequence of future model inputs that allows defining the control law. Experimental tests prove that the proposed controller can asymptotically track and reject biased sinusoidal signals.

42 ENGINEERING↗

Standard and goal-oriented adaptive mesh refinement applied to radiation transport on 2D unstructured triangular meshes

Standard and goal-oriented adaptive mesh refinement (AMR) techniques are presented for the linear Boltzmann transport equation. A posteriori error estimates are employed to drive the AMR process and are based on angular-moment information rather than on directional information, leading to direction-independent adapted meshes. An error estimate based on a two-mesh approach and a jump-based error indicator are compared for various test problems. In addition to the standard AMR approach, where the global error in the solution is diminished, a goal-oriented AMR procedure is devised and aims at reducing the error in user-specified quantities of interest. The quantities of interest are functionals of the solution and may include, for instance, point-wise flux values or average reaction rates in a subdomain. A high-order (up to order 4) Discontinuous Galerkin technique with standard upwinding is employed for the spatial discretization; the discrete ordinates method is used to treat the angular variable.

97 MATHEMATICS AND COMPUTING↗

Machine learning framework for predicting uranium enrichments from M400 CZT gamma spectra

A machine learning framework was developed for predicting uranium enrichments from M400 CZT gamma spectra. This framework leverages the availability of a large amount of measured M400 gamma spectra and uses a recently updated version of Gamma Detector Response and Analysis Software (GADRAS) for gamma spectrum analysis and generation. It also leverages the existing machine learning modules in Python for gamma spectrum data processing, curation, model training, benchmarking, and optimization of the deep machine learning models. The framework is used to develop a deep learning model to analyze gamma spectra from a set of U 3 O 8 samples with enrichments ranging from 0.31 to 93.17% and UF 6 cylinders with enrichments ranging from 0.2 to 4.95%, and the model performance is tested using a set of measured spectra and the respective declared enrichment values. Results show that the model can correctly classify 99.35% of the U 3 O 8 sample enrichments, and can predict the samples’ enrichments within an average absolute error of 0.099% (in percentage points of enrichment). For the UF 6 cylinders, the average absolute error was approximately 0.03%, with an accuracy of 98% in classifying discrete enrichment values of UF 6 samples. Finally, the results also show that the model has performed significantly better in terms of predicting enrichments in UF 6 cylinders based on measured gamma spectra than the GEM code, with a standard deviation (of the relative errors) of 2.23% (compared with the 11.51% value for the GEM code) based on results from a set of test data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Chandra and very large array observations of the nearby Sd galaxy NGC 45

We present an analysis of high angular resolution observations made in the X-ray and the radio with the Chandra X-ray Observatory and the Karl Jansky Very Large Array (VLA), respectively, of the nearby spiral galaxy NGC 45. This galaxy is the third that we have considered in a study of the supernova remnant (SNR) populations of nearby spiral galaxies and the present work represents the first detailed analysis of the discrete X-ray and radio source populations of this galaxy. We analyzed data sets from the three pointed observations made of this galaxy with Chandra along with a merged data set obtained from combining these data sets: the total effective exposure time of the merged data set is 63515 s. A total of 25 discrete X-ray sources are found in the entire field of view of the ACIS-S3 chip, with 16 sources found within the visual extent of the galaxy. We estimate that as many as half of the sources detected in the entire field of view of the ACIS-S3 chip and seven of the sources detected in the optical extent of NGC 45 may be background sources. We analyzed the spectral properties of the discrete X-ray sources within the galaxy and conclude that the majority of these sources are X-ray binaries. We have searched for counterparts at different wavelengths to the discrete X-ray sources and we find two associations: one with a star cluster and the other with a background galaxy. We have found one source that is clearly variable within one observation and seven that are seen to vary from one observation to another. We also conduct a photometric analysis to determine the near-infrared fluxes of the discrete X-ray sources in Spitzer Infrared Array Camera channels. We constructed a cumulative luminosity function of the discrete X-ray sources seen toward NGC 45: taking into account simultaneously the luminosity function of background sources, the fitted slope of the cumulative luminosity function Γ = –1.3{sub −1.6}{sup +0.7} (all error bounds correspond to 90% confidence intervals). The VLA observations reveal seven discrete radio sources: we find no overlaps between these sources and the X-ray detected sources. Based on their measured spectral indices and their locations with respect to the visible extent of NGC 45, we classify one source as a candidate radio SNR associated with the galaxy and the others as likely background galaxies seen in projection toward NGC 45. Finally, we discuss the properties of a background cluster of galaxies (denoted as CXOU J001354.2–231254.7) seen in projection toward NGC 45 and detected by the Chandra observations. The fit parameters to the extracted Chandra spectra of this cluster are a column density N{sub H} = 0.07(<0.14) × 10{sup 22} cm{sup −2}, a temperature kT = 4.22{sub −1.42}{sup +2.08} keV, an abundance Z = 0.30(<0.75) relative to solar and a redshift z = 0.28 ± 0.14. From the fit parameters we derive an electron number density n{sub e} = 4(±1) × 10{sup −3} cm{sup −3}, an unabsorbed X-ray luminosity L{sub 0.5−7.0 keV} ∼ 8.77(±0.96) × 10{sup 43} erg s{sup −1} for the cluster and an X-ray emitting mass M = 2.32(±1.75) × 10{sup 12} M{sub ⊙}.

79 ASTRONOMY AND ASTROPHYSICS↗

Error-correcting Bacon-Shor code with continuous measurement of noncommuting operators

We analyze the continuous operation of the nine-qubit error correcting Bacon-Shor code with all noncommuting gauge operators measured at the same time. The error syndromes are continuously monitored using cross-correlations of sets of three measurement signals. We calculate the logical error rates due to $X$, $Y$ and $Z$ errors in the physical qubits and compare the continuous implementation with the discrete operation of the code. We find that both modes of operation exhibit similar performances when the measurement strength from continuous measurements is sufficiently strong. Here, we also estimate the value of the crossover error rate of the physical qubits, below which continuous error correction gives smaller logical error rates. Continuous operation has the advantage of passive monitoring of errors and avoids the need for additional circuits involving ancilla qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparative Study of Finite Element Methods Using the Time-Accuracy-Size(TAS) Spectrum Analysis

We present a performance analysis appropriate for comparing algorithms using different numerical discretizations. By taking into account the total time-to-solution, numerical accuracy with respect to an error norm, and the computation rate, a cost-benefit analysis can be performed to determine which algorithm and discretization are particularly suited for an application. This work extends the performance spectrum model in for interpretation of hardware and algorithmic tradeoffs in numerical PDE simulation. As a proof-of-concept, popular finite element software packages are used to illustrate this analysis for Poisson’s equation.

97 MATHEMATICS AND COMPUTING↗

Pressure-stabilized fixed-stress iterative solutions of compositional poromechanics

We consider the numerical behavior of the fixed-stress splitting method for coupled poromechanics as undrained regimes are approached. We explain that pressure stability is related to the splitting error of the scheme, not the fact that the discrete saddle point matrix never appears in the fixed-stress approach. This observation reconciles previous results regarding the pressure stability of the splitting method. Using examples of compositional poromechanics with application to geological CO sequestration, we see that solutions obtained using the fixed-stress scheme with a low order finite element-finite volume discretization which is not inherently inf-sup stable can exhibit the same pressure oscillations obtained with the corresponding fully implicit scheme. Moreover, pressure jump stabilization can effectively remove these spurious oscillations in the fixed-stress setting, while also improving the efficiency of the scheme in terms of the number of iterations required at every time step to reach convergence.

42 ENGINEERING↗

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↗

A comparison of HDR near source dosimetry using a treatment planning system, Monte Carlo simulation, and radiochromic film

This study aimed to investigate the high-dose rate Iridium-192 brachytherapy, including near source dosimetry, of a catheter-based applicator from 0.5 mm to 1 cm along the transverse axis. Radiochromic film and Monte Carlo (MC) simulation were used to generate absolute dose for the catheter-based applicator. Results from radiochromic film and MC simulation were compared directly to the treatment planning system (TPS) based on the American Association of Physicists in Medicine Updated Task Group 43 (TG-43U1) dose calculation formalism. The difference between dose measured using radiochromic film along the transverse plane at 0.5 mm from the surface and the predicted dose by the TPS was 24%±13%. The dose difference between the MC simulation along the transverse plane at 0.5 mm from the surface and the predicted dose by the TPS was 22.1%±3%. For distances from 1.5 mm to 1 cm from the surface, radiochromic film and MC simulation agreed with TPS within an uncertainty of 3%. The TPS under-predicts the dose at the surface of the applicator, i.e., 0.5 mm from the catheter surface, as compared to the measured and MC simulation predicted dose. MC simulation results demonstrated that 15% of this error is due to neglecting the beta particles and discrete electrons emanating from the sources and not considered by the TPS, and 7% of the difference was due to the photon alone, potentially due to the differences in MC dose modeling, photon spectrum, scoring techniques, and effect of the presence of the catheter and the air gap. Beyond 1 mm from the surface, the TPS dose algorithm agrees with the experimental and MC data within 3%.

61 RADIATION PROTECTION AND DOSIMETRY↗

Variational symplectic algorithm for guiding center dynamics and its application in tokamak geometry

A variational symplectic integrator for the guiding center motion of charged particles in general magnetic fields is developed to enable accurate long-time simulation studies of magnetized plasmas. Instead of discretizing the differential equations of the guiding center motion, the action of the guiding center motion is discretized and minimized to obtain the iteration rules for advancing the dynamics. The variational symplectic integrator conserves exactly a discrete Lagrangian symplectic structure and globally bounds the numerical error in energy by a small number for all simulation time steps. Compared with standard integrators, such as the fourth order Runge-Kutta method, the variational symplectic integrator has superior numerical properties over long integration time. For example, in a two-dimensional tokamak geometry, the variational symplectic integrator is able to guarantee the accuracy for both the trapped and transit particle orbits for arbitrarily long simulation time. This is important for modern large-scale simulation studies of fusion plasmas where it is critical to use algorithms with long-term accuracy and fidelity. The variational symplectic integrator is expected to have a wide range of applications.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Computation of the Biot–Savart line integral with higher-order convergence using straight segments

One common approach to computing the magnetic field produced by a filamentary current-carrying coil is to approximate the coil as a series of straight segments. The Biot–Savart field from each straight segment is analytically known. However, if the endpoints of the straight segments are chosen to lie on the coil, then the accuracy of the Biot–Savart computation is generally only the second order in the number of endpoints. In this work, we propose a simple modification: shift each end point of the coil in the outward normal direction by an amount proportional to the local curvature. With this modification, the Biot–Savart accuracy increases to the fourth order and the numerical error is dramatically reduced for a given number of discretization points.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An Asymptotic Preserving Discontinuous Galerkin Method for a Linear Boltzmann Semiconductor Model

A key property of the linear Boltzmann semiconductor model is that as the collision frequency tends to infinity, the phase space density $f$ = $f$ ($x, v, t$) converges to an isotropic function $M (v)$$ρ$$(x, t)$, called the drift-diffusion limit, where $M$ is a Maxwellian and the physical density $ρ$ satisfies a second-order parabolic PDE known as the drift-diffusion equation. Numerical approximations that mirror this property are said to be asymptotic preserving. In this paper we build a discontinuous Galerkin method to the semiconductor model, and we show this scheme is both uniformly stable in $ε$, where 1/$ε$ is the scale of the collision frequency, and asymptotic preserving. Here in particular, we discuss what properties the discrete Maxwellian must satisfy in order for the schemes to converge in $ε$ to an accurate $h$-approximation of the drift-diffusion limit. Discrete versions of the drift-diffusion equation and error estimates in several norms with respect to $ε$ and the spacial resolution are also included.

97 MATHEMATICS AND COMPUTING↗

The virtual element method for linear elastodynamics models: Design, analysis, and implementation

We design the conforming virtual element method for the numerical simulation of two dimensional time-dependent elastodynamics problems. We investigate the performance of the method both theoretically and numerically. We prove the stability and the convergence of the semi-discrete approximation in the energy norm and derive optimal error estimates. We also show the convergence in the L 2 norm. The performance of the virtual element method is assessed on a set of different computational meshes, including non-convex cells up to order four in the h-refinement setting. Exponential convergence is also experimentally seen in the p-refinement setting.

97 MATHEMATICS AND COMPUTING↗

Extending Petsc's Composable Hierarchically Nested Linear Solvers

The Contributions from the RELACS group at both Rice University and the University at Buffalo in this phase of the PETSc Composable Solvers effort have centered around four main areas: scalable mesh processing, mesh adaptivity, solvers for subsurface flow, and performance modeling. The prominence of mesh processing demonstrates the tight relationship between meshing and discretization on the one hand, and optimal solvers on the other. All optimal solvers that we consider depend on some notion of hierarchy, and we express this using the DMPlex abstraction in PETSc. This relationship demands tight integration between the DM and SNES/TS components in PETSc that is the foundation of much of this work. In addition, interpretation of performance results for scalable solvers necessitates that information from the discretization and solver enter the performance model. Without this, comparing different solvers can be a fruitless exercise. Some major accomplishment of the past three years in these areas include: scalable mesh loading in PETSc on more than 10K cores, integrated mesh adaptivity using both p4est and Pragmatic, scalable multigrid for DG discretizations of subsurface flow, and predictive performance modeling incorporating error estimates.

79 ASTRONOMY AND ASTROPHYSICS↗