Search NASA⌕ Search

SEARCH · Search NASA

Results for “error vector”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

pnnl/IMIC

The first step toward the design of good error detection/correction techniques involves an understanding of an application’s vulnerability to soft errors. To study the behavior of iterative methods in the presence of soft errors, we inject errors during the execution of these methods. In particular, we study the impact of one error (single- or multi-bit) on the execution of iterative methods. We use real life datasets from the SuiteSparse Matrix Collection (https://sparse.tamu.edu) and widely used iterative solver library (Iterative Methods Library, IML++ v1.2a). We instrument the iterative solver implementations so that our error injection methodology can control the iteration, vector, position, number of bits and position of the bits of the error injection. We employed 6 solvers and 28 datasets, performed a total of 1,744,800 error injection runs and collected more than 2.5TB data.

Mutlu, Burcu↗
DOE OSTI2020

Towards Feature-Preserving 2D and 3D Vector Field Compression

The objective of this work is to develop error-bounded lossy compression methods to preserve topological features in 2D and 3D vector fields. Specifically, we explore the preservation of critical points in piecewise linear vector fields. We define the preservation of critical points as, without any false positive, false negative, or false type change in the decompressed data, (1) keeping each critical point in its original cell and (2) retaining the type of each critical point (e.g., saddle and attracting node). The key to our method is to adapt a vertex-wise error bound for each grid point and to compress input data together with the error bound field using a modified lossy compressor. Our compression algorithm can be also embarrassingly parallelized for large data handling and in situ processing. We benchmark our method by comparing it with existing lossy compressors in terms of false positive/negative/type rates, compression ratio, and various vector field visualizations with several scientific applications.

critical points↗
DOE OSTI2020

Augmenting machine learning of energy landscapes with local structural information

We present a machine learning approach for accurately predicting formation energies of binary compounds in the context of crystal structure predictions. The success of any machine learning model depends significantly on the choice of representation used to encode the relevant physical information into machine-learnable data. We test different representation schemes based on partial radial and angular distribution functions (RDF+ADF) on Al–Ni and Cd–Te structures generated using our genetic algorithm for structure prediction. We observe a remarkable improvement in predictive accuracy upon transitioning from global to atom-centered representations, resulting in a threefold decrease in prediction errors. We show that a support vector regression model using a combination of atomic radial and angular distribution functions performs best at the formation energy prediction task, providing small root mean squared errors of 3.9 meV/atom and 10.9 meV/atom for Al–Ni and Cd–Te, respectively. We test the performance of our models against common traditional descriptors and find that RDF- and ADF-based representations significantly outperform many of those in the prediction of formation energies. The high accuracy of predictions makes our machine learning models great candidates for the exploration of energy landscapes.

Honrao, Shreyas J. (ORCID:0000000166155257)↗
DOE OSTI2023

Scaling Automatic Vector Data Alignment to Satellite Imagery

Given the tremendous volume of accessible Earth Observation (EO) data, there is a need to develop scalable Geospatial Artificial Intelligence (GeoAI) solutions for time-sensitive applications. Scalability in this context refers to rapidly processing large-scale EO data using high performance computing resources. Accurate mapping of the built environment from remote sensing (RS) imagery has been one of the crucial components in GeoAI workflows for a wide spectrum of humanitarian applications. Derived vector data of built environment is often leveraged for disaster preparedness and response activities. However, factors such as differences in ortho-rectification, atmospheric conditions and human error, results in spatial misalignment between vector data and the timely available RS imagery. Model training for downstream tasks such as object detection, change analysis, etc., is negatively impacted due to such spatial misalignment. Although there has been progress towards automatic alignment of vector data, the lack of scalability remains an open research challenge. This paper proposes to leverage parallel computing to optimize an automatic vector data alignment workflow. It further employs CPU-level multi-core parallelism for improving the performance of the workflow for scalable built environment mapping. We report observations and discuss findings from the preliminary experiments performed on the Summit Supercomputer.

Potnis, Abhishek↗
DOE OSTI2021

Sensitivity of back‐projection algorithm (BPA) synthetic aperture radar (SAR) image formation to initial position, velocity, and attitude navigation errors

Abstract The Back‐Projection Algorithm (BPA) is a time‐domain‐matched filtering technique to form synthetic aperture radar (SAR) images. To produce high‐quality BPA images, precise navigation data for the radar platform must be known. Errors in position, velocity, or attitude result in improperly formed images that are corrupted by shifting and blurring. The contribution of this paper is the development of analytical expressions that characterise the relationship between navigation errors and image formation errors from an inertial navigation point of view, where trajectory estimation errors in position, velocity, and attitude propagate through time and cause compounding errors in the vehicle state vector. These analytical expressions are verified via simulated image formation and real‐data image formation.

Lindstrom, Colton↗
DOE OSTI2024

KiDS-1000 cosmology: Combined second- and third-order shear statistics

Aims.In this work, we perform the first cosmological parameter analysis of the fourth release of Kilo Degree Survey (KiDS-1000) data with second- and third-order shear statistics. This paper builds on a series of studies aimed at describing the roadmap to third-order shear statistics. Methods.We derived and tested a combined model of the second-order shear statistic, namely, the COSEBIs and the third-order aperture mass statistics 〈ℳ ap 3 〉 in a tomographic set-up. We validated our pipeline withN-body mock simulations of the KiDS-1000 data release. To model the second- and third-order statistics, we used the latest version of HMCODE2020 for the power spectrum and BIHALOFITfor the bispectrum. Furthermore, we used an analytic description to model intrinsic alignments and hydro-dynamical simulations to model the effect of baryonic feedback processes. Lastly, we decreased the dimension of the data vector significantly by considering only equal smoothing radii for the 〈ℳ ap 3 〉 part of the data vector. This makes it possible to carry out a data analysis of the KiDS-1000 data release using a combined analysis of COSEBIs and third-order shear statistics. Results.We first validated the accuracy of our modelling by analysing a noise-free mock data vector, assuming the KiDS-1000 error budget, finding a shift in the maximum of the posterior distribution of the matter density parameter, ΔΩ m < 0.02 σ Ω m , and of the structure growth parameter, ΔS 8 < 0.05 σ S 8 . Lastly, we performed the first KiDS-1000 cosmological analysis using a combined analysis of second- and third-order shear statistics, where we constrained Ω m = 0.248 −0.055 +0.062 andS 8 = σ 8 √(Ω m /0.3 )= 0.772 ± 0.022. The geometric average on the errors of Ω m andS 8 of the combined statistics decreases, compared to the second-order statistic, by a factor of 2.2.

Astronomy & Astrophysics↗
DOE OSTI2022

Wind turbine gearbox fault prognosis using high-frequency SCADA data

Condition-based maintenance using routinely collected Supervisory Control and Data Acquisition (SCADA) data is a promising strategy to reduce downtime and costs associated with wind farm operations and maintenance. New approaches are continuously being developed to improve the condition monitoring for wind turbines. Development of normal behaviour models is a popular approach in studies using SCADA data. This paper first presents a data-driven framework to apply normal behaviour models using an artificial neural network approach for wind turbine gearbox prognostics. A one-class support vector machine classifier, combining different error parameters, is used to analyse the normal behaviour model error to develop a robust threshold to distinguish anomalous wind turbine operation. A detailed sensitivity study is then conducted to evaluate the potential of using high-frequency SCADA data for wind turbine gearbox prognostics. The results based on operational data from one wind turbine show that, compared to the conventionally used 10-min averaged SCADA data, the use of high-frequency data is valuable as it leads to improved prognostic predictions. High-frequency data provides more insights into the dynamics of the condition of the wind turbine components and can aid in earlier detection of faults.

17 WIND ENERGY↗
DOE OSTI2020

Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM

We analyze an expansion of the generalized block Krylov subspace framework of [Electron. Trans. Numer. Anal., 47 (2017), pp. 100--126]. This expansion allows the use of low-rank modifications of the matrix projected onto the block Krylov subspace and contains, as special cases, the block GMRES method and the new block Radau--Arnoldi method. Within this general setting, we present results that extend the interpolation property from the nonblock case to a matrix polynomial interpolation property for the block case, and we relate the eigenvalues of the projected matrix to the latent roots of these matrix polynomials. Some error bounds for these modified block FOM methods for solving linear systems are presented. We then show how cospatial residuals can be preserved in the case of families of shifted linear block systems. This result is used to derive computationally practical restarted algorithms for block Krylov approximations that compute the action of a matrix function on a set of several vectors simultaneously. Finally, we prove some error bounds and present numerical results showing that two modifications of FOM, the block harmonic and the block Radau--Arnoldi methods for matrix functions, can significantly improve the convergence behavior.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Taylor-Expansion-Based Robust Power Flow in Unbalanced Distribution Systems: A Hybrid Data-Aided Method

Traditional power flow methods often adopt certain assumptions designed for passive balanced distribution systems, thus lacking practicality for unbalanced operation. moreover, their computation accuracy and efficiency are heavily subject to unknown errors and bad data in measurements or prediction data of distributed energy resources (ders). to address these issues, this paper proposes a hybrid data-aided robust power flow algorithm in unbalanced distribution systems, which combines taylor series expansion knowledge with a data-driven regression technique. the proposed method initiates a linearization power flow model to derive an explicitly analytical solution by modified taylor expansion. to mitigate the approximation loss that surges due to the der integration and bad data, we further develop a data-aided robust support vector regression approach to estimate the errors efficiently. comparative analysis in the 13-bus and 123-bus ieee unbalanced feeders shows that the proposed hybrid algorithm achieves superior computational efficiency, with guaranteed accuracy and robustness against outliers.

data-driven↗
DOE OSTI2025

A two-level GPU-accelerated incomplete LU preconditioner for general sparse linear systems

This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block-Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors by targeting an algebraically smooth vector. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods on challenging anisotropic diffusion problems and a collection of general sparse matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Evaluation of a frequency-dependent phase shift in chirped Raman lasers for atom gravimeters

Light-pulse atom gravimetry has emerged as a powerful technique for precisely measuring absolute gravitational acceleration. Raman lasers are commonly used in this technique to coherently manipulate the atomic wave packet, of which the effective frequency is chirped continuously to compensate for the Doppler shift. In this study we investigate an additional phase shift in the Raman lasers that arises due to the frequency chirp. Here, we directly measure this phase shift by recording the beat signal of the Raman lasers with a high-speed oscilloscope, providing an independent evaluation of the resultant error in atom gravimeters caused by this phase shift. Concurrently, we detect the influence of the additional phase shift on gravity measurements using our atom gravimeter, and the results are in good agreement with the independent evaluation. Notably, there may still be a residual error at the microgal level when performing differential measurements by reversing the direction of the effective wave vector of the Raman lasers. We propose that this residual error can in principle be eliminated by selecting the same chirp frequency range for both directions in the differential measurement.

Xu, Yaoyao [Huazhong Univ. of Science and Technolo↗
DOE OSTI2025

Comparing quantum annealing and spiking neuromorphic computing for sampling binary sparse coding QUBO problems

We consider the problem of computing a sparse binary representation of an image. Given an image and an overcomplete, non-orthonormal basis, we aim to find a sparse binary vector indicating the minimal set of basis vectors that when added together best reconstruct the given input. We formulate this problem with an L 2 loss on the reconstruction error, and an L 0 loss on the binary vector enforcing sparsity. First, we solve the sparse representation QUBOs by solving them both on a D-Wave quantum annealer with Pegasus chip connectivity, as well as on the Intel Loihi 2 spiking neuromorphic processor using a stochastic Non-equilibrium Boltzmann Machine (NEBM). Second, using Quantum Evolution Monte Carlo with Reverse Annealing and iterated warm starting on Loihi 2 to evolve the solution quality from the respective machines. We demonstrate that both quantum annealing and neuromorphic computing are suitable for solving binary sparse coding QUBOs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Machine Learning-Based Model Predictive Control of Two-Time-Scale Systems

In this study, we present a general form of nonlinear two-time-scale systems, where singular perturbation analysis is used to separate the dynamics of the slow and fast subsystems. Machine learning techniques are utilized to approximate the dynamics of both subsystems. Specifically, a recurrent neural network (RNN) and a feedforward neural network (FNN) are used to predict the slow and fast state vectors, respectively. Moreover, we investigate the generalization error bounds for these machine learning models approximating the dynamics of two-time-scale systems. Next, under the assumption that the fast states are asymptotically stable, our focus shifts toward designing a Lyapunov-based model predictive control (LMPC) scheme that exclusively employs the RNN to predict the dynamics of the slow states. Additionally, we derive sufficient conditions to guarantee the closed-loop stability of the system under the sample-and-hold implementation of the controller. A nonlinear chemical process example is used to demonstrate the theory. In particular, two RNN models are constructed: one to model the full two-time-scale system and the other to predict solely the slow state vector. Both models are integrated within the LMPC scheme, and we compare their closed-loop performance while assessing the computational time required to execute the LMPC optimization problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Generic Two-Vector Model Predictive Control for Hybrid Multilevel Converters

In this article, a generic two-vector model predictive control (TV-MPC) strategy is proposed for the hybrid multilevel converters (HMCs). The proposed method selects two optimal voltage vectors among all the vector candidates using a geometric positioning approach to reduce the computational burden, which is a common issue in the existing MPC methods for HMC. Then duty cycles of the two selected vectors are optimized to minimize the current tracking error, such that the current tracking performance can be enhanced compared with the conventional MPC. In addition, the voltages of the floating dc capacitors can be balanced by evaluating all switching sequences that belong to the optimal voltage vectors with optimal duty cycles. Here, the concept of the proposed TV-MPC is generic and applicable for any HMCs. A typical HMC based on active neutral-point-clamped topology is adopted as a case study in this work. Comprehensive simulation and experimental studies are performed on an all silicon-carbide HMC prototype to validate the effectiveness of the proposed control scheme.

42 ENGINEERING↗
DOE OSTI2021

Functional Principal Component Analysis of Radio–Optical Reference Frame Tie

The Gaia optical reference frame is intrinsically undefined with respect to global orientation and spin, so it needs to be anchored in the radio-based International Celestial Reference Frame (ICRF) to provide a referenced and quasi-inertial celestial coordinate system. The link between the two fundamental frames is realized through two samples of distant extragalactic sources, mostly active galactic nuclei and quasars, but only the smaller sample of radio-loud ICRF sources with optical counterparts is available to determine the mutual orientation. The robustness of this link can be mathematically formulated in the framework of functional principal component analysis using a set of vector spherical harmonics to represent the differences in celestial positions of the common objects. The weakest eigenvectors are computed, which describe the greatest deficiency of the link. The deficient or poorly determined terms are specific vector fields on the sphere that carry the largest errors of absolute astrometry using Gaia in reference to the ICRF. This analysis provides guidelines for the future development of the ICRF maximizing the accuracy of the link over the entire celestial sphere. A measure of the robustness of a least-squares solution, which can be applied to any linear model fitting problem, is introduced to help discriminate between reference frame tie models of different degrees.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

On fast simulation of dynamical system with neural vector enhanced numerical solver

The large-scale simulation of dynamical systems is critical in numerous scientific and engineering disciplines. However, traditional numerical solvers are limited by the choice of step sizes when estimating integration, resulting in a trade-off between accuracy and computational efficiency. To address this challenge, we introduce a deep learning-based corrector called Neural Vector (NeurVec), which can compensate for integration errors and enable larger time step sizes in simulations. Our extensive experiments on a variety of complex dynamical system benchmarks demonstrate that NeurVec exhibits remarkable generalization capability on a continuous phase space, even when trained using limited and discrete data. NeurVec significantly accelerates traditional solvers, achieving speeds tens to hundreds of times faster while maintaining high levels of accuracy and stability. Moreover, NeurVec’s simple-yet-effective design, combined with its ease of implementation, has the potential to establish a new paradigm for fast-solving differential equations based on deep learning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Behavior and mechanisms of Doppler wind lidar error in varying stability regimes

Abstract. Wind lidars are widespread and important tools in atmospheric observations. An intrinsic part of lidar measurement error is due to atmospheric variability in the remote-sensing scan volume. This study describes and quantifies the distribution of measurement error due to turbulence in varying atmospheric stability. While the lidar error model is general, we demonstrate the approach using large ensembles of virtual WindCube V2 lidar performing a profiling Doppler-beam-swinging scan in quasi-stationary large-eddy simulations (LESs) of convective and stable boundary layers. Error trends vary with the stability regime, time averaging of results, and observation height. A systematic analysis of the observation error explains dominant mechanisms and supports the findings of the empirical results. Treating the error under a random variable framework allows for informed predictions about the effect of different configurations or conditions on lidar performance. Convective conditions are most prone to large errors (up to 1.5 m s−1 in 1 Hz wind speed in strong convection), driven by the large vertical velocity variances in convective conditions and the high elevation angle of the scanning beams (62∘). Range-gate weighting induces a negative bias into the horizontal wind speeds near the surface shear layer (−0.2 m s−1 in the stable test case). Errors in the horizontal wind speed and direction computed from the wind components are sensitive to the background wind speed but have negligible dependence on the relative orientation of the instrument. Especially during low winds and in the presence of large errors in the horizontal velocity estimates, the reported wind speed is subject to a systematic positive bias (up to 0.4 m s−1 in 1 Hz measurements in strong convection). Vector time-averaged measurements can improve the behavior of the error distributions (reducing the 10 min wind speed error standard deviation to <0.3 m s−1 and the bias to <0.1 m s−1 in strong convection) with a predictable effectiveness related to the number of decorrelated samples in the time window. Hybrid schemes weighting the 10 min scalar- and vector-averaged lidar measurements are shown to be effective at reducing the wind speed biases compared to cup measurements in most of the simulated conditions, with time averages longer than 10 min recommended for best use in some unstable conditions. The approach in decomposing the error mechanisms with the help of the LES flow field could be extended to more complex measurement scenarios and scans.

17 WIND ENERGY↗
DOE OSTI2022

Transient Storage Model Parameter Optimization Using the Simulated Annealing Method

Hyporheic exchange in streams is critical to ecosystem functions such as nutrient cycling along river corridors, especially for slowly moving or small stream systems. The transient storage model (TSM) has been widely used for modeling of hyporheic exchange. TSM calibration, for hyporheic exchange, is typically used to estimate four parameters, including the mass exchange rate coefficient, the dispersion coefficient, stream cross-sectional area, and hyporheic zone cross-sectional area. Prior studies have raised concerns regarding the non-uniqueness of the inverse problem for the TSM, that is, the occurrence of different parameter vectors resulting in TSM solution that reproduces the observed in-stream tracer break through curve (BTC) with the same error. This leads to practical non-identifiability in determining the unknown parameter vector values even when global-optimal values exist, and the parameter optimization becomes practically non-unique. To address this problem, we applied the simulated annealing method to calibrate the TSM to BTCs, because it is less susceptible to local minima-induced non-identifiability. A hypothetical (or synthetic) tracer test data set with known parameters was developed to demonstrate the capability of the simulated annealing method to find the global minimum parameter vector, and it identified the “hypothetically-true” global minimum parameter vector even with input data that were modified with up to 10% noise without increasing the number of iterations required for convergence. The simulated annealing TSM was then calibrated using two in-stream tracer tests conducted in East Fork Poplar Creek, Tennessee. In conclusion, simulated annealing was determined to be appropriate for quantifying the TSM parameter vector because of its search capability for the global minimum parameter vector.

54 ENVIRONMENTAL SCIENCES↗