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,585 records · Page 88

An Anisotropic Fluid-Solid Model of the Mouse Heart

A critical challenge in biomechanical simulations is the spatial discretization of complex fluid-solid geometries created from imaging. This is especially important when dealing with Lagrangian interfaces, as there must be at a minimum both geometric and topological compatibility between fluid and solid phases, with exact matching of the interfacial nodes being highly desirable. We have developed a solution to this problem and applied the approach to the creation of a 3D fluidsolid mesh of the mouse heart. First, a 50 micron isotropic MRI dataset of a perfusion-fixed mouse heart was segmented into blood, tissue, and background using a customized multimaterial connected fuzzy thresholding algorithm. Then, a multimaterial marching cubes algorithm was applied to produce two compatible isosurfaces, one for the blood-tissue boundary and one for the tissue-background boundary. A multimaterial smoothing algorithm that rigorously conserves volume for each phase simultaneously smoothed the isosurfaces. Next we applied novel automated meshing algorithms to generate anisotropic hybrid meshes with the number of layers and the desired element anisotropy for each material as the only input parameters. As the meshes are scale-invariant within a material and include boundary layer prisms, fluid-structure interaction computations would have a relative error equilibrated over the entire mesh. The resulting model is highly detailed mesh representation of the mouse heart, including features such as chordae and coronary vasculature, that is also maximally efficient to produce the best simulation results for the computational resources available

59 BASIC BIOLOGICAL SCIENCES↗

Performance analysis of a finite radon transform in OFDM system under different channel models

In this paper, a class of discrete Radon transforms namely Finite Radon Transform (FRAT) was proposed as a modulation technique in the realization of Orthogonal Frequency Division Multiplexing (OFDM). The proposed FRAT operates as a data mapper in the OFDM transceiver instead of the conventional phase shift mapping and quadrature amplitude mapping that are usually used with the standard OFDM based on Fast Fourier Transform (FFT), by the way that ensure increasing the orthogonality of the system. The Fourier domain approach was found here to be the more suitable way for obtaining the forward and inverse FRAT. This structure resulted in a more suitable realization of conventional FFT- OFDM. It was shown that this application increases the orthogonality significantly in this case due to the use of Inverse Fast Fourier Transform (IFFT) twice, namely, in the data mapping and in the sub-carrier modulation also due to the use of an efficient algorithm in determining the FRAT coefficients called the optimal ordering method. The proposed approach was tested and compared with conventional OFDM, for additive white Gaussian noise (AWGN) channel, flat fading channel, and multi-path frequency selective fading channel. The obtained results showed that the proposed system has improved the bit error rate (BER) performance by reducing inter-symbol interference (ISI) and inter-carrier interference (ICI), comparing with conventional OFDM system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spline-Based Smoothing of Airfoil Curvatures

Constrained fitting for airfoil curvature smoothing (CFACS) is a splinebased method of interpolating airfoil surface coordinates (and, concomitantly, airfoil thicknesses) between specified discrete design points so as to obtain smoothing of surface-curvature profiles in addition to basic smoothing of surfaces. CFACS was developed in recognition of the fact that the performance of a transonic airfoil is directly related to both the curvature profile and the smoothness of the airfoil surface. Older methods of interpolation of airfoil surfaces involve various compromises between smoothing of surfaces and exact fitting of surfaces to specified discrete design points. While some of the older methods take curvature profiles into account, they nevertheless sometimes yield unfavorable results, including curvature oscillations near end points and substantial deviations from desired leading-edge shapes. In CFACS as in most of the older methods, one seeks a compromise between smoothing and exact fitting. Unlike in the older methods, the airfoil surface is modified as little as possible from its original specified form and, instead, is smoothed in such a way that the curvature profile becomes a smooth fit of the curvature profile of the original airfoil specification. CFACS involves a combination of rigorous mathematical modeling and knowledge-based heuristics. Rigorous mathematical formulation provides assurance of removal of undesirable curvature oscillations with minimum modification of the airfoil geometry. Knowledge-based heuristics bridge the gap between theory and designers best practices. In CFACS, one of the measures of the deviation of an airfoil surface from smoothness is the sum of squares of the jumps in the third derivatives of a cubicspline interpolation of the airfoil data. This measure is incorporated into a formulation for minimizing an overall deviation- from-smoothness measure of the airfoil data within a specified fitting error tolerance. CFACS has been extensively tested on a number of supercritical airfoil data sets generated by inverse design and optimization computer programs. All of the smoothing results show that CFACS is able to generate unbiased smooth fits of curvature profiles, trading small modifications of geometry for increasing curvature smoothness by eliminating curvature oscillations and bumps (see figure).

Li, W.↗

TH-CD-207B-11: Multi-Vendor Phantom Study of CT Lung Density Metrics: Is a Reproducibility of Less Than 1 HU Achievable?

Purpose: To standardize the calibration procedures of CT lung density measurements using low-density reference foams in a phantom, and to demonstrate a reproducibility of less than 1 HU for lung equivalent foam densities measured across CT vendor platforms and protocols. Methods: A phantom study was conducted on CT scanner models from 4 vendors at 100, 120, and 135/140 kVp and 1.5, 3, and 6 mGy dose settings, using a lung density phantom containing air, water, and 3 reference foams (indirectly calibrated) with discrete densities simulating a 5-cm slice of the human chest. Customized segmentation software was used to analyze the images and generate a mean HU and variance for each of the density for the 22 vendor/protocols. A 3-step calibration process was devised to remove a scanner-dependent parameter using linear regression of the HU value vs the relative electron density. The results were mapped to a single energy (80 keV) for final comparison. Results: The heterogeneity across vendor platforms for each density assessed by a random effects model was reduced by 50% after re-calibration, while the standard deviation of the mean HU values also improved by about the same amount. The 95% CI of the final HU value was within +/−1 HU for all 3 reference foam densities. For the backing lung foam in the phantom (served as an “unknown”), this CI is +/− 1.6 HU. The kVp and dose settings did not appear to have significant contributions to the variability. Conclusion: With the proposed calibration procedures, the inter-scanner reproducibility of better than 1 HU is demonstrated in the current phantom study for the reference foam densities, but not yet achieved for a test density. The sources of error are being investigated in the next round of scanning with a certified Standard Reference Material for direct calibration. Fain: research funding from GE Healthcare to develop pulmonary MRI techniques. Hoppel: employee of Toshiba Medical Research Institute USA/financial interest with GE Healthcare. M. Fuld: employee of Siemens Healthcare for medical device equipment and software. This project is supported partially by RSNA QIBA Concept Award (Fain), NIH/NIBIB, HHSN268201300071C (Y).

60 APPLIED LIFE SCIENCES↗

Cascade Error Projection: A Learning Algorithm for Hardware Implementation

In this paper, we workout a detailed mathematical analysis for a new learning algorithm termed Cascade Error Projection (CEP) and a general learning frame work. This frame work can be used to obtain the cascade correlation learning algorithm by choosing a particular set of parameters. Furthermore, CEP learning algorithm is operated only on one layer, whereas the other set of weights can be calculated deterministically. In association with the dynamical stepsize change concept to convert the weight update from infinite space into a finite space, the relation between the current stepsize and the previous energy level is also given and the estimation procedure for optimal stepsize is used for validation of our proposed technique. The weight values of zero are used for starting the learning for every layer, and a single hidden unit is applied instead of using a pool of candidate hidden units similar to cascade correlation scheme. Therefore, simplicity in hardware implementation is also obtained. Furthermore, this analysis allows us to select from other methods (such as the conjugate gradient descent or the Newton's second order) one of which will be a good candidate for the learning technique. The choice of learning technique depends on the constraints of the problem (e.g., speed, performance, and hardware implementation); one technique may be more suitable than others. Moreover, for a discrete weight space, the theoretical analysis presents the capability of learning with limited weight quantization. Finally, 5- to 8-bit parity and chaotic time series prediction problems are investigated; the simulation results demonstrate that 4-bit or more weight quantization is sufficient for learning neural network using CEP. In addition, it is demonstrated that this technique is able to compensate for less bit weight resolution by incorporating additional hidden units. However, generation result may suffer somewhat with lower bit weight quantization.

Duong, Tuan A.↗

Adaptive laser link reconfiguration using constraint propagation

This paper describes Harris AI research performed on the Adaptive Link Reconfiguration (ALR) study for Rome Lab, and focuses on the application of constraint propagation to the problem of link reconfiguration for the proposed space based Strategic Defense System (SDS) Brilliant Pebbles (BP) communications system. According to the concept of operations at the time of the study, laser communications will exist between BP's and to ground entry points. Long-term links typical of RF transmission will not exist. This study addressed an initial implementation of BP's based on the Global Protection Against Limited Strikes (GPALS) SDI mission. The number of satellites and rings studied was representative of this problem. An orbital dynamics program was used to generate line-of-site data for the modeled architecture. This was input into a discrete event simulation implemented in the Harris developed COnstraint Propagation Expert System (COPES) Shell, developed initially on the Rome Lab BM/C3 study. Using a model of the network and several heuristics, the COPES shell was used to develop the Heuristic Adaptive Link Ordering (HALO) Algorithm to rank and order potential laser links according to probability of communication. A reduced set of links based on this ranking would then be used by a routing algorithm to select the next hop. This paper includes an overview of Constraint Propagation as an Artificial Intelligence technique and its embodiment in the COPES shell. It describes the design and implementation of both the simulation of the GPALS BP network and the HALO algorithm in COPES. This is described using a 59 Data Flow Diagram, State Transition Diagrams, and Structured English PDL. It describes a laser communications model and the heuristics involved in rank-ordering the potential communication links. The generation of simulation data is described along with its interface via COPES to the Harris developed View Net graphical tool for visual analysis of communications networks. Conclusions are presented, including a graphical analysis of results depicting the ordered set of links versus the set of all possible links based on the computed Bit Error Rate (BER). Finally, future research is discussed which includes enhancements to the HALO algorithm, network simulation, and the addition of an intelligent routing algorithm for BP.

Crone, M. S.↗

Simulating scalar field theories on quantum computers with limited resources

Here we present a quantum algorithm for implementing φ 4 lattice scalar field theory on qubit computers. The field is represented in the discretized field amplitude basis. The number of qubits and elementary gates required by the implementation of the evolution operator is proportional to the lattice size. The algorithm allows efficient φ 4 state preparation for a large range of input parameters in both the normal and broken-symmetry phases. The states are prepared using a combination of variational and adiabatic evolution methods. First, the ground state of a local Hamiltonian, which includes the φ 4 self-interaction, is prepared using short variational circuits. Next, this state is evolved by switching on the coupling between the lattice sites adiabatically. The parameters defining the local Hamiltonian are adjustable and constitute the input of our algorithm. We present a method to optimize these parameters in order to reduce the adiabatic time required for state preparation. For preparing broken-symmetry states, the adiabatic evolution problems caused by crossing the phase transition critical line and by the degeneracy of the broken-symmetry ground state can be addressed using an auxiliary external field which gradually turns off during the adiabatic process. We show that the time dependence of the external field during the adiabatic evolution is important for addressing the broken-symmetry ground state degeneracy. The adiabatic time dependence on the inverse error tolerance can be reduced from quadratic to linear by using a field strength that decreases exponentially in time relative to one that decreases linearly.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A high-order vertex-based central ENO finite-volume scheme for three-dimensional compressible flows

High-order discretization methods offer the potential to reduce the computational cost associated with modeling compressible flows. However, it is difficult to obtain accurate high-order discretizations of conservation laws that do not produce spurious oscillations near discontinuities, especially on multi-dimensional unstructured meshes. A novel, high-order, central essentially non-oscillatory (CENO) finite-volume method that does not have these difficulties is proposed for tetrahedral meshes. The proposed unstructured method is vertex-based, which differs from existing cell-based CENO formulations, and uses a hybrid reconstruction procedure that switches between two different solution representations. It applies a high-order k-exact reconstruction in smooth regions and a limited linear reconstruction when discontinuities are encountered. Both reconstructions use a single, central stencil for all variables, making the application of CENO to arbitrary unstructured meshes relatively straightforward. The new approach was applied to the conservation equations governing compressible flows and assessed in terms of accuracy and computational cost. For all problems considered, which included various function reconstructions and idealized flows, CENO demonstrated excellent reliability and robustness. Up to fifth-order accuracy was achieved in smooth regions and essentially non-oscillatory solutions were obtained near discontinuities. The high-order schemes were also more computationally efficient for high-accuracy solutions, i.e., they took less wall time than the lower-order schemes to achieve a desired level of error. In one particular case, it took a factor of 24 less wall-time to obtain a given level of error with the fourth-order CENO scheme than to obtain the same error with the second-order scheme.

97 MATHEMATICS AND COMPUTING↗

A reduced-order modeling of a tubular solar reactor for long duration thermochemical energy storage

The storage of solar energy in a solid form, referred to as a “solar fuel”, can be achieved through a process known as endothermic solar thermochemistry. This process transforms the absorbed solar energy into a stable and retrievable form that can be stored for extended periods of time. This paper presents a low–order heat transfer model of a counter–current tubular falling bed reactor designed to produce thermally reduced magnesium manganese oxide pellets for long duration thermochemical energy storage. The energy required for the endothermic reduction was supplied by concentrated solar energy or renewable electricity via indirect heating of the gas and solid reactants flowing in a ceramic tube. The counter-current gas flow enhances the mixing of the solid particles with the heat recuperation zone, allowing the gas and particles to enter and exit the tubular reactor close to room temperature. Further, the reactor was vertically oriented and was heated circumferentially by an adjustable level heat flux along a finite segment of its length. The temperature distribution of the reactor in response to transient changes along the tube was modeled by considering conduction, convection, and radiation heat transfer. Governing equations for the heat transfer model were solved by discretizing the reactor tube into a finite number of control volumes and using an energy balance for the heat exchange between the reactor wall, gas, and particles within the control volume. The energy absorbed during this endothermic reaction was modeled numerically by fitting the data of the chemical conversion rate with the corresponding temperature of particles in the heating zone. The numerical model has been experimentally validated using a reactor prototype made of a 121.92 cm alumina tube heated by a 7kW electric tube–furnace. The alumina tube receives magnesium manganese oxide pellets of 3.66±0.516 mm in diameter from the top, and a counter–current gas flow from the bottom. The reactor wall temperature was monitored by six thermocouples installed along the reactor tube length. The experimental procedure was numerically simulated, and the temperature variation along the reactor tube was compared with a matrix of experimental runs for a range of particles mass flowrates (0.75–1.25g/s) and corresponding gas flowrates (36–65 SLPM). The reactor system was heated gradually from room temperature to a steady state temperature of 1673K, and then cooled down to room temperature. The heating and cooling processes were simulated, and the numerical and experimental results were compared throughout processes. The numerical model showed similar trends to the experimental results, with an error of 0.69 to 7.9% for the particle inlet and 0.7 to 7.9% for the gas inlet during steady-state operation. The proposed numerical model can be implemented as a simplified physical model to design a feedback control system to regulate reactor temperature.

14 SOLAR ENERGY↗

$\mathrm{IH}$-$\mathrm{GAN}$: A conditional generative model for implicit surface-based inverse design of cellular structures

Variable-density cellular structures can overcome connectivity and manufacturability issues of topologically optimized structures, particularly those represented as discrete density maps. However, the optimization of such cellular structures is challenging due to the multiscale design problem. Past work addressing this problem generally either only optimizes the volume fraction of single-type unit cells but ignoring the effects of unit cell geometry on properties, or considers the geometry–property relation but builds this relation via heuristics. In contrast, we propose a simple yet more principled way to accurately model the property to geometry mapping using a conditional deep generative model, named Inverse Homogenization Generative Adversarial Network (IH-GAN). It learns the conditional distribution of unit cell geometries given properties and can realize the one-to-many mapping from properties to geometries. Here we further reduce the complexity of IH-GAN by using the implicit function parameterization to represent unit cell geometries. Results show that our method can 1) generate various unit cells that satisfy given material properties with high accuracy (R 2 -scores between target properties and properties of generated unit cells >98%) and 2) improve the optimized structural performance over the conventional variable-density single-type structure. In the minimum compliance example, our IH-GAN generated structure achieves a 79.7% reduction in concentrated stress and an extra 3.03% reduction in displacement. In the target deformation examples, our IH-GAN generated structure reduces the target matching error by 86.4% and 79.6% for two test cases, respectively. We also demonstrated that the connectivity issue for multi-type unit cells can be solved by transition layer blending.

42 ENGINEERING↗

Error Analysis for Discontinuous Galerkin Method for Parabolic Problems

In the proposal, the following three objectives are stated: (1) A p-version of the discontinuous Galerkin method for a one dimensional parabolic problem will be established. It should be recalled that the h-version in space was used for the discontinuous Galerkin method. An a priori error estimate as well as a posteriori estimate of this p-finite element discontinuous Galerkin method will be given. (2) The parameter alpha that describes the behavior double vertical line u(sub t)(t) double vertical line 2 was computed exactly. This was made feasible because of the explicitly specified initial condition. For practical heat transfer problems, the initial condition may have to be approximated. Also, if the parabolic problem is proposed on a multi-dimensional region, the parameter alpha, for most cases, would be difficult to compute exactly even in the case that the initial condition is known exactly. The second objective of this proposed research is to establish a method to estimate this parameter. This will be done by computing two discontinuous Galerkin approximate solutions at two different time steps starting from the initial time and use them to derive alpha. (3) The third objective is to consider the heat transfer problem over a two dimensional thin plate. The technique developed by Vogelius and Babuska will be used to establish a discontinuous Galerkin method in which the p-element will be used for through thickness approximation. This h-p finite element approach, that results in a dimensional reduction method, was used for elliptic problems, but the application appears new for the parabolic problem. The dimension reduction method will be discussed together with the time discretization method.

Kaneko, Hideaki↗

Revisiting the Hail Radar Reflectivity–Kinetic Energy Flux Relation by Combining T-Matrix and Discrete Dipole Approximation Calculations to Size Distribution Observations

The retrieval of hail kinetic energy with weather radars or its simulation in numerical models is challenging because of the shape complexity and variable density of hailstones. We combine 3D scans of individual hailstones with measurements of the particle size distributions (PSD) and T-matrix calculations to understand how hail reflectivity Z changes when approximating hailstones as spheroids, as compared to the realistic shapes obtained by 3D scanning technology. Additionally, recent terminal velocity relations are used to compare Z to the hail kinetic energy flux E ˙ . We parameterize the hail backscattering cross sections at L, S, C, and X bands as a function of size between 0.5 and 5.0 cm, matching the range of the observed PSDs. The scattering calculations use the T-matrix method for size parameters below 1.0 and the discrete dipole approximation (DDA) method otherwise. The DDA calculations are done for 48 digital models of realistic hailstones of sizes between 1 and 5 cm. The DDA cross sections are calculated for multiple orientations and averaged assuming a fully random orientation distribution to provide a single value per hailstone. The T-matrix reflectivity assuming solid ice spheres presents negligible differences to DDA results for size parameters below 1.0. Therefore, T matrix was used to fill in the gaps left by the DDA calculations. The results are mapped to the same size bins of the observed PSDs, allowing the calculation of the radar reflectivity. This is then correlated to E ˙ , allowing a potential improvement of past retrieval methods of E ˙ from Z in multiple wavelengths.

54 ENVIRONMENTAL SCIENCES↗

Application of Modified Meshgraphnets for Subsurface Prediction during CO2 Sequestration

In the face of the increasingly dire consequences of anthropogenic climate change, capturing and storing carbon dioxide is paramount. However, several impediments exist to the safe and effective subsurface storage of CO2, such as cost of transport, identification of suitable sites for subsurface storage, and assessment of long-term risk from storage in subsurface aquifers. Accurate subsurface modeling is necessary to ensure that CO2 storage is both safe and effective. Still, such modeling has traditionally required either substantial time and computational power (numerical simulation) or a substantial amount of pre-existing data for training (machine learning models). Additionally, these models lack flexibility in dealing with both changes in discretization of the input data and generalizability beyond the data on which they are trained. In order to address these issues, this research applies graph neural networks (GNNs) to predict subsurface saturation and pressure during CO₂ injection in a model of the Illinois Basin-Decatur Project (IBDP). GNNs provide a flexible, intuitive method for representing and manipulating complex unstructured data, which is often found in many practical domain problems such as fluid flow and subsurface characterization. These unstructured grids are easily represented in GNNs by representing spatially-localized features such as permeability, porosity, saturation, and pressure as nodes in a graph and relationships between these properties as edges connecting these nodes. This research applies a specific GNN model called MeshGraphNets (MGN) to model the change in CO2 saturation and pressure over a 50-month time period (36 months of injection, 14 months post-injection). The MGN model leverages a message passing process that allows the network to learn both the spatial and temporal dynamics of this system simultaneously. Additionally, training on a limited dataset (64 realizations, 20 time points each) resulted in a high degree of accuracy in saturation prediction both within the same timeframe as the training (20 months, 0.039 average RMSE) and when projecting out to the end of injection (36 months, 0.053 average RMSE). Temporal predictions such as those generated by MGNs and other similar models are prone to accumulated error over time; in order to address this, a multi-step rollout (MSR) training process was applied to calculate training loss. This method mimics the forward prediction during inference by “rolling out” multiple time points in a single training step using the previous prediction as input to the MGN model. By calculating the loss several time steps forward from the current prediction, the model is forced to find a more stable state over time. Application of MSR to the MGN model resulted in an average 15% reduction in inference error over time during forward prediction. This study showcases the immense potential of GNNs as a game-changing methodology for predicting pressure and saturation evolution in CCS projects, ultimately paving the way for more sustainable and effective carbon storage solutions. Presentation prepared for the 2024 AiChE Annual Meeting, October 27 to November 1 2024, San Diego, CA.

Holcomb, Paul↗

Race conditions and data partitioning: risks posed by common errors to reproducible parallel simulations

When parallel algorithms for simulation were introduced in the 1970s, their development and use interested only experts in parallel computation. This circumstance changed as multi-core processors became commonplace, putting a parallel computer into the hands of every modeler. A natural outcome is growing interest in parallel simulation among persons not intimately familiar with parallel computing. At the same time, parallel simulation tools continue to be developed with the implicit assumption that the modeler is knowledgeable about parallel programming. The unintended consequence is a rapidly growing number of users of parallel simulation tools that are unlikely to recognize when the interaction of race conditions, partitioning strategies, and simultaneous action in their simulation models make results non-reproducible, thereby calling into question the validity of conclusions drawn from the simulation data. Here, we illustrate the potential dangers of exposing parallel algorithms to users who are not experts in parallel computation with example models constructed using existing parallel simulation tools. By doing so, we hope to refocus tool developers on usability, even if this new focus incurs loss of some performance.

97 MATHEMATICS AND COMPUTING↗

A Lightning Channel Retrieval Algorithm for the North Alabama Lightning Mapping Array (LMA)

A new multi-station VHF time-of-arrival (TOA) antenna network is, at the time of this writing, coming on-line in Northern Alabama. The network, called the Lightning Mapping Array (LMA), employs GPS timing and detects VHF radiation from discrete segments (effectively point emitters) that comprise the channel of lightning strokes within cloud and ground flashes. The network will support on-going ground validation activities of the low Earth orbiting Lightning Imaging Sensor (LIS) satellite developed at NASA Marshall Space Flight Center (MSFC) in Huntsville, Alabama. It will also provide for many interesting and detailed studies of the distribution and evolution of thunderstorms and lightning in the Tennessee Valley, and will offer many interesting comparisons with other meteorological/geophysical wets associated with lightning and thunderstorms. In order to take full advantage of these benefits, it is essential that the LMA channel mapping accuracy (in both space and time) be fully characterized and optimized. In this study, a new revised channel mapping retrieval algorithm is introduced. The algorithm is an extension of earlier work provided in Koshak and Solakiewicz (1996) in the analysis of the NASA Kennedy Space Center (KSC) Lightning Detection and Ranging (LDAR) system. As in the 1996 study, direct algebraic solutions are obtained by inverting a simple linear system of equations, thereby making computer searches through a multi-dimensional parameter domain of a Chi-Squared function unnecessary. However, the new algorithm is developed completely in spherical Earth-centered coordinates (longitude, latitude, altitude), rather than in the (x, y, z) cartesian coordinates employed in the 1996 study. Hence, no mathematical transformations from (x, y, z) into spherical coordinates are required (such transformations involve more numerical error propagation, more computer program coding, and slightly more CPU computing time). The new algorithm also has a more realistic definition of source altitude that accounts for Earth oblateness (this can become important for sources that are hundreds of kilometers away from the network). In addition, the new algorithm is being applied to analyze computer simulated LMA datasets in order to obtain detailed location/time retrieval error maps for sources in and around the LMA network. These maps will provide a more comprehensive analysis of retrieval errors for LMA than the 1996 study did of LDAR retrieval errors. Finally, we note that the new algorithm can be applied to LDAR, and essentially any other multi-station TWA network that depends on direct line-of-site antenna excitation.

Koshak, William↗

Sparse-grid, reduced-basis Bayesian inversion: Nonaffine-parametric nonlinear equations

We extend the reduced basis (RB) accelerated Bayesian inversion methods for affine-parametric, linear operator equations which are considered in [16,17] to non-affine, nonlinear parametric operator equations. We generalize the analysis of sparsity of parametric forward solution maps in [20] and of Bayesian inversion in [48,49] to the fully discrete setting, including Petrov–Galerkin high-fidelity (“HiFi”) discretization of the forward maps. We develop adaptive, stochastic collocation based reduction methods for the efficient computation of reduced bases on the parametric solution manifold. The nonaffinity and nonlinearity with respect to (w.r.t.) the distributed, uncertain parameters and the unknown solution is collocated; specifically, by the so-called Empirical Interpolation Method (EIM). For the corresponding Bayesian inversion problems, computational efficiency is enhanced in two ways: first, expectations w.r.t. the posterior are computed by adaptive quadratures with dimension-independent convergence rates proposed in [49]; the present work generalizes [49] to account for the impact of the PG discretization in the forward maps on the convergence rates of the Quantities of Interest (QoI for short). Second, we propose to perform the Bayesian estimation only w.r.t. a parsimonious, RB approximation of the posterior density. Based on the approximation results in [49], the infinite-dimensional parametric, deterministic forward map and operator admit N-term RB and EIM approximations which converge at rates which depend only on the sparsity of the parametric forward map. In several numerical experiments, the proposed algorithms exhibit dimension-independent convergence rates which equal, at least, the currently known rate estimates for N-term approximation. We propose to accelerate Bayesian estimation by first offline construction of reduced basis surrogates of the Bayesian posterior density. The parsimonious surrogates can then be employed for online data assimilation and for Bayesian estimation. They also open a perspective for optimal experimental design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

To Sample or Not to Sample - An Investigation Into the Uncertainty from Sampling Followed by Laboratory Analysis Versus In-Toto Gamma Spectroscopy for Situations of Non-Uniform Radioactivity Distribution

During the decommissioning of structures and the remediation of soil, material that is known or suspected to be contaminated with radioactivity must be assayed. For many, if not most, of the cases, the radioactive material concentration can be determined or inferred by gamma spectroscopy. In most, if not all, of these cases, the radioactivity is not uniformly distributed. For these situations, is it better to perform in-toto measurements of the entire item, or is it better to extract a sample and analyze that sample? For the in-toto gamma spectroscopy measurement, the results will not be accurate unless the calibration method perfectly represents the measured item. And since the calibrations normally assume uniformly distributed radioactivity, any nonuniform distribution of radioactivity in the measured material will cause an error in the results. A mathematical program using probabilistic methods has been developed to estimate the uncertainty in in-toto gamma spectroscopy measurements. This program has the capability of determining the efficiency of various types of non-uniform radioactivity distributions and to compare it to the uniform distribution efficiency. Repeating this for a large number of random tries allows the estimation of the measurement uncertainty. A new feature has been added to the program to simulate the extraction of a sample from these same non-uniform distributions, to compute the average concentration in this extracted sample, and to compare it to the average concentration in the original item to be measured. Repeating this for a large number of random tries allows the estimation of the sampling uncertainty. These two computations were run on several different 'typical' contamination measurement scenarios [200 liter drums, 27 cubic meter 'truck' containers, 0.01-10 liter 'laboratory' containers, and 3600 square meter soil 'in-situ' plots]. In all cases examined, the sampling uncertainty was larger than the in-toto gamma measurement uncertainty - typically about an order of magnitude larger. This means that in-toto measurements are likely better for situations where the activity is not homogeneous, and where gamma spectroscopy is appropriate. If sampling is to be done, then the best results will be when the largest mass of sample is extracted and when it is made up from the largest number of discrete sub-samples. The more extreme the non-uniformity, the more important this is. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗