Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Filter 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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

A numerical extension of the spatially-filtered Euler equations for contact discontinuities

Solving the spatially-filtered Euler equations with a kinetic energy-preserving centered discretization is an efficient framework for simulating shock-dominated flows. Here, the present work describes a numerical treatment of the spatially-filtered Euler equations to minimize oscillations when simulating contact discontinuities. To counteract dispersive errors inherent to centered schemes, a WENO-like correction term is applied to the enthalpy transport in the energy equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

A Proof for the Unbiased Nature of Range-Doppler Measurements in Coarse-Resolution Dechirp-on-Receive Feedback Synthetic Aperture Radar Navigation

In feedback synthetic aperture radar (SAR) navigation, observables extracted from SAR range-Doppler images correct position and velocity errors accumulated within an associated navigation system. Unlike most other sensors, which produce measurements without input from a navigation system, SARs require a prior estimate of the radar’s position and velocity to adjust the radar’s matched filter during range-Doppler image formation. Consequently, it is possible for position and velocity errors within a navigation system to manifest as additional errors (biases) in the range-Doppler measurement observables. Prior work has not tackled this possibility in the context of feedback SAR navigation with a dechirp-on-receive radar. This paper offers a proof demonstrating that range-Doppler observables extracted from coarse-resolution vertical SAR images formed with a dechirp-on-receive radar may be safely modeled as unbiased measurements of the radar’s true position and velocity despite the presence of moderate navigation errors.

dechirp-on-receive↗
DOE OSTI2026

Quantum Filtering and Analysis of Multiplicities in Eigenvalue Spectra

Fine-grained spectral properties of quantum Hamiltonians, including both eigenvalues and their multiplicities, provide useful information for characterizing many-body quantum systems as well as for understanding phenomena such as topological order. Extracting such information with small additive error is #BQP-complete in the worst case. In this work, we introduce QFAMES (quantum filtering and analysis of multiplicities in eigenvalue spectra), a quantum algorithm that efficiently identifies clusters of closely spaced dominant eigenvalues and determines their multiplicities under physically motivated assumptions, which allows us to bypass worst-case complexity barriers. QFAMES also enables the estimation of observable expectation values within targeted energy clusters, providing a powerful tool for studying quantum phase transitions and other physical properties. We validate the effectiveness of QFAMES through numerical demonstrations, including its applications to characterizing quantum phases in the transverse-field Ising model and estimating the ground-state degeneracy of a topologically ordered phase in the two-dimensional toric code model. We also generalize QFAMES to the setting of mixed initial states. Our approach offers rigorous theoretical guarantees and significant advantages over existing subspace-based quantum spectral analysis methods, particularly in terms of the sample complexity and the ability to resolve degeneracies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Merger identification through photometric bands, colours, and their errors

Aims. We present the application of a fully connected neural network (NN) for galaxy merger identification using exclusively photometric information. Our purpose is not only to test the method’s efficiency, but also to understand what merger properties the NN can learn and what their physical interpretation is. Methods. We created a class-balanced training dataset of 5860 galaxies split into mergers and non-mergers. The galaxy observations came from SDSS DR6 and were visually identified in Galaxy Zoo. The 2930 mergers were selected from known SDSS mergers and the respective non-mergers were the closest match in both redshift and r magnitude. The NN architecture was built by testing a different number of layers with different sizes and variations of the dropout rate. We compared input spaces constructed using: the five SDSS filters: u, g, r, i, and z; combinations of bands, colours, and their errors; six magnitude types; and variations of input normalization. Results. We find that the fibre magnitude errors contribute the most to the training accuracy. Studying the parameters from which they are calculated, we show that the input space built from the sky error background in the five SDSS bands alone leads to 92.64 ± 0.15% training accuracy. We also find that the input normalization, that is to say, how the data are presented to the NN, has a significant effect on the training performance. Conclusions. We conclude that, from all the SDSS photometric information, the sky error background is the most sensitive to merging processes. This finding is supported by an analysis of its five-band feature space by means of data visualization. Moreover, studying the plane of the g and r sky error bands shows that a decision boundary line is enough to achieve an accuracy of 91.59%.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Procrustean entanglement concentration in quantum-classical networking

The success of a future quantum internet will rest in part on the ability of quantum and classical signals to coexist in the same optical fiber infrastructure, a challenging endeavor given the orders of magnitude differences in flux of single-photon-level quantum fields and bright classical traffic. Here, we theoretically describe and experimentally implement Procrustean entanglement concentration for polarization-entangled states contaminated with classical light, showing significant mitigation of crosstalk noise in dense wavelength-division multiplexing. Our approach leverages a pair of polarization-dependent loss emulators to attenuate highly polarized crosstalk that results from imperfect isolation of conventional signals copropagating on shared fiber links. We demonstrate our technique both on the tabletop and over a deployed quantum local area network, finding a substantial improvement of two-qubit entangled state fidelity from approximately 75% to over 92%. This local filtering technique could be used as a preliminary step to reduce asymmetric errors, potentially improving the overall efficiency when combined with more complex error-mitigation techniques in future quantum repeater networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Distribution System State Estimation Using a Multiple Iteration Extended Kalman Filter Approach

To support the operation of modern distribution systems, operators require real-time visibility into system states. Due to a lack of measurements and unbalanced operation, the state estimation in distribution systems is challenging as compared to transmission systems. This paper proposes the utilization of a Multiple Iteration - Extended Kalman Filter based approach for the distribution system state estimation. This modified version of the baseline extended Kalman filter iterates over the update step multiple times thereby reducing the estimation error. The proposed algorithm along with the auxiliary algorithms such as bad data detection is integrated into a co-simulation environment. Case studies show that the proposed state estimation method can result in a lesser estimation error as compared to the baseline approach.

Bhatti, Bilal Ahmad↗
DOE OSTI2020

Reconstruction of Charged Particle Tracks in Realistic Detector Geometry Using a Vectorized and Parallelized Kalman Filter Algorithm

One of the most computationally challenging problems expected for the High-Luminosity Large Hadron Collider (HL-LHC) is finding and fitting particle tracks during event reconstruction. Algorithms used at the LHC today rely on Kalman filtering, which builds physical trajectories incrementally while incorporating material e ects and error estimation. Recognizing the need for faster computational throughput, we have adapted Kalman-filterbased methods for highly parallel, many-core SIMD and SIMT architectures that are now prevalent in high-performance hardware. Previously we observed significant parallel speedups, with physics performance comparable to CMS standard tracking, on Intel Xeon, Intel Xeon Phi, and (to a limited extent) NVIDIA GPUs. While early tests were based on artificial events occurring inside an idealized barrel detector, we showed subsequently that our mkFit software builds tracks successfully from complex simulated events (including detector pileup) occurring inside a geometrically accurate representation of the CMS-2017 tracker. Here, we report on advances in both the computational and physics performance of mkFit, as well as progress toward integration with CMS production software. Recently we have improved the overall eciency of the algorithm by preserving short track candidates at a relatively early stage rather than attempting to extend them over many layers. Moreover, mkFit formerly produced an excess of duplicate tracks; these are now explicitly removed in an additional processing step. We demonstrate that with these enhancements, mkFit becomes a suitable choice for the first iteration of CMS tracking, and eventually for later iterations as well. We plan to test this capability in the CMS High Level Trigger during Run 3 of the LHC, with an ultimate goal of using it in both the CMS HLT and oine reconstruction for the HL-LHC CMS tracker.

Cerati, Giuseppe↗
DOE OSTI2021

Decentralized Filtering Adaptive Neural Network Control for Uncertain Switched Interconnected Nonlinear Systems

This article presents a novel decentralized filtering adaptive neural network control framework for uncertain switched interconnected nonlinear systems. Each subsystem has its own decentralized controller based on the established decentralized state predictor. For each subsystem, the nonlinear uncertainties are approximated by a Gaussian radial basis function (GRBF) neural network incorporated with a piecewise constant adaptive law, where the adaptive law will update adaptive parameters from the error dynamics between the host system and the decentralized state predictor by discarding the unknowns, whereas a decentralized filtering control law is derived to cancel both local and mismatched uncertainties from other subsystems, as well as achieve the local objective tracking of the host system. The achievement of global objective depends on the achievement of local objective for each subsystem. The matched uncertainties are canceled directly by adopting their opposite in the control signal, whereas a dynamic inversion of the system is required to eliminate the effect of the mismatched uncertainties on the output. By exploiting the average dwell time principle, the error bounds between the real system and the virtual reference system, which defines the best performance that can be achieved by the closed-loop system, are derived. A numerical example is given to illustrate the effectiveness of the decentralized filtering adaptive neural network control architecture by comparing against the model reference adaptive control (MRAC).

Average dwell time, decentralized, filtering adapt↗
DOE OSTI2026

Generalized Theory and Realization of Reconfigurable Bandpass Filtering Equalizers

Here, in this article, a generalized theory of bandpass filtering equalizers is proposed. A filtering equalizer is a device that combines the frequency-selective properties of a filter with the controllable slope of an equalizer into a single component. The equations used to design the function for a desired slope are provided, and the design methodology to determine the necessary filtering polynomials is also shown. The controllable slope of the dual-function component is realized using variable capacitors, which are used to tune both a transmission zero and a matching network to achieve the desired slope. A third-order bandpass filtering equalizer is designed, fabricated, and measured to verify the generalized theory. The component is designed to operate at 1 GHz with a slope that can be reconfigured from 1 to 3 dB along the passband. This proposed filtering equalizer demonstrates the feasibility of a tunable, low-cost, size, weight, and power (C-SWaP) solution to enable increased flatness in the overall system response and thereby decrease the error vector magnitude (EVM) of future radio frequency (RF) systems and a design process that allows for future development of filtering equalizers.

Filter↗
DOE OSTI2025

Angularly resolved spectral reconstruction of x rays via filter pack attenuation

We have designed a new filter pack array to measure angular variations in x-ray spectra during a single shot. The filter pack was composed of repeating identical columns of aluminum and copper filters of varying thicknesses. These columns were located at different positions to measure the spectrum at each corresponding angle. This array was utilized in an experiment to measure the energy evolution of betatron x rays in a laser wakefield accelerator by curving the wakefield with a transverse density gradient, streaking the x rays across the array in front of an x-ray charge-coupled device (CCD) camera. After subtracting the background and “flattening” the image to remove spatial nonuniformities, a critical energy was calculated for each position that produced the best agreement with the measured signal. There was a clear change in critical energy with angle, shedding light on the dynamics of the electrons that traveled through the accelerator. Furthermore, these angles correspond to distinct emission times, covering a timescale of tens of picoseconds. The filter pack was capable of recovering these angular details without the impact of errors introduced by shot-to-shot variability.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Fluid temperature predictions of geothermal borefields using load estimations via state observers

Fluid temperature predictions of geothermal borefields usually involves temporal superposition of its characteristic g-function, using load aggregation schemes to reduce computational times. Assuming that the ground has linear properties, it can be modeled as a linear state space system where the states are the aggregated loads. However, the application and accuracy of these models is compromised when the borefield is already operating and its load history is not registered or there are gaps in the data. This paper assesses the performance of state observers to estimate the borefield load history and obtain accurate fluid predictions. Results show that both Time-Varying Kalman Filter (TVKF) and Moving Horizon Estimator (MHE) provide predictions with average and maximum errors below 0.1 $^\circ C$ and 1 $^\circ C$ respectively. MHE outperforms TVKF in terms of n-step ahead output predictions and load history profile at the expenses of about 5 times more computational time.

Figueroa, Iago C.↗
DOE OSTI2025

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

RLScheduler: An Automated HPC Batch Job Scheduler Using Reinforcement Learning

Today’s high-performance computing (HPC) platforms are still dominated by batch jobs. Accordingly, effective batch job scheduling is crucial to obtain high system efficiency. Existing HPC batch job schedulers typically leverage heuristic priority functions to prioritize and schedule jobs. But, once configured and deployed by the experts, such priority functions can hardly adapt to the changes of job loads, optimization goals, or system settings, potentially leading to degraded system efficiency when changes occur. To address this fundamental issue, we present RLScheduler, an automated HPC batch job scheduler built on reinforcement learning. RLScheduler relies on minimal manual interventions or expert knowledge, but can learn high-quality scheduling policies via its own continuous ‘trial and error’. We introduce a new kernel-based neural network structure and trajectory filtering mechanism in RLScheduler to improve and stabilize the learning process. Through extensive evaluations, we confirm that RLScheduler can learn high-quality scheduling policies towards various workloads and various optimization goals with relatively low computation cost. Moreover, we show that the learned models perform stably even when applied to unseen workloads, making them practical for production use.

Zhang, Di↗
DOE OSTI2020

Radioactive Source Localization via Bayesian Particle Filter

In the event of a misplaced radioactive source or other emergency situation, measuring a radiation field, mapping its distribution, and determining a source location are essential tasks to ameliorating the situation. However, radiation fields may be extremely hazardous to human surveyors and minimizing received radiation doses is just as essential. Robots appear to be a potential solution to these problems. Beyond simply measuring radiation, the robot's computer processing capabilities offer a way to apply complex data analysis methods to radiation measurements in real-time. Methods which predict likely source locations can then feed this information into other processes, potentially improving path planning and enabling more efficient measurements. Given a robot mounted with a gamma-ray detector, can we: develop a methodology to account for detector performance across a wide range of source angles, distances, and photon energies? operate an autonomously navigating robot to effectively survey and characterize an area of interest? implement a data analysis method, conventionally used in measurements of motion, for source localization purposes? An open-source TurtleBot 3 robot, running Robot Operating System (ROS) on Ubuntu 16.04 LTS, was fitted with a Kromek GR1{sup R} Cadmium Zinc Telluride (CZT) solid-state gamma-ray detector. As a part of ROS, the packages OpenSlam, gmapping, and amcl were used to perform Simultaneous Localization and Mapping (SLAM), determining the robot's position and mapping the surrounding area. Data was acquired via Lidar mounted on top the TurtleBot 3. Detector Calibration Fit: The equation was fit to 365 counts of various energies, distances, and angles. A MATLAB{sup R} program was written to simulate measurements taken a robot on a random walk, with count data and positions discretized into finite element pixels. Using this program, a sample of 100 runs was performed on a map with a simulated source at the center, with a total of 200 of 2 pixels each. Similarly, multiple runs of the filter were performed on recorded robot measurement data. In both simulation and real tests, when corrected for errors (particles placed outside of bounds or on the robot, and simulation-specific errors), corresponding t-tests of predicted x and y-coordinates were within a 95% confidence interval of the actual position. For the real trial, these positions are slightly skewed right in the x-axis as the robot remained mainly to the left side of the source within the sample area. These simulations demonstrate potential validity for the usage of a particle filter as method of radioactive source localization. In the future, true real-time implementation and data fusion may further augment the performance of the robot to localize lost sources. Additionally, identification of multiple sources, determination of source types, and usage of a collimator are areas to potentially be explored.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2023

A comparison of past and present computational methods for shape analysis of double-shell x-ray radiographs

Implosion symmetry is a key requirement in achieving a robust burning plasma in inertial confinement fusion experiments. In double-shell capsule implosions, we are interested in the shape of the inner shell as it pushes on the fuel. Shape analysis is a popular technique for studying said symmetry during implosion. Combinations of filtering and contour-finding algorithms are studied for their promise in reliably recovering Legendre shape coefficients from synthetic radiographs of double-shell capsules with applied levels of noise. A radial lineout max(slope) method when used on an image pre-filtered with non-local means and a variant of the marching squares algorithm are able to recover p 0 , p 2 , and p 4 maxslope Legendre shape coefficients with mean pixel discrepancy errors of 2.81 and 3.06, respectively, for the noisy synthetic radiographs we consider. Here, this improves upon prior radial lineout methods paired with Gaussian filtering, which we show to be unreliable and whose performance is dependent on input parameters that are difficult to estimate.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

Cauer Prototype for Butterworth Filters: Lowpass, Highpass, Bandpass, and Bandstop Transformations

I had a need to develop a real, physical, analog filter with real RLC components. Having spent a career in theory, I had only ever designed filters for signal processing. I needed only the a and b coefficients. But converting a and b coefficients into RLC values was beyond me. Web searches returned nothing useful until I found Dr. Aaron Danner’s Designing Passive Butterworth Filters (10 - Passive Filters), part of an excellent YouTube series which introduced me to the Cauer prototype for Butterworth filters and Cauer topologies. Failing to find documentation on Cauer filter prototypes, I asked Anthropic’s Claude AI for assistance. Claude returned a few errors which I corrected. This is a comprehensive report on what I learned.

42 ENGINEERING↗
DOE OSTI2025

Covariance operator estimation: Sparsity, lengthscale, and ensemble Kalman filters

This paper investigates covariance operator estimation via thresholding. For Gaussian random fields with approximately sparse covariance operators, we establish non-asymptotic bounds on the estimation error in terms of the sparsity level of the covariance and the expected supremum of the field. We prove that thresholded estimators enjoy an exponential improvement in sample complexity compared with the standard sample covariance estimator if the field has a small correlation lengthscale. As an application of the theory, we study thresholded estimation of covariance operators within ensemble Kalman filters.

Covariance operator estimation↗
DOE OSTI2021

Ring artifact reduction via multiscale nonlocal collaborative filtering of spatially correlated noise

X-ray micro-tomography systems often suffer severe ring artifacts in reconstructed images. These artifacts are caused by defects in the detector, calibration errors, and fluctuations producing streak noise in the raw sinogram data. In this work, these streaks are modeled in the sinogram domain as additive stationary correlated noise upon logarithmic transformation. Based on this model, a streak removal procedure is proposed where the Block-Matching and 3-D (BM3D) filtering algorithm is applied across multiple scales, achieving state-of-the-art performance in both real and simulated data. Specifically, the proposed fully automatic procedure allows for attenuation of streak noise and the corresponding ring artifacts without creating major distortions common to other streak removal algorithms.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗