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 757 records · Page 42

Parametric reduced order models for graded lattice structures

Graded lattice structures, characterized by smoothly varying mechanical properties, hold significant promise for optimizing material distribution in advanced engineering applications. However, accurately modeling these structures poses substantial computational challenges due to the continuous geometric variations within their unit cells. Here, to address these challenges, this paper introduces a novel Efficient Reduced Order Model (EROM) that integrates the Matrix Discrete Empirical Interpolation Method (MDEIM) and Discrete Empirical Interpolation Method (DEIM) with polynomial regression to efficiently manage geometric parametrization in lattice structures. Unlike traditional reduced order models (ROMs) that require extensive precomputed libraries for each geometric configuration, our approach enables continuous geometric variations through a flexible algebraic formulation, significantly reducing computational costs while preserving high accuracy. The method constructs projection matrices for individual unit cells that can be efficiently assembled into global systems, leveraging the repetitive nature of lattice structures. Numerical studies demonstrate that our EROM achieves displacement errors below 1% and von Mises stress prediction errors below 4%, coupled with computational speedups exceeding two orders of magnitude compared to full-order simulations. The proposed method's modularity and scalability make it particularly suitable for design optimization and real-time simulation of functionally graded lattice structures, with applications spanning aerospace to biomedical engineering.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A Statistical Interpolation Code for Ocean Analysis and Forecasting

Abstract We present a data assimilation package for use with ocean circulation models in analysis, forecasting, and system evaluation applications. The basic functionality of the package is centered on a multivariate linear statistical estimation for a given predicted/background ocean state, observations, and error statistics. Novel features of the package include support for multiple covariance models, and the solution of the least squares normal equations either using the covariance matrix or its inverse—the information matrix. The main focus of this paper, however, is on the solution of the analysis equations using the information matrix, which offers several advantages for solving large problems efficiently. Details of the parameterization of the inverse covariance using Markov random fields are provided and its relationship to finite-difference discretizations of diffusion equations are pointed out. The package can assimilate a variety of observation types from both remote sensing and in situ platforms. The performance of the data assimilation methodology implemented in the package is demonstrated with a yearlong global ocean hindcast with a 1/4° ocean model. The code is implemented in modern Fortran, supports distributed memory, shared memory, multicore architectures, and uses climate and forecasts compliant Network Common Data Form for input/output. The package is freely available with an open source license from www.tendral.com/tsis/ .

Srinivasan, Ashwanth↗

Multiscale two-stage solver for Biot’s poroelasticity equations in subsurface media

In this paper, we propose a two-stage preconditioner for accelerating the iterative solution by a Krylov subspace method of Biot’s poroelasticity equations based on a displacement-pressure formulation. The spatial discretization combines a finite element method for mechanics and a finite volume approach for flow. The fully implicit backward Euler scheme is used for time integration. The result is a 2 × 2 block linear system for each timestep. The preconditioning operator is obtained by applying a two-stage scheme. The first stage is a global preconditioner that employs multiscale basis functions to construct coarse-scale coupled systems using a Galerkin projection. This global stage is effective at damping low-frequency error modes associated with long-range coupling of the unknowns. The second stage is a local block-triangular smoothing preconditioner, which is aimed at high-frequency error modes associated with short-range coupling of the variables. Lastly, various numerical experiments are used to demonstrate the robustness of the proposed solver.

58 GEOSCIENCES↗

Discontinuous Galerkin solution of the Navier-Stokes equations on deformable domains

We describe a method for computing time-dependent solutions to the compressible Navier-Stokes equations on variable geometries. We introduce a continuous mapping between a fixed reference configuration and the time varying domain, By writing the Navier-Stokes equations as a conservation law for the independent variables in the reference configuration, the complexity introduced by variable geometry is reduced to solving a transformed conservation law in a fixed reference configuration, The spatial discretization is carried out using the Discontinuous Galerkin method on unstructured meshes of triangles, while the time integration is performed using an explicit Runge-Kutta method, For general domain changes, the standard scheme fails to preserve exactly the free-stream solution which leads to some accuracy degradation, especially for low order approximations. This situation is remedied by adding an additional equation for the time evolution of the transformation Jacobian to the original conservation law and correcting for the accumulated metric integration errors. A number of results are shown to illustrate the flexibility of the approach to handle high order approximations on complex geometries.

97 MATHEMATICS AND COMPUTING↗

NEON AOP foliar trait maps, maps of model uncertainty estimates, and conifer map, East River, CO 2018

This data package contains mapped trait estimates and their uncertainties, and conifer map, for the National Ecological Observatory Network's Airborne Observation Platform survey data acquired over the Upper East River, Colorado in 2018. For full details, please see associated reference. in brief, trait models were developed independently for needle and non-needle leaf species using partial least squares regression (PLSR) using ground data from additional datasets: doi:10.15485/1618130, doi:10.15485/1618132, and doi:10.15485/1631278, merged with extracted spectral data from doi:10.15485/1618131. We separated vegetated pixels into needle and non-needle classes in order to generate a classification map based on the spectral differences between these leaf types (conifer.tif). We trained a deep learning model with custom architecture, detailed in Chadwick et al. In Press. The model performed with 0.998 true positive rate and 0.982 true negative rate, with ‘positives’ being non-needle identification. We then utilized PLSR to generate models of foliar traits for each leaf type. So that we could also map uncertainty in these predictions, we generated ten different models for needle and non-needle leaf species using different testing holdout sets of discrete sites. Each of these models was developed with a 100-fold cross validation procedure that utilized a 70% training set and 30% validation set with each fold, and then assessed based on the 10% of testing sites that were not included in that model’s development. The mean predicted value across the 10 models is used for the trait estimate in each pixel across the study area. The models are applied according to the leaf type designation in the conifer.tif map. The errors are the standard deviation across the 10 different models developed, with high error suggesting instability in model prediction and areas where values may not be reliable for ecological inference. These maps are only applied to areas with a NDVI > 0.5 to exclude non-vegetated areas. Shade masks could be applied to these data (doi:10.15485/1618131), but have not been for this data package. These data are also available on Google Earth Engine: https://code.earthengine.google.com/?asset=users/kdc/ER_NEON

54 ENVIRONMENTAL SCIENCES↗

An adaptive, data-driven multiscale approach for dense granular flows

The accuracy of coarse-grained continuum models of dense granular flows is limited by the lack of high-fidelity closure models for granular rheology. One approach to addressing this issue, referred to as the hierarchical multiscale method, is to use a high-fidelity fine-grained model to compute the closure terms needed by the coarse-grained model. The difficulty with this approach is that the overall model can become computationally intractable due to the high computational cost of the high-fidelity model. In this work, we describe a multiscale modeling approach for dense granular flows that utilizes neural networks trained using high-fidelity discrete element method (DEM) simulations to approximate the constitutive granular rheology for a continuum incompressible flow model. Our approach leverages an ensemble of neural networks to estimate predictive uncertainty that allows us to determine whether the rheology at a given point is accurately represented by the neural network model. Additional DEM simulations are only performed when needed, minimizing the number of additional DEM simulations required when updating the rheology. This adaptive coupling significantly reduces the overall computational cost of the approach while controlling the error. In addition, the neural networks are customized to learn regularized rheological behavior to ensure well-posedness of the continuum solution. We first validate the approach using two-dimensional steady-state and decelerating inclined flows. We then demonstrate the efficiency of our approach by modeling three-dimensional sub-aerial granular column collapse for varying initial column aspect ratios, where our multiscale method compares well with the computationally expensive computational fluid dynamics (CFD)-DEM simulation.

Dense granular flows↗

Absolute calibration method for nanosecond-resolved, time-streaked, fiber optic light collection, spectroscopy systems

This paper describes a convenient and accurate method to calibrate fast (<1 ns resolution) streaked, fiber optic light collection, spectroscopy systems. Such systems are inherently difficult to calibrate due to the lack of sufficiently intense, calibrated light sources. Such a system is used to collect spectral data on plasmas generated in electron beam diodes fielded on the RITS-6 accelerator (8-12MV, 140-200kA) at Sandia National Laboratories. On RITS, plasma light is collected through a small diameter (200 {mu}m) optical fiber and recorded on a fast streak camera at the output of a 1 meter Czerny-Turner monochromator. For this paper, a 300 W xenon short arc lamp (Oriel Model 6258) was used as the calibration source. Since the radiance of the xenon arc varies from cathode to anode, just the area around the tip of the cathode ('hotspot') was imaged onto the fiber, to produce the highest intensity output. To compensate for chromatic aberrations, the signal was optimized at each wavelength measured. Output power was measured using 10 nm bandpass interference filters and a calibrated photodetector. These measurements give power at discrete wavelengths across the spectrum, and when linearly interpolated, provide a calibration curve for the lamp. The shape of the spectrum is determined by the collective response of the optics, monochromator, and streak tube across the spectral region of interest. The ratio of the spectral curve to the measured bandpass filter curve at each wavelength produces a correction factor (Q) curve. This curve is then applied to the experimental data and the resultant spectra are given in absolute intensity units (photons/sec/cm{sup 2}/steradian/nm). Error analysis shows this method to be accurate to within +/- 20%, which represents a high level of accuracy for this type of measurement.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Distributed State Estimation Over Time-Varying Graphs: Exploiting the Age-of-Information

Here, we study the problem of designing a distributed observer for an LTI system over a time-varying communication graph. The limited existing work on this topic imposes various restrictions either on the observation model or on the sequence of communication graphs. In contrast, we propose a single-time-scale distributed observer that works under mild assumptions. Specifically, our communication model only requires strong-connectivity to be preserved over non-overlapping, contiguous intervals that are even allowed to grow unbounded over time. We show that under suitable conditions that bound the growth of such intervals, joint observability is sufficient to track the state of any discrete-time LTI system exponentially fast, at any desired rate. We also develop a variant of our algorithm that is provably robust to worst-case adversarial attacks, provided the sequence of graphs is sufficiently connected over time. The key to our approach is the notion of a "freshness-index" that keeps track of the age-of-information being diffused across the network. Such indices enable nodes to reject stale estimates of the state, and, in turn, contribute to stability of the error dynamics.

42 ENGINEERING↗

Statistical Mechanics Modeling of Mesoscale Deformation in Metals

The research under this project focused on a theoretical and computational modeling of dislocation dynamics of mesoscale deformation of metal single crystals. Specifically, the work aimed to implement a continuum statistical theory of dislocations to understand strain hardening and cell structure formation under monotonic loading. These aspects of crystal deformation are manifestations of the evolution of the underlying dislocation system under mechanical loading. The project had three research tasks: 1) Investigating the statistical characteristics of dislocation systems in deformed crystals. 2) Formulating kinetic equations of dislocations and coupling these kinetics equations and crystal mechanics. 3) Computational solution of coupled crystal mechanics and dislocation kinetics. Comparison of dislocation dynamics predictions with experimental results in the area of statistical properties of dislocations and their field was also a part of the proposed effort. In the first research task, the dislocation dynamics simulation method was used to investigate the spatial, orientation, velocity, and temporal statistics of dynamical dislocation systems, and on the use of the results from this investigation to complete the kinetic description of dislocations. The second task focused on completing the formulation of a kinetic theory of dislocations that respects the discrete nature of crystallographic slip and the physics of dislocation motion and dislocation interaction in the crystal. Part of this effort also targeted the theoretical basis for establishing the connection between discrete and continuum representation of dislocations and the analysis of discrete dislocation simulation results within the continuum framework. This part of the research enables the enrichment of the kinetic description with information representing the discrete dislocation systems behavior. The third task focused on the development of physics-inspired numerical methods of solution of the coupled dislocation kinetics and crystal mechanics framework. To a large extent, this task has also been successfully started. We have developed a custom finite-element approach with mesh points being a subset of the underlying crystal structure. When used to predict the evolution of the dislocation system, the planar motion of dislocations is naturally captured for all slip systems, thus minimizing numerical errors and providing simple ways to investigate cross slip and dislocation reactions. Preliminary results in this direction show that we are closer than ever in building a predictive framework for dislocation dynamics and mesoscale plasticity based on the first principles of dislocation dynamics. The rest of the report gives and overview of the research performed under this project and highlights the key results and open questions left for future investigations.

36 MATERIALS SCIENCE↗

Numerical and boundary condition effects on the prediction of detonation engine behavior using detailed numerical simulations

High-fidelity numerical simulations of an experimental rotating detonation engine with discrete fuel/air injection were conducted. A series of configurations with different feed-plenum pressures but with constant equivalence ratio were studied. Detailed chemical kinetics for the hydrogen/air system is used. A resolution study for the full rotating detonation engine (RDE) system simulation is also conducted. Two kinds of boundary conditions, a total pressure boundary and a constant mass flow rate boundary, are used to assess the effects of the inlet boundary. As mass flow rate is increased, the total pressure boundary causes more error in the axial pressure distribution while the constant mass flow rate gives a better solution for all cases ran. The simulations confirm experimental findings, and reproduce qualitative as well as some of the quantitative trends. These results demonstrate that a) fuel-air mixing is highly non-uniform within the detonation chamber, leading to variations in local equivalence ratio, b) the fuel and oxidizer injectors experience significant backflow as the detonation wave passes over, but recover at different rates which further augments the inefficiencies in mixing, and c) parasitic combustion in the mixing region makes the detonation wave weak by extending the reaction zone across the wave.

33 ADVANCED PROPULSION SYSTEMS↗

An explicit, energy-conserving particle-in-cell scheme

We present an explicit temporal discretization of particle-in-cell schemes for the non-relativistic Vlasov equation that results in exact energy conservation when combined with an appropriate spatial discretization. The scheme is inspired by a simple, second-order explicit scheme that conserves energy exactly in the Eulerian context. We show that direct translation to particle-in-cell does not result in strict conservation, but derive a simple correction based on an analytically solvable optimization problem that recovers conservation. While this optimization problem is not guaranteed to have a real solution for every particle, we provide a correction that makes imaginary values extremely rare and still admits $\mathcal{O}$(10 –12 ) fractional errors in energy for practical simulation parameters. We present the scheme in both electrostatic – where we use the Ampère formulation – and electromagnetic contexts. With an electromagnetic field solve, the field update is most naturally linearly implicit, but the more computationally intensive particle update remains fully explicit. Here, we also show how the scheme can be extended to use the fully explicit leapfrog and pseudospectral analytic time-domain (PSATD) field solvers. The scheme is tested on standard kinetic plasma problems, confirming its conservation properties.

Energy conservation↗

Scalable line and plane relaxation in a parallel structured multigrid solver

The efficient solution of sparse, linear systems that arise through the discretization of partial differential equations remains a key challenge for a range of high performance scientific simulations. One approach for reducing data movement and improving performance is by exposing and exploiting structure in a problem through the use of robust structured multilevel solvers. By choosing coarsening that preserves the structure of the problem, these methods maintain efficient structured computation and communication throughout the multigrid hierarchy. However, when coarsening is not permitted to be dependent on the operator, anisotropy must be addressed by the smoother — producing error compatible for coarse-grid correction with structured coarsening. Here, the components required in a scalable parallel structured solver are described with a focus on memory and communication efficiency of robust smoothers. While the implementation of communication and memory reduction techniques in smoothers integrated in a complete 3D solver present a significant engineering challenge, a novel approach is proposed that addresses these challenges systematically through a change to the solver’s execution model. Enabled by user-level threading paired with a set of data and communication abstractions, this approach permits seamless aggregation of communication in plane smoothers — directly reusing code for a 2D distributed multilevel cycle. Results show an effective reduction in communication costs for coarse-grid problems, and result in a speedup of 8.7x in smoothing routines shown in Fig. 12 using this approach. This produces a significant improvement to strong scalability while maintaining favorable weak scaling behavior. Finally, a parallel scaling study using a series of refined meshes is included that demonstrates the effectiveness of this approach in an application of interest.

97 MATHEMATICS AND COMPUTING↗

Autonomous stabilization with programmable stabilized state

Reservoir engineering is a powerful technique to autonomously stabilize a quantum state. Traditional schemes involving multi-body states typically function for discrete entangled states. In this work, we enhance the stabilization capability to a continuous manifold of states with programmable stabilized state selection using multiple continuous tuning parameters. We experimentally achieve 84.6% and 82.5% stabilization fidelity for the odd and even-parity Bell states as two special points in the manifold. We also perform fast dissipative switching between these opposite parity states within 1.8 μs and 0.9 μs by sequentially applying different stabilization drives. Our result is a precursor for new reservoir engineering-based error correction schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A rigorous sequential update strategy for parallel kinetic Monte Carlo simulation

The kinetic Monte Carlo (kMC) method is used in many scientific fields in applications involving rare-event transitions. Due to its discrete stochastic nature, efforts to parallelize kMC approaches often produce unbalanced time evolutions requiring complex implementations to ensure correct statistics. In the context of parallel kMC, the sequential update technique has shown promise by generating high quality distributions with high relative efficiencies for short-range systems. In this work, we provide an extension of the sequential update method in a parallel context that rigorously obeys detailed balance, which guarantees exact equilibrium statistics for all parallelization settings. Furthermore, our approach also preserves nonequilibrium dynamics with minimal error for many parallelization settings, and can be used to achieve highly precise sampling.

36 MATERIALS SCIENCE↗

Monitoring radiation use in cardiac fluoroscopy imaging procedures

Purpose: Timely identification of systematic changes in radiation delivery of an imaging system can lead to a reduction in risk for the patients involved. However, existing quality assurance programs involving the routine testing of equipment performance using phantoms are limited in their ability to effectively carry out this task. To address this issue, the authors propose the implementation of an ongoing monitoring process that utilizes procedural data to identify unexpected large or small radiation exposures for individual patients, as well as to detect persistent changes in the radiation output of imaging platforms. Methods: Data used in this study were obtained from records routinely collected during procedures performed in the cardiac catheterization imaging facility at St. Andrew's War Memorial Hospital, Brisbane, Australia, over the period January 2008-March 2010. A two stage monitoring process employing individual and exponentially weighted moving average (EWMA) control charts was developed and used to identify unexpectedly high or low radiation exposure levels for individual patients, as well as detect persistent changes in the radiation output delivered by the imaging systems. To increase sensitivity of the charts, we account for variation in dose area product (DAP) values due to other measured factors (patient weight, fluoroscopy time, and digital acquisition frame count) using multiple linear regression. Control charts are then constructed using the residual values from this linear regression. The proposed monitoring process was evaluated using simulation to model the performance of the process under known conditions. Results: Retrospective application of this technique to actual clinical data identified a number of cases in which the DAP result could be considered unexpected. Most of these, upon review, were attributed to data entry errors. The charts monitoring the overall system radiation output trends demonstrated changes in equipment performance associated with relocation of the equipment to a new department. When tested under simulated conditions, the EWMA chart was capable of detecting a sustained 15% increase in average radiation output within 60 cases (<1 month of operation), while a 33% increase would be signaled within 20 cases. Conclusions: This technique offers a valuable enhancement to existing quality assurance programs in radiology that rely upon the testing of equipment radiation output at discrete time frames to ensure performance security.

60 APPLIED LIFE SCIENCES↗

An overlapping domain decomposition method for large-scale problems

Discretization of dynamical models defined through partial differential equations leads to large-scale systems. Time-depending condition involves an iterative integration of such kind of systems. In this paper, a novel technique based on overlapped domain decomposition, without preconditioner and scalable, is presented. Due to the domain decomposition, subproblems are solved in parallel without communications, cutting off the computation time and optimizing the computational cost. This direct method describes an optimized parallel strategy to solve the initial problem, providing the exact solution, up to rounding errors. Moreover, it takes into account both physical nature of the problem and deriving numerical properties of the system. It is highly recommended in case of band matrices and a long time interval because of an increasing gain in terms of performance and computational cost with the number of integrations. A deep analysis of the computational cost concludes the paper.

97 MATHEMATICS AND COMPUTING↗

Discrete Green’s functions and spectral graph theory for computationally efficient thermal modeling

Here, this work concerns solutions of the heat equation with the spectral graph method, for which the temperature is defined at discrete points in the domain and the spatial relationship among the points is described by a graph. The heat equation on the graph is solved using matrix techniques involving the eigenvectors and eigenvalues of the Laplacian matrix. The spectral graph approach precludes the computationally intensive meshing and numerous time-integration steps of the finite element method. In the present work, the spectral graph method is extended to include heat loss at the boundaries with a generalized boundary condition, and physics-based edge weights are introduced which simplify the calibration process. From this approach a discrete Green’s function is defined which allows for solutions under a variety of heating conditions including: space-varying initial conditions; time-and-space varying internal heating; and, time-and-space-varying heating at boundaries of type 1 (Dirichlet), type 2 (Neumann) and type 3 (Robin). Results are provided for benchmark heat transfer problems in one spatial dimension and in three spatial dimensions, and verification is provided by comparison with exact analytical solutions and finite difference solutions. The spectral graph method converges within 0.4% error of the analytical solution. The practical utility of the approach is demonstrated by thermal simulation of a multilayer additive manufacturing process. The spectral graph results are compared to experimentally-obtained temperature data for two metal parts, with error less than 5% of the experimental measurements, with computation time less than one minute on a desktop computer.

36 MATERIALS SCIENCE↗

High-Precision Determination of the {pi}, K, D, and D{sub s} Decay Constants from Lattice QCD

We determine D and D{sub s} decay constants from lattice QCD with 2% errors, 4 times better than experiment and previous theory: f{sub D{sub s}}=241(3) MeV, f{sub D}=207(4) MeV, and f{sub D{sub s}}/f{sub D}=1.164(11). We also obtain f{sub K}/f{sub {pi}}=1.189(7) and (f{sub D{sub s}}/f{sub D})/(f{sub K}/f{sub {pi}})=0.979(11). Combining with experiment gives V{sub us}=0.2262(14) and V{sub cs}/V{sub cd} of 4.43(41). We use a highly improved quark discretization on MILC gluon fields that include realistic sea quarks, fixing the u/d, s, and c masses from the {pi}, K, and {eta}{sub c} meson masses. This allows a stringent test against experiment for D and D{sub s} masses for the first time (to within 7 MeV)

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗