Search NASA⌕ Search

SEARCH · Search NASA

Results for “Constraints”

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 OSTI2025

From Existing and New Nuclear and Astrophysical Constraints to Stringent Limits on the Equation of State of Neutron-Rich Dense Matter

Through continuous progress in nuclear theory and experiment and an increasing number of neutron-star (NS) observations, a multitude of information about the equation of state (EOS) for matter at extreme densities is available. To constrain the EOS across its entire density range, this information needs to be combined consistently. However, the impact and model dependency of individual observations vary. Given their growing number, assessing the various methods is crucial to compare the respective effects on the EOS and discover potential biases. For this purpose, we present a broad compendium of different constraints and apply them individually to a large set of EOS candidates within a Bayesian framework. Specifically, we explore different ways of how chiral effective field theory and perturbative quantum chromodynamics can be used to place a likelihood on EOS candidates. We also investigate the impact of nuclear experimental constraints, as well as different radio and x-ray observations of NS masses and radii. This is augmented by reanalyses of the existing data from binary neutron star coalescences, in particular of GW170817, with improved models for the tidal waveform and kilonova light curves, which we also utilize to construct a tight upper limit of 2.39 M ⊙ on the TOV mass based on GW170817’s remnant. Our diverse set of constraints is eventually combined to obtain stringent limits on NS properties. We organize the combination in a way to distinguish between constraints where the systematic uncertainties are deemed small and those that rely on less conservative assumptions. For the former, we find the radius of the canonical 1.4 M ⊙ neutron star to be R 1.4 = 12.2 6 − 0.91 + 0.80 km and the TOV mass at M TOV = 2.2 5 − 0.22 + 0.42 M ⊙ (95% credibility). Including all the presented constraints yields R 1.4 = 12.2 0 − 0.48 + 0.50 km and M TOV = 2.3 0 − 0.20 + 0.07 M ⊙ . When comparing these limits to individual data points, we find that the quoted radius of HESS J1731-347 displays noticeable tension with other constraints. Constraining microphysical properties of the EOS proves more challenging. For instance, the symmetry energy slope is restricted to L sym = 48 − 25 + 21 MeV , where this constraint is mainly dominated by our reanalysis of the PREX-II and CREX experiment. Published by the American Physical Society 2025

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Scalable Pattern Matching in Metadata Graphs via Constraint Checking

Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1990

Conservative buffering of approximate nonlinear constraints

In engineering design practice behavior is usually predicted based on some known nominal design. However, when the design is fabricated it will differ from the nominal design because of manufacturing tolerances. In order to generate nominal designs that will still satisfy behavior constraints in the presence of manufacturing tolerances, engineers resort to the use of safety factors, over and above those introduced to account for other uncertainties (e.g., in load conditions, material properties, analysis modeling). The accurate selection of the values of these manufacturing tolerances safety factors is dependent on the capability of the engineer to determine the sensitivity of the critical constraints to changes in the design variables. This process usually leads to overly conservative designs. The task of choosing safety factors is much more difficult in structural synthesis because: (1) it is not known which constraints will be active at the final design, (2) as the design changes during the synthesis process the sensitivities of the constraints with respect to the design variables also change, and (3) the imposition of the safety factors themselves may change the set of critical constraints. These difficulties can be overcome with the approximation concepts approach to structural synthesis by buffering the approximate constraints with quantities that are related to the design variable tolerances and the accurate sensitivities of the constraints with respect to the design variable. Designs generated by this approach tend to be feasible but not overly conservative.

Thomas, H. L.↗
NASA NTRS2000

Optimization of Car Body under Constraints of Noise, Vibration, and Harshness (NVH), and Crash

To be competitive on the today's market, cars have to be as light as possible while meeting the Noise, Vibration, and Harshness (NVH) requirements and conforming to Government-man dated crash survival regulations. The latter are difficult to meet because they involve very compute-intensive, nonlinear analysis, e.g., the code RADIOSS capable of simulation of the dynamics, and the geometrical and material nonlinearities of a thin-walled car structure in crash, would require over 12 days of elapsed time for a single design of a 390K elastic degrees of freedom model, if executed on a single processor of the state-of-the-art SGI Origin2000 computer. Of course, in optimization that crash analysis would have to be invoked many times. Needless to say, that has rendered such optimization intractable until now. The car finite element model is shown. The advent of computers that comprise large numbers of concurrently operating processors has created a new environment wherein the above optimization, and other engineering problems heretofore regarded as intractable may be solved. The procedure, shown, is a piecewise approximation based method and involves using a sensitivity based Taylor series approximation model for NVH and a polynomial response surface model for Crash. In that method the NVH constraints are evaluated using a finite element code (MSC/NASTRAN) that yields the constraint values and their derivatives with respect to design variables. The crash constraints are evaluated using the explicit code RADIOSS on the Origin 2000 operating on 256 processors simultaneously to generate data for a polynomial response surface in the design variable domain. The NVH constraints and their derivatives combined with the response surface for the crash constraints form an approximation to the system analysis (surrogate analysis) that enables a cycle of multidisciplinary optimization within move limits. In the inner loop, the NVH sensitivities are recomputed to update the NVH approximation model while keeping the Crash response surface constant. In every outer loop, the Crash response surface approximation is updated, including a gradual increase in the order of the response surface and the response surface extension in the direction of the search. In this optimization task, the NVH discipline has 30 design variables while the crash discipline has 20 design variables. A subset of these design variables (10) are common to both the NVH and crash disciplines. In order to construct a linear response surface for the Crash discipline constraints, a minimum of 21 design points would have to be analyzed using the RADIOSS code. On a single processor in Origin 2000 that amount of computing would require over 9 months! In this work, these runs were carried out concurrently on the Origin 2000 using multiple processors, ranging from 8 to 16, for each crash (RADIOSS) analysis. Another figure shows the wall time required for a single RADIOSS analysis using varying number of processors, as well as provides a comparison of 2 different common data placement procedures within the allotted memories for each analysis. The initial design is an infeasible design with NVH discipline Static Torsion constraint violations of over 10%. The final optimized design is a feasible design with a weight reduction of 15 kg compared to the initial design. This work demonstrates how advanced methodology for optimization combined with the technology of concurrent processing enables applications that until now were out of reach because of very long time-to-solution.

Kodiyalam, Srinivas↗
NASA NTRS2003

Kalman Filtering with Inequality Constraints for Turbofan Engine Health Estimation

Kalman filters are often used to estimate the state variables of a dynamic system. However, in the application of Kalman filters some known signal information is often either ignored or dealt with heuristically. For instance, state variable constraints (which may be based on physical considerations) are often neglected because they do not fit easily into the structure of the Kalman filter. This paper develops two analytic methods of incorporating state variable inequality constraints in the Kalman filter. The first method is a general technique of using hard constraints to enforce inequalities on the state variable estimates. The resultant filter is a combination of a standard Kalman filter and a quadratic programming problem. The second method uses soft constraints to estimate state variables that are known to vary slowly with time. (Soft constraints are constraints that are required to be approximately satisfied rather than exactly satisfied.) The incorporation of state variable constraints increases the computational effort of the filter but significantly improves its estimation accuracy. The improvement is proven theoretically and shown via simulation results. The use of the algorithm is demonstrated on a linearized simulation of a turbofan engine to estimate health parameters. The turbofan engine model contains 16 state variables, 12 measurements, and 8 component health parameters. It is shown that the new algorithms provide improved performance in this example over unconstrained Kalman filtering.

Simon, Dan↗
NASA NTRS2006

Automated Derivation of Complex System Constraints from User Requirements

International Space Station (ISS) payload developers submit their payload science requirements for the development of on-board execution timelines. The ISS systems required to execute the payload science operations must be represented as constraints for the execution timeline. Payload developers use a software application, User Requirements Collection (URC), to submit their requirements by selecting a simplified representation of ISS system constraints. To fully represent the complex ISS systems, the constraints require a level of detail that is beyond the insight of the payload developer. To provide the complex representation of the ISS system constraints, HOSC operations personnel, specifically the Payload Activity Requirements Coordinators (PARC), manually translate the payload developers simplified constraints into detailed ISS system constraints used for scheduling the payload activities in the Consolidated Planning System (CPS). This paper describes the implementation for a software application, User Requirements Integration (URI), developed to automate the manual ISS constraint translation process.

Muery, Kim↗
DOE OSTI2021

Comprehension of Spatial Constraints by Neural Logic Learning from a Single RGB-D Scan

Autonomous industrial assembly relies on the precise measurement of spatial constraints as designed by computer-aided design (CAD) software such as SolidWorks. This paper proposes a framework for an intelligent industrial robot to understand the spatial constraints for model assembly. An extended generative adversary network (GAN) with a 3D long short-term memory (LSTM) network was designed to composite 3D point clouds from a single RGB-D scan. The spatial constraints of the segmented point clouds are identified by a neural-logic network that incorporates general knowledge of spatial constraints in terms of first-order logic. The model was designed to comprehend a complete set of spatial constraints that are consistent with industrial CAD software, including left, right, above, below, front, behind, parallel, perpendicular, concentric, and coincident relations. The accuracy of 3D model composition and spatial constraint identification was evaluated by the RGB-D scans and 3D models in the ABC dataset. The proposed model achieved 57.23% intersection over union (IoU) in 3D model composition, and over 99% in comprehending all spatial constraints.

Wang, Dali↗
DOE OSTI2022

Manufacturing and stiffness constraints for topology optimized periodic structures

Topology optimization (TO) is commonly applied to design the unit cells of periodic structures. For example, metamaterials, lattice structures, phononic crystals (PhC), and photonic crystals (PC) have all been previously designed via TO. Unfortunately, the optimal structures for certain design objectives, e.g., bandgaps, are often impossible to manufacture as they have disconnected regions or “islands” of solid material (ISM) that are not self-supporting. Additionally, designs with enclosed void space (EVS) are problematic for additive manufacturing (AM) since support material or pre-sintered powder cannot be removed after manufacturing. We present a series of constraints that may be incorporated into any TO framework to ensure structures are self-supporting without enclosed voids. Additionally, we employ homogenization-based constraints that allow the designer to tune the elastic stiffness and isotropy of the optimized design. The proposed constraints are evaluated on example microstructures and utilized in a simple optimization test problem to highlight their abilities and limitations so that guidelines for appropriate combinations of constraints may be proposed. Effective constraint combinations are demonstrated on the design of 3D photonic crystals for maximum bandgap subject to manufacturing and stiffness constraints.

42 ENGINEERING↗
DOE OSTI2025

Preserving nonlinear constraints in variational flow filtering data assimilation

Data assimilation aims to estimate the states of a dynamical system by optimally combining sparse and noisy observations of the physical system with uncertain forecasts produced by a computational model. The states of many dynamical systems of interest obey nonlinear physical constraints, and the corresponding dynamics is confined to a certain sub-manifold of the state space. Standard data assimilation techniques applied to such systems yield posterior states lying outside the manifold, violating the physical constraints. This work focuses on particle flow filters which use stochastic differential equations to evolve state samples from a prior distribution to samples from an observation-informed posterior distribution. The variational Fokker-Planck (VFP)—a generic particle flow filtering framework—is extended to incorporate non-linear, equality state constraints in the analysis. To this end, two algorithmic approaches that modify the VFP stochastic differential equation are discussed: (i) VFPSTAB, to inexactly preserve constraints with the addition of a stabilizing drift term, and (ii) VFPDAE, to exactly preserve constraints by treating the VFP dynamics as a stochastic differential-algebraic equation (SDAE). Additionally, an implicit-explicit time integrator is developed to evolve the VFPDAE dynamics. The strength of the proposed approach for constraint preservation in data assimilation is demonstrated on three test problems: the double pendulum, Korteweg-de-Vries, and the incompressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Determination of Constraint-Independent Crack Tip Opening Angle for Stable Crack Growth in High-Strength Ductile Steels

The crack tip opening angle (CTOA) is one of fracture toughness parameters that has been used for decades in describing large stable crack growth in thin-walled aerospace structures under the low-constraint conditions. Recently, the pipeline industry has developed a growing interest in using the CTOA parameter to serve as the minimum required fracture toughness to arrest dynamic crack propagation in modern gas transmission pipelines made of high-strength ductile steel. To meet this industrial need, the CTOA test standard ASTM E3039 was therefore developed for measuring the constant critical CTOA. ASTM E3039 recommends a drop weight tearing test (DWTT) specimen with a shallow crack for standard CTOA testing, but its CTOA may depend on the low constraint condition of the DWTT specimen at the crack tip. Verifying the constraint independence of the DWTT-measured CTOA thus becomes indispensable for applying CTOA toughness to the running fracture control in the pipeline design. For this purpose, the present paper evaluates critical CTOA values in a set of fracture toughness tests on single-edge notched bend (SENB) specimens with shallow and deep cracks, based on four CTOA estimation models. Among these, the Ln(P)-LLD linear fit model is similar to that recommended by ASTM E3039 for CTOA calculation. Fracture test data for X80 pipeline steel and HY80 structural steel were considered in the CTOA evaluation. The results showed that the four CTOA models were able to determine a constraint independent CTOA value for stable crack growth in the SENB specimens. As a result, a single, reliable, constant CTOA value could be determined regardless of the specimen geometry or the crack-tip constraint conditions. Therefore, the CTOA measured using ASTM E3039 is constraint-independent and transferable to use in cases of actual cracks propagating in gas transmission pipelines.

36 MATERIALS SCIENCE↗
NASA NTRS2006

Measuring Constraint-Set Utility for Partitional Clustering Algorithms

Clustering with constraints is an active area of machine learning and data mining research. Previous empirical work has convincingly shown that adding constraints to clustering improves the performance of a variety of algorithms. However, in most of these experiments, results are averaged over different randomly chosen constraint sets from a given set of labels, thereby masking interesting properties of individual sets. We demonstrate that constraint sets vary significantly in how useful they are for constrained clustering; some constraint sets can actually decrease algorithm performance. We create two quantitative measures, informativeness and coherence, that can be used to identify useful constraint sets. We show that these measures can also help explain differences in performance for four particular constrained clustering algorithms.

constraints↗
DOE OSTI2023

High-throughput exploration of the WMoVTaNbAl refractory multi-principal-element alloys under multiple-property constraints

Development of next-generation gas turbines requires the design and fabrication of novel high-temperature structural materials capable of operating beyond 1300°C. Here, we propose a high-throughput alloy design framework under multiple-property constraints to discover new refractory multi-principal element alloys (MPEAs) for high-temperature applications. The framework treats the development of MPEAs as a composition-agnostic constraint satisfaction problem, i.e., no prescriptions are made concerning the design space before performing investigatory calculations. We target alloys in the WMoVTaNbAl chemistry space that are predicted to meet constraints on the following properties simultaneously: single-phase stability, density, solidus temperature, yield strength at 1300°C, and ductile-to-brittle-transition temperature. These properties are relevant to both applications in gas turbines and manufacturability. A set of 214 MoNbV-rich alloys meet these relevant constraints. These feasible alloys are investigated with density functional theory (DFT) to provide a fundamental electronic basis for their superior properties. Three compositionally representative alloys from the feasible design space (Mo 45 Nb 35 Ta 5 V 15 , Mo 25 Nb 50 V 20 W 5 , and Mo 30 Nb 35 Ta 5 V 25 W 5 ) are selected with a k-medoids-based design scheme for detailed DFT analysis and experimental characterization. The DFT analysis predicted a single-phase BCC at high temperatures with a high yield strength for all three MPEAs, in agreement with CALPHAD (CALculation of PHAse Diagrams) and experiments, respectively. These three alloys are benchmarked against a public database of 1546 MPEAs. Concerning the aforementioned constraints, the Mo 30 Nb 35 Ta 5 V 25 W 5 alloy outperforms these 1546 MPEAs. The present work demonstrates the ability of the proposed design methodology to identify candidate alloys for a given application under multiple property constraints in a combinatorically vast design space.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Beyond – ΛCDM constraints from the full shape clustering measurements from BOSS and eBOSS

We analyse the full shape of anisotropic clustering measurements from the extended Baryon Oscillation Spectroscopic Survey quasar sample together with the combined galaxy sample from the Baryon Oscillation Spectroscopic Survey. We obtain constraints on the cosmological parameters independent of the Hubble parameter h for the extensions of the Lambda cold dark matter (ΛCDM) models, focusing on cosmologies with free dark energy equation of state parameter w. We combine the clustering constraints with those from the latest cosmic microwave background data from Planck to obtain joint constraints for these cosmologies for w and the additional extension parameters – its time evolution w a , the physical curvature density ω K and the neutrino mass sum Σm ν . Our joint constraints are consistent with a flat ΛCDM cosmological model within 68 per cent confidence limits. We demonstrate that the Planck data are able to place tight constraints on the clustering amplitude today, σ 12 , in cosmologies with varying w and present the first constraints for the clustering amplitude for such cosmologies, which is found to be slightly higher than the ΛCDM value. Additionally, we show that when we vary w and allow for non-flat cosmologies and the physical curvature density is used, Planck prefers a curved universe at 4σ significance, which is ~2σ higher than when using the relative curvature density Ω K . Finally, when w is varied freely, clustering provides only a modest improvement (of 0.021 eV) on the upper limit of Σm ν .

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Dark energy survey year 3 results: Cosmological constraints from cluster abundances, weak lensing, and galaxy clustering

Galaxy clusters provide a unique probe of the late-time cosmic structure and serve as a powerful independent test of the Λ⁢CDM model. This work presents the first set of cosmological constraints derived with ∼16,000 optically selected redMaPPer clusters across nearly 5000 deg 2 using DES year 3 datasets. Our analysis leverages a consistent modeling framework for galaxy cluster cosmology and DES-Y3 joint analyses of galaxy clustering and weak lensing (3 × 2⁢pt), ensuring direct comparability with the DES-Y3 3 × 2⁢pt analysis. Here, we obtain constraints of 𝑆 8 = 0.864 ± 0.035 and Ω m = $0.26⁢5^{+0.019}_{−0.031}$ from the cluster-based data vector. We find that cluster constraints and 3 × 2⁢pt constraints are consistent under the Λ⁢CDM model with a posterior predictive distribution (PPD) value of 0.53. The consistency between clusters and 3 × 2⁢pt provides a stringent test of Λ⁢CDM across different mass and spatial scales. Jointly analyzing clusters with 3 × 2⁢pt further improves cosmological constraints, yielding 𝑆 8 = $0.81⁢1^{+0.022}_{−0.020}$ and Ω m = $0.29⁢4^{+0.022}_{−0.033}$, a 24% improvement in the Ω m − 𝑆 8 figure of merit over 3 × 2⁢pt alone. Moreover, we find no significant deviation from the Planck CMB constraints with a probability to exceed (PTE) value of 0.6, significantly reducing previous 𝑆 8 tension claims. Finally, combining DES 3 × 2⁢pt, DES clusters, and Planck CMB places an upper limit on the sum of neutrino masses of ∑𝑚 𝜈 < 0.26 eV at 95% confidence under the Λ⁢CDM model. These results establish optically selected clusters as a key cosmological probe and pave the way for cluster-based analyses in upcoming stage-IV surveys such as LSST, Euclid, and Roman.

Abbott, T. M. C. [NSF’s National Optical-Infrared ↗
DOE OSTI2021

Constraints on f ( R ) and normal-branch Dvali-Gabadadze-Porrati modified gravity model parameters with cluster abundances and galaxy clustering

In this report we present forecasted cosmological constraints from combined measurements of galaxy cluster abundances from the Simons Observatory and galaxy clustering from a DESI-like experiment on two well-studied modified gravity models, the chameleon-screened Hu-Sawicki f(R) model and the nDGP braneworld Vainshtein model. A Fisher analysis is conducted using σ 8 constraints derived from thermal Sunyaev-Zel’dovich (tSZ) selected galaxy clusters as well as linear and quasilinear redshift-space 2-point galaxy correlation functions. We find that the cluster abundances drive the constraints on the nDGP model while f(R) constraints are led by galaxy clustering. The two tracers of the cosmological gravitational field are found to be complementary, and their combination significantly improves constraints on the f(R) in particular in comparison to each individual tracer alone. For a model of f(R) with a general relativity (GR) fiducial case (f R0 = 0), we find a 2-σ upper limit of f R0 ≤ 5.68 x10 -7 . For the well-studied log-based fiducial parameter value in f(R), log 10 (f R0 ) = -5, paired with the parameter value n = 1, we find combined 1-σ constraints of σ(log 10 (f R0 )) = 0.12 and σ(n) = 0.36. For the nDGP model with fiducial n nDGP = 1 we find σ( n nDGP ) = 0.087. Our results present the exciting potential to utilize upcoming galaxy and CMB survey data available in the near future to discern and/or constrain cosmic deviations from GR.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Evaluating Lyman- α constraints for general dark-matter velocity distributions: Multiple scales and cautionary tales

One of the most important observational constraints on possible models of dark-matter physics exploits the Lyman-α absorption spectrum associated with photons traversing the intergalactic medium. Because these data allow us to probe the linear matter power spectrum with great accuracy down to relatively small distance scales, finding ways of accurately evaluating such Lyman-α constraints across large classes of candidate models of dark-matter physics is of paramount importance. While such Lyman-α constraints have been evaluated for dark-matter models that give rise to relatively simple dark-matter velocity distributions, more complex models—particularly those whose dark-matter velocity distributions stretch across multiple scales—have recently been receiving increasing attention. In this paper, we undertake a study of the Lyman-α constraints associated with general dark-matter velocity distributions. Although such Lyman-α constraints are difficult to evaluate in principle, in practice there currently exist two classes of methods in the literature through which such constraints can be recast into forms which are easier to evaluate and which therefore allow a more rapid determination of whether a given dark-matter model is ruled in or out. Accordingly, we utilize both of these recasts in order to determine the Lyman-α bounds on different classes of dark-matter velocity distributions. Here we also develop a general method by which the results of these different recasts can be compared. For relatively simple dark-matter velocity distributions, we demonstrate that these two classes of recasts tend to align and give similar results. However, we find that the situation is far more complex for distributions involving multiple velocity scales: while these two classes of recasts continue to yield similar results within certain regions of parameter space, they nevertheless yield dramatically different results within precisely those regions of parameter space which are likely to be phenomenologically relevant. This, then, serves as a cautionary tale regarding the use of such recasts for complex dark-matter velocity distributions.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Constraints on neutrino physics from DESI DR2 BAO and DR1 full shape

The Dark Energy Spectroscopic Instrument (DESI) Collaboration has obtained robust measurements of baryon acoustic oscillations in the redshift range 0.1 < 𝑧 < 4.2, based on the Lyman-𝛼 forest and galaxies from data release 2. We combine these measurements with cosmic microwave background (CMB) data from Planck and the Atacama Cosmology Telescope to place our tightest constraints yet on the sum of neutrino masses. Assuming the cosmological Λ⁢ CDM model and three degenerate neutrino states, we find ∑𝑚 𝜈 < 0.0642 eV (95%) with a marginalized error of 𝜎⁡(∑𝑚 𝜈 ) = 0.020 eV. We also constrain the effective number of neutrino species, finding 𝑁 eff = 3.2⁢3$^{+0.35}_{−0.34}$ (95%), in line with the Standard Model prediction. When accounting for neutrino oscillation constraints, we find a preference for the normal mass ordering and an upper limit on the lightest neutrino mass of 𝑚 𝑙 < 0.023 eV (95%). However, we determine using frequentist and Bayesian methods that our constraints are in tension with the lower limits derived from neutrino oscillations. Correcting for the physical boundary at zero mass, we report a 95% Feldman-Cousins upper limit of ∑𝑚 𝜈 < 0.053 eV, breaching the lower limit from neutrino oscillations. Considering a more general Bayesian analysis with an effective cosmological neutrino mass parameter, ∑𝑚 𝜈,eff , that allows for negative energy densities and removes unsatisfactory prior weight effects, we derive constraints that are in 3⁢𝜎 tension with the same oscillation limit, while the error rises to 𝜎⁡(∑𝑚 𝜈,eff ) = 0.053 eV. In the absence of unknown systematics, this finding could be interpreted as a hint of new physics not necessarily related to neutrinos. The preference of DESI and CMB data for an evolving dark energy model offers one possible solution. In the 𝑤 0 ⁢𝑤 𝑎 ⁢CDM model, we find ∑𝑚 𝜈 < 0.163 eV (95%), relaxing the neutrino tension. These constraints all rely on the effects of neutrinos on the cosmic expansion history. Using full-shape power spectrum measurements of data release 1 galaxies, we place complementary constraints that rely on neutrino free streaming. Our strongest such limit in Λ ⁢CDM, using selected CMB priors, is ∑𝑚 𝜈 < 0.193 eV (95%).

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Incorporating physical constraints into Gaussian process surrogate models (LDRD Project Summary)

This report summarizes work done under the Laboratory Directed Research and Development (LDRD) project titled "Incorporating physical constraints into Gaussian process surrogate models?' In this project, we explored a variety of strategies for constraint implementations. We considered bound constraints, monotonicity and related convexity constraints, Gaussian processes which are constrained to satisfy linear operator constraints which represent physical laws expressed as partial differential equations, and intrinsic boundary condition constraints. We wrote three papers and are currently finishing two others. We developed initial software implementations for some approaches. This report summarizes the work done under this LDRD.

97 MATHEMATICS AND COMPUTING↗