Search NASA⌕ Search

SEARCH · Search NASA

Results for “Structural 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 811 records · Page 45
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

“Best” Iterative Coupled-Cluster Triples Model? More Evidence for 3CC

To follow up on the unexpectedly good performance of several coupled-cluster models with approximate inclusion of 3-body clusters we performed a more complete assessment of the 3CC method for accurate computational thermochemistry in the standard HEAT framework. New spin-integrated implementation of the 3CC method applicable to closed- and open-shell systems utilizes a new automated toolchain for derivation, optimization, and evaluation of operator algebra in many-body electronic structure. We found that with a double-ζ basis set the 3CC correlation energies and their atomization energy contributions are almost always more accurate (with respect to the CCSDTQ reference) than the CCSDT model as well as the standard CCSD(T) model. The mean absolute errors in cc-pVDZ {3CC, CCSDT, and CCSD(T)} electronic (per valence electron) and atomization energies relative to the CCSDTQ reference for the HEAT data set, were {24, 70, 122} μE h /e and {0.46, 2.00, 2.58} kJ/mol, respectively. The mean absolute errors in the complete-basis-set limit {3CC, CCSDT, and CCSD(T)} atomization energies relative to the HEAT model reference, were {0.52, 2.00, and 1.07} kJ/mol, The significant and systematic reduction of the error by the 3CC method and its lower cost than CCSDT suggests it as a viable candidate for post- CCSD(T) thermochemistry applications, as well as the preferred alternative to CCSDT in general.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

UniKP: a unified framework for the prediction of enzyme kinetic parameters

Prediction of enzyme kinetic parameters is essential for designing and optimizing enzymes for various biotechnological and industrial applications, but the limited performance of current prediction tools on diverse tasks hinders their practical applications. Here, we introduce UniKP, a unified framework based on pretrained language models for the prediction of enzyme kinetic parameters, including enzyme turnover number (k cat ), Michaelis constant (K m ), and catalytic efficiency (k cat / K m ), from protein sequences and substrate structures. A two-layer framework derived from UniKP (EF-UniKP) has also been proposed to allow robust k cat prediction in considering environmental factors, including pH and temperature. In addition, four representative re-weighting methods are systematically explored to successfully reduce the prediction error in high-value prediction tasks. We have demonstrated the application of UniKP and EF-UniKP in several enzyme discovery and directed evolution tasks, leading to the identification of new enzymes and enzyme mutants with higher activity. UniKP is a valuable tool for deciphering the mechanisms of enzyme kinetics and enables novel insights into enzyme engineering and their industrial applications.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Stochastic quantum Krylov protocol with double-factorized Hamiltonians

Here we propose a class of randomized quantum Krylov diagonalization (rQKD) algorithms capable of solving the eigenstate estimation problem with modest quantum resource requirements. Compared to previous real-time evolution quantum Krylov subspace methods, our approach expresses the time evolution operator e –i$\widehat{H}$$\tau$ as a linear combination of unitaries and subsequently uses a stochastic sampling procedure to reduce circuit depth requirements. While our methodology applies to any Hamiltonian with fast-forwardable subcomponents, we focus on its application to the explicitly double-factorized electronic-structure Hamiltonian. To demonstrate the potential of the proposed rQKD algorithm on near-term quantum devices, we provide numerical benchmarks for a variety of molecular systems with circuit-based state-vector simulators including the effects of sampling noise, achieving ground-state energy errors of less than 1 kcal mol -1 with circuit depths orders of magnitude shallower than those required for low-rank deterministic Trotter-Suzuki decompositions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Dynamic linear response quantum algorithm

The dynamic linear response of a quantum system is critical for understanding both the structure and dynamics of strongly interacting quantum systems, including neutron scattering from materials, photon and electron scattering from atomic systems, and electron and neutrino scattering by nuclei. Here, we present a general algorithm for universal quantum computers to calculate the dynamic linear response function with controlled errors and to obtain information about specific final states that can be directly compared to experimental observations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2017

Resilience Design Patterns - A Structured Approach to Resilience at Extreme Scale (version 1.2)

We developed a new structured approach to the management of HPC resilience using the concept of resilience-based design patterns. In general, a design pattern is a repeatable solution to a commonly occurring problem. We identified the well-known solutions that are commonly used to deal with faults, errors and failures in HPC systems. In the initial design patterns specification (version 1.0), we described the various solutions, which address specific problems in the design of resilient HPC environments, in the form of patterns. Each pattern describes a problem caused by a fault, error or failure event in an HPC environment, and then describes the core of the solution of the problem in such a way that this solution may be adapted to different systems and implemented at different layers of the system stack. The catalog of these resilience design patterns provides designers with a collection of design elements. To construct complete resilience solutions using combinations of various patterns, we defined a framework that enhances HPC designers’ understanding of the important constraints and the opportunities for the design patterns to be implemented and deployed at various layers of the system stack. The design framework is also useful for establishing interfaces and mechanisms to coordinate flexible fault management across hardware and software components, as well as to consider the trade-off between performance, resilience, and power consumption when constructing a solution. The resilience design patterns specification version 1.1 included more detailed explanations of the pattern solutions, the context in which the patterns are applicable, and the implications for hardware or software design. It also provided several additional examples and detailed case studies to demonstrate the use of patterns to build realistic solutions. In this version 1.2 of the specification document, we have improved the pattern descriptions, including graphical representations of the pattern components. These improvements are largely based on critical comments, feedback and suggestions received from pattern experts and readers of the previous versions of the specification. The pattern classification has been modified to further clarify the relationships between pattern categories. This version of the specification also introduces a pattern language for resilience design patterns. The pattern language presents the patterns in the catalog as a network, revealing the relations among the resilience patterns. The language provides designers with the means to explore alternative techniques for handling a specific fault model that may have different effciency and complexity characteristics. Using the pattern language also enables the design and implementation of comprehensive resilience solutions as a set of interconnected resilience patterns that can be instantiated across layers of the system stack. The overall goal of this work is to provide hardware and software designers, as well as the users and operators of HPC systems, a systematic methodology for the design and evaluation of resilience technologies in HPC systems that keep scientific applications running to a correct solution in a timely and cost-effcient manner despite frequent faults, errors, and failures of various types.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Chemical Cartography with APOGEE: Mapping Disk Populations with a 2-process Model and Residual Abundances

We apply a novel statistical analysis to measurements of 16 elemental abundances in 34,410 Milky Way disk stars from the final data release (DR17) of APOGEE-2. Building on recent work, we fit median abundance ratio trends [X/Mg] versus [Mg/H] with a 2-process model, which decomposes abundance patterns into a "prompt" component tracing core-collapse supernovae and a "delayed" component tracing Type Ia supernovae. For each sample star, we fit the amplitudes of these two components, then compute the residuals Δ[X/H] from this two-parameter fit. The rms residuals range from ~0.01–0.03 dex for the most precisely measured APOGEE abundances to ~0.1 dex for Na, V, and Ce. The correlations of residuals reveal a complex underlying structure, including a correlated element group comprised of Ca, Na, Al, K, Cr, and Ce and a separate group comprised of Ni, V, Mn, and Co. Selecting stars poorly fit by the 2-process model reveals a rich variety of physical outliers and sometimes subtle measurement errors. Residual abundances allow for the comparison of populations controlled for differences in metallicity and [α/Fe]. Relative to the main disk (R = 3–13 kpc), we find nearly identical abundance patterns in the outer disk (R = 15–17 kpc), 0.05–0.2 dex depressions of multiple elements in LMC and Gaia Sausage/Enceladus stars, and wild deviations (0.4–1 dex) of multiple elements in ω Cen. The residual abundance analysis opens new opportunities for discovering chemically distinctive stars and stellar populations, for empirically constraining nucleosynthetic yields, and for testing chemical evolution models that include stochasticity in the production and redistribution of elements.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2017

Structural insights into the light-driven auto-assembly process of the water-oxidizing Mn 4 CaO 5 -cluster in photosystem II

In plants, algae and cyanobacteria, Photosystem II (PSII) catalyzes the light-driven splitting of water at a protein-bound Mn 4 CaO 5 -cluster, the water-oxidizing complex (WOC). In the photosynthetic organisms, the light-driven formation of the WOC from dissolved metal ions is a key process because it is essential in both initial activation and continuous repair of PSII. Structural information is required for understanding of this chaperone-free metal-cluster assembly. For the first time, we obtained a structure of PSII from Thermosynechococcus elongatus without the Mn 4 CaO 5 -cluster. Surprisingly, cluster-removal leaves the positions of all coordinating amino acid residues and most nearby water molecules largely unaffected, resulting in a pre-organized ligand shell for kinetically competent and error-free photo-assembly of the Mn 4 CaO 5 -cluster. First experiments initiating (i) partial disassembly and (ii) partial re-assembly after complete depletion of the Mn4CaO5-cluster agree with a specific bi-manganese cluster, likely a di-µ-oxo bridged pair of Mn(III) ions, as an assembly intermediate.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

2D-FFTLog: efficient computation of real-space covariance matrices for galaxy clustering and weak lensing

ABSTRACT Accurate covariance matrices for two-point functions are critical for inferring cosmological parameters in likelihood analyses of large-scale structure surveys. Among various approaches to obtaining the covariance, analytic computation is much faster and less noisy than estimation from data or simulations. However, the transform of covariances from Fourier space to real space involves integrals with two Bessel integrals, which are numerically slow and easily affected by numerical uncertainties. Inaccurate covariances may lead to significant errors in the inference of the cosmological parameters. In this paper, we introduce a 2D-FFTLog algorithm for efficient, accurate, and numerically stable computation of non-Gaussian real-space covariances for both 3D and projected statistics. The 2D-FFTLog algorithm is easily extended to perform real-space bin-averaging. We apply the algorithm to the covariances for galaxy clustering and weak lensing for a Dark Energy Survey Year 3-like and a Rubin Observatory’s Legacy Survey of Space and Time Year 1-like survey, and demonstrate that for both surveys, our algorithm can produce numerically stable angular bin-averaged covariances with the flat sky approximation, which are sufficiently accurate for inferring cosmological parameters. The code CosmoCov for computing the real-space covariances with or without the flat-sky approximation is released along with this paper.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

Gottfried Sum Rule in QCD Nonsinglet Analysis of DIS Fixed-Target Data

Deep-inelastic-scattering data from fixed-target experiments on the structure function F{sub 2} were analyzed in the valence-quark approximation at the next-to-next-to-leading-order accuracy level in the strong-coupling constant. In this analysis, parton distributions were parametrized by employing information from the Gottfried sum rule. The strong-coupling constant was found to be α{sub s}(M{sup 2}{sub Z}) = 0.1180 ± 0.0020 (total expt. error), which is in perfect agreement with the world-averaged value from an updated Particle Data Group (PDG) report, α{sup PDG}{sub s} (M{sup 2}{sub Z}) = 0.1181 ± 0.0011. Also, the value of 〈x〉{sub u−d} = 0.187 ± 0.021 found for the second moment of the difference in the u- and d-quark distributions complies very well with the most recent lattice result 〈x〉{sup LATTICE}{sub u−d} = 0.208 ± 0.024.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Prediction of carbon nanostructure mechanical properties and the role of defects using machine learning

Graphene-based nanostructures hold immense potential as strong and lightweight materials, however, their mechanical properties such as modulus and strength are difficult to fully exploit due to challenges in atomic-scale engineering. This study presents a database of over 2,000 pristine and defective nanoscale CNT bundles and other graphitic assemblies, inspired by microscopy, with associated stress–strain curves from reactive molecular dynamics (MD) simulations using the reactive INTERFACE force field (IFF-R). These 3D structures, containing up to 80,000 atoms, enable detailed analyses of structure-stiffness-failure relationships. By leveraging the database and physics- and chemistry-informed machine learning (ML), accurate predictions of elastic moduli and tensile strength are demonstrated at speeds 1,000 to 10,000 times faster than efficient MD simulations. Hierarchical Graph Neural Networks with Spatial Information (HS-GNNs) are introduced, which integrate chemistry knowledge. HS-GNNs as well as extreme gradient boosted trees (XGBoost) achieve forecasts of mechanical properties of arbitrary carbon nanostructures with only 3 to 6% mean relative error. The reliability equals experimental accuracy and is up to 20 times higher than other ML methods. Predictions maintain 8 to 18% accuracy for large CNT bundles, CNT junctions, and carbon fiber cross-sections outside the training distribution. The physics- and chemistry-informed HS-GNN works remarkably well for data outside the training range while XGBoost works well with limited training data inside the training range. The carbon nanostructure database is designed for integration with multimodal experimental and simulation data, scalable beyond 100 nm size, and extendable to chemically similar compounds and broader property ranges. The ML approaches have potential for applications in structural materials, nanoelectronics, and carbon-based catalysts.

Winetrout, Jordan J.↗
DOE OSTI2026

Limiter-aware adaptive excitation control for hydropower generators with legacy voltage regulation systems

Hydropower units often rely on legacy excitation systems with fixed automatic voltage regulator (AVR) settings, but parameter drift, changing operating conditions, and evolving grid-service demands can degrade terminal-voltage regulation over time. This problem should be addressed because poor voltage regulation affects reactive-power support, system stability, and reliable plant operation, and replacing installed AVR and limiter logic is costly and disruptive in practice. To address this issue, this paper proposes a retrofit-friendly enhancement for hydropower generator excitation systems that combines adaptive tuning of the AVR middle lead–lag branch with a small proportional-integral correction for removing steady bias and slow drift. The adaptive laws are normalized, projection-bounded, and equipped with leakage, while adaptation is enabled only in the middle branch. Thus, the intent of the underexcitation and overexcitation limiters, as well as legacy current and rate limits, remains unchanged. Stability is analyzed under incremental performance assumptions, yielding boundedness and asymptotic tracking in the absence of saturation. The method is evaluated using real operational data from a utility-scale hydropower unit at Rocky Reach Dam, Unit C-8. Compared with the fixed AVR baseline, the proposed method reduces terminal-voltage mean squared error by about 70%, removes long periods of steady-state bias, and improves transient tracking while coexisting with limiter actions. These results show that substantial voltage-control improvement can be achieved on existing hydropower units with minimal integration effort and without replacing the installed AVR structure.

ESST5B model↗
DOE OSTI2026

Enabling probabilistic learning on manifolds through double diffusion maps

Here, we present a generative learning framework for probabilistic sampling that extends Probabilistic Learning on Manifolds (PLoM), which is designed to generate statistically consistent realizations of a random vector in a finite-dimensional Euclidean space, informed by a (representative) set of observations. In its original form, PLoM constructs a reduced-order probabilistic model by combining three main components: (a) kernel density estimation to approximate the underlying probability measure, (b) Diffusion Maps to characterize the manifold of the data, and (c) a reduced-order Itô Stochastic Differential Equation (ISDE) to sample from the learned distribution. However, its sampling dynamics are posed in the ambient space and the retained number of reduced coordinates is chosen by projection-reconstruction error. In practice, this often (i) requires more coordinates than the data’s intrinsic dimension to achieve stable sampling and (ii) lacks a smooth, basis-independent lifting back to the data domain; moreover, standard Diffusion Maps emphasize harmonic eigenfunctions and can miss non-harmonic latent structure. We address these limitations by decoupling geometry learning from sampling: a first Diffusion Maps pass identifies non-harmonic coordinates on which we formulate a full-order ISDE directly in the latent space, while Double Diffusion Maps captures multiscale geometric features and Geometric Harmonics (GH) learns a smooth lifting map to the ambient variables that is independent of the particular diffusion basis. This hybrid design preserves the system’s dynamical richness with a compact geometric representation and enables principled out-of-sample inference. The effectiveness and robustness of the proposed method are illustrated through two numerical studies: one based on data generated from two-dimensional Hermite polynomial functions and another based on high-fidelity simulations of a detonation wave in a reactive flow.

Double diffusion maps↗
DOE OSTI2022

Physics-informed graph neural networks for predicting cetane number with systematic data quality analysis

Designing alternative fuels for advanced compression ignition engines necessitates a predictive model for cetane number (CN). In this study, the physics-informed graph neural networks are introduced for a reliable CN prediction by considering molecular features pertinent to the physical properties of molecules that affect CN. The reliability of measured data is another key factor to consider for improving the predictive model. Various experimental instruments for measuring CN exist, including standard and non-standard methods. In this regard, a systematic data quality analysis was carried out for the total 630 CNs collected from literature and new measurements in this study using Advanced Fuel Ignition Delay Analyzer (AFIDA). The results from this data curation process were reflected in the model by imposing lower sample weights on the data coming from less reliable measurement techniques. This approach effectively maximized the prediction accuracy while incorporating data from all available sources. Using the sample weights decreased the mean absolute error (MAE) up to 0.8 CN units. The accuracy was also improved by introducing the CN-related physical properties (the number of hydrogen bond donors and acceptors); the test set MAE is 5.74 and 7.01 for the model with and without such properties, respectively. Investigating molecular structural effects on CN was also carried out to gain chemical insights into factors used to design new fuel candidates. The dimensionality reduction analysis of feature vectors showed a clear clustering in terms of functional groups and CN and the structural effect derived from the model was consistent with the physicochemical insights. Finally, this physics-informed model and data curation would be helpful for accurate CN prediction and inform rational fuel design.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Nuclear quantum effects enter the mainstream

Atomistic simulations of chemical, biological and materials systems have become increasingly precise and predictive owing to the development of accurate and efficient techniques that describe the quantum mechanical behaviour of electrons. Nevertheless, the overwhelming majority of such simulations still assumes that the nuclei behave as classical particles. Historically, this approximation could sometimes be justified owing to the complexity and computational overhead. However, neglecting nuclear quantum effects has become one of the largest sources of error, especially when systems containing light atoms are treated using current state-of-the-art descriptions of chemical interactions. Over the past decade, this realization has spurred a series of methodological advances that have dramatically reduced the cost of including these important physical effects in the structure and dynamics of chemical systems. We discuss how these developments are now allowing nuclear quantum effects to become a mainstream feature of molecular simulations. These advances have led to new insights into phenomena that are relevant to different areas of science — from biochemistry to condensed matter — and open the door to many exciting future opportunities.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2020

A Look Inside the Black Box: Using graph-theoretical descriptors to interpret a Continuous-Filter Convolutional Neural Network (CF-CNN) trained on the global and local minimum energy structures of neutral water clusters

A Continuous Filter Convolutional Neural Network (CF-CNN) was trained to predict the potential energy of water cluster networks \ce{(H2O)_{\textit{N}}}, \textit{N}=10--30, corresponding to local minima lying within 5 kcal/mol from the putative minima taken from a newly published database containing over 5 million unique networks. The chemical sampling space of the database was characterized using chemical descriptors derived from graph theory, which led to the identification of important trends in the topology, connectivity, polygon structures associated with the various networks as a function of cluster size. The resulting graphs are available alongside the original database at \url{https://sites.uw.edu/wdbase/}. The CF-CNN trained on a subset of 500,000 networks for (\textit{N}=10, 30) yielded a mean absolute error of 0.002$\pm$0.002 kcal/mol per water molecule, giving the trained CF-CNN the highest accuracy of any neural network-based surrogate model to date. In addition, clusters of sizes not included in the training set exhibited errors of the same magnitude, indicating that the CF-CNN ptotocol is general enough to accurately predict energies of networks for both smaller and larger sizes than those used during training. The graph-theoretical descriptors were developed in order to analyze the properties of the full database and interpret the predictive power of the CF-CNN. Using topology measures, such as the Wiener index and the average shortest path length along with two similarity measures, we showed that all networks from the test set were within the range of the ones from the training set, suggesting that the training set covered the chemical space of interest quite well. Our graph analysis suggests that the mean degree and number of polygons for networks with larger errors tend to lie further from the mean than those with lower errors. The generality of the used CF-CNN was thus demonstrated, while the use of the graph-theoretical descriptors assisted in interpreting the predicted results.

Bilbrey, Jenna A.↗
DOE OSTI2023

Tiling Framework for Heterogeneous Computing of Matrix based Tiled Algorithms

Tiling matrix operations can improve the load balancing and performance of applications on heterogeneous computing resources. Writing a tile-based algorithm for each operation with a traditional, hand-tuned tiling approach that uses for loops in C/C++ is cumbersome and error prone. Moreover, it must enable and support the heterogeneous memory management of data objects and also explore architecture-supported, native, tiled-data transfer APIs instead of copying the tiled data to continuous memory before the data transfer. The tiling framework provides a tiled data structure for heterogeneous memory mapping and parameterization to a heterogeneous task specification API. We have integrated our tiled framework into MatRIS (Math kernels library using IRIS). IRIS is a heterogeneous run-time framework with a heterogeneous programming model, memory model, and task execution model. Experiments reveal that the tiled framework for BLAS operations has improved the programmability of tiled BLAS and improved performance by ~20% when compared against the traditional method that copies the data to continuous memory locations for heterogeneous computing.

Miniskar, Narasinga Rao↗
DOE OSTI2020

Prediction of Research/Motor Octane Number and Octane Sensitivity Using Artificial Neural Networks

Octane sensitivity (OS), dfined as the research octane number (RON) minus the motor octane number (MON) of a given fuel, has gained interest among researchers due to its apparent ffect on knocking conditions in internal combustion engines. Compounds with a high OS enable higher efficiencies, especially with respect to advanced compression ignition engines. RON/MON must be experimentally tested to determine OS; however, the experimental methods utilized require a substantial amount of time, a significant monetary investment, and specialized equipment. To this end, predictive computational models trained with existing experimental data and molecular properties would allow for the preemptive screening of compounds prior to performing these experiments. The present work proposes two methods for predicting the OS of a given compound: using artficial neural networks (ANNs) trained with quantitative structure-property relationship (QSPR) descriptors to predict RON and MON individually to compute OS from RON/MON predictions (derived octane sensitivity, dOS), and using an ANN trained with QSPR descriptors to directly predict OS. ANNs trained to predict RON and MON achieved test set root-mean-square errors (RMSEs) of 10.499 and 7.551 respectively. dOS calculations were found to have a test set RMSE of 6.432 while predicting OS directly resulted in a test set RMSE of 7.019, showing it is more bene cial to obtain OS from RON/MON predictions than predicting it directly. Furthermore, relationships between individual QSPR descriptors and RON/MON/OS are discussed, highlighting correlations between specfic molecular features and these properties.

09 BIOMASS FUELS↗
DOE OSTI2020

The completed SDSS-IV extended baryon oscillation spectroscopic survey: pairwise-inverse probability and angular correction for fibre collisions in clustering measurements

ABSTRACT The completed extended Baryon Oscillation Spectroscopic Survey (eBOSS) catalogues contain redshifts of 344 080 quasars at 0.8 < z < 2.2, 174 816 luminous red galaxies between 0.6 < z < 1.0, and 173 736 emission-line galaxies over 0.6 < z < 1.1 in order to constrain the expansion history of the Universe and the growth rate of structure through clustering measurements. Mechanical limitations of the fibre-fed spectrograph on the Sloan telescope prevent two fibres being placed closer than 62 arcsec in a single pass of the instrument. These ‘fibre collisions’ strongly correlate with the intrinsic clustering of targets and can bias measurements of the two-point correlation function resulting in a systematic error on the inferred values of the cosmological parameters. We combine the new techniques of pairwise-inverse probability and the angular upweighting (PIP+ANG) to correct the clustering measurements for the effect of fibre collisions. Using mock catalogues, we show that our corrections provide unbiased measurements, within data precision, of both the projected $\rm {\mathit{ w}_p}\left(\mathit{ r}_p\right)$ and the redshift-space multipole ξ(ℓ = 0, 2, 4)(s) correlation functions down to $0.1\, h^{-1}{\rm Mpc}$, regardless of the tracer type. We apply the corrections to the eBOSS DR16 catalogues. We find that, on scales $s\gtrsim 20\, h^{-1}{\rm Mpc}$ for ξℓ, as used to make baryon acoustic oscillation and large-scale redshift-space distortion measurements, approximate methods such as nearest-neighbour upweighting are sufficiently accurate given the statistical errors of the data. Using the PIP method, for the first time for a spectroscopic program of the Sloan Digital Sky Survey, we are able to successfully access the one-halo term in the clustering measurements down to $\sim 0.1\, h^{-1}{\rm Mpc}$ scales. Our results will therefore allow studies that use the small-scale clustering to strengthen the constraints on both cosmological parameters and the halo occupation distribution models.

79 ASTRONOMY AND ASTROPHYSICS↗