Search NASA⌕ Search

SEARCH · Search NASA

Results for “error bound”

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 145 records · Page 8

Destructive Error Interference in Product-Formula Lattice Simulation

Quantum computers can efficiently simulate the dynamics of quantum systems. Here, we study the cost of digitally simulating the dynamics of several physically relevant systems using the first-order product-formula algorithm. We show that the errors from different Trotterization steps in the algorithm can interfere destructively, yielding a much smaller error than previously estimated. In particular, we prove that the total error in simulating a nearest-neighbor interacting system of n sites for time t using the first-order product formula with r time slices is O ( n t / r + n t 3 / r 2 ) when n t 2 / r is less than a small constant. Given an error tolerance ϵ , the error bound yields an estimate of max { O ( n 2 t / ϵ ) , O ( n 2 t 3 / 2 / ϵ 1 / 2 ) } for the total gate count of the simulation. The estimate is tighter than previous bounds and matches the empirical performance observed in Childs et al. [ Proc. Natl. Acad. Sci. U.S.A. 115 , 9456 (2018) ]. We also provide numerical evidence for potential improvements and conjecture an even tighter estimate for the gate count.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

WE-G-207-02: Full Sequential Projection Onto Convex Sets (FS-POCS) for X-Ray CT Reconstruction

Purpose: To develop an iterative reconstruction method for X-ray CT, in which the reconstruction can quickly converge to the desired solution with much reduced projection views. Methods: The reconstruction is formulated as a convex feasibility problem, i.e. the solution is an intersection of three convex sets: 1) data fidelity (DF) set – the L2 norm of the difference of observed projections and those from the reconstructed image is no greater than an error bound; 2) non-negativity of image voxels (NN) set; and 3) piecewise constant (PC) set - the total variation (TV) of the reconstructed image is no greater than an upper bound. The solution can be found by applying projection onto convex sets (POCS) sequentially for these three convex sets. Specifically, the algebraic reconstruction technique and setting negative voxels as zero are used for projection onto the DF and NN sets, respectively, while the projection onto the PC set is achieved by solving a standard Rudin, Osher, and Fatemi (ROF) model. The proposed method is named as full sequential POCS (FS-POCS), which is tested using the Shepp-Logan phantom and the Catphan600 phantom and compared with two similar algorithms, TV-POCS and CP-TV. Results: Using the Shepp-Logan phantom, the root mean square error (RMSE) of reconstructed images changing along with the number of iterations is used as the convergence measurement. In general, FS- POCS converges faster than TV-POCS and CP-TV, especially with fewer projection views. FS-POCS can also achieve accurate reconstruction of cone-beam CT of the Catphan600 phantom using only 54 views, comparable to that of FDK using 364 views. Conclusion: We developed an efficient iterative reconstruction for sparse-view CT using full sequential POCS. The simulation and physical phantom data demonstrated the computational efficiency and effectiveness of FS-POCS.

60 APPLIED LIFE SCIENCES↗

Instrumental noise estimates stabilize and quantify endothelial cell micro-impedance barrier function parameter estimates

A novel transcellular micro-impedance biosensor, referred to as the electric cell-substrate impedance sensor or ECIS, has become increasingly applied to the study and quantification of endothelial cell physiology. In principle, frequency dependent impedance measurements obtained from this sensor can be used to estimate the cell cell and cell matrix impedance components of endothelial cell barrier function based on simple geometric models. Few studies, however, have examined the numerical optimization of these barrier function parameters and established their error bounds. This study, therefore, illustrates the implementation of a multi-response Levenberg Marquardt algorithm that includes instrumental noise estimates and applies it to frequency dependent porcine pulmonary artery endothelial cell impedance measurements. The stability of cell cell, cell matrix and membrane impedance parameter estimates based on this approach is carefully examined, and several forms of parameter instability and refinement illustrated. Including frequency dependent noise variance estimates in the numerical optimization reduced the parameter value dependence on the frequency range of measured impedances. The increased stability provided by a multi-response non-linear fit over one-dimensional algorithms indicated that both real and imaginary data should be used in the parameter optimization. Error estimates based on single fits and Monte Carlo simulations showed that the model barrier parameters were often highly correlated with each other. Independently resolving the different parameters can, therefore, present a challenge to the experimentalist and demand the use of non-linear multivariate statistical methods when comparing different sets of parameters.

59 BASIC BIOLOGICAL SCIENCES↗

Quantum simulation of boson-related Hamiltonians: techniques, effective Hamiltonian construction, and error analysis

Elementary quantum mechanics proposes that a closed physical system consistently evolves in a reversible manner. However, control and readout necessitate the coupling of the quantum system to the external environment, subjecting it to relaxation and decoherence. Consequently, system-environment interactions are indispensable for simulating physically significant theories. A broad spectrum of physical systems in condensed-matter and high-energy physics, vibrational spectroscopy, and circuit and cavity QED necessitates the incorporation of bosonic degrees of freedom, such as phonons, photons, and gluons, into optimized fermion algorithms for near-future quantum simulations. In particular, when a quantum system is surrounded by an external environment, its basic physics can usually be simplified to a spin or fermionic system interacting with bosonic modes. Nevertheless, troublesome factors such as the magnitude of the bosonic degrees of freedom typically complicate the direct quantum simulation of these interacting models, necessitating the consideration of a comprehensive plan. This strategy should specifically include a suitable fermion/boson-to-qubit mapping scheme to encode sufficiently large yet manageable bosonic modes, and a method for truncating and/or downfolding the Hamiltonian to the defined subspace for performing an approximate but highly accurate simulation, guided by rigorous error analysis. In this pedagogical tutorial review, we aim to provide such an exhaustive strategy, focusing on encoding and simulating certain bosonic-related model Hamiltonians, inclusive of their static properties and time evolutions. Specifically, we emphasize two aspects: (1) the discussion of recently developed quantum algorithms for these interacting models and the construction of effective Hamiltonians, and (2) a detailed analysis regarding a tightened error bound for truncating the bosonic modes for a class of fermion-boson interacting Hamiltonians.

bosonic Hamiltonian↗

Entanglement creation in low-energy scattering

We study the entanglement creation in the low-energy scattering of two particles in three dimensions, for a general class of interaction potentials that are not required to be spherically symmetric. The incoming asymptotic state, before the collision, is a product of two normalized Gaussian states. After the scattering, the particles are entangled. We take as a measure of the entanglement the purity of one of them. We provide a rigorous explicit computation, with error bound, of the leading order of the purity at low energy. The entanglement depends strongly on the difference of the masses. It takes its minimum when the masses are equal, and it increases rapidly with the difference of the masses. It is quite remarkable that the anisotropy of the potential gives no contribution to the leading order of the purity, in spite of the fact that entanglement is a second-order effect.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical solution of systems of fractional delay differential equations using a new kind of wavelet basis

In the present paper, a new orthonormal wavelet basis, called Chelyshkov wavelet, is constructed from a class of orthonormal polynomials. These wavelet basis and their properties are utilized to obtain their operational matrix of fractional integration in the Riemann–Liouville sense and delay operational matrix. Convergence and error bound of the expansion by this kind of wavelet functions are investigated. Then, these operational matrices along with the Galerkin approach have been implemented to solve systems of fractional delay differential equations (SFDDEs). The main superiority of the proposed technique is that it reduces SFDDEs to a system of algebraic equations. Moreover, accuracy and efficiency of the suggested Chelyshkov wavelet approach are verified through some linear and nonlinear SFDDEs. Finally, the obtained numerical results are compared with those previously reported in the literature.

97 MATHEMATICS AND COMPUTING↗

Validation of COBRA-TF and STAR-CCM+ with Dakota 6.5 for CASL

High-to-low (Hi2Lo) is the process of using a validated high resolution code to generate synthetic data to improve a lower resolution code. The process is useful when generating additional experimental data is prohibitively expensive or impractical. The synthetic data from the high resolution code is treated as calibration data (with uncertainties and error bounds quantified) and is used to reduce uncertainty in the lower resolution code as well as train parameters that affect the solution accuracy. The future goal of this work is implementing a Hi2Lo workflow between STAR-CCM+ (STAR) and COBRA-TF (CTF) using Dakota. Synthetic data generated by STAR will be used with current experimental results to reduce the uncertainty in the CTF model. The scope of the results presented is validation of STAR and CTF models using experimental data provided by Westinghouse Electric Company (WEC). A companion paper describes the calibration work for CTF.

42 ENGINEERING↗

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↗

Calibration of COBRA-TF and STAR-CCM+ with Dakota 6.5 for CASL

High-to-low (Hi2Lo) is utilizing a validated model in a high resolution code to generate synthetic data for improvement of the same model in a lower resolution code. This process is useful in cases where experimental data does not exist or is not sufficient. Data from the high resolution code is treated as calibration data (with appropriate uncertainties and error bounds) which can be used to train parameters that affect solution accuracy in the lower resolution code model and reduce uncertainty. Implementing the Hi2Lo process between COBRA-TF (CTF) and STAR-CCM+ (STAR) within a Dakota 6.5 framework is the goal of this work. High resolution results provided by STAR will eventually be used in addition to experimental data from Westinghouse Electric Company (WEC) to reduce uncertainty in the CTF model. The scope of the work presented herein is a proof of concept for deterministic calibration using Dakota and is not a demonstration of the Hi2Lo process. CTF temperatures will be calibrated to WEC experimental data as a first demonstration of the calibration process. Validation of the CTF model with experimental data was performed previously.

42 ENGINEERING↗

Fast and Accurate Intersections on a Sphere

We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and numerical robustness over the ones traditionally implemented in geoscience software. We then show how algorithms based on the concept of error-free transformations (EFT) can be applied to evaluate this formula within a relative error bound that is on the order of machine precision. Here, we demonstrate that, with a vectorized and parallelized implementation, this enhanced accuracy is achieved with no compute time overhead compared to a direct calculation in hardware floating point, making our algorithm suitable for performance-sensitive applications like regridding of high-resolution climate data. In contrast, evaluating our formula using high-precision data types like quadruple precision and arbitrary precision, or using the robust intersection computation routines from the Computational Geometry Algorithms Library, leads to significant computational overhead, especially since these alternatives inhibit vectorization. More generally, our work demonstrates how EFT techniques can be combined and extended to implement nontrivial geometric calculations with high accuracy and speed.

Environmental sciences↗

Universality of entanglement creation in low-energy two-dimensional scattering

We prove that the entanglement created in the low-energy scattering of two particles in two dimensions is given by a universal coefficient that is independent of the interaction potential. This is strikingly different from the three dimensional case, where it is proportional to the total scattering cross section. Before the collision the state is a product of two normalized Gaussians. We take the purity as the measure of the entanglement after the scattering. We give a rigorous computation, with error bound, of the leading order of the purity at low-energy. For a large class of potentials, that are not-necessarily spherically symmetric, we prove that the low-energy behavior of the purity, P, is universal. It is given by P=1−1/((ln(σ/ħ)){sup 2}) E, where σ is the variance of the Gaussians and the entanglement coefficient, E, depends only on the masses of the particles and not on the interaction potential. There is a strong dependence of the entanglement in the difference of the masses. The minimum is when the masses are equal, and it increases strongly with the difference of the masses. -- Highlights: •The entanglement in low-energy scattering in two dimensions is universal. It is independent of the potential. •We take the purity as the measure of entanglement. •We give a rigorous computation of the leading order of the purity at low energy. •The created entanglement depends strongly on the masses of the particles. •It takes its minimum for equal masses and it increases strongly with the difference of the masses.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ISABELA for effective in situ compression of scientific data: ISABELA FOR EFFECTIVE IN-SITU REDUCTION OF SPATIO-TEMPORAL DATA

Exploding dataset sizes from extreme-scale scientific simulations necessitates efficient data management and reduction schemes to mitigate I/O costs. With the discrepancy between I/O bandwidth and computational power, scientists are forced to capture data infrequently, thereby making data collection an inherently lossy process. Although data compression can be an effective solution, the random nature of real-valued scientific datasets renders lossless compression routines ineffective. These techniques also impose significant overhead during decompression, making them unsuitable for data analysis and visualization, which require repeated data access. To address this problem, we propose an effective method for In situ Sort-And-B-spline Error-bounded Lossy Abatement (ISABELA) of scientific data that is widely regarded as effectively incompressible. With ISABELA, we apply a pre-conditioner to seemingly random and noisy data along spatial resolution to achieve an accurate fitting model that guarantees a ≥0.99 correlation with the original data. We further take advantage of temporal patterns in scientific data to compress data b ≈ 85%, while introducing only a negligible overhead on simulations in terms of runtime. ISABELA significantly outperforms existing lossy compression methods, such as wavelet compression, in terms of data reduction and accuracy. We extend upon our previous paper by additionally building a communication-free, scalable parallel storage framework on top of ISABELA-compressed data that is ideally suited for extreme-scale analytical processing. The basis for our storage framework is an inherently local decompression method (it need not decode the entire data), which allows for random access decompression and low-overhead task division that can be exploited over heterogeneous architectures. Furthermore, analytical operations such as correlation and query processing run quickly and accurately over data in the compressed space. Copyright © 2012 John Wiley & Sons, Ltd.

Computer Science↗

A Lyapunov and Sacker–Sell spectral stability theory for one-step methods

Approximation theory for Lyapunov and Sacker–Sell spectra based upon QR techniques is used to analyze the stability of a one-step method solving a time-dependent (nonautonomous) linear ordinary differential equation (ODE) initial value problem in terms of the local error. Integral separation is used to characterize the conditioning of stability spectra calculations. The stability of the numerical solution by a one-step method of a nonautonomous linear ODE using real-valued, scalar, nonautonomous linear test equations is justified. This analysis is used to approximate exponential growth/decay rates on finite and infinite time intervals and establish global error bounds for one-step methods approximating uniformly, exponentially stable trajectories of nonautonomous and nonlinear ODEs. A time-dependent stiffness indicator and a one-step method that switches between explicit and implicit Runge–Kutta methods based upon time-dependent stiffness are developed based upon the theoretical results.

97 MATHEMATICS AND COMPUTING↗

A stiff order condition theory for Runge–Kutta methods applied to semilinear ODEs

Classical convergence theory of Runge–Kutta methods assumes that the time step is small relative to the Lipschitz constant of the ordinary differential equation (ODE). For stiff problems, that assumption is often violated, and a problematic degradation in accuracy, known as order reduction, can arise. Methods with high stage order, e.g., Gauss–Legendre and Radau, are known to avoid order reduction, but they must be fully implicit. For the broad class of semilinear ODEs, which consist of a stiff linear term and non-stiff nonlinear term, we show that weaker conditions suffice. Here, our new semilinear order conditions are formulated in terms of orthogonality relations and can be enumerated by rooted trees. Finally, we prove global error bounds that hold uniformly with respect to stiffness of the linear term.

Mathematics and Computing↗

Haar-Like Wavelets on Hierarchical Trees

Here, discrete wavelet methods, originally formulated in the setting of regularly sampled signals, can be adapted to data defined on a point cloud if some multiresolution structure is imposed on the cloud. A wide variety of hierarchical clustering algorithms can be used for this purpose, and the multiresolution structure obtained can be encoded by a hierarchical tree of subsets of the cloud. Prior work introduced the use of Haar-like bases defined with respect to such trees for approximation and learning tasks on unstructured data. This paper builds on that work in two directions. First, we present an algorithm for constructing Haar-like bases on general discrete hierarchical trees. Second, with an eye towards data compression, we present thresholding techniques for data defined on a point cloud with error controlled in the $L$ $\infty$ norm and in a Hölder-type norm. In a concluding trio of numerical examples, we apply our methods to compress a point cloud dataset, study the tightness of the $L$ $\infty$ error bound, and use thresholding to identify MNIST classifiers with good generalizability.

97 MATHEMATICS AND COMPUTING↗

The Adjoint Petrov–Galerkin method for non-linear model reduction

Here, we formulate a new projection-based reduced-order modeling technique for non-linear dynamical systems. The proposed technique, which we refer to as the Adjoint Petrov–Galerkin (APG) method, is derived by decomposing the generalized coordinates of a dynamical system into a resolved coarse-scale set and an unresolved fine-scale set. A Markovian finite memory assumption within the Mori–Zwanzig formalism is then used to develop a reduced-order representation of the coarse scales. This procedure leads to a closed reduced-order model that displays commonalities with the adjoint stabilization method used in finite elements. The formulation is shown to be equivalent to a Petrov–Galerkin method with a non-linear, time-varying test basis, thus sharing some similarities with the Least-Squares Petrov–Galerkin method. Theoretical analysis examining a priori error bounds and computational cost is presented. Numerical experiments on the compressible Navier–Stokes equations demonstrate that the proposed method can lead to improvements in numerical accuracy, robustness, and computational efficiency over the Galerkin method on problems of practical interest. Improvements in numerical accuracy and computational efficiency over the Least-Squares Petrov–Galerkin method are observed in most cases.

42 ENGINEERING↗