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 1,135 records · Page 63

A software‐defined networks ‐based measurement method of network traffic for 6G technologies

Abstract In software‐defined networks (SDN) for 6G technologies, the controller should accurately and efficiently measure the flow traffic in switches for traffic engineering. Fine‐grained flow measurement can more accurately describe the traffic in the network, but it also consumes much more resources. To reduce the overhead incurred in the measurement process and obtain the approximate fine‐grained measurements, we propose a novel lightweight measurement scheme that runs in the controller. The novel lightweight measurement architecture consists of two parts: coarse‐grained measurement and interpolation‐optimization. In the first part, based on the SDN architecture, we use the pull‐based random sampling method to quickly obtain the coarse‐grained measurement of flow traffic through OpenFlow protocol. In the second part, we insert some discrete values into the coarse‐grained measurement with the interpolation theory, then we optimize interpolation results until finding the optimal fine‐grained flow traffic measurement by utilizing the multiconstraint method. We verified the feasibility of the proposed measurement method, and simulation results show that the measurement error of the proposed method is under 25%, but the flow measurement overhead of this method occupies only 3.3% compared with that of the fine‐grained method.

Huo, Liuwei↗

A robust fourth-order finite-difference discretization for the strongly anisotropic transport equation in magnetized plasmas

We propose a second-order temporally implicit, fourth-order-accurate spatial discretization scheme for the strongly anisotropic heat transport equation characteristic of hot, fusion-grade plasmas. Following Du Toit et al. (2018), the scheme transforms mixed-derivative diffusion fluxes (which are responsible for the lack of a discrete maximum principle) into nonlinear advective fluxes, amenable to nonlinear-solver-friendly monotonicity-preserving limiters. The scheme enables accurate multi-dimensional heat transport simulations with up to seven orders of magnitude of heat-transport-coefficient anisotropies with low cross-field numerical error pollution and excellent algorithmic performance, with the number of linear iterations scaling very weakly with grid resolution and grid anisotropy, and scaling with the square-root of the implicit timestep. We propose a multigrid preconditioning strategy based on a lower-order approximation that renders the scheme efficient and scalable under grid refinement. Several numerical tests are presented that display the expected spatial convergence rates and strong algorithmic performance, including fully nonlinear magnetohydrodynamics simulations of kink instabilities in a Bennett pinch in 2D helical geometry and of ITER in 3D toroidal geometry.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A model and variance reduction method for computing statistical outputs of stochastic elliptic partial differential equations

We present a model and variance reduction method for the fast and reliable computation of statistical outputs of stochastic elliptic partial differential equations. Our method consists of three main ingredients: (1) the hybridizable discontinuous Galerkin (HDG) discretization of elliptic partial differential equations (PDEs), which allows us to obtain high-order accurate solutions of the governing PDE; (2) the reduced basis method for a new HDG discretization of the underlying PDE to enable real-time solution of the parameterized PDE in the presence of stochastic parameters; and (3) a multilevel variance reduction method that exploits the statistical correlation among the different reduced basis approximations and the high-fidelity HDG discretization to accelerate the convergence of the Monte Carlo simulations. The multilevel variance reduction method provides efficient computation of the statistical outputs by shifting most of the computational burden from the high-fidelity HDG approximation to the reduced basis approximations. Furthermore, we develop a posteriori error estimates for our approximations of the statistical outputs. Based on these error estimates, we propose an algorithm for optimally choosing both the dimensions of the reduced basis approximations and the sizes of Monte Carlo samples to achieve a given error tolerance. We provide numerical examples to demonstrate the performance of the proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An arbitrary-order Runge–Kutta discontinuous Galerkin approach to reinitialization for banded conservative level sets

Here, we present a Runge-Kutta discontinuous Galerkin method for solving conservative reinitialization in the context of the conservative level set method. This represents an extension of the method recently proposed by Owkes and Desjardins [21], by solving the level set equations on the refined level set grid and projecting all spatially-dependent variables into the full basis used by the discontinuous Galerkin discretization. By doing so, we achieve the full k+1 order convergence rate in the L1 norm of the level set field predicted for RKDG methods given kth degree basis functions when the level set profile thickness is held constant with grid refinement. Shape and volume errors for the 0.5-contour of the level set, on the other hand, are found to converge between first and second order. We show a variety of test results, including the method of manufactured solutions, reinitialization of a circle and sphere, Zalesak's disk, and deforming columns and spheres, all showing substantial improvements over the high-order finite difference traditional level set method studied for example by Herrmann. We also demonstrate the need for kth order accurate normal vectors, as lower order normals are found to degrade the convergence rate of the method.

97 MATHEMATICS AND COMPUTING↗

Near-field acoustic microbead trapping as remote anchor for single particle manipulation

We recently proposed an analytical model of a two-dimensional acoustic trapping of polystyrene beads in the ray acoustics regime, where a bead diameter is larger than the wavelength used. As its experimental validation, this paper demonstrates the transverse (or lateral) trapping of individual polystyrene beads in the near field of focused ultrasound. A 100 μm bead is immobilized on the central beam axis by a focused sound beam from a 30 MHz single element lithium niobate transducer, after being laterally displaced through hundreds of micrometers. Maximum displacement, a longest lateral distance at which a trapped bead can be directed towards the central axis, is thus measured over a discrete frequency range from 24 MHz to 36 MHz. The displacement data are found to be between 323.7 μm and 470.2 μm, depending on the transducer's driving frequency and input voltage amplitude. The experimental results are compared with their corresponding model values, and their relative errors lie between 0.9% and 3.9%. The results suggest that this remote maneuvering technique may be employed to manipulate individual cells through solid microbeads, provoking certain cellular reactions to localized mechanical disturbance without direct contact.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scaling methods for accelerating kinetic Monte Carlo simulations of chemical reaction networks

Various kinetic Monte Carlo algorithms become inefficient when some of the population sizes in a system are large, which gives rise to a large number of reaction events per unit time. In this work, we present a new acceleration algorithm based on adaptive and heterogeneous scaling of reaction rates and stoichiometric coefficients. The algorithm is conceptually related to the commonly used idea of accelerating a stochastic simulation by considering a subvolume λΩ (0 < λ < 1) within a system of interest, which reduces the number of reaction events per unit time occurring in a simulation by a factor 1/λ at the cost of greater error in unbiased estimates of first moments and biased overestimates of second moments. Our new approach offers two unique benefits. First, scaling is adaptive and heterogeneous, which eliminates the pitfall of overaggressive scaling. Second, there is no need for an a priori classification of populations as discrete or continuous (as in a hybrid method), which is problematic when discreteness of a chemical species changes during a simulation. The method requires specification of only a single algorithmic parameter, N c , a global critical population size above which populations are effectively scaled down to increase simulation efficiency. The method, which we term partial scaling, is implemented in the open-source BioNetGen software package. We demonstrate that partial scaling can significantly accelerate simulations without significant loss of accuracy for several published models of biological systems. Finally, these models characterize activation of the mitogen-activated protein kinase ERK, prion protein aggregation, and T-cell receptor signaling.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Marine Corps Base Camp Lejeune NRE Carbon Flux

Critical military training and testing on lands along the nation’s coastal and estuarine shorelines are increasingly placed at risk because of encroachment pressures in surrounding areas, impairments due to other anthropogenic disturbances, and changes in climate and sea level. The U.S. Department of Defense (DoD) intends to enhance and sustain its training and testing assets and also optimize its stewardship of natural resources through the development and application of an ecosystem-based management approach on DoD installations. To accomplish this goal, particularly for installations in estuarine/coastal environments, the Strategic Environmental Research and Development Program (SERDP) launched the Defense Coastal/Estuarine Research Program (DCERP) as a 10-year effort at Marine Corps Base Camp Lejeune (MCBCL) in North Carolina. The results of the second 5 years of the program (DCERP2) are presented in the DCERP2 Final Report.There were four overarching objectives of DCERP2. The first objective was to understand the effects of climate change impacts, including warming temperatures, variability in the hydrological cycle, storm events, and sea level rise on the coastal ecosystems at MCBCL from observations and measurements made over the 10-year program. The second objective was to understand the carbon cycle of the coastal and terrestrial ecosystems at MCBCL through a highly integrated sampling program. The third objective was to develop models, tools, and indicators to evaluate current and projected future ecosystem state changes and translate scientific findings into actionable information for installation managers. The last objective was to recommend adaptive management strategies to sustain ecosystem natural resources within the context of an active military installation.In situ CO2 sensors were deployed on the AVPs at Stones Bay and Morgans Bay between AEM-1 ongoing bi-monthly discrete sampling events. CO2 fluxes were calculated using measured pCO2, and pCO2 estimated based on a linear interpolation of measured pCO2 (between start and end of each deployment). The intention of this dataset is to asses whether such a linear interpolation of pCO2 introduces a significant error to CO2 flux calculations.

54 ENVIRONMENTAL SCIENCES↗

State estimation with small nonlinearities

A variety of techniques is available for estimating the states of nonlinear dynamic systems from noisy data. The differences among several of these procedures in the presence of small dynamic and observational nonlinearities are investigated. Four discrete estimation algorithms are analyzed. The first is a strictly least square estimator, while the others are recursive algorithms similar to the Kalman filter used for estimating the states of linear systems. A group of analytic expressions is developed for the mean and covariance of the error in each of these estimators so that they may be compared without lengthy Monte Carlo simulations. The covariance expressions show that, to first order, all the estimators have the same covariance. Expressions for the means show that each estimator has a different bias. Several examples are carried out demonstrating that the relative magnitudes of the bias errors in the various estimators can be a strong function of such parameters as initial covariances and number of data points. Under some circumstances, more complicated algorithms can have larger biases than smaller ones.

Conrad, B.↗

Establishment of a rotor model basis

Radial-dimension computations in the RSRA's blade-element model are modified for both the acquisition of extensive baseline data and for real-time simulation use. The baseline data, which are for the evaluation of model changes, use very small increments and are of high quality. The modifications to the real-time simulation model are for accuracy improvement, especially when a minimal number of blade segments is required for real-time synchronization. An accurate technique for handling tip loss in discrete blade models is developed. The mathematical consistency and convergence properties of summation algorithms for blade forces and moments are examined and generalized integration coefficients are applied to equal-annuli midpoint spacing. Rotor conditions identified as 'constrained' and 'balanced' are used and the propagation of error is analyzed.

Mcfarland, R. E.↗

VLSI Architectures for Computing DFT's

Simplifications result from use of residue Fermat number systems. System of finite arithmetic over residue Fermat number systems enables calculation of discrete Fourier transform (DFT) of series of complex numbers with reduced number of multiplications. Computer architectures based on approach suitable for design of very-large-scale integrated (VLSI) circuits for computing DFT's. General approach not limited to DFT's; Applicable to decoding of error-correcting codes and other transform calculations. System readily implemented in VLSI.

Truong, T. K.↗

Learning control for slewing of a flexible panel

This paper studies the applicability of a discrete-time learning control method to the slewing control of a large flexible panel. Among the issues discussed are feasibility of the desired trajectories and their specification schemes, learning control by linear feedback, limitation of the actuator device output, and robustness to parameter changes or modeling errors associated with the chosen learning control design. To demonstrate the effectiveness of learning control, the system is designed with a proportional controller of the base angle only. Then application of the learning control is shown to make the system learn quickly to achieve the desired slewing without residual vibration at the end of the maneuver. Simulation results are reported and discussed.

Phan, M.↗

Adjoints and Low-rank Covariance Representation

Quantitative measures of the uncertainty of Earth System estimates can be as important as the estimates themselves. Second moments of estimation errors are described by the covariance matrix, whose direct calculation is impractical when the number of degrees of freedom of the system state is large. Ensemble and reduced-state approaches to prediction and data assimilation replace full estimation error covariance matrices by low-rank approximations. The appropriateness of such approximations depends on the spectrum of the full error covariance matrix, whose calculation is also often impractical. Here we examine the situation where the error covariance is a linear transformation of a forcing error covariance. We use operator norms and adjoints to relate the appropriateness of low-rank representations to the conditioning of this transformation. The analysis is used to investigate low-rank representations of the steady-state response to random forcing of an idealized discrete-time dynamical system.

Tippett, Michael K.↗

Quantifying Contaminant Mass for the Feasibility Study of the DuPont Chambers Works FUSRAP Site - 13510

The U.S. Army Corps of Engineers (USACE) - Philadelphia District is conducting an environmental restoration at the DuPont Chambers Works in Deepwater, New Jersey under the Formerly Utilized Sites Remedial Action Program (FUSRAP). Discrete locations are contaminated with natural uranium, thorium-230 and radium-226. The USACE is proposing a preferred remedial alternative consisting of excavation and offsite disposal to address soil contamination followed by monitored natural attenuation to address residual groundwater contamination. Methods were developed to quantify the error associated with contaminant volume estimates and use mass balance calculations of the uranium plume to estimate the removal efficiency of the proposed alternative. During the remedial investigation, the USACE collected approximately 500 soil samples at various depths. As the first step of contaminant mass estimation, soil analytical data was segmented into several depth intervals. Second, using contouring software, analytical data for each depth interval was contoured to determine lateral extent of contamination. Six different contouring algorithms were used to generate alternative interpretations of the lateral extent of the soil contamination. Finally, geographical information system software was used to produce a three dimensional model in order to present both lateral and vertical extent of the soil contamination and to estimate the volume of impacted soil for each depth interval. The average soil volume from all six contouring methods was used to determine the estimated volume of impacted soil. This method also allowed an estimate of a standard deviation of the waste volume estimate. It was determined that the margin of error for the method was plus or minus 17% of the waste volume, which is within the acceptable construction contingency for cost estimation. USACE collected approximately 190 groundwater samples from 40 monitor wells. It is expected that excavation and disposal of contaminated soil will remove the contaminant source zone and significantly reduce contaminant concentrations in groundwater. To test this assumption, a mass balance evaluation was performed to estimate the amount of dissolved uranium that would remain in the groundwater after completion of soil excavation. As part of this evaluation, average groundwater concentrations for the pre-excavation and post-excavation aquifer plume area were calculated to determine the percentage of plume removed during excavation activities. In addition, the volume of the plume removed during excavation dewatering was estimated. The results of the evaluation show that approximately 98% of the aqueous uranium would be removed during the excavation phase. The USACE expects that residual levels of contamination will remain in groundwater after excavation of soil but at levels well suited for the selection of excavation combined with monitored natural attenuation as a preferred alternative. (authors)

54 ENVIRONMENTAL SCIENCES↗

Preliminary Analysis of Facility Design for Pyro-processing Safeguardability

The deployment of advanced nuclear energy systems can assure sustainable energy use worldwide. For some of these systems, nuclear fuel will be fabricated in remotely-handled facilities in which batch-type processing will occur in heavily-shielded hot cells. Because special nuclear material is in both different physical and chemical form than that of the contemporary fuel cycle, new challenges have arisen in terms of safeguards, safety, and security, integrated with facility design; i.e., safeguardability. There is a need to develop models that can quantitatively assess safeguardability from a design-driven perspective. Previously, the first build of a material throughput model was established using discrete event simulation (DES) for the fuel fabrication process. Results showed that the DES model potentially can detect diversion attempts. This paper continues the study by further developing the the model. We test the use of the probability of the false alarm; i.e., the Type I error, as a metric for safeguardability assessment. Initiating events leading to a false alarm arise from aspects of safeguards, safety, and security. Different conceptual facility designs could exhibit different frequencies for the Type I error, and this could provide a measure of the safeguardability of each design. A quantitative assessment for safeguardable facility designs has not been developed in this manner. Much of the research into safeguardability has been qualitative. Engineering design approaches for a safeguardable facility are now needed. As there are not accepted metrics for safeguardability assessment, our motivation is to develop this design facet of safeguardability further.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Automated Weight-Window Generation for Threat Detection Applications Using ADVANTG

Deterministic transport codes have been used for some time to generate weight-window parameters that can improve the efficiency of Monte Carlo simulations. As the use of this hybrid computational technique is becoming more widespread, the scope of applications in which it is being applied is expanding. An active source of new applications is the field of homeland security--particularly the detection of nuclear material threats. For these problems, automated hybrid methods offer an efficient alternative to trial-and-error variance reduction techniques (e.g., geometry splitting or the stochastic weight window generator). The ADVANTG code has been developed to automate the generation of weight-window parameters for MCNP using the Consistent Adjoint Driven Importance Sampling method and employs the TORT or Denovo 3-D discrete ordinates codes to generate importance maps. In this paper, we describe the application of ADVANTG to a set of threat-detection simulations. We present numerical results for an 'active-interrogation' problem in which a standard cargo container is irradiated by a deuterium-tritium fusion neutron generator. We also present results for two passive detection problems in which a cargo container holding a shielded neutron or gamma source is placed near a portal monitor. For the passive detection problems, ADVANTG obtains an O(10{sup 4}) speedup and, for a detailed gamma spectrum tally, an average O(10{sup 2}) speedup relative to implicit-capture-only simulations, including the deterministic calculation time. For the active-interrogation problem, an O(10{sup 4}) speedup is obtained when compared to a simulation with angular source biasing and crude geometry splitting.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quadratic pseudospectrum for identifying localized states

Here we examine the utility of the quadratic pseudospectrum for understanding and detecting states that are somewhat localized in position and energy, in particular, in the context of condensed matter physics. Specifically, the quadratic pseudospectrum represents a method for approaching systems with incompatible observables {A j |1 ≤ j ≤ d} as it minimizes collectively the errors $\parallel$A j v - λ j v$\parallel$ while defining a joint approximate spectrum of incompatible observables. Moreover, we derive an important estimate relating the Clifford and quadratic pseudospectra. Finally, we prove that the quadratic pseudospectrum is local and derive the bounds on the errors that are incurred by truncating the system in the vicinity of where the pseudospectrum is being calculated.

97 MATHEMATICS AND COMPUTING↗

YARNsim: Simulating Hadoop YARN

Despite the popularity of the Apache Hadoop system, its success has been limited by issues such as single points of failure, centralized job/task management, and lack of support for programming models other than MapReduce. The next generation of Hadoop, Apache Hadoop YARN, is designed to address these issues. In this paper, we propose YARNsim, a simulation system for Hadoop YARN. YARNsim is based on parallel discrete event simulation and provides protocol-level accuracy in simulating key components of YARN. YARNsim provides a virtual platform on which system architects can evaluate the design and implementation of Hadoop YARN systems. Also, application developers can tune job performance and understand the tradeoffs between different configurations, and Hadoop YARN system vendors can evaluate system efficiency under limited budgets. To demonstrate the validity of YARNsim, we use it to model two real systems and compare the experimental results from YARNsim and the real systems. The experiments include standard Hadoop benchmarks, synthetic workloads, and a bioinformatics application. The results show that the error rate is within 10% for the majority of test cases. The experiments prove that YARNsim can provide what-if analysis for system designers in a timely manner and at minimal cost compared with testing and evaluating on a real system.

Hadoop↗

Machine learning a molecular Hamiltonian for predicting electron dynamics

We develop a computational method to learn a molecular Hamiltonian matrix from matrix-valued time series of the electron density. As we demonstrate for three small molecules, the resulting Hamiltonians can be used for electron density evolution, producing highly accurate results even when propagating 1,000 time steps beyond the training data. As a more rigorous test, we use the learned Hamiltonians to simulate electron dynamics in the presence of an applied electric field, extrapolating to a problem that is beyond the field-free training data. We find that the resulting electron dynamics predicted by our learned Hamiltonian are in close quantitative agreement with the ground truth. Our method relies on combining a reduced-dimensional, linear statistical model of the Hamiltonian with a time-discretization of the quantum Liouville equation within time-dependent Hartree Fock theory. In conclusion, we train the model using a least-squares solver, avoiding numerous, CPU-intensive optimization steps. For both field-free and field-on problems, we quantify training and propagation errors, highlighting areas for future development.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗