Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical algorithm”

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 1,333 records · Page 74

Short-Term Precipitation Forecast Based on the PERSIANN System and LSTM Recurrent Neural Networks

Short-term Quantitative Precipitation Forecasting is important for flood forecasting, early flood warning, and natural hazard management. This study proposes a precipitation forecast model by extrapolating Cloud-Top Brightness Temperature (CTBT) using advanced Deep Neural Networks, and applying the forecasted CTBT into an effective rainfall retrieval algorithm to obtain the Short-term Quantitative Precipitation Forecasting (0–6 hr). To achieve such tasks, we propose a Long Short-Term Memory (LSTM) and the Precipitation Estimation from Remotely Sensed Information using Artificial Neural Networks (PERSIANN), respectively. The precipitation forecasts obtained from our proposed framework, (i.e., LSTM combined with PERSIANN) are compared with a Recurrent Neural Network (RNN), Persistency method, and Farneback optical flow each combined with PERSIANN algorithm and the numerical model results from the first version of Rapid Refresh (RAPv1.0) over three regions in the United States, including the states of Oregon, Oklahoma, and Florida. We report our experiments indicate better statistics, such as correlation coefficient and root-mean-square error, for the CTBT forecasts from the proposed LSTM compared to the RNN, Persistency, and the Farneback method. The precipitation forecasts from the proposed LSTM and PERSIANN framework has demonstrated better statistics compared to the RAPv1.0 numerical forecasts and PERSIANN estimations from RNN, Persistency, and Farneback projections in terms of Probability of Detection, False Alarm Ratio, Critical Success Index, correlation coefficient, and root-mean-square error, especially in predicting the convective rainfalls. The proposed method shows superior capabilities in short-term forecasting over compared methods, and has the potential to be implemented globally as an alternative short-term forecast product.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Diethylene Glycol Condensation Particle Counter for Rapid Sizing of sub-3 nm Atmospheric Clusters

AbstractThis paper describes the modification of a laminar flow, thermally diffusive universal-fluid condensation particle counter (standard operation: 50% detection efficiency at 5 nm) to rapidly measure the size distribution of sub 3 nm aerosol. Sub 3 nm detection was achieved by using diethylene glycol as the working fluid, which enabled high instrument super-saturations while minimizing homogenous nucleation of the working fluid; a detection efficiency of 50% was achieved at 1.6 nm with laboratory-generated ammonium sulfate aerosol. Rapid aerosol sizing beneath 3 nm was achieved by inverting the measured grown droplet size distribution (1 second sampling) to recover the sampled aerosol size distribution. The developed inversion algorithm utilizes analytical kernel functions determined from the instrument response to pseudo-monodisperse ammonium sulfate aerosol from 1.5 nm to 20 nm, generated by a high resolution DMA and a nano DMA. The inversion algorithm was tested numerically with assumed, idealized aerosol size distributions consistent with observed new particle formation events, yielding reasonable agreement between inverted and assumed aerosol size distributions below 3 nm. Furthermore, this technique provides a measure of the aerosol size assuming an aerosol composition identical to that of the aerosol used to generate the experimentally determined kernel function.

54 ENVIRONMENTAL SCIENCES↗

Adaptive mesh refinement in binary black holes simulations

Abstract We discuss refinement criteria for the Berger–Rigoutsos (block-based) refinement algorithm in our numerical relativity code GR-Athena++ in the context of binary black hole (BBH) merger simulations. We compare three different strategies: the ‘box-in-box’ approach, the ‘sphere-in-sphere’ approach and a local criterion for refinement based on the estimation of truncation error of the finite difference scheme. We extract and compare gravitational waveforms using the three different mesh refinement methods and compare their accuracy against a calibration waveform and demonstrate that the sphere-in-sphere approach provides the best strategy overall when considering computational cost and the waveform accuracy. Ultimately, we demonstrate the capability of each mesh refinement method in accurately simulating gravitational waves from BBH systems—a crucial aspect for their application in next-generation detectors. We quantify the mismatch achievable with the different strategies by extrapolating the gravitational wave mismatch to higher resolution.

Astronomy & Astrophysics↗

How to estimate the 3D power spectrum of the Lyman-α forest

Here, we derive and numerically implement an algorithm for estimating the 3D power spectrum of the Lyman-α (Lyα) forest flux fluctuations. The algorithm exploits the unique geometry of Lyα forest data to efficiently measure the cross-spectrum between lines of sight as a function of parallel wavenumber, transverse separation and redshift. We start by approximating the global covariance matrix as block-diagonal, where only pixels from the same spectrum are correlated. We then compute the eigenvectors of the derivative of the signal covariance with respect to cross-spectrum parameters, and project the inverse-covariance-weighted spectra onto them. This acts much like a radial Fourier transform over redshift windows. The resulting cross-spectrum inference is then converted into our final product, an approximation of the likelihood for the 3D power spectrum expressed as second order Taylor expansion around a fiducial model. We demonstrate the accuracy and scalability of the algorithm and comment on possible extensions. Our algorithm will allow efficient analysis of the upcoming Dark Energy Spectroscopic Instrument dataset.

79 ASTRONOMY AND ASTROPHYSICS↗

A digital CDS technique and its performance testing

Readout noise is a critical parameter for characterizing the performance of charge-coupled devices (CCDs), which can be greatly reduced by the correlated double sampling (CDS) circuit. However, a conventional CDS circuit inevitably introduces new noise since it consists of several active analog components such as operational amplifiers. This article proposes a digital CDS circuit technique, which transforms the pre-amplified CCD signal into a train of digital presentations by a high-speed data acquisition card directly without the noisy CDS circuit, then implements the digital CDS algorithm through a numerical method. A readout noise of 3.3 e - and an energy resolution of 121 eV@5.9 keV can be achieved via the digital CDS technique.

42 ENGINEERING↗

Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering

Abstract The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT (All-SAT) and Max-SAT problems. G-QAOA is less resource-intensive and more adaptable for these problems than Grover’s algorithm, and it surpasses conventional QAOA in its ability to sample all solutions. We show these benefits by classical simulations of many-round G-QAOA on thousands of random 3-SAT instances. We also observe G-QAOA advantages on the IonQ Aria quantum computer for small instances, finding that current hardware suffices to determine and sample all solutions. Interestingly, a single-angle-pair constraint that uses the same pair of angles at each G-QAOA round greatly reduces the classical computational overhead of optimizing the G-QAOA angles while preserving its quadratic speedup. We also find parameter clustering of the angles. The single-angle-pair protocol and parameter clustering significantly reduce obstacles to classical optimization of the G-QAOA angles.

Zhang, Zewen (ORCID:000000032258613X)↗

Critical entropies for magnetic ordering in bosonic mixtures on a lattice

We perform a numeric study (Worm algorithm Monte Carlo simulations) of ultracold two-component bosons in two- and three-dimensional optical lattices. At strong enough interactions and low enough temperatures the system features magnetic ordering. We compute critical temperatures and entropies for the disappearance of the Ising antiferromagnetic and the xy-ferromagnetic order and find that the largest possible entropies per particle are {approx} 0.5k{sub B}. We also estimate (optimistically) the experimental hold times required to reach equilibrium magnetic states to be on a scale of seconds. Low critical entropies and long hold times render the experimental observations of magnetic phases challenging and call for increased control over heating sources.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mott-insulator-to-superfluid transition in Bose-Bose mixtures in a two-dimensional lattice

We perform a numeric study (worm algorithm Monte Carlo simulations) of ultracold two-component bosons in two-dimensional optical lattices. We study how the Mott-insulator-to-superfluid transition is affected by the presence of a second superfluid bosonic species. We find that, at fixed interspecies interaction, the upper and lower boundaries of the Mott lobe are differently modified. The lower boundary is strongly renormalized even for relatively low filling factor of the second component and moderate (interspecies) interaction. The upper boundary, instead, is affected only for large enough filling of the second component. Whereas boundaries are renormalized we find evidence of polaron-like excitations. Our results are of interest for current experimental setups.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Effect of finite particle number sampling on baryon number fluctuations

The effects of finite particle number sampling on the net baryon number cumulants, extracted from fluid dynamical simulations, are studied. The commonly used finite particle number sampling procedure introduces an additional Poissonian (or multinomial if global baryon number conservation is enforced) contribution which increases the extracted moments of the baryon number distribution. If this procedure is applied to a fluctuating fluid dynamics framework, one severely overestimates the actual cumulants. We show that the sampling of so-called test particles suppresses the additional contribution to the moments by at least one power of the number of test particles. We demonstrate this method in a numerical fluid dynamics simulation that includes the effects of spinodal decomposition due to a first-order phase transition. Furthermore, in the limit where antibaryons can be ignored, we derive analytic formulas which capture exactly the effect of particle sampling on the baryon number cumulants. These formulas may be used to test the various numerical particle sampling algorithms.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

New approach to QCD final-state evolution in processes with massive partons

We present an algorithm for massive parton evolution which is based on the differentially accurate simulation of soft-gluon radiation by means of a nontrivial azimuthal angle dependence of the splitting functions. The kinematics mapping is chosen such as to reflect the symmetry of the final state in soft-gluon radiation and collinear splitting processes. We compute the counterterms needed for a fully differential next-to-leading order matching and discuss the analytic structure of the parton shower in the next-to-leading logarithmic limit. We implement the new algorithm in the numerical code Alaric and present a first comparison to experimental data. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Universal energy-speed-accuracy trade-offs in driven nonequilibrium systems

The connection between measure theoretic optimal transport and dissipative nonequilibrium dynamics provides a language for quantifying nonequilibrium control costs, leading to a collection of thermodynamic speed limits, which rely on the assumption that the target probability distribution is perfectly realized. This is almost never the case in experiments or numerical simulations, so here we address the situation in which the external controller is imperfect. We obtain a lower bound for the dissipated work in generic nonequilibrium control problems that (1) is asymptotically tight and (2) matches the thermodynamic speed limit in the case of optimal driving. Along with analytically solvable examples, we refine this imperfect driving notion to systems in which the controlled degrees of freedom are slow relative to the nonequilibrium relaxation rate, and identify independent energy contributions from fast and slow degrees of freedom. Furthermore, we develop a strategy for optimizing minimally dissipative protocols based on optimal transport flow matching, a generative machine learning technique. Furthermore, this latter approach ensures the scalability of both the theoretical and computational framework we put forth. Crucially, we demonstrate that we can compute the terms in our bound numerically using efficient algorithms from the computational optimal transport literature and that the protocols we learn saturate the bound.

59 BASIC BIOLOGICAL SCIENCES↗

Model-based Assessment for Balancing Privacy Requirements and Operational Capabilities

The smart grid changes the way energy is produced and distributed. In addition both, energy and information is exchanged bidirectionally among participating parties. Therefore heterogeneous systems have to cooperate effectively in order to achieve a common high-level use case, such as smart metering for billing or demand response for load curtailment. Furthermore, a substantial amount of personal data is often needed for achieving that goal. Capturing and processing personal data in the smart grid increases customer concerns about privacy and in addition, certain statutory and operational requirements regarding privacy aware data processing and storage have to be met. An increase of privacy constraints, however, often limits the operational capabilities of the system. In this paper, we present an approach that automates the process of finding an optimal balance between privacy requirements and operational requirements in a smart grid use case and application scenario. This is achieved by formally describing use cases in an abstract model and by finding an algorithm that determines the optimum balance by forward mapping privacy and operational impacts. For this optimal balancing algorithm both, a numeric approximation and – if feasible – an analytic assessment are presented and investigated. The system is evaluated by applying the tool to a real-world use case from the University of Southern California (USC) microgrid.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Battery Model Parameterization Using Manufacturer Datasheet and Field Measurement for Real-Time HIL Applications

Here, this paper presents a novel battery model parameterization method using actual field measurement and manufacturer datasheet for real-time hardware-in-the-loop (HIL) applications. It is critical that real-time HIL models can accurately reproduce field test results so that tests can be conducted on HIL testbeds instead of in the field. In the past, numerical heuristic optimization algorithms were often used to derive parameters for battery models. However, the deterministic algorithms often reach a locally optimal solution and stochastic heuristic searching strategies suffer from low searching efficiency. Therefore, in this paper, we propose a global-local searching enhanced genetic algorithm (GL-SEGA). By applying the generalized opposition-based learning mechanism, GL-SEGA can efficiently explore the global solution space. By using the trust-region-reflective method to perform the local search, the GL-SEGA can improve the accuracy and convergence in its local exploitations. Field measurements and manufactory datasheets are used to test and validate the accuracy and robustness of the GL-SEGA algorithm.

25 ENERGY STORAGE↗

Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers

Ptychography has risen as a reference X-ray imaging technique: it achieves resolutions of one billionth of a meter, macroscopic field of view, or the capability to retrieve chemical or magnetic contrast, among other features. A ptychographic reconstruction is normally formulated as a blind phase retrieval problem, where both the image (sample) and the probe (illumination) have to be recovered from phaseless measured data. In this article we address a nonlinear least squares model for the blind ptychography problem with constraints on the image and the probe by maximum likelihood estimation of the Poisson noise model. We formulate a variant model that incorporates the information of phaseless measurements of the probe to eliminate possible artifacts. Next, we propose a generalized alternating direction method of multipliers designed for the proposed nonconvex models with convergence guarantee under mild conditions, where their subproblems can be solved by fast el-ementwise operations. Numerically, the proposed algorithm outperforms state-of-the-art algorithms in both speed and image quality.

47 OTHER INSTRUMENTATION↗

Robust A-Optimal Experimental Design for Sensor Placement in Bayesian Linear Inverse Problems

Optimal design of experiments for Bayesian inverse problems has recently gained wide popularity and attracted much attention, especially in the computational science and Bayesian inversion communities. An optimal design maximizes a predefined utility function that is formulated in terms of the elements of an inverse problem, an example being optimal sensor placement for parameter identification. The state-of-the-art algorithmic approaches following this simple formulation generally overlook misspecification of the elements of the inverse problem, such as the prior or the measurement uncertainties. This work presents an efficient algorithmic approach for designing optimal experimental design schemes for Bayesian linear inverse problems such that the optimal design is robust to misspecification of elements of the inverse problem. Specifically, we consider a worst-case scenario approach for the uncertain or misspecified parameters, formulate robust objectives, and propose an algorithmic approach for optimizing such objectives. Furthermore, both relaxation and stochastic solution approaches are discussed with detailed analysis and insight into the interpretation of the problem and the proposed algorithmic approach. Extensive numerical experiments to validate and analyze the proposed approach are carried out for sensor placement in a parameter identification problem.

Bayesian inverse problems↗

Axionic dark matter halos in the gravitational field of baryonic matter

We consider a dark matter halo (DMH) of a spherical galaxy as a Bose–Einstein condensate (BEC) of the ultra-light axions (ULA) interacting with the baryonic matter. In the mean-field (MF) limit, we have derived the integro-differential equation of the Hartree–Fock type for the spherically symmetrical wave function of the DMH component. This equation includes two independent dimensionless parameters: (i) β is the ratio of baryon and axion total mases and (ii) ξ is the ratio of characteristic baryon and axion spatial parameters. We extended our “dissipation algorithm” for studying numerically the ground state of the axion halo in the gravitational field produced by the baryonic component. We calculated the characteristic size, x c of DMH as a function of β and ξ and obtained an analytical approximation for x c .

79 ASTRONOMY AND ASTROPHYSICS↗

Postprocessing Algorithm for Driving Conventional Scanning Tunneling Microscope at Fast Scan Rates

We present an image postprocessing framework for Scanning Tunneling Microscope (STM) to reduce the strong spurious oscillations and scan line noise at fast scan rates and preserve the features, allowing an order of magnitude increase in the scan rate without upgrading the hardware. The proposed method consists of two steps for large scale images and four steps for atomic scale images. For large scale images, we first apply for each line an image registration method to align the forward and backward scans of the same line. In the second step we apply a “rubber band” model which is solved by a novel Constrained Adaptive and Iterative Filtering Algorithm (CIAFA). The numerical results on measurement from copper(111) surface indicate the processed images are comparable in accuracy to data obtained with a slow scan rate, but are free of the scan drift error commonly seen in slow scan data. For atomic scale images, an additional first step to remove line-by-line strong background fluctuations and a fourth step of replacing the postprocessed image by its ranking map as the final atomic resolution image are required. The resulting image restores the lattice image that is nearly undetectable in the original fast scan data.

47 OTHER INSTRUMENTATION↗

Computational thermal, chemical, fluid, and solid mechanics for geosystems management.

This document summarizes research performed under the SNL LDRD entitled - Computational Mechanics for Geosystems Management to Support the Energy and Natural Resources Mission. The main accomplishment was development of a foundational SNL capability for computational thermal, chemical, fluid, and solid mechanics analysis of geosystems. The code was developed within the SNL Sierra software system. This report summarizes the capabilities of the simulation code and the supporting research and development conducted under this LDRD. The main goal of this project was the development of a foundational capability for coupled thermal, hydrological, mechanical, chemical (THMC) simulation of heterogeneous geosystems utilizing massively parallel processing. To solve these complex issues, this project integrated research in numerical mathematics and algorithms for chemically reactive multiphase systems with computer science research in adaptive coupled solution control and framework architecture. This report summarizes and demonstrates the capabilities that were developed together with the supporting research underlying the models. Key accomplishments are: (1) General capability for modeling nonisothermal, multiphase, multicomponent flow in heterogeneous porous geologic materials; (2) General capability to model multiphase reactive transport of species in heterogeneous porous media; (3) Constitutive models for describing real, general geomaterials under multiphase conditions utilizing laboratory data; (4) General capability to couple nonisothermal reactive flow with geomechanics (THMC); (5) Phase behavior thermodynamics for the CO2-H2O-NaCl system. General implementation enables modeling of other fluid mixtures. Adaptive look-up tables enable thermodynamic capability to other simulators; (6) Capability for statistical modeling of heterogeneity in geologic materials; and (7) Simulator utilizes unstructured grids on parallel processing computers.

99 GENERAL AND MISCELLANEOUS↗