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 739 records · Page 41

SU-E-T-631: Preliminary Results for Analytical Investigation Into Effects of ArcCHECK Setup Errors

Purpose: As three-dimensional diode arrays increase in popularity for patient-specific quality assurance for intensity-modulated radiation therapy (IMRT), it is important to evaluate an array’s susceptibility to setup errors. The ArcCHECK phantom is set up by manually aligning its outside marks with the linear accelerator’s lasers and light-field. If done correctly, this aligns the ArcCHECK cylinder’s central axis (CAX) with the linear accelerator’s axis of rotation. However, this process is prone to error. This project has developed an analytical expression including a perturbation factor to quantify the effect of shifts. Methods: The ArcCHECK is set up by aligning its machine marks with either the sagittal room lasers or the light-field of the linear accelerator at gantry zero (IEC). ArcCHECK has sixty-six evenly-spaced SunPoint diodes aligned radially in a ring 14.4 cm from CAX. The detector response function (DRF) was measured and combined with inverse-square correction to develop an analytical expression for output. The output was calculated using shifts of 0 (perfect alignment), +/−1, +/−2 and +/−5 mm. The effect on a series of simple inputs was determined: unity, 1-D ramp, steps, and hat-function to represent uniform field, wedge, evenly-spaced modulation, and single sharp modulation, respectively. Results: Geometric expressions were developed with perturbation factor included to represent shifts. DRF was modeled using sixth-degree polynomials with correlation coefficient 0.9997. The output was calculated using simple inputs such as unity, 1-D ramp, steps, and hat-function, with perturbation factors of: 0, +/−1, +/−2 and +/−5 mm. Discrepancies have been observed, but large fluctuations have been somewhat mitigated by aliasing arising from discrete diode placement. Conclusion: An analytical expression with perturbation factors was developed to estimate the impact of setup errors on an ArcCHECK phantom. Presently, this has been applied to simple functions, but is being developed to handle more realistic clinical cases.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Moving Embedded Boundary Approach for the Compressible Navier-Stokes Equations in a Block-Structured Adaptive Refinement Framework

A computational technique has been developed to perform compressible flow simulations involving moving boundaries using an embedded boundary approach within the block-structured adaptive mesh refinement (SAMR) framework of AMReX [1], [91], [92]. We leverage the SAMR capability to obtain quantitatively accurate results whilst using robust, second-order finite volume schemes. A conservative, unsplit, cut-cell approach is utilized and a ghost-cell approach is developed for computing the flux on the moving, embedded boundary faces. A third-order least-squares formulation has been developed to compute the wall velocity gradients, and was found to significantly improve the performance of the solver in terms of the quantitative comparison of surface quantities such as the skin friction coefficient. Various test cases are performed to validate the method, and compared with analytical, experimental, and other numerical results in literature. Inviscid and viscous test cases are performed that span a wide regime of flow speeds - acoustic (harmonically pulsating sphere), smooth flows (expansion fan created by a receding piston) and flows with shocks (shock-cylinder interaction, shock-wedge interaction, pitching NACA 0012 airfoil and shock-cone interaction). A closed system with moving boundaries - an oscillating piston in a cylinder, showed that the percentage error in mass within the system decreases with refinement, demonstrating that the numerical scheme is conservative with grid refinement, but is not discretely conservative. Viscous test cases involve that of a horizontally moving cylinder at Re = 40, an inline oscillating cylinder at Re = 100, and a transversely oscillating cylinder at Re = 185. The judicious use of adaptive mesh refinement with appropriate refinement criteria to capture the regions of interest leads to well-resolved flow features, and good quantitative comparison is observed with the results available in literature.

adaptive refinement↗

A practical method to test the validity of the standard Gumbel distribution in logit-based multinomial choice models of travel behavior

Most multinomial choice models (e.g., the multinomial logit model) adopted in practice assume an extreme-value Gumbel distribution for the random components (error terms) of utility functions. This distributional assumption offers a closed-form likelihood expression when the utility maximization principle is applied to model choice behaviors. As a result, model coefficients can be easily estimated using the standard maximum likelihood estimation method. However, maximum likelihood estimators are consistent and efficient only if distributional assumptions on the random error terms are valid. It is therefore critical to test the validity of underlying distributional assumptions on the error terms that form the basis of parameter estimation and policy evaluation. In this paper, a practical yet statistically rigorous method is proposed to test the validity of the distributional assumption on the random components of utility functions in both the multinomial logit (MNL) model and multiple discrete-continuous extreme value (MDCEV) model. Based on a semi-nonparametric approach, a closed-form likelihood function that nests the MNL or MDCEV model being tested is derived. The proposed method allows traditional likelihood ratio tests to be used to test violations of the standard Gumbel distribution assumption. Simulation experiments are conducted to demonstrate that the proposed test yields acceptable Type-I and Type-II error probabilities at commonly available sample sizes. The test is then applied to three real-world discrete and discrete-continuous choice models. For all three models, the proposed test rejects the validity of the standard Gumbel distribution in most utility functions, calling for the development of robust choice models that overcome adverse effects of violations of distributional assumptions on the error terms in random utility functions.

30 DIRECT ENERGY CONVERSION↗

Low-rank separated representation surrogates of high-dimensional stochastic functions: Application in Bayesian inference

This study introduces a non-intrusive approach in the context of low-rank separated representation to construct a surrogate of high-dimensional stochastic functions, e.g., PDEs/ODEs, in order to decrease the computational cost of Markov Chain Monte Carlo simulations in Bayesian inference. The surrogate model is constructed via a regularized alternative least-square regression with Tikhonov regularization using a roughening matrix computing the gradient of the solution, in conjunction with a perturbation-based error indicator to detect optimal model complexities. The model approximates a vector of a continuous solution at discrete values of a physical variable. The required number of random realizations to achieve a successful approximation linearly depends on the function dimensionality. The computational cost of the model construction is quadratic in the number of random inputs, which potentially tackles the curse of dimensionality in high-dimensional stochastic functions. Furthermore, this vector-valued separated representation-based model, in comparison to the available scalar-valued case, leads to a significant reduction in the cost of approximation by an order of magnitude equal to the vector size. The performance of the method is studied through its application to three numerical examples including a 41-dimensional elliptic PDE and a 21-dimensional cavity flow.

97 MATHEMATICS AND COMPUTING↗

Finite time step and spatial grid effects in δf simulation of warm plasmas

This paper introduces a technique for analyzing time integration methods used with the particle weight equations in δf method particle-in-cell (PIC) schemes. The analysis applies to the simulation of warm, uniform, periodic or infinite plasmas in the linear regime and considers the collective behavior similar to the analysis performed by Langdon for full-f PIC schemes [1,2]. We perform both a time integration analysis and spatial grid analysis for a kinetic ion, adiabatic electron model of ion acoustic waves. An implicit time integration scheme is studied in detail for δf simulations using our weight equation analysis and for full-f simulations using the method of Langdon. It is found that the δf method exhibits a CFL-like stability condition for low temperature ions, which is independent of the parameter characterizing the implicitness of the scheme. The accuracy of the real frequency and damping rate due to the discrete time and spatial schemes is also derived using a perturbative method. The theoretical analysis of numerical error presented here may be useful for the verification of simulations and for providing intuition for the design of new implicit time integration schemes for the δf method, as well as understanding differences between δf and full-f approaches to plasma simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Digital quantum magnetism on a trapped-ion quantum computer

Digital quantum matter—realized when discrete quantum gates approximate continuous time evolution—is susceptible to heating into chaotic, structureless states. If digitization errors are adequately suppressed, a long-lived transient regime of approximately energy-conserving dynamics can be observed on gate-based quantum computers. Conservation of energy, in turn, enables the exploration of a wide variety of complex behaviours observed in equilibrium systems, ranging from the non-trivial microscopic origins of thermalization itself to the stabilization of effective models hosting exotic emergent properties. Here we use Quantinuum’s H2 quantum computer to simulate digitized dynamics of the quantum Ising model, suppressing digitization errors well enough to observe thermalization on timescales that severely challenge classical simulation methods. Relaxation of an inhomogeneous state reveals an emergent hydrodynamics owing to approximate energy conservation and we compute the associated diffusion constant. By reprogramming our simulations to take place on a triangular lattice with periodic boundary conditions, we observe thermalization consistent with emergent gauge and topological constraints resulting from lattice frustration. Furthermore, our results were enabled by continued advances in two-qubit gate quality (native partial entangler fidelities of 99.94(1)%) and establish digital quantum computers as powerful tools for studying (effectively) continuous-time dynamics.

Information theory and computation↗

Conforming and nonconforming virtual element methods for elliptic problems

Here we present, in a unified framework, new conforming and nonconforming virtual element methods for general second-order elliptic problems in two and three dimensions. The differential operator is split into its symmetric and nonsymmetric parts and conditions for stability and accuracy on their discrete counterparts are established. These conditions are shown to lead to optimal H 1 - and L 2 -error estimates, confirmed by numerical experiments on a set of polygonal meshes. The accuracy of the numerical approximation provided by the two methods is shown to be comparable.

97 MATHEMATICS AND COMPUTING↗

Coefficient-to-Basis Network: a fine-tunable operator learning framework for inverse problems with adaptive discretizations and theoretical guarantees

We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.

97 MATHEMATICS AND COMPUTING↗

An extension of the quickened display for manual control

It is very difficult (or even impossible) for a human to control plants of third order or more with little or no damping by just knowing the instantaneous error. It has been shown that adding first and/or higher order derivatives to the error signal and displaying the combined signal are effective in facilitating human control over such plants. This signal quickening technique by Birmingham and Taylor is further extended to incorporate the future trajectory variation into the displayed signal so as to minimize the tracking error. A method for tuning free parameters in ordinary and extended quickening is established by applying discrete-time optimal control. Experimental results for a triple integrator plant indicate the effectiveness of the proposed method to achieve high quality tracking.

Tomizuka, M.↗

Small gain robustness issues in the p-integrator repetitive controller

The basic theory of the digital p-integrator controller is utilized to modify the command to a stable analog feedback control system in order to produce zero tracking error of a repetitive command. Mapping of continuous time poles and zeros to the images in the discrete time domain is performed. It is shown that for a pole excess of one, with p odd, the p-integrator learning controller will often produce a stable learning process, even for relatively large sample times. For a pole excess of two, a stable learning process can often be achieved for any p as long as the sample time is kept sufficiently short. Therefore, when the pole excess is zero and one utilizes the proper p-integrator controller with p odd, stable performance is often produced, even for relatively large sample times.

Longman, Richard W.↗

An efficient nonlinear relaxation technique for the three-dimensional, Reynolds-averaged Navier-Stokes equations

An efficient implicit method for the computation of steady, three-dimensional, compressible Navier-Stokes flowfields is presented. A nonlinear iteration strategy based on planar Gauss-Seidel sweeps is used to drive the solution toward a steady state, with approximate factorization errors within a crossflow plane reduced by the application of a quasi-Newton technique. A hybrid discretization approach is employed, with flux-vector splitting utilized in the streamwise direction and central differences with artificial dissipation used for the transverse fluxes. Convergence histories and comparisons with experimental data are presented for several 3-D shock-boundary layer interactions. Both laminar and turbulent cases are considered, with turbulent closure provided by a modification of the Baldwin-Barth one-equation model. For the problems considered (175,000-325,000 mesh points), the algorithm provides steady-state convergence in 900-2000 CPU seconds on a single processor of a Cray Y-MP.

Edwards, Jack R.↗

Intrastep, Stage-Value Predictors for Diagonally-Implicit Runge-Kutta Methods

To better identify the necessary attributes of good stage-value predictors (SVPs), numerous SVPs are designed for an existing: ESDIRK4(3)7L[2]SA [26] and a new: ESDIRK4(3)8L[2]SA scheme.1 Both are stifflyaccurate, stage-order two, explicit, singly-diagonally implicit Runge–Kutta (ESDIRK) schemes. Tradeoffs are studied in the parameter spaces enforcing the constraints on accuracy, linear stability, nonlinear stability and coefficient size to determine which objectives correlate with effective predictors. The SVPs are tested on three challenging external aerodynamics problems [107 − 108 degrees of freedom (DoFs)], each with a different level of stiffness. The problems include two 3D airfoils simulations and one canonical turbulence simulation. All simulations use the compressible Navier-Stokes equations (CNSE). An entropy stable spectral collocation formulation is used for discretizing the spatial terms in the equations. Simulations are performed at a wide variety of temporal error tolerances. Problems that are sufficiently stiff (e.g., lax temporal error tolerances) benefit from SVPs designed with second-order accuracy and stability properties: A-stability, and L-stability, rather than high accuracy constraints. Simulations with modest stiffness (e.g., strict error tolerances) are better suited for SVPs designed using high accuracy constraints. Designing SVPs with enhanced stability properties is tedious but worthwhile. Simulation times are reduced with optimal SVPs by as much as 100% on some stages, with combined stepwise improvements of between 50 − 100% for both methods. A comparative study is performed with the two aforementioned methods as well as four other ESDIRKs. The newly designed ESDIRK4(3)8L[2]SA with γ ≈ 1/10, proves to be the most efficient of the six tested ESDIRK schemes simulating the CNSE.

Diagonally-Implicit Runge-Kutta↗

An introduction to financial option pricing on a qudit-based quantum computer

The financial sector is anticipated to be one of the first industries to benefit from the increased computational power of quantum computers, in areas such as portfolio optimisation and risk management to financial derivative pricing. Financial mathematics, and derivative pricing in particular, are not areas quantum physicists are traditionally trained in despite the fact that they often have the raw technical skills needed to understand such topics. On the other hand, most quantum algorithms have largely focused on qubits, which are comprised of two discrete states, as the information carriers. However, discrete higher-dimensional qudits, in addition to possibly possessing increased noise robustness and allowing for novel error correction protocols in certain hardware implementations, also have logarithmically greater information storage and processing capacity. In the current NISQ era of quantum computing, a wide array of hardware paradigms are still being studied and any potential advantage a platform offers is worth exploring. Here we introduce the basic concepts behind financial derivatives for the unfamiliar enthusiast as well as outline in great detail the quantum algorithm routines needed to price a European option, the simplest derivative. This is done within the context of a quantum computer comprised of qudits and employing the natural higher-dimensional analogue of a qubit-based pricing algorithm with its various subroutines. From these pieces, one should relatively easily be able to tailor the scheme to more complex, realistic financial derivatives. Finally, the entire stack is numerically simulated with the results demonstrating how the qudit-based scheme's payoff quickly approaches that of both a similarly-resourced classical computer as well as the true payoff, within error, for a modest increase in qudit dimension.

Bornman, Nicholas↗

Achieving Accuracy Requirements for Forest Biomass Mapping: A Spaceborne Data Fusion Method for Estimating Forest Biomass and Lidar Sampling Error

The synergistic use of active and passive remote sensing (i.e., data fusion) demonstrates the ability of spaceborne light detection and ranging (LiDAR), synthetic aperture radar (SAR) and multispectral imagery for achieving the accuracy requirements of a global forest biomass mapping mission (+/-20 Mg/ha or 20%, the greater of the two, for at least 80% of grid cells). A data fusion approach also provides a means to extend 3D information from discrete spaceborne LiDAR measurements of forest structure across scales much larger than that of the LiDAR footprint. For estimating biomass, these measurements mix a number of errors including those associated with LiDAR footprint sampling over regional-global extents. A general framework for mapping above ground live forest biomass density (AGB) with a data fusion approach is presented and verified using data from NASA field campaigns near Howland, ME, USA, to assess AGB and LiDAR sampling errors across a regionally representative landscape. We combined SAR and Landsat-derived optical (passive optical) image data to identify contiguous areas (>0.5 ha) that are relatively homogenous in remote sensing metrics (forest patches). We used this image-derived data with simulated spaceborne LiDAR derived from orbit and cloud cover simulations and airborne data from NASA's Laser Vegetation Imaging Sensor (LVIS) to compute AGB and estimate LiDAR sampling error for forest patches and 100 m, 250 m, 500 m, and 1 km grid cells. At both the patch and grid scales, we evaluated differences in AGB estimation and sampling error from the combined use of LiDAR with both SAR and passive optical and with either SAR or passive optical alone. First, this data fusion approach demonstrates that incorporating forest patches into the AGB mapping framework can provide sub-grid forest information for coarser grid-level AGB reporting. Second, a data fusion approach for estimating AGB using simulated spaceborne LiDAR with SAR and passive optical image combinations reduced forest AGB sampling errors 12%-38% from those where LiDAR is used with SAR or passive optical alone. In absolute terms, sampling errors were reduced from 14-40 Mg/ha to 11-28 Mg/ha across all grid scales and prediction methods, where minimum sampling errors were 11, 15, 18, and 22 Mg/ha for 1 km, 500 m, 250 m, and 100 m grid scales, respectively. Third, spaceborne global scale accuracy requirements were achieved whereby at least 80% of the grid cells at 100 m, 250 m, 500 m, and 1 km grid levels met AGB accuracy requirements using a combination of passive optical and SAR along with machine learning methods to predict vegetation structure metrics for forested areas without LiDAR samples. Finally, using either passive optical or SAR, accuracy requirements were met at the 500 m and 250 m grid level, respectively..

LiDAR↗

Arbitrary Dimension Convection-Diffusion Schemes for Space-Time Discretizations

This note proposes embedding a time dependent PDE into a convection-diffusion type PDE (in one space dimension higher) with singularity, for which two discretization schemes, the classical streamline-diffusion and the EAFE (edge average finite element) one, are investigated in terms of stability and error analysis. The EAFE scheme, in particular, is extended to be arbitrary order which is of interest on its own. Numerical results, in combined space-time domain demonstrate the feasibility of the proposed approach.

97 MATHEMATICS AND COMPUTING↗

Soft Syndrome Decoding of Quantum LDPC Codes for Joint Correction of Data and Syndrome Errors

Quantum errors are primarily detected and corrected using the measurement of syndrome information which itself is an unreliable step in practical error correction implementations. Typically, such faulty or noisy syndrome measurements are modeled as a binary measurement outcome flipped with some probability. However, the measured syndrome is in fact a discretized value of the continuous voltage or current values obtained in the physical implementation of the syndrome extraction. In this paper, we use this "soft" or analog information without the conventional discretization step to benefit the iterative decoders for decoding quantum low-density parity-check (QLDPC) codes. Syndrome-based iterative belief propagation (BP) decoders are modified to utilize the syndrome-soft information to successfully correct both data and syndrome errors simultaneously, without repeated measurements. We demonstrate the advantages of extracting the soft information from the syndrome in our improved decoders, not only in terms of comparison of thresholds and logical error rates for quasi-cyclic lifted-product QLDPC code families, but also for faster convergence of iterative decoders. In particular, the new BP decoder with noisy syndrome performs as good as the standard BP decoder under ideal syndrome.

97 MATHEMATICS AND COMPUTING↗

A new indirect measure of diffusion model error

We define a new indirect measure of the diffusion model error called the diffusion model error source. When this model error source is added to the diffusion equation, the transport solution for the angular-integrated intensity is obtained. This source represents a means by which a transport code can be used to generate information relating to the adequacy of diffusion theory for any given problem without actually solving the diffusion equation. The generation of this source does not relate in any way to acceleration of the iterative convergence of transport solutions. Perhaps the most well-known indirect measure of the diffusion model error is the variable-Eddington tensor. This tensor provides a great deal of information about the angular dependence of the angular intensity solution, but it is not always simple to interpret. In contrast, our diffusion model error source is a scalar that is conceptually easy to understand. In addition to defining the diffusion model error source analytically, we show how to generate this source numerically relative to the S{sub n} radiative transfer equations with linear-discontinuous spatial discretization. This numerical source is computationally tested and shown to reproduce the Sn solution for a Marshak-wave problem. (authors)

97 MATHEMATICS AND COMPUTING↗