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 199 records · Page 11

Double absorbing boundaries for finite-difference time-domain electromagnetics

We describe the implementation of optimal local radiation boundary condition sequences for second order finite difference approximations to Maxwell's equations and the scalar wave equation using the double absorbing boundary formulation. Numerical experiments are presented which demonstrate that the design accuracy of the boundary conditions is achieved and, for comparable effort, exceeds that of a convolution perfectly matched layer with reasonably chosen parameters. An advantage of the proposed approach is that parameters can be chosen using an accurate a priori error bound.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Conservative model reduction for finite-volume models

Here, this work proposes a method for model reduction of finite-volume models that guarantees the resulting reduced-order model is conservative, thereby preserving the structure intrinsic to finite-volume discretizations. The proposed reduced-order models associate with optimization problems characterized by a minimum-residual objective function and nonlinear equality constraints that explicitly enforce conservation over subdomains. Conservative Galerkin projection arises from formulating this optimization problem at the time-continuous level, while conservative least-squares Petrov–Galerkin (LSPG) projection associates with a time-discrete formulation. We equip these approaches with hyper-reduction techniques in the case of nonlinear flux and source terms, and also provide approaches for handling infeasibility. In addition, we perform analyses that include deriving conditions under which conservative Galerkin and conservative LSPG are equivalent, as well as deriving a posteriori error bounds. Numerical experiments performed on a parameterized quasi-1D Euler equation demonstrate the ability of the proposed method to ensure not only global conservation, but also significantly lower state-space errors than nonconservative reduced-order models such as standard Galerkin and LSPG projection.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

waveSZ: A Hardware-Algorithm Co-Design of Efficient Lossy Compression for Scientific Data

Error-bounded lossy compression is critical to the success of extreme-scale scientific research because of ever-increasing volumes of data produced by today's high-performance computing (HPC) applications. Not only can error-controlled lossy compressors significantly reduce the I/O and storage burden but they can retain high data fidelity for post analysis. Existing state-of-the-art lossy compressors, however, generally suffer from relatively low compression and decompression throughput (up to hundreds of megabytes per second on a single CPU core), which considerably restrict the adoption of lossy compression by many HPC applications especially those with a fairly high data production rate. In this paper, we propose a highly efficient lossy compression approach based on field programmable gate arrays (FPGAs) under the state-of-the-art lossy compression model SZ. Our contributions are fourfold. (1) We adopt a wavefront memory layout to alleviate the data dependency during the prediction for higher-dimensional predictors, such as the Lorenzo predictor. (2) We propose a co-design framework named WAVESZ based on the wavefront memory layout and the characteristics of SZ algorithm and carefully implement it by using high-level synthesis. (3) We propose a hardware-algorithm co-optimization method to improve the performance. (4) We evaluate our proposed WAVESZ on three real-world HPC simulation datasets from the Scientific Data Reduction Benchmarks and compare it with other state-of-the-art methods on both CPUs and FPGAs. Experiments show that our WAVESZ can improve SZ's compression throughput by 6.9x similar to 8.7x over the production version running on a state-of-the-art CPU and improve the compression ratio and throughput by 2.1x and 5.8x on average, respectively, respectively, compared with the state-of-the-art FPGA design.

Compression Ratio↗

Development of the functional simulator for the Galileo attitude and articulation control system

A simulation program for verifying and checking the performance of the Galileo Spacecraft's Attitude and Articulation Control Subsystem's (AACS) flight software is discussed. The program, which is called Functional Simulator (FUNSIM), provides a simple method of interfacing user-supplied mathematical models coded in FORTRAN which describes spacecraft dynamics, sensors, and actuators; this is done with the AACS flight software, coded in HAL/S (High-level Advanced Language/Shuttle). It is thus able to simulate the AACS flight software accurately to the HAL/S statement level in the environment of a mainframe computer system. FUNSIM also has a command and data subsystem (CDS) simulator. It is noted that the input/output data and timing are simulated with the same precision as the flight microprocessor. FUNSIM uses a variable stepsize numerical integration algorithm complete with individual error bound control on the state variable to solve the equations of motion. The program has been designed to provide both line printer and matrix dot plotting of the variables requested in the run section and to provide error diagnostics.

Namiri, M. K.↗

Robust Controller Synthesis for Vision-based Spacecraft Guidance and Control

This work develops a method for Robust Controller for Vision-based Spacecraft (RCVS) guidance and control, integral to the robust autonomy framework for multi-spacecraft for- mation control and reconfiguration applications. The method is built around the use of a photo-realistic simulator, where a camera is deployed on a tracking spacecraft (ego) in order to observe an uncontrolled spacecraft (target) in a Low Earth Orbit (LEO). In this direction, the proposed approach performs the relative state (attitude and position) estimation of the target spacecraft using Convolutional Neural Network (CNN). The state estimation error is then modeled and the corresponding error-bounds are obtained around a nominal trajectory of the ego and target spacecraft. Next, this work proposes a linear matrix inequalities (LMIs) based approach to controller synthesis, guaranteed to be robust against both model uncertainties and measurement errors, resulting from vision-based estimation. This controller is comprised of two distinct components, one synthesized based on the nominal trajectory, while the “robust” component corrects for deviations from the nominal trajectory. Finally, a tracking scenario that directly utilize the image data for spacecraft guidance and control, is presented to showcase the performance of the proposed robust autonomy framework.

Rahmani, Amir↗

Discrete Hahn polynomials for numerical solution of two-dimensional variable-order fractional Rayleigh–Stokes problem

The main aim of this paper is to find the numerical solutions of 2D Rayleigh–Stokes problem with the variable-order fractional derivatives in the Riemann–Liouville sense. The presented method is based on collocation procedure in combination with the new operational matrix of the variable-order fractional derivatives, in the Caputo sense, for the discrete Hahn polynomials. The main advantage of the proposed method is obtaining a global approximation for spatial and temporal discretizations, and it reduced the problem to an algebraic system, which is easier to solve. Also, the profit of approximating a continuous function by Hahn polynomials is that for computing the coefficients of the expansion, we only have to compute a summation and the calculation of coefficients is exact. The error bound for the approximate solution is estimated. Finally, we evaluate results of the presented method with other numerical methods.

97 MATHEMATICS AND COMPUTING↗

Universal approximation of symmetric and anti-symmetric functions

In this work, we consider universal approximations of symmetric and anti-symmetric functions, which are important for applications in quantum physics, as well as other scientific and engineering computations. We give constructive approximations with explicit bounds on the number of parameters with respect to the dimension and the target accuracy ϵ. While the approximation still suffers from the curse of dimensionality, to the best of our knowledge, these are the first results in the literature with explicit error bounds for functions with symmetry or anti-symmetry constraints

97 MATHEMATICS AND COMPUTING↗

Upper bounds on the error probabilities and asymptotic error exponents in quantum multiple state discrimination

We consider the multiple hypothesis testing problem for symmetric quantum state discrimination between r given states σ₁, …, σ{sub r}. By splitting up the overall test into multiple binary tests in various ways we obtain a number of upper bounds on the optimal error probability in terms of the binary error probabilities. These upper bounds allow us to deduce various bounds on the asymptotic error rate, for which it has been hypothesized that it is given by the multi-hypothesis quantum Chernoff bound (or Chernoff divergence) C(σ₁, …, σ{sub r}), as recently introduced by Nussbaum and Szkoła in analogy with Salikhov's classical multi-hypothesis Chernoff bound. This quantity is defined as the minimum of the pairwise binary Chernoff divergences min{sub j<k}C(σ{sub j},σ). It was known already that the optimal asymptotic rate must lie between C/3 and C, and that for certain classes of sets of states the bound is actually achieved. It was known to be achieved, in particular, when the state pair that is closest together in Chernoff divergence is more than 6 times closer than the next closest pair. Our results improve on this in two ways. First, we show that the optimal asymptotic rate must lie between C/2 and C. Second, we show that the Chernoff bound is already achieved when the closest state pair is more than 2 times closer than the next closest pair. We also show that the Chernoff bound is achieved when at least r - 2 of the states are pure, improving on a previous result by Nussbaum and Szkoła. Finally, we indicate a number of potential pathways along which a proof (or disproof) may eventually be found that the multi-hypothesis quantum Chernoff bound is always achieved.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Localized Modes Due to Defects in High Contrast Periodic Media Via Two-Scale Homogenization

The spectral problem for an infinite periodic medium perturbed by a compact defect is considered. For a high contrast small ε-size periodicity and a finite size defect we consider the critical ε{sup 2}-scaling for the contrast. We employ two-scale homogenization for deriving asymptotically explicit limit equations for the localized modes and associated eigenvalues. Those are expressed in terms of the eigenvalues and eigenfunctions of a perturbed version of a two-scale limit operator introduced by V. V. Zhikov with an emergent explicit nonlinear dependence on the spectral parameter for the spectral problem at the macroscale. Using the method of asymptotic expansions supplemented by a high contrast boundary layer analysis, we establish the existence of the actual eigenvalues near the eigenvalues of the limit operator, with “ε square root” error bounds. An example for circular or spherical defects in a periodic medium with isotropic homogenized properties is given.

97 MATHEMATICS AND COMPUTING↗

Direct interpolative construction of the discrete Fourier transform as a matrix product operator

The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator. However, the original proof of this fact does not furnish a construction of the MPO with a guaranteed error bound. Meanwhile, the existing practical construction of this MPO, based on the compression of a quantum circuit, is not as efficient as possible. We present a simple closed-form construction of the QFT MPO using the interpolative decomposition, with guaranteed near-optimal compression error for a given rank. This construction can speed up the application of the QFT and the DFT, respectively, in quantum circuit simulations and QTT applications. We also connect our interpolative construction to the approximate quantum Fourier transform (AQFT) by demonstrating that the AQFT can be viewed as an MPO constructed using a different interpolation scheme.

97 MATHEMATICS AND COMPUTING↗

Statistics Analysis of the Uncertainties in Cloud Optical Depth Retrievals Caused by Three-Dimensional Radiative Effects

This paper presents a simple approach to estimate the uncertainties that arise in satellite retrievals of cloud optical depth when the retrievals use one-dimensional radiative transfer theory for heterogeneous clouds that have variations in all three dimensions. For the first time, preliminary error bounds are set to estimate the uncertainty of cloud optical depth retrievals. These estimates can help us better understand the nature of uncertainties that three-dimensional effects can introduce into retrievals of this important product of the MODIS instrument. The probability distribution of resulting retrieval errors is examined through theoretical simulations of shortwave cloud reflection for a wide variety of cloud fields. The results are used to illustrate how retrieval uncertainties change with observable and known parameters, such as solar elevation or cloud brightness. Furthermore, the results indicate that a tendency observed in an earlier study, clouds appearing thicker for oblique sun, is indeed caused by three-dimensional radiative effects.

Varnai, Tamas↗

Near-Efficient and Non-Asymptotic Multiway Inference

We establish non-asymptotic efficiency guarantees for tensor decomposition–based inference in count data models. Under a Poisson framework, we consider two related goals: (i) parametric inference , the estimation of the full distributional parameter tensor, and (ii) multiway analysis , the recovery of its canonical polyadic (CP) decomposition factors. Our main result shows that in the rank-one setting, a rank-constrained maximum-likelihood estimator achieves multiway analysis with variance matching the Cramér–Rao Lower Bound (CRLB) up to absolute constants and logarithmic factors. This provides a general framework for studying “near-efficient” multiway estimators in finite-sample settings. For higher ranks, we illustrate that our multiway estimator may not attain the CRLB; nevertheless, CP-based parametric inference remains nearly minimax optimal, with error bounds that improve on prior work by offering more favorable dependence on the CP rank. Numerical experiments corroborate near-efficiency in the rank-one case and highlight the efficiency gap in higher-rank scenarios.

97 MATHEMATICS AND COMPUTING↗

Perturbative readout-error mitigation for near-term quantum computers

Readout errors on near-term quantum computers can introduce significant error to the empirical probability distribution sampled from the output of a quantum circuit. These errors can be mitigated by classical postprocessing given the access of an experimental response matrix that describes the error associated with the measurement of each computational basis state. However, the resources required to characterize a complete response matrix and to compute the corrected probability distribution scale exponentially with the number of qubits, n . In this work, we modify standard matrix inversion techniques using perturbative approximations with significantly reduced complexity and bounded error when the likelihood of high-order bit-flip events is strongly suppressed. Given a characteristic error rate q , we discuss a method to recover the probability of the all-zeros bit string p 0 by sampling only a small subspace of the response matrix before inverting readout error, resulting in a relative speedup of poly [ 2 n / ( n w ) ] , which we motivate using a simplified error model for which the approximation incurs only O ( q w ) error for some integer w . We then provide a generalized technique to efficiently recover full output distributions with O ( q w ) error in the perturbative limit. These approximate techniques for readout-error correction may greatly accelerate near-term quantum computing applications.

97 MATHEMATICS AND COMPUTING↗

Multi-fidelity stochastic collocation method for computation of statistical moments

We present an efficient numerical algorithm to approximate the statistical moments of stochastic problems, in the presence of models with different fidelities. The method extends the multi-fidelity approximation method developed in . By combining the efficiency of low-fidelity models and the accuracy of high-fidelity models, our method exhibits fast convergence with a limited number of high-fidelity simulations. We establish an error bound of the method and present several numerical examples to demonstrate the efficiency and applicability of the multi-fidelity algorithm.

97 MATHEMATICS AND COMPUTING↗

A transformed path integral approach for solution of the Fokker–Planck equation

A novel path integral (PI) based method for solution of the Fokker–Planck equation is presented. The proposed method, termed the transformed path integral (TPI) method, utilizes a new formulation for the underlying short-time propagator to perform the evolution of the probability density function (PDF) in a transformed computational domain where a more accurate representation of the PDF can be ensured. The new formulation, based on a dynamic transformation of the original state space with the statistics of the PDF as parameters, preserves the non-negativity of the PDF and incorporates short-time properties of the underlying stochastic process. New update equations for the state PDF in a transformed space and the parameters of the transformation (including mean and covariance) that better accommodate nonlinearities in drift and non-Gaussian behavior in distributions are proposed (based on properties of the SDE). Owing to the choice of transformation considered, the proposed method maps a fixed grid in transformed space to a dynamically adaptive grid in the original state space. The TPI method, in contrast to conventional methods such as Monte Carlo simulations and fixed grid approaches, is able to better represent the distributions (especially the tail information) and better address challenges in processes with large diffusion, large drift and large concentration of PDF. Additionally, in the proposed TPI method, error bounds on the probability in the computational domain can be obtained using the Chebyshev's inequality. The benefits of the TPI method over conventional methods are illustrated through simulations of linear and nonlinear drift processes in one-dimensional and multidimensional state spaces. The effects of spatial and temporal grid resolutions as well as that of the diffusion coefficient on the error in the PDF are also characterized.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic goal-oriented error estimation with memory

We propose a stochastic dual-weighted error estimator for the viscous shallow-water equation with boundaries. For this purpose, previous work on memory-less stochastic dual-weighted error estimation is extended by incorporating memory effects. The memory is introduced by describing the local truncation error as a sum of time-correlated random variables. The random variables itself represent the temporal fluctuations in local truncation errors and are estimated from high-resolution information at near-initial times. The resulting error estimator is evaluated experimentally in two classical ocean-type experiments, the Munk gyre and the flow around an island. In these experiments, the stochastic process is adapted locally to the respective dynamical flow regime. Our stochastic dual-weighted error estimator is shown to provide meaningful error bounds for a range of physically relevant goals. We prove, as well as show numerically, that our approach can be interpreted as a linearized stochastic-physics ensemble.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An adaptive local reduced basis method for solving PDEs with uncertain inputs and evaluating risk

Many physical systems are modeled using partial differential equations (PDEs) with uncertain or random inputs. For such systems, naively propagating a fixed number of samples of the input probability law (or an approximation thereof) through the PDE is often inadequate to accurately quantify the "risk" associated with critical system responses. In this paper, we develop a goal-oriented, adaptive sampling and local reduced basis approximation for PDEs with random inputs. Our method determines a set of samples and an associated (implicit) Voronoi partition of the parameter domain on which we build local reduced basis approximations of the PDE solution. The samples are selected in an adaptive manner using an a posteriori error indicator. A notable advantage of the proposed approach is that the computational cost of the approximation during the adaptive process remains constant. We provide theoretical error bounds for our approximation and numerically demonstrate the performance of our method when compared to widely used adaptive sparse grid techniques. In addition, we tailor our approach to accurately quantify the risk of quantities of interest that depend on the PDE solution. We demonstrate our method on an advection-diffusion example and a Helmholtz example. Keywords: stochastic partial differential equation, adaptive sampling, reduced basis, a posteriori error estimation, coherent risk measure, conditional value-at-risk.

42 ENGINEERING↗

The effects of missing data on global ozone estimates

The effects of missing data and model truncation on estimates of the global mean, zonal distribution, and global distribution of ozone are considered. It is shown that missing data can introduce biased estimates with errors that are not accounted for in the accuracy calculations of empirical modeling techniques. Data-fill techniques are introduced and used for evaluating error bounds and constraining the estimate in areas of sparse and missing data. It is found that the accuracy of the global mean estimate is more dependent on data distribution than model size. Zonal features can be accurately described by 7th order models over regions of adequate data distribution. Data variance accounted for by higher order models appears to represent climatological features of columnar ozone rather than pure error. Data-fill techniques can prevent artificial feature generation in regions of sparse or missing data without degrading high order estimates over dense data regions.

Drewry, J. W.↗