Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized 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,153 records · Page 64

An Efficient Deterministic Approach to Model-based Prediction Uncertainty Estimation

Prognostics deals with the prediction of the end of life (EOL) of a system. EOL is a random variable, due to the presence of process noise and uncertainty in the future inputs to the system. Prognostics algorithm must account for this inherent uncertainty. In addition, these algorithms never know exactly the state of the system at the desired time of prediction, or the exact model describing the future evolution of the system, accumulating additional uncertainty into the predicted EOL. Prediction algorithms that do not account for these sources of uncertainty are misrepresenting the EOL and can lead to poor decisions based on their results. In this paper, we explore the impact of uncertainty in the prediction problem. We develop a general model-based prediction algorithm that incorporates these sources of uncertainty, and propose a novel approach to efficiently handle uncertainty in the future input trajectories of a system by using the unscented transformation. Using this approach, we are not only able to reduce the computational load but also estimate the bounds of uncertainty in a deterministic manner, which can be useful to consider during decision-making. Using a lithium-ion battery as a case study, we perform several simulation-based experiments to explore these issues, and validate the overall approach using experimental data from a battery testbed.

Daigle, Matthew J.↗

Linear scaling solution of the time-dependent self-consistent-field equations with quasi-independent Rayleigh quotient iteration

An algorithm for solution of the Time-Dependent Self-Consistent-Field (TD-SCF) equations is developed, based on dual solution channels for non-linear optimization of the Tsiper functional [J.Phys.B, 34 L401 (2001)]. This formulation poses the TD-SCF problem as two Rayleigh quotients, coupled weakly through biorthogonality. Convergence rates for the Random Phase Approximation (RPA) are found to be equivalent to the Tamm-Dancoff approximation (TDA). Moreover, the variational nature of the quotient is robust to approximation errors, allowing linear scaling solution to the bulk limit of the RPA matrix-eigenvalue and exchange operator problem for molecular wires with extended conjugation, including polyphenylene vinylene and the (4,3) nanotube.

74 ATOMIC AND MOLECULAR PHYSICS↗

Improvement of machine learning enhanced genetic algorithm for nonlinear beam dynamics optimization

On top of the genetic algorithm enhanced by machine learning for nonlinear lattice optimization, as proposed in Li et al. (2018), an improved repopulation technique has been developed. Different weight coefficients for defining the “elite cluster” were compared to discern the fastest convergence in two classic optimization test problems. Additonally, the volume of the parameter space for generating potentially competitive candidates was further confined by repopulation in the vicinity of randomly selected “elite seeds”. The new repopulation technique significantly improves the quality of newly populated candidates by excluding the less competitive seeds introduced by the old repopulation algorithm. Finally, this technique has been validated, having a faster convergence for test problems first, and then applied to the nonlinear lattice optimization for the High Energy Photon Source storage ring.

36 MATERIALS SCIENCE↗

Hybrid optimization and Bayesian inference techniques for a non-smooth radiation detection problem

In this paper, we propose several algorithms to recover the location and intensity of a radiation source located in a simulated 250 × 180 m block of an urban center based on synthetic measurements. Radioactive decay and detection are Poisson random processes, so we employ likelihood functions based on this distribution. Owing to the domain geometry and the proposed response model, the negative logarithm of the likelihood is only piecewise continuous differentiable, and it has multiple local minima. To address these difficulties, we investigate three hybrid algorithms composed of mixed optimization techniques. For global optimization, we consider simulated annealing, particle swarm, and genetic algorithm, which rely solely on objective function evaluations; that is, they do not evaluate the gradient in the objective function. By employing early stopping criteria for the global optimization methods, a pseudo-optimum point is obtained. This is subsequently utilized as the initial value by the deterministic implicit filtering method, which is able to find local extrema in non-smooth functions, to finish the search in a narrow domain. These new hybrid techniques, combining global optimization and implicit filtering address, difficulties associated with the non-smooth response, and their performances, are shown to significantly decrease the computational time over the global optimization methods. To quantify uncertainties associated with the source location and intensity, we employ the delayed rejection adaptive Metropolis and DiffeRential Evolution Adaptive Metropolis algorithms. Finally, marginal densities of the source properties are obtained, and the means of the chains compare accurately with the estimates produced by the hybrid algorithms.

42 ENGINEERING↗

Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates

In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the physical discretization error and the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity of the sparse grid. Utilizing these error estimates provides significantly more accurate functional values for random samples of the sparse grid approximation. We also demonstrate that alternative refinement strategies based upon a posteriori error estimates can lead to further increases in accuracy in the approximation over traditional hierarchical surplus based strategies. Throughout this paper we also provide and test a framework for balancing the physical discretization error with the stochastic interpolation error of the enhanced sparse grid approximation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Minimax decoding of cyclic block codes

A minimax decoding algorithm utilizing soft bit detection of an (n,k) cyclic block code is described which will permit the correction of up to n-k bit errors interspersed at random locations throughout the block. The decoding solution consists of: (1) identifying the ordered soft bit set and, (2) finding the minimum order solution to the resulting syndrome equations where the nonzero error vector components are constrained to be a subset of the soft bit set. An efficient implementation of the decoding operation is described. In essence, this algorithm focuses the correction capability of the code on those bit positions which have the lowest a posteriori probabilities of correct detection.

Greene, E. P.↗

From Points to Planes: A Workflow for Converting Three‐Dimensional Point Cloud Data Into Discrete Fracture Network Flow and Transport Models

We present the Point cLoud Algorithm for NEtwork Extraction of Discrete Fracture Networks (PLANE-DFN), a point cloud–based algorithm for automatic fracture network extraction designed to support discrete fracture network (DFN) modeling workflows. PLANE-DFN segments three-dimensional fracture planes from raw point cloud data using RANdom SAmple Consensus coupled with statistical outlier removal and density-based clustering to isolate individual fracture features. Each candidate plane is constrained against site-specific structural constraints based on strike and dip. After segmentation, each fracture is converted into a 2-D convex polygon suitable for meshing and simulation. The PLANE-DFN algorithm is validated by comparing geometric and flow and transport data against data from dfnWorks simulations with ensembles of plane-fit networks. We find that the flow and transport in plane-fit networks are comparable to dfnWorks-generated networks when realistic network geometry is maintained. The PLANE-DFN algorithm provides an automated and streamlined workflow to transform point clouds of data into DFN network geometry.

54 ENVIRONMENTAL SCIENCES↗

The multi-element probabilistic collocation method (ME-PCM): Error analysis and applications

Stochastic spectral methods are numerical techniques for approximating solutions to partial differential equations with random parameters. In this work, we present and examine the multi-element probabilistic collocation method (ME-PCM), which is a generalized form of the probabilistic collocation method. In the ME-PCM, the parametric space is discretized and a collocation/cubature grid is prescribed on each element. Both full and sparse tensor product grids based on Gauss and Clenshaw-Curtis quadrature rules are considered. We prove analytically and observe in numerical tests that as the parameter space mesh is refined, the convergence rate of the solution depends on the quadrature rule of each element only through its degree of exactness. In addition, the L{sup 2} error of the tensor product interpolant is examined and an adaptivity algorithm is provided. Numerical examples demonstrating adaptive ME-PCM are shown, including low-regularity problems and long-time integration. We test the ME-PCM on two-dimensional Navier-Stokes examples and a stochastic diffusion problem with various random input distributions and up to 50 dimensions. While the convergence rate of ME-PCM deteriorates in 50 dimensions, the error in the mean and variance is two orders of magnitude lower than the error obtained with the Monte Carlo method using only a small number of samples (e.g., 100). The computational cost of ME-PCM is found to be favorable when compared to the cost of other methods including stochastic Galerkin, Monte Carlo and quasi-random sequence methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probabilistic Look-ahead Contingency Analysis Integration with Commercial Tool and Practical Data

This paper presents an initial effort of integrating a smart sampling-based probabilistic look-ahead contingency analysis algorithm with General Electric (GE) Grid Solutions’ commercial energy management system (EMS) tool as a proof-of-concept for a seamless research tool integration using real world large-scale grid data. With the increasing impact of random forces such as variable generation and load, their stochastic behaviors cannot be ignored. However, the current practices are still dominated by deterministic tools. They are becoming increasingly inadequate for the future grid. The developed look-ahead contingency analysis algorithm incorporates forecast errors of variable energy and load to address the challenges brought by the increasing uncertainty of power system. The algorithm can reveal the potential violations caused by the variance of variable energy and load that are not normally detected by traditional deterministic approaches. To test its performance under practical environments ( real data with real commercial tool), significant efforts have been made to prepare test cases, modify GE EMS tool, and adapt an extreme value distribution algorithm to analyze the GE EMS’s violation-only outputs. The test results clearly demonstrate the effectiveness of the developed algorithm as new transformer violations that were not previously detected have been identified. This performance provides better situational awareness to engineers for their decision-making process under uncertainty. Moreover, with the discussion of computational performance and future work, this paper has shown a clear path for integrating the probabilistic algorithm with commercial tools to make us better equipped for the changing power system.

Modeling and simulation of power systems, constrai↗

Massively parallel algorithms for trace-driven cache simulations

Trace driven cache simulation is central to computer design. A trace is a very long sequence of reference lines from main memory. At the t(exp th) instant, reference x sub t is hashed into a set of cache locations, the contents of which are then compared with x sub t. If at the t sup th instant x sub t is not present in the cache, then it is said to be a miss, and is loaded into the cache set, possibly forcing the replacement of some other memory line, and making x sub t present for the (t+1) sup st instant. The problem of parallel simulation of a subtrace of N references directed to a C line cache set is considered, with the aim of determining which references are misses and related statistics. A simulation method is presented for the Least Recently Used (LRU) policy, which regradless of the set size C runs in time O(log N) using N processors on the exclusive read, exclusive write (EREW) parallel model. A simpler LRU simulation algorithm is given that runs in O(C log N) time using N/log N processors. Timings are presented of the second algorithm's implementation on the MasPar MP-1, a machine with 16384 processors. A broad class of reference based line replacement policies are considered, which includes LRU as well as the Least Frequently Used and Random replacement policies. A simulation method is presented for any such policy that on any trace of length N directed to a C line set runs in the O(C log N) time with high probability using N processors on the EREW model. The algorithms are simple, have very little space overhead, and are well suited for SIMD implementation.

Nicol, David M.↗

Intensity-Modulated Radiotherapy Optimization in a Quasi-Periodically Deforming Patient Model

Purpose: To present the implementation of a probability-based, four-dimensional (4D) intensity-modulated radiotherapy (IMRT) planning approach that explicitly optimizes the accumulated dose to moving tissue, estimated using the patient's probability density function (pdf) of respiratory motion. This is termed 'optimization in tissue's-eye-view'. Methods and Materials: The method incorporates 4D Monte Carlo dose calculation in multiple geometries of a respiratory-correlated CT dataset. The instance doses are weighted according to the breathing pdf and accumulated in a common reference geometry, which involves dose warping based on deformable registration. The algorithm produces deliverable multileaf collimator segments and was tested on a sample lung cancer patient dataset with large target excursion. Accumulated doses of the moving target and organs at risk of this plan were compared with those of corresponding margin-based static IMRT plans for free-breathing and gated treatment, as well as target tracking. Results: Target tracking provided best target coverage. Both the presented 4D IMRT approach for free-breathing treatment and gated treatment gave similar results for target coverage and lung dose, with significantly better target coverage than the margin-based static IMRT plan for free-breathing treatment. Conclusions: The presented 4D planning concept offers an alternative to gating by providing the optimal dose for free-breathing IMRT treatment. Although the focus of this study was 4D lung planning, the approach can be generally applied for IMRT optimization in randomly deforming patient models.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Impact of Random and Periodic Surface Roughness on P- and L-band Radiometry

L-band passive microwave remote sensing is currently considered a robust technique for global monitoring of soil moisture. However, soil roughness complicates the relationship between brightness temperature and soil moisture, with current soil moisture retrieval algorithms typically assuming a constant roughness parameter globally, leading to a potential degradation in retrieval accuracy. This current investigation established a tower-based experiment site in Victoria, Australia. P-band (~40-cm wavelength/0.75 GHz) was compared with L-band (~21-cm wavelength/1.41 GHz) over random and periodic soil surfaces to determine if there is an improvement in brightness temperature simulation and soil moisture retrieval accuracy for bare soil conditions, due to reduced roughness impact when using a longer wavelength. The results showed that P-band was less impacted by random and periodic roughness than L-band, evidenced by more comparable statistics across different roughness conditions. The roughness effect from smooth surfaces (e.g., 0.8-cm root-mean-square height and 11.1-cm correlation length) could be potentially ignored at both P- and L-band with satisfactory simulation and retrieval performance. However, for rougher soil (e.g., 1.6-cm root-mean-square height and 6.8-cm correlation length), the roughness impact needed to be accounted for at both P- and L-band, with P-band observations showing less impact than L-band. Moreover, a sinusoidal soil surface with 10-cm amplitude and 80-cm period substantially impacted the brightness temperature simulation and soil moisture retrieval at both P- and L-band, which could not be fully accounted for using the SMOS and SMAP default roughness parameters. However, when retrieving roughness parameters along with soil moisture, the ubRMSE at P-band over periodic soil was improved to a similar level (0.01-0.02 m3/m3) as that of smooth flat soil (0.01 m3/m3), while L-band showed higher ubRMSE over the periodic soil (0.03-0.04 m3/m3) than over smooth flat soil (0.01 m3/m3). Accordingly, periodic roughness effects were reduced by using observations at P-band.

Soil roughness↗

Gearbox bearing crack growth prognostics and uncertainty quantification with physics-informed machine learning

This paper introduces the extreme theory of functional connections (X-TFC), a physics-informed machine learning algorithm, and tailors it to estimate the remaining useful life (RUL) of wind turbine gearbox bearings experiencing fatigue crack growth. Unlike purely data-driven methods, X-TFC embeds a physics model, based on Head's theory in this work, into its training objective. The core of X-TFC is a random-projection single-layer neural network trained via an extreme learning machine, which requires only limited damage progression data and solves for output weights with a least-squares optimization algorithm. A composite loss function balances the network's fit to observed degradation data against the residuals of the governing crack growth differential equation, ensuring the learned damage trajectory remains physically plausible. When applied to a vibration-based health-index (HI) dataset measured during the growth of a crack on the inner ring of a high-speed bearing in a wind turbine gearbox (Bechhoefer and Dubé, 2020), X-TFC achieves near-zero prediction bias. Even when trained on only the first 10 %–20 % of the damage progression data, with sufficient physics weighting its predictions remain monotonic and smooth, delivering high prognosability and trendability. To quantify the epistemic uncertainty, we employ a Monte Carlo ensemble of independently initialized X-TFC models trained on noise-perturbed data, which yields confidence intervals around each RUL estimate and captures both model-parameter and epistemic uncertainty. In addition to a vibration-based HI, we demonstrate that the proposed framework can be directly applied to a supervisory control and data acquisition (SCADA) data-based HI (Eftekhari Milani et al., 2026) measured during similar wind turbine gearbox bearing crack faults, preserving its accuracy and interpretability. This extension shows the versatility of our approach, which is applicable to bearings of multiple gearbox manufacturers, models, and ratings using only SCADA data. By integrating domain knowledge with machine learning, X-TFC offers a rapid, reliable tool for crack prognostics. Its adaptability to other bearing failure modes, such as pitch bearing ring cracks, positions X-TFC as a powerful enabler of data-driven, physics-informed asset management in the wind energy sector and beyond.

17 WIND ENERGY↗

Hamiltonian variational ansatz without barren plateaus

Variational quantum algorithms, which combine highly expressive parameterized quantum circuits (PQCs) and optimization techniques in machine learning, are one of the most promising applications of a near-term quantum computer. Despite their huge potential, the utility of variational quantum algorithms beyond tens of qubits is still questioned. One of the central problems is the trainability of PQCs. The cost function landscape of a randomly initialized PQC is often too flat, asking for an exponential amount of quantum resources to find a solution. This problem, dubbed barren plateaus , has gained lots of attention recently, but a general solution is still not available. In this paper, we solve this problem for the Hamiltonian variational ansatz (HVA), which is widely studied for solving quantum many-body problems. After showing that a circuit described by a time-evolution operator generated by a local Hamiltonian does not have exponentially small gradients, we derive parameter conditions for which the HVA is well approximated by such an operator. Based on this result, we propose an initialization scheme for the variational quantum algorithms and a parameter-constrained ansatz free from barren plateaus.

Physics↗

Benchmarking Gas Path Diagnostic Methods: A Public Approach

Recent technology reviews have identified the need for objective assessments of engine health management (EHM) technology. The need is two-fold: technology developers require relevant data and problems to design and validate new algorithms and techniques while engine system integrators and operators need practical tools to direct development and then evaluate the effectiveness of proposed solutions. This paper presents a publicly available gas path diagnostic benchmark problem that has been developed by the Propulsion and Power Systems Panel of The Technical Cooperation Program (TTCP) to help address these needs. The problem is coded in MATLAB (The MathWorks, Inc.) and coupled with a non-linear turbofan engine simulation to produce "snap-shot" measurements, with relevant noise levels, as if collected from a fleet of engines over their lifetime of use. Each engine within the fleet will experience unique operating and deterioration profiles, and may encounter randomly occurring relevant gas path faults including sensor, actuator and component faults. The challenge to the EHM community is to develop gas path diagnostic algorithms to reliably perform fault detection and isolation. An example solution to the benchmark problem is provided along with associated evaluation metrics. A plan is presented to disseminate this benchmark problem to the engine health management technical community and invite technology solutions.

Simon, Donald L.↗

Quantum-Inspired Maximizer

A report discusses an algorithm for a new kind of dynamics based on a quantum- classical hybrid-quantum-inspired maximizer. The model is represented by a modified Madelung equation in which the quantum potential is replaced by different, specially chosen 'computational' potential. As a result, the dynamics attains both quantum and classical properties: it preserves superposition and entanglement of random solutions, while allowing one to measure its state variables, using classical methods. Such optimal combination of characteristics is a perfect match for quantum-inspired computing. As an application, an algorithm for global maximum of an arbitrary integrable function is proposed. The idea of the proposed algorithm is very simple: based upon the Quantum-inspired Maximizer (QIM), introduce a positive function to be maximized as the probability density to which the solution is attracted. Then the larger value of this function will have the higher probability to appear. Special attention is paid to simulation of integer programming and NP-complete problems. It is demonstrated that the problem of global maximum of an integrable function can be found in polynomial time by using the proposed quantum- classical hybrid. The result is extended to a constrained maximum with applications to integer programming and TSP (Traveling Salesman Problem).

Zak, Michail↗

Invariant functions for the Lyapunov exponents of random matrices

A new approach to the study of Lyapunov exponents of random matrices is presented. We prove that any family of nonnegative (dxd)-matrices has a continuous concave invariant functional on R{sup d}{sub +}. Under some standard assumptions on the matrices, this functional is strictly positive, and the coefficient corresponding to it is equal to the largest Lyapunov exponent. As a corollary we obtain asymptotics for the expected value of the logarithm of norms of matrix products and of their spectral radii. Another corollary gives new upper and lower bounds for the Lyapunov exponent, and an algorithm for computing it for families of nonnegative matrices. We consider possible extensions of our results to general nonnegative matrix families and present several applications and examples. Bibliography: 29 titles.

97 MATHEMATICS AND COMPUTING↗