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,009 records · Page 56

Deterministic Modeling of the High Temperature Test Reactor with DRAGON-HEXPEDITE

The Idaho National Laboratory (INL) is tasked with the development of reactor physics analysis capability of the Next Generation Nuclear Power (NGNP) project. In order to examine the INL’s current prismatic reactor analysis tools, the project is conducting a benchmark exercise based on modeling the High Temperature Test Reactor (HTTR). This exercise entails the development of a model for the initial criticality, a 19 fuel column thin annular core, and the fully loaded core critical condition with 30 fuel columns. Special emphasis is devoted to physical phenomena and artifacts in HTTR that are similar to phenomena and artifacts in the NGNP base design. The DRAGON code is used in this study since it offers significant ease and versatility in modeling prismatic designs. DRAGON can generate transport solutions via Collision Probability (CP), Method of Characteristics (MOC) and Discrete Ordinates (Sn). A fine group cross-section library based on the SHEM 281 energy structure is used in the DRAGON calculations. The results from this study show reasonable agreement in the calculation of the core multiplication factor with the MC methods, but a consistent bias of 2-3% with the experimental values is obtained. This systematic error has also been observed in other HTTR benchmark efforts and is well documented in the literature. The ENDF/B VII graphite and U 235 cross sections appear to be the main source of the error. The isothermal temperature coefficients calculated with the fully loaded core configuration agree well with other benchmark participants but are 40% higher than the experimental values. This discrepancy with the measurement partially stems from the fact that during the experiments the control rods were adjusted to maintain criticality, whereas in the model, the rod positions were fixed. In addition, this work includes a brief study of a cross section generation approach that seeks to decouple the domain in order to account for neighbor effects. This spectral interpenetration is a dominant effect in annular HTR physics. This analysis methodology should be further explored in order to reduce the error that is systematically propagated in the traditional generation of cross sections.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Generalized Multiscale Finite Element Methods with energy minimizing oversampling

In this work, we propose a general concept for constructing multiscale basis functions within Generalized Multiscale Finite Element Method, which uses oversampling and stable decomposition. The oversampling refers to using larger regions in constructing multiscale basis functions and stable decomposition allows estimating the local errors. The analysis of multiscale methods involves decomposing the error by coarse regions, where each error contribution is estimated. In this estimate, we often use oversampling techniques to achieve a fast convergence. We demonstrate our concepts in the mixed, the Interior Penalty Discontinuous Galerkin, and Hybridized Discontinuous Galerkin discretizations. One of the important features of the proposed basis functions is that they can be used in online Generalized Multiscale Finite Element Method, where one constructs multiscale basis functions using residuals. In these problems, it is important to achieve a fast convergence, which can be guaranteed if we have a stable decomposition. In our numerical results, we present examples for both offline and online multiscale basis functions. Our numerical results show that one can achieve a fast convergence when using online basis functions. Moreover, we observe that coupling using Hybridized Discontinuous Galerkin provides a better accuracy compared with Interior Penalty Discontinuous Galerkin, which is due to using multiscale glueing functions.

42 ENGINEERING↗

Upscaling permeability for three-dimensional fractured porous rocks with the multiple boundary method

Upscaling permeability of grid blocks is crucial for groundwater models. A novel upscaling method for three-dimensional fractured porous rocks is presented. The objective of the study was to compare this method with the commonly used Oda upscaling method and the volume averaging method. First, the multiple boundary method and its computational framework were defined for three-dimensional stochastic fracture networks. Then, the different upscaling methods were compared for a set of rotated fractures, for tortuous fractures, and for two discrete fracture networks. The results computed by the multiple boundary method are comparable with those of the other two methods and fit best the analytical solution for a set of rotated fractures. The errors in flow rate of the equivalent fracture model decrease when using the multiple boundary method. Furthermore, the errors of the equivalent fracture models increase from well-connected fracture networks to poorly connected ones. Finally, the diagonal components of the equivalent permeability tensors tend to follow a normal or log-normal distribution for the well-connected fracture network model with infinite fracture size. By contrast, they exhibit a power-law distribution for the poorly connected fracture network with multiple scale fractures. The study demonstrates the accuracy and the flexibility of the multiple boundary upscaling concept. This makes it attractive for being incorporated into any existing flow-based upscaling procedures, which helps in reducing the uncertainty of groundwater models.

58 GEOSCIENCES↗

Fault-Tolerant Operation of Bosonic Qubits with Discrete-Variable Ancillae

Fault-tolerant quantum computation with bosonic qubits often necessitates the use of noisy discrete-variable ancillae. In this work, we establish a comprehensive and practical fault-tolerance framework for such a hybrid system and synthesize it with fault-tolerant protocols by combining bosonic quantum error correction (QEC) and advanced quantum control techniques. We introduce essential building blocks of error-corrected gadgets by leveraging ancilla-assisted bosonic operations using a generalized variant of path-independent quantum control. Using these building blocks, we construct a universal set of error-corrected gadgets that tolerate a single-photon loss and an arbitrary ancilla fault for four-legged cat qubits. Notably, our construction requires only dispersive coupling between bosonic modes and ancillae, as well as beam-splitter coupling between bosonic modes, both of which have been experimentally demonstrated with strong strengths and high accuracy. Moreover, each error-corrected bosonic qubit is comprised of only a single bosonic mode and a three-level ancilla, featuring the hardware efficiency of bosonic QEC in the full fault-tolerant setting. We numerically demonstrate the feasibility of our schemes using current experimental parameters in the circuit-QED platform. Finally, we present a hardware-efficient architecture for fault-tolerant quantum computing by concatenating the four-legged cat qubits with an outer qubit code utilizing only beam-splitter couplings. Our estimates suggest that the overall noise threshold can be reached using existing hardware. These developed fault-tolerant schemes extend beyond their applicability to four-legged cat qubits and can be adapted for other rotation-symmetrical codes, offering a promising avenue toward scalable and robust quantum computation with bosonic qubits. Published by the American Physical Society 2024

Physics↗

Feasibility of Correlation-Aware Inference and Universal Precision Scaling in Bonse–Hart Ultra-Small-Angle Neutron Scattering

Bonse–Hart ultra-small-angle neutron scattering (USANS) provides access to micrometre-scale structure, but useful measurements often require long counting times. In this work, we test whether the expected smoothness of the scattering profile can be exploited to improve data quality at lower counting statistics. We apply a Gaussian-process-based method to Bonse–Hart USANS data and evaluate its performance on pseudo-measurements generated from high-statistics experiments under Poisson statistics. This provides a stringent test of how well the underlying I(Q) profile can be reconstructed when the available counts are substantially reduced. We further show that, in the counting-limited regime, the reconstruction error follows a universal scaling behaviour that differs from the usual independent-counting expectation. At higher counts, the improvement crosses over to a resolution-limited regime set by analyser-angle discretization and rocking-curve width. These results clarify when correlation-aware inference is useful in USANS and provide a practical basis for improving measurement efficiency and beam-time usage.

Tung, Chi-Huan [ORNL] (ORCID:0000000221972074)↗

Stability of matrix equations arising in electromagnetics

Many problems in electromagnetics can be formulated as a Fredholm equation of the first kind. In these problems it is desired to determine some function f(x) from its integral transform g(y). Except for special cases for which an explicit inverse operator is known, the equation is usually discretized by the method of moments into a matrix equation Af = g, which is then solved on a computer. A method of calculating the sensitivity of the solution of Af = g due to errors in either the vector g or the matrix A is developed. The usefulness of this method is demonstrated with problems from antenna theory, scattering theory, and remote sensing.

Klein, C.↗

DEKFIS user's guide: Discrete Extended Kalman Filter/Smoother program for aircraft and rotorcraft data consistency

The computer program DEKFIS (discrete extended Kalman filter/smoother), formulated for aircraft and helicopter state estimation and data consistency, is described. DEKFIS is set up to pre-process raw test data by removing biases, correcting scale factor errors and providing consistency with the aircraft inertial kinematic equations. The program implements an extended Kalman filter/smoother using the Friedland-Duffy formulation.

Source record↗

On the implementation of modal filters for control of structures

The most common technique for the control of structures is modal control. In modal control, the differential equations in terms of actual coordinates are replaced by a set of ordinary differential equations in terms of the modal coordinates known as modal equations. In designing feedback controls in conjunction with the modal equations, one must know the modal states for the modes targeted for control. The sensors measure actual states, however. The modal states can be estimated by means of a Luenberger observer or modal filters. The modal filters produce estimates of the modal states from distributed measurements of the states. If distributed measurements are not available, then they can be reconstructed from measurements at discrete points via interpolation. This paper examines various questions associated with the implementation of modal filters, such as the effect of choice of interpolation functions and sensors locations, as well as of measurement errors, on the state estimation process. The method is demonstrated by means of two numerical examples.

Meirovitch, L.↗

Grammians and model reduction in limited time and frequency intervals

In this paper the controllability and observability grammians in limited time and frequency intervals are studied, and used for model reduction. In balanced and modal coordinates a near-optimal reduction procedure is developed, yielding the reduction error (norm of the difference between the output of the original system and the reduced model) almost minimal. Several examples are given to illustrate the concept for model reduction of continuous- and discrete-time systems, stable and unstable systems, in limited tim or/and frequency interval. Finally, the model reduction of a flexible truss structure is presented.

Gawronski, Wodek↗

Signal processing for airborne doppler radar detection of hazardous wind shear as applied to NASA 1991 radar flight experiment data

Radar data collected during the 1991 NASA flight tests have been selectively analyzed to support research directed at developing both improved as well as new algorithms for detecting hazardous low-altitude windshear. Analysis of aircraft attitude data from several flights indicated that platform stability bandwidths were small compared to the data rate bandwidths which should support an assumption that radar returns can be treated as short time stationary. Various approaches at detection of weather returns in the presence of ground clutter are being investigated. Non-coventional clutter rejection through spectrum mode tracking and classification algorithms is a subject of continuing research. Based upon autoregressive modeling of the radar return time sequence, this approach may offer an alternative to overcome errors in conventional pulse-pair estimates. Adaptive filtering is being evaluated as a means of rejecting clutter with emphasis on low signal-to-clutter ratio situations, particularly in the presence of discrete clutter interference. An analysis of out-of-range clutter returns is included to illustrate effects of ground clutter interference due to range aliasing for aircraft on final approach. Data are presented to indicate how aircraft groundspeed might be corrected from the radar data as well as point to an observed problem of groundspeed estimate bias variation with radar antenna scan angle. A description of how recorded clutter return data are mixed with simulated weather returns is included. This enables the researcher to run controlled experiments to test signal processing algorithms. In the summary research efforts involving improved modelling of radar ground clutter returns and a Bayesian approach at hazard factor estimation are mentioned.

Baxa, Ernest G., Jr.↗

Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing

An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.

Acikmese, Behcet↗

Development of a Filtered CFD-DEM Drag Model with Multiscale Markers Using an Artificial Neural Network and Nonlinear Regression

Here, the accuracy of coarse-grained Euler-Lagrangian simulations of fluidized beds heavily depends on the mesoscale drag models to account for the influences of the unresolved sub-grid structures. Traditional filtered drag models are regressed with mesoscale markers such as voidage and slip velocities. In this research, a filtered drag was regressed with both mesoscale and macro-scale markers using fine grid Computational Fluid Dynamics - Discrete Element Method (CFD-DEM) simulations. The traditional non-linear regression method was compared with machine learning regression using an Artificial Neural Network (ANN) implemented in PyTorch and coupled with MFiX. The new drag showed higher accuracy than the Wen-Yu drag and another filtered drag derived from the two-fluid model. The nonlinear regression shows slightly better results than ANN regression in cases with similar R 2 values. The utilization of the gas inlet velocity as an additional macro-scale marker reduced the errors by up to 55.3% in the tested cases.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Space–Time Least-Squares Petrov–Galerkin Projection for Nonlinear Model Reduction

This work proposes a space--time least-squares Petrov--Galerkin (ST-LSPG) projection method for model reduction of nonlinear dynamical systems. In contrast to typical nonlinear model-reduction methods that first apply (Petrov--)Galerkin projection in the spatial dimension and subsequently apply time integration to numerically resolve the resulting low-dimensional dynamical system, the proposed method applies projection in space and time simultaneously. To accomplish this, the method first introduces a low-dimensional space--time trial subspace, which can be obtained by computing tensor decompositions of state-snapshot data. The method then computes discrete-optimal approximations in this space--time trial subspace by minimizing the residual arising after time discretization over all space and time in a weighted $\ell^2$-norm. This norm can be defined to enable complexity reduction (i.e., hyper-reduction) in time, which leads to space--time collocation and space--time Gauss--Newton with Approximated Tensors (GNAT) variants of the ST-LSPG method. Advantages of the approach relative to typical spatial-projection-based nonlinear model reduction methods such as Galerkin projection and least-squares Petrov--Galerkin projection include a reduction of both the spatial and temporal dimensions of the dynamical system, and a priori error bounds that bound the solution error by the best space--time approximation error and whose stability constants exhibit slower growth in time. Numerical examples performed on model problems in fluid dynamics demonstrate the ability of the method to generate orders-of-magnitude computational savings relative to spatial-projection-based reduced-order models without sacrificing accuracy for a fixed spatio-temporal discretization.

97 MATHEMATICS AND COMPUTING↗

Optical homodyne tomography with polynomial series expansion

We present and demonstrate a method for optical homodyne tomography based on the inverse Radon transform. Different from the usual filtered back-projection algorithm, this method uses an appropriate polynomial series to expand the Wigner function and the marginal distribution, and discretize Fourier space. We show that this technique solves most technical difficulties encountered with kernel deconvolution-based methods and reconstructs overall better and smoother Wigner functions. We also give estimators of the reconstruction errors for both methods and show improvement in noise handling properties and resilience to statistical errors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Further evaluation of the constrained least squares electromagnetic compensation method

Technologies exist for construction of antennas with adaptive surfaces that can compensate for many of the larger distortions caused by thermal and gravitational forces. However, as the frequency and size of reflectors increase, the subtle surface errors become significant and degrade the overall electromagnetic performance. Electromagnetic (EM) compensation through an adaptive feed array offers means for mitigation of surface distortion effects. Implementation of EM compensation is investigated with the measured surface errors of the NASA 15 meter hoop/column reflector antenna. Computer simulations are presented for: (1) a hybrid EM compensation technique, and (2) evaluating the performance of a given EM compensation method when implemented with discretized weights.

Smith, William T.↗

Indirect decentralized repetitive control

Learning control refers to controllers that learn to improve their performance at executing a given task, based on experience performing this specific task. In a previous work, the authors presented a theory of indirect decentralized learning control based on use of indirect adaptive control concepts employing simultaneous identification and control. This paper extends these results to apply to the indirect repetitive control problem in which a periodic (i.e., repetitive) command is given to a control system. Decentralized indirect repetitive control algorithms are presented that have guaranteed convergence to zero tracking error under very general conditions. The original motivation of the repetitive control and learning control fields was learning in robots doing repetitive tasks such as on an assembly line. This paper starts with decentralized discrete time systems, and progresses to the robot application, modeling the robot as a time varying linear system in the neighborhood of the desired trajectory. Decentralized repetitive control is natural for this application because the feedback control for link rotations is normally implemented in a decentralized manner, treating each link as if it is independent of the other links.

Lee, Soo Cheol↗

Simulations of Sea-Ice Dynamics Using the Material-Point Method

In recent years, the availability of large volumes of recorded ice motion derived from high-resolution SAR data has provided an amazingly detailed look at the deformation of the ice cover. The deformation is dominated by the appearance of linear kinematic features that have been associated with the presence of leads. These remarkable data put us in a position to begin detailed evaluation of current coupled mechanical and thermodynamic models of sea ice. This presentation will describe the material point method (MPM) for solving these model equations. MPM is a numerical method for continuum mechanics that combines the best aspects of Lagrangian and Eulerian discretizations. The material points provide a Lagrangian description of the ice that models convection naturally. Thus, properties such as ice thickness and compactness are computed in a Lagrangian frame and do not suffer from errors associated with Eulerian advection schemes, such as artificial diffusion, dispersion, or oscillations near discontinuities. This desirable property is illustrated by solving transport of ice in uniform, rotational and convergent velocity fields. Moreover, the ice geometry is represented by unconnected material points rather than a grid. This representation facilitates modeling the large deformations observed in the Arctic, as well as localized deformation along leads, and admits a sharp representation of the ice edge. MPM also easily allows the use of any ice constitutive model. The versatility of MPM is demonstrated by using two constitutive models for simulations of wind-driven ice. The first model is a standard viscous-plastic model with two thickness categories. The MPM solution to the viscous-plastic model agrees with previously published results using finite elements. The second model is a new elastic-decohesive model that explicitly represents leads. The model includes a mechanism to initiate leads, and to predict their orientation and width. The elastic-decohesion model can provide similar overall deformation as the viscous-plastic model; however, explicit regions of opening and shear are predicted. Furthermore, the efficiency of MPM with the elastic-decohesive model is competitive with the current best methods for sea ice dynamics. Simulations will also be presented for an area of the Beaufort Sea, where predictions can be validated against satellite observations of the Arctic.

Sulsky, D.↗

Estimated spectrum adaptive postfilter and the iterative prepost filtering algirighms

The invention presents The Estimated Spectrum Adaptive Postfilter (ESAP) and the Iterative Prepost Filter (IPF) algorithms. These algorithms model a number of image-adaptive post-filtering and pre-post filtering methods. They are designed to minimize Discrete Cosine Transform (DCT) blocking distortion caused when images are highly compressed with the Joint Photographic Expert Group (JPEG) standard. The ESAP and the IPF techniques of the present invention minimize the mean square error (MSE) to improve the objective and subjective quality of low-bit-rate JPEG gray-scale images while simultaneously enhancing perceptual visual quality with respect to baseline JPEG images.

Linares, Irving↗