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,387 records · Page 77

Efficient Gradient-Based Shape Optimization Methodology Using Inviscid/Viscous CFD

The formerly developed preconditioned-biconjugate-gradient (PBCG) solvers for the analysis and the sensitivity equations had resulted in very large error reductions per iteration; quadratic convergence was achieved whenever the solution entered the domain of attraction to the root. Its memory requirement was also lower as compared to a direct inversion solver. However, this memory requirement was high enough to preclude the realistic, high grid-density design of a practical 3D geometry. This limitation served as the impetus to the first-year activity (March 9, 1995 to March 8, 1996). Therefore, the major activity for this period was the development of the low-memory methodology for the discrete-sensitivity-based shape optimization. This was accomplished by solving all the resulting sets of equations using an alternating-direction-implicit (ADI) approach. The results indicated that shape optimization problems which required large numbers of grid points could be resolved with a gradient-based approach. Therefore, to better utilize the computational resources, it was recommended that a number of coarse grid cases, using the PBCG method, should initially be conducted to better define the optimization problem and the design space, and obtain an improved initial shape. Subsequently, a fine grid shape optimization, which necessitates using the ADI method, should be conducted to accurately obtain the final optimized shape. The other activity during this period was the interaction with the members of the Aerodynamic and Aeroacoustic Methods Branch of Langley Research Center during one stage of their investigation to develop an adjoint-variable sensitivity method using the viscous flow equations. This method had algorithmic similarities to the variational sensitivity methods and the control-theory approach. However, unlike the prior studies, it was considered for the three-dimensional, viscous flow equations. The major accomplishment in the second period of this project (March 9, 1996 to March 8, 1997) was the extension of the shape optimization methodology for the Thin-Layer Navier-Stokes equations. Both the Euler-based and the TLNS-based analyses compared with the analyses obtained using the CFL3D code. The sensitivities, again from both levels of the flow equations, also compared very well with the finite-differenced sensitivities. A fairly large set of shape optimization cases were conducted to study a number of issues previously not well understood. The testbed for these cases was the shaping of an arrow wing in Mach 2.4 flow. All the final shapes, obtained either from a coarse-grid-based or a fine-grid-based optimization, using either a Euler-based or a TLNS-based analysis, were all re-analyzed using a fine-grid, TLNS solution for their function evaluations. This allowed for a more fair comparison of their relative merits. From the aerodynamic performance standpoint, the fine-grid TLNS-based optimization produced the best shape, and the fine-grid Euler-based optimization produced the lowest cruise efficiency.

Baysal, Oktay↗

Parallel Processing of Broad-Band PPM Signals

A parallel-processing algorithm and a hardware architecture to implement the algorithm have been devised for timeslot synchronization in the reception of pulse-position-modulated (PPM) optical or radio signals. As in the cases of some prior algorithms and architectures for parallel, discrete-time, digital processing of signals other than PPM, an incoming broadband signal is divided into multiple parallel narrower-band signals by means of sub-sampling and filtering. The number of parallel streams is chosen so that the frequency content of the narrower-band signals is low enough to enable processing by relatively-low speed complementary metal oxide semiconductor (CMOS) electronic circuitry. The algorithm and architecture are intended to satisfy requirements for time-varying time-slot synchronization and post-detection filtering, with correction of timing errors independent of estimation of timing errors. They are also intended to afford flexibility for dynamic reconfiguration and upgrading. The architecture is implemented in a reconfigurable CMOS processor in the form of a field-programmable gate array. The algorithm and its hardware implementation incorporate three separate time-varying filter banks for three distinct functions: correction of sub-sample timing errors, post-detection filtering, and post-detection estimation of timing errors. The design of the filter bank for correction of timing errors, the method of estimating timing errors, and the design of a feedback-loop filter are governed by a host of parameters, the most critical one, with regard to processing very broadband signals with CMOS hardware, being the number of parallel streams (equivalently, the rate-reduction parameter).

Gray, Andrew↗

The effects of mapping CT images to Monte Carlo materials on GEANT4 proton simulation accuracy

Purpose: Monte Carlo simulations of radiation therapy require conversion from Hounsfield units (HU) in CT images to an exact tissue composition and density. The number of discrete densities (or density bins) used in this mapping affects the simulation accuracy, execution time, and memory usage in GEANT4 and other Monte Carlo code. The relationship between the number of density bins and CT noise was examined in general for all simulations that use HU conversion to density. Additionally, the effect of this on simulation accuracy was examined for proton radiation. Methods: Relative uncertainty from CT noise was compared with uncertainty from density binning to determine an upper limit on the number of density bins required in the presence of CT noise. Error propagation analysis was also performed on continuously slowing down approximation range calculations to determine the proton range uncertainty caused by density binning. These results were verified with Monte Carlo simulations. Results: In the presence of even modest CT noise (5 HU or 0.5%) 450 density bins were found to only cause a 5% increase in the density uncertainty (i.e., 95% of density uncertainty from CT noise, 5% from binning). Larger numbers of density bins are not required as CT noise will prevent increased density accuracy; this applies across all types of Monte Carlo simulations. Examining uncertainty in proton range, only 127 density bins are required for a proton range error of <0.1 mm in most tissue and <0.5 mm in low density tissue (e.g., lung). Conclusions: By considering CT noise and actual range uncertainty, the number of required density bins can be restricted to a very modest 127 depending on the application. Reducing the number of density bins provides large memory and execution time savings in GEANT4 and other Monte Carlo packages.

60 APPLIED LIFE SCIENCES↗

Loop transfer recovery for general nonminimum phase discrete time systems. II - Design

The authors consider the design of controllers for the recovery of target loop transfer function or sensitivity and complementary sensitivity functions for general nonminimum phase discrete time systems. The necessary design constraints and the available design freedom are reviewed. In view of the available freedom, possible specifications on the eigenstructure of the observer dynamic matrix are formulated. Three different types of controllers which are respectively based on prediction, current, and reduced-order estimators are considered. For each one of those controllers, three different design techniques are developed. The first one is an eigenstructure assignment scheme, while the other two are optimization-based designs. The eigenstructure assignment method yields a controller design which achieves any chosen recovery error matrix among a set of admissible recovery error matrices. On the other hand, one of the optimization-based design methods leads to a controller that achieves a recovery error matrix having the infimum H-infinity norm, while the other does the same except it achieves a recovery error matrix having the infimum H2 norm.

Chen, Ben M.↗

AutoLabs: cognitive multi-agent systems with self-correction for autonomous chemical experimentation

The automation of chemical research through self-driving laboratories (SDLs) promises to accelerate scientific discovery, yet the reliability and granular performance of the underlying AI agents remain critical, under-examined challenges. In this work, we introduce AutoLabs, a self-correcting, multi-agent architecture designed to autonomously translate natural-language instructions into executable protocols for a high-throughput liquid handler. The system engages users in dialogue, decomposes experimental goals into discrete tasks for specialized agents, performs tool-assisted stoichiometric calculations, and iteratively self-corrects its output before generating a hardware-ready file. We present a comprehensive evaluation framework featuring five benchmark experiments of increasing complexity, from simple sample preparation to multi-plate timed syntheses. Through a systematic ablation study of 20 agent configurations, we assess the impact of reasoning capacity, architectural design (single- vs. multi-agent), tool use, and self-correction mechanisms. Our results demonstrate that agent reasoning capacity is the most critical factor for success, reducing quantitative errors in chemical amounts (nRMSE) by over 85% in complex tasks. When combined with a multi-agent architecture and iterative self-correction, AutoLabs approaches expert-authored reference procedures on the benchmark (F1-score > 0.89) on challenging multi-plate syntheses. These findings establish a clear blueprint for developing robust and trustworthy AI partners for autonomous laboratories, highlighting the synergistic effects of modular design, advanced reasoning, and self-correction to ensure both performance and reliability in high-stakes scientific applications. Code: https://github.com/pnnl/autolabs

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Design considerations for a real-time ocular counterroll instrument

A real-time algorithm for measuring three-dimensional movement of the human eye, especially torsional movement, is presented. As its input, the system uses images of the eyeball taken at video rate. The amount of horizontal and vertical movement is extracted using a pupil tracking technique. The torsional movement is then measured by computing the discrete cross-correlation function between the circular samples of successive images of the iris patterns and searching for the position of the peak of the function. A local least square interpolation around the peak of the cross-correlation function is used to produce nearly unbiased estimates of torsion angle with accuracy of about 3-4 arcmin. Accuracies of better than 0.03 deg are achievable in torsional measurement with SNR higher than 36 dB. Horizontal and vertical rotations of up to + or - 13 deg can occur simultaneously with torsion without introducing any appreciable error in the counterrolling measurement process.

Hatamian, M.↗

Assessment of numerical techniques for unsteady flow calculations

The characteristics of unsteady flow motions have long been a serious concern in the study of various fluid dynamic and combustion problems. With the advancement of computer resources, numerical approaches to these problems appear to be feasible. The objective of this paper is to assess the accuracy of several numerical schemes for unsteady flow calculations. In the present study, Fourier error analysis is performed for various numerical schemes based on a two-dimensional wave equation. Four methods sieved from the error analysis are then adopted for further assessment. Model problems include unsteady quasi-one-dimensional inviscid flows, two-dimensional wave propagations, and unsteady two-dimensional inviscid flows. According to the comparison between numerical and exact solutions, although second-order upwind scheme captures the unsteady flow and wave motions quite well, it is relatively more dissipative than sixth-order central difference scheme. Among various numerical approaches tested in this paper, the best performed one is Runge-Kutta method for time integration and six-order central difference for spatial discretization.

Hsieh, Kwang-Chung↗

Development of iterative techniques for the solution of unsteady compressible viscous flows

Efficient iterative solution methods are being developed for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations. Iterative time marching methods have several advantages over classical multi-step explicit time marching schemes, and non-iterative implicit time marching schemes. Iterative schemes have better stability characteristics than non-iterative explicit and implicit schemes. Thus, the extra work required by iterative schemes can also be designed to perform efficiently on current and future generation scalable, missively parallel machines. An obvious candidate for iteratively solving the system of coupled nonlinear algebraic equations arising in CFD applications is the Newton method. Newton's method was implemented in existing finite difference and finite volume methods. Depending on the complexity of the problem, the number of Newton iterations needed per step to solve the discretized system of equations can, however, vary dramatically from a few to several hundred. Another popular approach based on the classical conjugate gradient method, known as the GMRES (Generalized Minimum Residual) algorithm is investigated. The GMRES algorithm was used in the past by a number of researchers for solving steady viscous and inviscid flow problems with considerable success. Here, the suitability of this algorithm is investigated for solving the system of nonlinear equations that arise in unsteady Navier-Stokes solvers at each time step. Unlike the Newton method which attempts to drive the error in the solution at each and every node down to zero, the GMRES algorithm only seeks to minimize the L2 norm of the error. In the GMRES algorithm the changes in the flow properties from one time step to the next are assumed to be the sum of a set of orthogonal vectors. By choosing the number of vectors to a reasonably small value N (between 5 and 20) the work required for advancing the solution from one time step to the next may be kept to (N+1) times that of a noniterative scheme. Many of the operations required by the GMRES algorithm such as matrix-vector multiplies, matrix additions and subtractions can all be vectorized and parallelized efficiently.

Sankar, Lakshmi N.↗

Computation of Sound Propagation by Boundary Element Method

This report documents the development of a Boundary Element Method (BEM) code for the computation of sound propagation in uniform mean flows. The basic formulation and implementation follow the standard BEM methodology; the convective wave equation and the boundary conditions on the surfaces of the bodies in the flow are formulated into an integral equation and the method of collocation is used to discretize this equation into a matrix equation to be solved numerically. New features discussed here include the formulation of the additional terms due to the effects of the mean flow and the treatment of the numerical singularities in the implementation by the method of collocation. The effects of mean flows introduce terms in the integral equation that contain the gradients of the unknown, which is undesirable if the gradients are treated as additional unknowns, greatly increasing the sizes of the matrix equation, or if numerical differentiation is used to approximate the gradients, introducing numerical error in the computation. It is shown that these terms can be reformulated in terms of the unknown itself, making the integral equation very similar to the case without mean flows and simple for numerical implementation. To avoid asymptotic analysis in the treatment of numerical singularities in the method of collocation, as is conventionally done, we perform the surface integrations in the integral equation by using sub-triangles so that the field point never coincide with the evaluation points on the surfaces. This simplifies the formulation and greatly facilitates the implementation. To validate the method and the code, three canonic problems are studied. They are respectively the sound scattering by a sphere, the sound reflection by a plate in uniform mean flows and the sound propagation over a hump of irregular shape in uniform flows. The first two have analytical solutions and the third is solved by the method of Computational Aeroacoustics (CAA), all of which are used to compare the BEM solutions. The comparisons show very good agreements and validate the accuracy of the BEM approach implemented here.

Guo, Yueping↗

Variational symplectic algorithm for guiding center dynamics in the inner magnetosphere

Charged particle dynamics in magnetosphere has temporal and spatial multiscale; therefore, numerical accuracy over a long integration time is required. A variational symplectic integrator (VSI) [H. Qin and X. Guan, Phys. Rev. Lett. 100, 035006 (2008) and H. Qin, X. Guan, and W. M. Tang, Phys. Plasmas 16, 042510 (2009)] for the guiding-center motion of charged particles in general magnetic field is applied to study the dynamics of charged particles in magnetosphere. Instead of discretizing the differential equations of the guiding-center motion, the action of the guiding-center motion is discretized and minimized to obtain the iteration rules for advancing the dynamics. The VSI conserves exactly a discrete Lagrangian symplectic structure and has better numerical properties over a long integration time, compared with standard integrators, such as the standard and adaptive fourth order Runge-Kutta (RK4) methods. Applying the VSI method to guiding-center dynamics in the inner magnetosphere, we can accurately calculate the particles'orbits for an arbitrary long simulating time with good conservation property. When a time-independent convection and corotation electric field is considered, the VSI method can give the accurate single particle orbit, while the RK4 method gives an incorrect orbit due to its intrinsic error accumulation over a long integrating time.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Sensitivity Studies for Space-based Measurement of Atmospheric Total Column Carbon Dioxide Using Reflected Sunlight

A series of sensitivity studies is carried out to explore the feasibility of space-based global carbon dioxide (CO2) measurements for global and regional carbon cycle studies. The detection method uses absorption of reflected sunlight in the CO2 vibration-rotation band at 1.58 microns. The sensitivities of the detected radiances are calculated using the line-by-line model (LBLRTM), implemented with the DISORT (Discrete Ordinates Radiative Transfer) model to include atmospheric scattering in this band. The results indicate that (a) the small (approx.1%) changes in CO2 near the Earth's surface are detectable in this CO2 band provided adequate sensor signal-to-noise ratio and spectral resolution are achievable; (b) the radiance signal or sensitivity to CO2 change near the surface is not significantly diminished even in the presence of aerosols and/or thin cirrus clouds in the atmosphere; (c) the modification of sunlight path length by scattering of aerosols and cirrus clouds could lead to large systematic errors in the retrieval; therefore, ancillary aerosol/cirrus cloud data are important to reduce retrieval errors; (d) CO2 retrieval requires good knowledge of the atmospheric temperature profile, e.g. approximately 1K RMS error in layer temperature; (e) the atmospheric path length, over which the CO2 absorption occurs, must be known in order to correctly interpret horizontal gradients of CO2 from the total column CO2 measurement; thus an additional sensor for surface pressure measurement needs to be attached for a complete measurement package.

Mao, Jianping↗

Canonical symplectic structure and structure-preserving geometric algorithms for Schrödinger–Maxwell systems

An infinite dimensional canonical symplectic structure and structure-preserving geometric algorithms are developed for the photon–matter interactions described by the Schrödinger–Maxwell equations. The algorithms preserve the symplectic structure of the system and the unitary nature of the wavefunctions, and bound the energy error of the simulation for all time-steps. This new numerical capability enables us to carry out first-principle based simulation study of important photon–matter interactions, such as the high harmonic generation and stabilization of ionization, with long-term accuracy and fidelity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A nonlinear analysis of the terahertz serpentine waveguide traveling-wave amplifier

A nonlinear model for the numerical simulation of terahertz serpentine waveguide traveling-wave tube (SW-TWT) is described. In this model, the electromagnetic wave transmission in the SW is represented as an infinite set of space harmonics to interact with an electron beam. Analytical expressions for axial electric fields in axisymmetric interaction gaps of SW-TWTs are derived and compared with the results from CST simulation. The continuous beam is treated as discrete macro-particles with different initial phases. The beam-tunnel field equations, space-charge field equations, and motion equations are combined to solve the beam-wave interaction. The influence of backward wave and relativistic effect is also considered in the series of equations. The nonlinear model is used to design a 340 GHz SW-TWT. Several favorable comparisons of model predictions with results from a 3-D Particle-in-cell simulation code CHIPIC are presented, in which the output power versus beam voltage and interaction periods are illustrated. The relative error of the predicted output power is less than 15% in the 3 dB bandwidth and the relative error of the saturated length is less than 8%.The results show that the 1-D nonlinear analysis model is appropriate to solve the terahertz SW-TWT operation characteristics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Scattering phase shift in quantum mechanics on quantum computers

Here, we investigate the feasibility of extracting infinite volume scattering phase shift on quantum computers in a simple one-dimensional quantum mechanical model, using the formalism established in the work by Guo and Gasparian [Phys. Rev. D 108, 074504 (2023)] that relates the integrated correlation functions for a trapped system to the infinite volume scattering phase shifts through a weighted integral. The system is first discretized in a finite box with periodic boundary conditions, and the formalism in real time is verified by employing a contact interaction potential with exact solutions. Quantum circuits are then designed and constructed to implement the formalism on current quantum computing architectures. To overcome the fast oscillatory behavior of the integrated correlation functions in real-time simulation, different methods of postdata analysis are proposed and discussed. Test results on IBM hardware show that good agreement can be achieved with two qubits, but complete failure ensues with three qubits due to two-qubit gate operation errors and thermal relaxation errors.

Guo, Peng [Dakota State Univ., Madison, SD (United↗

Establishing Models for Digital Twin of Hydropower Systems Using Probability Density Function Shaping

This paper introduces a digital twin modeling method for hydropower systems with Kaplan turbines using probability density function (PDF) shaping. We first use multilayer perceptron (MLP) model to build the discretized openloop Kaplan unit, where the MLP is trained by historical data. Then we use a proportional integral double derivative (PIDD) controller and a lead-lag exciter to test the obtained digital twin model in a closed-loop fashion. Simulation results show that the proposed digital twin modeling method can accurately capture the dynamics of the Kaplan hydropower unit. Finally, we show that the obtained digital twin can help to optimize the PIDD parameters. Compared with the original PIDD controller, the optimized one can achieve an over 90% improvement on the mean square tracking error.

Yin, Zhun [New York University]↗

Transfer learning for metamaterial design and simulation

Abstract We demonstrate transfer learning as a tool to improve the efficacy of training deep learning models based on residual neural networks (ResNets). Specifically, we examine its use for study of multi-scale electrically large metasurface arrays under open boundary conditions in electromagnetic metamaterials. Our aim is to assess the efficiency of transfer learning across a range of problem domains that vary in their resemblance to the original base problem for which the ResNet model was initially trained. We use a quasi-analytical discrete dipole approximation (DDA) method to simulate electrically large metasurface arrays to obtain ground truth data for training and testing of our deep neural network. Our approach can save significant time for examining novel metasurface designs by harnessing the power of transfer learning, as it effectively mitigates the pervasive data bottleneck issue commonly encountered in deep learning. We demonstrate that for the best case when the transfer task is sufficiently similar to the target task, a new task can be effectively trained using only a few data points yet still achieve a test mean absolute relative error of 3 % with a pre-trained neural network, realizing data reduction by a factor of 1000.

Peng, Rixi↗

Design and convergence analysis of the conforming virtual element method for polyharmonic problems

In the recent years, there has been a tremendous interest to numerical methods that approximate partial differential equations (PDEs) on computational meshes with arbitrarily-shaped polygonal/polyhedral (polytopal, for short) elements. A nonexhaustive list of such methods include the Mimetic Finite Difference method [4, 9, 21, 24, 28, 33, 35, 62, 64–67], the Polygonal Finite Element Method [68, 73, 74], the polygonal Discontinuous Galerkin Finite Element Methods [5, 7, 8, 10, 13–15, 18, 36, 38, 39, 41, 50], the Hybridizable Discontinuous Galerkin and Hybrid High-Order Methods [46–48, 51], the Gradient Discretization method [49, 53, 54], the Finite Volume Method [52], and the BEM-based FEM [71]. An alternative approach that also proved to be very successful is provided by the Virtual Element method (VEM), which was originally proposed in [19] for the numerical treatment of second-order elliptic problems [43, 44], and readily extended to linear and nonlinear elasticity [22, 25, 56], plate bending problems [37], Cahn-Hilliard equation [3], Stokes equations [2], Laplace-Beltrami equation [55], Darcy-Brinkam equation [76], discrete topology optimization problems [6], fracture networks problems [29], eigenvalue problems [59, 75]. The mixed virtual element formulation was proposed in [20, 34]; the nonconforming Virtual element formulations was proposed for second-order elliptic problems in [16], and later extended to general advection-reaction-diffusion problems, Stokes equation, the biharmonic problems, the iegenvalue problem, and the Schrodinger equation in [11, 30, 42, 45, 58, 80]. The p- and hp-version of the VEM were developed in [26, 27] and efficient multigrid methods for the resulting linear system of equations in [12]. A posteriori error estimates can be found in [40].

97 MATHEMATICS AND COMPUTING↗

Development of a High Fidelity System Analysis Code for Generation IV Reactors

Traditional nuclear reactor system analysis codes such as RELAP and TRAC employ an operator split methodology. In this approach, each of the physics (fluid flow, heat conduction and neutron diffusion) is solved separately and the coupling terms are done explicitly. This approach limits accuracy (first order in time at best) and makes the codes slow in running since the explicit coupling imposes stability restrictions on the time step size. These codes have been extensively tested and validated for the existing LWRs. However, for GEN IV nuclear reactor designs which tend to have long lasting transients resulting from passive safety systems, the performance is questionable and modern high fidelity simulation tools will be required. The requirement for accurate predictability is the motivation for a large scale overhaul of all of the models and assumptions in transient nuclear reactor safety simulation software. At INL we have launched an effort with the long term goal of developing a high fidelity system analysis code that employs modern physical models, numerical methods, and computer science for transient safety analysis of GEN IV nuclear reactors. Modern parallel solution algorithms will be employed through utilizing the nonlinear solution software package PETSc developed by Argonne National Laboratory. The physical models to be developed will have physically realistic length scales and time scales. The solution algorithm will be based on the physics-based preconditioned Jacobian-free Newton-Krylov solution methods. In this approach all of the physical models are solved implicitly and simultaneously in a single nonlinear system. This includes the coolant flow, nonlinear heat conduction, neutron kinetics, and thermal radiation, etc. Including modern physical models and accurate space and time discretizations will allow the simulation capability to be second order accurate in space and in time. This paper presents the current status of the development efforts as well as some results from analyzing a simplified primary system model of GNEP’s advanced burner test reactor (ABTR) designed by Argonne. Various transient analyses are performed with this simplified ABTR model to study two fundamental issues related to system analysis codes – accuracy of numeric algorithm and efficiency. The accuracy study is carried by comparing the second order method with the first order method. The results show that numerical errors in the first order method are large and it is very difficult to distinguish numerical errors from physical modeling errors. On the other hand, second order method yields small numerical errors and it is very easy to spot physical modeling errors. The efficiency study is carried out by comparing the time steps for the fully implicit solution algorithm versus CFL stability limit methods. The dynamic time steps used in a fully implicit method will adjust the time step to resolve the time scale during the various stages of a long lasting transient. This will make a computer code based on fully implicit methods run more efficiently versus a CFL stability limit method code like RELAP, in which a particle of fluid cannot cross a control volume in a single time step.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗