Search NASA⌕ Search

SEARCH · Search NASA

Results for “polynomial filtering”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Scalable implementation of polynomial filtering for density functional theory calculation in PARSEC

In this work, we present an efficient implementation of polynomial filtering methods in PARSEC, a real-space pseudopotential based Kohn–Sham density functional theory solver. The implementation described here improves upon a Chebyshev-filtered subspace iteration algorithm used in the previous version of PARSEC. We present a hybrid polynomial filtering scheme that combines Chebyshev-filtered subspace iteration and a spectrum slicing method that partitions the spectrum into several spectral slices and uses bandpass-filtered subspace iteration to compute approximate eigenpairs within each interior slice simultaneously. We describe a procedure to partition a spectrum and construct polynomial filters. We also discuss a number of practical issues such as the use of appropriate data layouts for carrying out the computation on a two-dimensional process grid and how to achieve good load balance by allocating an appropriate number of process groups to each spectral slice. Numerical examples are presented to demonstrate the effectiveness of the hybrid polynomial filtering method as well as the superior parallel scalability of spectrum slicing in comparison to that of Chebyshev-filtered subspace iteration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Planetary normal mode computation: Parallel algorithms, performance and reproducibility

This report is an extension of work entitled “Computing planetary interior normal modes with a highly parallel polynomial filtering eigensolver.” by Shi et al., [1] originally presented at the SC18 conference. A highly parallel polynomial filtered eigensolver was developed and exploited to calculate the planetary normal modes. The proposed method is ideally suited for computing interior eigenpairs for large-scale eigenvalue problems as it greatly enhances memory and computational efficiency. In this article, the second-order finite element method is used to further improve the accuracy as only the first-order finite element method was deployed in the previous work. The parallel algorithm, its parallel performance up to 20k processors, and the great computational accuracy are illustrated. The reproducibility of the previous work was successfully performed on the Student Cluster Competition at the SC19 conference by several participant teams using a completely different Mars-model dataset on different clusters. Both weak and strong scaling performances of the reproducibility by the participant teams were impressive and encouraging. The analysis and reflection of their results are demonstrated and future direction is discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Non-perturbative Approach to Computing Seismic Normal Modes in Rotating Planets

In this work, a continuous Galerkin method based approach is presented to compute the seismic normal modes of rotating planets. Special care is taken to separate out the essential spectrum in the presence of a fluid outer core using a polynomial filtering eigensolver. The relevant elastic-gravitational system of equations, including the Coriolis force, is subjected to a mixed finite-element method, while self-gravitation is accounted for with the fast multipole method. Our discretization utilizes fully unstructured tetrahedral meshes for both solid and fluid regions. The relevant eigenvalue problem is solved by a combination of several highly parallel and computationally efficient methods. We validate our three-dimensional results in the non-rotating case using analytical results for constant elastic balls, as well as numerical results for an isotropic Earth model from standard “radial” algorithms. We also validate the computations in the rotating case, but only in the slowly-rotating regime where perturbation theory applies, because no other independent algorithms are available in the general case. The algorithm and code are used to compute the point spectra of eigenfrequencies in several Earth and Mars models studying the effects of heterogeneity on a large range of scales.

58 GEOSCIENCES↗
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 OSTI2020

Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems

We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial state with non-trivial overlap with the target eigenstate and have a reasonable lower bound for the spectral gap. We apply this algorithm to the quantum linear system problem (QLSP), and present two algorithms based on quantum adiabatic computing (AQC) and quantum Zeno effect respectively. Both algorithms prepare the final solution as a pure state, and achieves the near optimal $\mathcal{\tilde{O}}$(dκlog(1/ϵ)) query complexity for a d -sparse matrix, where κ is the condition number, and ϵ is the desired precision. Neither algorithm uses phase estimation or amplitude amplification.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

On detrending stream velocity time series for robust tidal flow turbulence characterization

We investigated the impact of detrending techniques on turbulence quantities from tidal stream flow data, focusing on the autocorrelation function, $ρ_{uu}$, and velocity spectrum, $Φ(f)$. Standard detrending methods, including high-pass frequency-based and polynomial-based techniques, are examined, alongside a proposed alternative method, the empirical mode decomposition (EMD). Our results highlight that intervals of flow acceleration and deceleration, typical in tidal and riverine flows, significantly affect the estimation of turbulence quantities using high-pass frequency filtering and polynomial detrending of varying orders. These methods can strongly influence $ρ_{uu}$ and $Φ(f)$, thereby affecting the accurate estimation of derived quantities. We examine two variations of detrending data using EMD; the first removes only the EMD residue, and the second removes both the residue and the largest scale intrinsic mode function (IMF). By comparing the detrended spectra with the modeled von Kármán spectra, we demonstrate that the second variation (i.e., removing the residue and the largest scale IMF) successfully removed the large-scale trend of the data while retaining the energy of other scales.

Detrend↗
DOE OSTI2021

Fast and robust all-electron density functional theory calculations in solids using orthogonalized enriched finite elements

Here, we present a computationally efficient approach to perform systematically convergent real-space all-electron Kohn-Sham density functional theory calculations for solids using an enriched finite element (FE) basis. The enriched FE basis is constructed by augmenting the classical FE basis with atom-centered numerical basis functions, comprising of atomic solutions to the Kohn-Sham problem. Notably, to improve the conditioning, we orthogonalize the enrichment functions with respect to the classical FE basis, without sacrificing the locality of the resultant basis. In addition to improved conditioning, this orthogonalization procedure also renders the overlap matrix block diagonal, greatly simplifying its inversion. Subsequently, we use a Chebyshev polynomial based filtering technique to efficiently compute the occupied eigenspace in each self-consistent field iteration. We demonstrate the accuracy and efficiency of the proposed approach on periodic unit cells and supercells. The benchmark studies show a staggering 130× speedup of the orthogonalized enriched FE basis over the classical FE basis. We also present a comparison of the orthogonalized enriched FE basis with the linearized augmented plane-wave + local orbitals basis, both in terms of accuracy and efficiency. Notably, we demonstrate that the orthogonalized enriched FE basis can handle large system sizes of ~10 000 electrons. Finally, we observe good parallel scalability of our implementation with 92% efficiency at 22× speedup for a system with 620 electrons

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Feasibility of DEIM for retrieving the initial field via dimensionality reduction

When parameter estimation is solved in a high-dimensional space, the dimensionality reduction strategy becomes the primary consideration for alleviating the tremendous computational cost. Here, the discrete empirical interpolation method (DEIM) is explored to retrieve the initial condition (IC) by combining the polynomial chaos (PC) based ensemble Kalman filter (i.e. PC-EnKF), where a non-intrusive PC expansion is considered as a surrogate model in place of the forward model in the prediction step of the ensemble Kalman filter, resulting in fewer forward model integrations but with a comparable accuracy as Monte Carlo-based approaches. The DEIM acts as a hyper-reduction tool to provide the low-dimensional input for the high-dimensional initial field, which can be reconstructed using the information on the sparse interpolation grid points that is adaptively obtained through PC-EnKF data assimilation method. Thus an innovative framework to reconstruct the IC is developed. The detailed procedure at each assimilation iteration includes: the determination of the spatial interpolation points, the estimation of the initial values on the interpolation locations using the optimal observations, and the reconstruction of IC in the full space. The current study uses the reconstruction field of initial conditions of the Navier-Stokes equations as an example to illustrate the efficacy of our method. The experimental results demonstrate the proposed algorithm achieves a satisfactory reconstruction for the initial field. The proposed method helps to extend the applicable area of DEIM in solving inverse problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Estimation of Large-Scale Wind Field Characteristics Using Supervisory Control and Data Acquisition Measurements

As the wind energy industry continues to push for increased power production and lower cost of energy, the focus of research has expanded from individual turbines to entire wind farms. Among a host of interesting problems to be solved when considering the wind farm as a whole, we consider the challenge of scalar field estimation, based on information already collected at the individual turbine level. We aim to estimate the large-scale, low-frequency characteristics of the wind field, such as the mean wind direction and the overall decrease in wind speed across the farm, and employ a Kalman filter that models the wind field using a polynomial function. We compare the proposed method’s performance to both a simple averaging technique and filtering of individual turbine measurements. The method presented is not limited to wind turbines and is applicable in other situations where multiple remote agents are used to estimate a scalar field.

estimation↗
DOE OSTI2023

Adaptive Online Multivariate Signal Extraction With Locally Weighted Robust Polynomial Regression

High-frequency, multivariate data collected in real-time and used to control or make decisions regarding a process’ operation often contain some noise and outliers. Thus, a method to extract the signal is needed in order to reduce the number and magnitude of control-based adjustments that are implemented. Such a method must be (i) online, depending only on past and current observations; (ii) fast, producing a smooth value more quickly than the measurement frequency; (iii) robust, ignoring brief bursts of erroneously measured values; (iv) multivariate, ignoring observations that are jointly unusual; (v) adaptive, adjusting to periods of rapid fluctuation in the signal versus periods of stability; and (vi) purely data-driven, not incorporating any information about the process from which the data are collected. Most existing methods are only able to address a subset of these six features. Furthermore, we also require the method to be nonlinear, providing a local nonlinear estimate of the signal. In this work, we propose a novel, real-time signal extraction method based on a local, robust polynomial fit. We demonstrate the performance of our method compared to a state-of-the-art competitor through simulation. For illustration, the methodology is applied to data collected from a reverse osmosis water treatment process.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Novel Modeling Framework for Computationally Efficient and Accurate Real-Time Ensemble Flood Forecasting With Uncertainty Quantification

A novel modeling framework that simultaneously improves accuracy, predictability, and computational efficiency is presented. It embraces the benefits of three modeling techniques integrated together for the first time: surrogate modeling, parameter inference, and data assimilation. The use of polynomial chaos expansion (PCE) surrogates significantly decreases computational time. Parameter inference allows for model faster convergence, reduced uncertainty, and superior accuracy of simulated results. Ensemble Kalman filters assimilate errors that occur during forecasting. To examine the applicability and effectiveness of the integrated framework, we developed 18 approaches according to how surrogate models are constructed, what type of parameter distributions are used as model inputs, and whether model parameters are updated during the data assimilation procedure. We conclude that (1) PCE must be built over various forcing and flow conditions, and in contrast to previous studies, it does not need to be rebuilt at each time step; (2) model parameter specification that relies on constrained, posterior information of parameters (so-called Selected specification) can significantly improve forecasting performance and reduce uncertainty bounds compared to Random specification using prior information of parameters; and (3) no substantial differences in results exist between single and dual ensemble Kalman filters, but the latter better simulates flood peaks. The use of PCE effectively compensates for the computational load added by the parameter inference and data assimilation (up to ~80 times faster). Therefore, the presented approach contributes to a shift in modeling paradigm arguing that complex, high-fidelity hydrologic and hydraulic models should be increasingly adopted for real-time and ensemble flood forecasting.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Asymptotic consistency of the WSINDy algorithm in the limit of continuum data

In this work we study the asymptotic consistency of the weak-form sparse identification of nonlinear dynamics algorithm (WSINDy) in the identification of differential equations from noisy samples of solutions. We prove that the WSINDy estimator is unconditionally asymptotically consistent for a wide class of models that includes the Navier–Stokes, Kuramoto–Sivashinsky and Sine–Gordon equations. We thus provide a mathematically rigorous explanation for the observed robustness to noise of weak-form equation learning. Conversely, we also show that, in general, the WSINDy estimator is only conditionally asymptotically consistent, yielding discovery of spurious terms with probability one if the noise level exceeds a critical threshold σ c . We provide explicit bounds on σ c in the case of Gaussian white noise and we explicitly characterize the spurious terms that arise in the case of trigonometric and/or polynomial libraries. Furthermore, we show that, if the data is suitably denoised (a simple moving average filter is sufficient), then asymptotic consistency is recovered for models with locally-Lipschitz, polynomial-growth nonlinearities. Our results reveal important aspects of weak-form equation learning, which may be used to improve future algorithms. We demonstrate our findings numerically using the Lorenz system, the cubic oscillator, a viscous Burgers-growth model and a Kuramoto–Sivashinsky-type high-order PDE.

asymptotic consistency↗
DOE OSTI2024

An Envelope Time Synchronous Averaging for Wind Turbine Gearbox Fault Diagnosis

Vibration-based condition monitoring techniques are widely used for diagnosing faults in rotating machines. These techniques are implemented in the time domain, the frequency domain, or both. However, the composite and noisy nature of the raw data collected requires a preprocessing stage such as filtering and decomposition using in-depth processing techniques. Moreover, these methods require good frequency resolution and involve examining a broad frequency range to discern both healthy and faulty cases. In this work, we introduce a simple and fast diagnostic scheme for wind turbine gear teeth wear based on time domain analysis. The proposed method is based on the local minima interpolation of a filtered version of the vibration signal following time synchronous averaging (TSA) technique. Given tachometer signal, the TSA of the vibration data is performed using MTALAB software. Then, local minima of the filtered signal are interpolated using the Piecewise Cubic Hermite Interpolating Polynomial (PCHIP) function. The variance of the interpolated curve built a gear fault index. The derived fault index resulting of the proposed technique allows a substantial distinction between the healthy and faulty cases. Its efficiency is validated using 10 real-world datasets of vibration stemmed from a wind turbine planetary gearbox. The proposed method boasts a low computation time and ease of interpretation, specifically beneficial for gearbox fault diagnosis purposes.

fault diagnosis↗
DOE OSTI2020

Stretched and Filtered Multigroup Pn Transport for Improved Positivity and Accuracy

One of the common methods for solving the radiation transport equation is to use a polynomial expansion for the angle variable(s). Recent research that reduces the oscillations and improves the positivity of the gray transport equation solutions is here applied to the multigroup transport equations. Constant scale factors that stretch the time axis and constant scattering opacities that filter the solution greatly increase the accuracy of the solution with no added nonlinearities. No new solution techniques are required. Test problems are presented in one and two dimensions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

ZTF-SEDm Type Ia supernova sample for Twins Embedding spectrophotometric standardization

Aims. This paper has two aims: the first aim is to build a large homogeneous spectrophotometric sample of Type Ia supernovae (SNe Ia) from the second data release of the Zwicky Transient Facility (ZTF DR2). We used the spectrum sample from the low-resolution ( R ∼ 100) SEDmachine (SEDm) Integral Field Spectrograph (IFS) that gathered 3069 spectra. This is one of the largest samples of such collections that can attempt to reproduce the Twins Embedding (TE) spectrophotometric standardization method. This is our second objective. The method was developed based on high-quality spectra from 200 SNe Ia of the Nearby Supernova factory (SNfactory) and led to an exceptionally low value of 0.073 mag for the intrinsic scatter. Methods. As the SEDm is not designed as a spectrophotometric instrument, we first improved the flux-calibration accuracy of the SN Ia spectrum sample using the ZTF photometric data, which were calibrated at the percent level. We corrected the spectra for second-order polynomials, fitted by comparing the synthetic photometry in the ZTF g , r , i filters with the light-curve (LC) data. We then applied the three steps of the TE parameterization to a subset of 783 ZTF SN spectra near maximum light while comparing results from SNfactory and ZTF. We finally analyzed the standardization methods based on the TE parameters. Results. The precision of the phase-correction model, which is the first step of the TE, is estimated at 0.01 mag in g band based on ZTF data. Despite the challenge posed by the spectrum-extraction pipeline associated with the SEDm (flux calibration, leftover host signal, low signal-to-noise ratio, and low resolution), we applied a first standardization in color based on the second step of the TE, called read between the lines (RBTL), to the ZTF sample. We reached a Hubble residual scatter of 0.153 mag, all in normalized median absolute deviation, which is to be compared to the ∼0.11 mag obtained with the SNfactory data. The SALT color and stretch standardization reaches a scatter of 0.164 mag for the same ZTF SN Ia sample, and its host steps are ∼0.1 mag and zero for RBTL. When considering the scatter due to the redshift error and flux calibration error, we estimated a RBTL scatter of ∼0.129 mag for this ZTF sample as an upper limit because we identified an additional contribution from a systematic error in color. We tested the standardization based on the nonlinear TE parameters, and, as expected from the low spectrum quality, it did not improve the overall dispersion. Conclusions. We release 1897 flux calibrated spectra of 1607 SNe Ia with an estimated photometric accuracy of 0.07 mag. We further demonstrate that some amount of spectrophotometric SN Ia standardization can be done with limited-quality spectra. The RBTL standardization is more efficient than that of SALT with one parameter less, and the resulting host steps are consistent with zero. This makes it less prone to astrophysical bias. For future spectroscopic surveys, targeting the extraction pipeline for a thorough flux calibration and good signal-to-noise ratio would enable us to compute the full TE standardization, which would further reduce the scatter in the distance estimate.

Ganot, C↗
DOE OSTI2020

Estimation of Large-Scale Wind Field Characteristics Using Supervisory Control and Data: Preprint

As the wind energy industry continues to pushfor increased power production and lower cost of energy, thefocus of research has expanded from individual turbines toentire wind farms. Among a host of interesting problems to besolved when considering the wind farm as a whole, we considerthe challenge of scalar field estimation, based on informationalready collected at the individual turbine level. We aim toestimate the large-scale, low-frequency characteristics of thewind field, such as the mean wind direction and the overalldecrease in wind speed across the farm, and employ a Kalmanfilter that models the wind field using a polynomial function.We compare the proposed method’s performance to both asimple averaging technique and filtering of individual turbinemeasurements. The method presented is not limited to windturbines and is applicable in other situations where multipleremote agents are used to estimate a scalar field.

large scale↗
DOE OSTI2021

Efficient phase-factor evaluation in quantum signal processing

Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in principle be obtained for a range of tasks, such as Hamiltonian simulation and the quantum linear system problem. A further benefit of QSP is that it uses a minimal number of ancilla qubits, which facilitates its implementation on near-to-intermediate term quantum architectures. However, there is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits. Existing methods require the use of variable precision arithmetic and can only be applied to polynomials of a relatively low degree. We present here an optimization-based method that can accurately compute the phase factors using standard double precision arithmetic operations. We demonstrate the performance of this approach with applications to Hamiltonian simulation, eigenvalue filtering, and quantum linear system problems. Furthermore, our numerical results show that the optimization algorithm can find phase factors to accurately approximate polynomials of a degree larger than 10000 with errors below 10 -12 .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗