Search NASA⌕ Search

SEARCH · Search NASA

Results for “random finite set”

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 91 records · Page 5

Dynamic response of some tentative compliant wall structures to convected turbulence fields

Some tentative compliant wall structures designed for possible skin friction drag reduction are investigated. Among the structural models considered is a ribbed membrane backed by polyurethane or PVS plastisol. This model is simplified as a beam placed on a viscoelastic foundation as well as on a set of evenly spaced supports. The total length of the beam may be either finite or infinite, and the supports may be either rigid or elastic. Another structural model considered is a membrane mounted over a series of pretensioned wires, also evenly spaced, and the entire membrane is backed by an air cavity. The forcing pressure field is idealized as a frozen random pattern convected downstream at a characteristic velocity. The results are given in terms of the frequency response functions of the system, the spectral density of the structural motion, and the spectral density of the boundary layer pressure including the effect of structural motion. These results are used in a parametric study of structural configurations capable of generating favorable wave lengths, wave amplitudes, and wave speeds in the structural motion for potential drag reduction.

Nijim, H. H.↗

PDE-constrained Optimization under Uncertainty

Uncertainty is pervasive in all science and engineering applications. Incorporating uncertainty in physical models is therefore both natural and vital. In doing so, we often arrive at parametric systems of partial differential equations (PDEs). When passing from simulation to optimization, we obtain (typically nonconvex) infinite-dimensional optimization problems that, upon discretization, result in extremely large-scale nonlinear programs. For example, consider a linear elliptic PDE on a two- dimensional domain with a single random coeffcient. If we sampled the random input with 10,000 realizations of the coeffcient, the resulting optimization problem would have 10,000 PDE constraints. Furthermore, discretizing each PDE with piecewise linear finite elements on a 100X100 uni- form quadrilateral mesh results in 100,000,000 degrees of freedom. As a result, the critical components for ensuring mesh-independent performance of numerical optimization methods in the deterministic setting, for example, solution regularity and generalized differentiability, are even more critical in the stochastic setting.

42 ENGINEERING↗

Multitask graph neural networks for elastoplastic response prediction in dual-phase polycrystals

Microstructure-sensitive prediction of elastoplastic response remains a recurring bottleneck in multiscale damage and fatigue modeling, where large ensembles of statistically distinct polycrystals are required to quantify variability and extreme-value behavior. In this work, we develop a multitask graph neural network (GNN) surrogate that maps dual-phase ferrite–martensite polycrystal microstructures to Statistical Volume Element (SVE)-level elastoplastic Quantities of Interest (QoIs). Each SVE is represented as a grain-adjacency graph, with node features encoding phase, geometry, and crystallographic orientation, and edge features encoding relative misorientation. A message-passing graph convolution generates node embeddings, which are pooled into a graph representation and passed to a multitask regression head that jointly predicts 10 scalar QoIs and vector-valued stress–strain responses in orthogonal loading directions across multiple martensite volume fractions and SVE sizes. Results show high accuracy for scalar QoIs and strong agreement for full stress–strain trajectories, with population envelopes reproducing both median behavior and finite-SVE variability across compositions and partition scales. A unified model trained on pooled volume-fraction data preserves most within-regime accuracy relative to regime-specific models while also capturing the broader cross-regime variation reflected in the pooled test set. Distributional comparisons further demonstrate that the surrogate preserves heterogeneity under SVE partitioning, enabling statistically consistent block-wise random-field construction for mesoscale analyses. Overall, the proposed grain-graph surrogate provides a practical pathway to accelerate ensemble-based studies of SVE-level constitutive variability in dual-phase polycrystals.

Crystal plasticity↗

TU-FG-BRB-08: Challenges, Limitations and Future Outlook Towards Clinical Translation of Proton Acoustic Range Verification

Purpose: To report our investigations of proton acoustic imaging, including computer simulations and preliminary experimental studies at clinical facilities. The ultimate achievable accuracy, sensitivity and clinical translation challenges are discussed. Methods: The acoustic pulse due to pressure rise was estimated using finite element model. Since the ionoacoustic pulse is highly dependent on the proton pulse width and energy, multiple pulse widths were studied. Based on the received signal spectrum at piezoelectric ultrasound transducer with consideration of random thermal noise, maximum spatial resolution of the proton-acoustic imaging modality was calculated. The simulation studies defined the design specifications of the system to detect proton acoustic signal from Hitachi and Mevion clinical machines. A 500 KHz hydrophone with 100 dB amplification was set up in a water tank placed in front of the proton nozzle A 40 MHz data acquisition was synchronized by a trigger signal provided by the machine. Results: Given 30–800 mGy dose per pulse at the Bragg peak, the minimum number of protons detectable by the proton acoustic technique was on the order of 10×10^6 per pulse. The broader pulse widths produce signal with lower acoustic frequencies, with 10 µs pulses producing signals with frequency less than 100 kHz. As the proton beam pulse width increases, a higher dose rate is required to measure the acoustic signal. Conclusion: We have established the minimal detection limit for protonacoustic range validation for a variety of pulse parameters. Our study indicated practical proton-acoustic range verification can be feasible with a pulse shorter than 10 µs, 5×10^6 protons/pulse, 50 nA beam current and a highly sensitive ultrasonic transducer. The translational challenges into current clinical machines include proper magnetic shielding of the measurement equipment, providing a clean trigger signal from the proton machine, providing a shorter proton beam pulse and higher dose per pulse.

60 APPLIED LIFE SCIENCES↗

An uncertainty principle for unimodular quantum groups

We present a generalization of Hirschman's entropic uncertainty principle for locally compact Abelian groups to unimodular locally compact quantum groups. As a corollary, we strengthen a well-known uncertainty principle for compact groups, and generalize the relation to compact quantum groups of Kac type. We also establish the complementarity of finite-dimensional quantum group algebras. In the non-unimodular setting, we obtain an uncertainty relation for arbitrary locally compact groups using the relative entropy with respect to the Haar weight as the measure of uncertainty. We also show that when restricted to q-traces of discrete quantum groups, the relative entropy with respect to the Haar weight reduces to the canonical entropy of the random walk generated by the state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Derivative-free stochastic optimization via adaptive sampling strategies

In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.

Adaptive sampling↗

A Finite-Field Approach for GW Calculations beyond the Random Phase Approximation

In this work, we describe a finite-field approach to compute density response functions, which allows for efficient G0W0 and G0W0Γ0 calculations beyond the random phase approximation. The method is easily applicable to density functional calculations performed with hybrid functionals. Lastly, we present results for the electronic properties of molecules and solids and we discuss a general scheme to overcome slow convergence of quasiparticle energies obtained from G0W0Γ0 calculations, as a function of the basis set used to represent the dielectric matrix.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

STARS: A general-purpose finite element computer program for analysis of engineering structures

STARS (Structural Analysis Routines) is primarily an interactive, graphics-oriented, finite-element computer program for analyzing the static, stability, free vibration, and dynamic responses of damped and undamped structures, including rotating systems. The element library consists of one-dimensional (1-D) line elements, two-dimensional (2-D) triangular and quadrilateral shell elements, and three-dimensional (3-D) tetrahedral and hexahedral solid elements. These elements enable the solution of structural problems that include truss, beam, space frame, plane, plate, shell, and solid structures, or any combination thereof. Zero, finite, and interdependent deflection boundary conditions can be implemented by the program. The associated dynamic response analysis capability provides for initial deformation and velocity inputs, whereas the transient excitation may be either forces or accelerations. An effective in-core or out-of-core solution strategy is automatically employed by the program, depending on the size of the problem. Data input may be at random within a data set, and the program offers certain automatic data-generation features. Input data are formatted as an optimal combination of free and fixed formats. Interactive graphics capabilities enable convenient display of nodal deformations, mode shapes, and element stresses.

Gupta, K. K.↗

Efficient Modal Basis Selection Criteria for Reduced-Order Nonlinear Simulation

A modal basis selection technique for a reduced-order nonlinear numerical simulation with application to two-dimensional structures is presented as a two-step procedure. A system identification analysis is first performed using proper orthogonal decomposition. Using these results, a set of load-invariant bases consisting of the normal modes is next selected. Two criteria for making the basis selection are offered; one using the modal assurance criterion and the other using the modal expansion theorem. The quality of the subsequent reduced-order analyses are examined through comparison with computationally intensive finite element nonlinear simulations in physical degrees-of-freedom. A clamped flat isotropic plate under a random acoustic loading is considered to demonstrate the procedure. It is found that the subject procedure enables formation of an accurate and computationally efficient reduced-order system applicable to a broad range of loading conditions.

Przekop, Adam↗

Finite elements for Matérn-type random fields: Uncertainty in computational mechanics and design optimization

This work highlights an approach for incorporating realistic uncertainties into scientific computing workflows based on finite elements, focusing on prevalent applications in computational mechanics and design optimization. We leverage Matérn-type Gaussian random fields (GRFs) generated using the SPDE method to model aleatoric uncertainties, including environmental influences, variating material properties, and geometric ambiguities. Our focus lies on delivering practical GRF realizations that accurately capture imperfections and variations and understanding how they impact the predictions of computational models as well as the shape and topology of optimized designs. Here we describe a numerical algorithm based on solving a generalized SPDE to sample GRFs on arbitrary meshed domains. The algorithm leverages established techniques and integrates seamlessly with the open-source finite element library MFEM and associated scientific computing workflows, like those found in industrial and national laboratory settings. Our solver scales efficiently for large-scale problems and supports various domain types, including surfaces and embedded manifolds. We showcase its versatility through biomechanics and topology optimization applications, emphasizing the potential to influence these domains. The flexibility and efficiency of SPDE-based GRF generation empowers us to run large-scale optimization problems on 2D and 3D domains, including finding optimized designs on embedded surfaces, and to generate design features and topologies beyond the reach of conventional techniques. Moreover, these capabilities allow us to model and quantify geometric uncertainties on reconstructed submanifolds, such as the interpolated surfaces of cerebral aneurysms provided by postprocessing CT scans. In addition to offering benefits in these specific domains, the proposed techniques transcend specific applications and generalize to arbitrary forward and backward problems in uncertainty quantification involving finite elements.

97 MATHEMATICS AND COMPUTING↗

Machine Learning Analysis of Direct Dynamics Trajectory Outcomes for Thermal Deazetization of 2,3-Diazabicyclo[2.2.1]hept-2-ene

Experimentally, the thermal gas-phase deazetization of 2,3-diazabicyclo[2.2.1]hept-2-ene (1) results in the loss of N2 and the formation of bicyclo products 3 (exo) and 4 (endo) in a nonstatistical ratio, with preference for the exo product. Here, we report unrestricted M06-2X quasiclassical trajectories initialized from the concerted N2 ejection transition state that were able to replicate the experimental preference to form 3. We found that the 3:4 ratio results from the relative amounts of very fast (ballistic) exotype trajectories versus trajectories that lead to the 1,3-diradical intermediate 2. These quasiclassical trajectories provided a set of transition-state vibrational, velocity, momenta, and geometric features for the machine learning analysis. Additionally, a selection of popular supervised classification algorithms (e.g., random forest) provided poor prediction of trajectory outcomes based on only transition-state vibrational quanta and energy features. However, these machine learning models provided more accurate predictions using atomic velocities and atomic positions, attaining ~70% accuracy using initial conditions and between 85 and 95% accuracy at later reaction time steps. This increased accuracy allowed the feature importance analysis to reveal that, at the later-time analysis, the methylene bridge out-of-plane bending is correlated with trajectory outcomes for the formation of either the exo product or toward the diradical intermediate. Possible reasons for the struggle of machine learning algorithms to classify trajectories based on transition-state features is the heavily overlapping feature values, the finite but very large possible vibrational mode combinations, and the possibility of chaos as trajectories propagate. We examined this chaos by comparing a set of nearly identical trajectories that differed by only a very small scaling of the kinetic energies resulting from the transition-state reaction coordinate.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Brownian dynamics of confined suspensions of active microrollers

In this study, we develop efficient numerical methods for performing many-body Brownian dynamics simulations of a recently observed fingering instability in an active suspension of colloidal rollers sedimented above a wall [M. Driscoll, B. Delmotte, M. Youssef, S. Sacanna, A. Donev, and P. Chaikin, Nat. Phys. (2016), preprint arXiv:1609.08673. We present a stochastic Adams-Bashforth integrator for the equations of Brownian dynamics, which has the same cost but is more accurate than the widely used Euler-Maruyama scheme, and use a random finite difference to capture the stochastic drift proportional to the divergence of the configuration-dependent mobility matrix. We generate the Brownian increments using a Krylov method and show that for particles confined to remain in the vicinity of a no-slip wall by gravity or active flows, the number of iterations is independent of the number of particles. Our numerical experiments with active rollers show that the thermal fluctuations set the characteristic height of the colloids above the wall, both in the initial condition and the subsequent evolution dominated by active flows. Finally, the characteristic height in turn controls the time scale and wavelength for the development of the fingering instability

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Uncertainty quantification for generalized Langevin dynamics

Here, we present efficient finite difference estimators for goal-oriented sensitivity indices with applications to the generalized Langevin equation (GLE). In particular, we apply these estimators to analyze an extended variable formulation of the GLE where other well known sensitivity analysis techniques such as the likelihood ratio method are not applicable to key parameters of interest. These easily implemented estimators are formed by coupling the nominal and perturbed dynamics appearing in the finite difference through a common driving noise or common random path. After developing a general framework for variance reduction via coupling, we demonstrate the optimality of the common random path coupling in the sense that it produces a minimal variance surrogate for the difference estimator relative to sampling dynamics driven by independent paths. In order to build intuition for the common random path coupling, we evaluate the efficiency of the proposed estimators for a comprehensive set of examples of interest in particle dynamics. These reduced variance difference estimators are also a useful tool for performing global sensitivity analysis and for investigating non-local perturbations of parameters, such as increasing the number of Prony modes active in an extended variable GLE.

97 MATHEMATICS AND COMPUTING↗

Get Non-Real: Randomized Sketching for High-Dimensional Non-Real Valued Data (Final Report)

In our final report for DE-C0022186, we describe the work we did on this grant towards the goals we proposed. Our first goal was characterizing fundamental limits for sketching of discrete high-dimensional matrices with low-dimensional structures. Our second main goal was designing algorithms for data reconstruction from sketches. We focus on approaches that are either specifically designed for non-real-valued data (binary, finite field) or that will translate more readily to that setting.

97 MATHEMATICS AND COMPUTING↗

Model's sparse representation based on reduced mixed GMsFE basis methods

In this paper, we propose a model's sparse representation based on reduced mixed generalized multiscale finite element (GMsFE) basis methods for elliptic PDEs with random inputs. A typical application for the elliptic PDEs is the flow in heterogeneous random porous media. Mixed generalized multiscale finite element method (GMsFEM) is one of the accurate and efficient approaches to solve the flow problem in a coarse grid and obtain the velocity with local mass conservation. When the inputs of the PDEs are parameterized by the random variables, the GMsFE basis functions usually depend on the random parameters. This leads to a large number degree of freedoms for the mixed GMsFEM and substantially impacts on the computation efficiency. In order to overcome the difficulty, we develop reduced mixed GMsFE basis methods such that the multiscale basis functions are independent of the random parameters and span a low-dimensional space. To this end, a greedy algorithm is used to find a set of optimal samples from a training set scattered in the parameter space. Reduced mixed GMsFE basis functions are constructed based on the optimal samples using two optimal sampling strategies: basis-oriented cross-validation and proper orthogonal decomposition. Although the dimension of the space spanned by the reduced mixed GMsFE basis functions is much smaller than the dimension of the original full order model, the online computation still depends on the number of coarse degree of freedoms. To significantly improve the online computation, we integrate the reduced mixed GMsFE basis methods with sparse tensor approximation and obtain a sparse representation for the model's outputs. The sparse representation is very efficient for evaluating the model's outputs for many instances of parameters. To illustrate the efficacy of the proposed methods, we present a few numerical examples for elliptic PDEs with multiscale and random inputs. In particular, a two-phase flow model in random porous media is simulated by the proposed sparse representation method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analysis of unbounded operators and random motion

We study infinite weighted graphs with view to 'limits at infinity' or boundaries at infinity. Examples of such weighted graphs arise in infinite (in practice, that means 'very' large) networks of resistors or in statistical mechanics models for classical or quantum systems. However, more generally, our analysis includes reproducing kernel Hilbert spaces and associated operators on them. If X is some infinite set of vertices or nodes, in applications the essential ingredient going into the definition is a reproducing kernel Hilbert space; it measures the differences of functions on X evaluated on pairs of points in X. Moreover, the Hilbert norm-squared in H(X) will represent a suitable measure of energy. Associated unbounded operators will define a notion or dissipation, it can be a graph Laplacian or a more abstract unbounded Hermitian operator defined from the reproducing kernel Hilbert space under study. We prove that there are two closed subspaces in reproducing kernel Hilbert space H(X) that measure quantitative notions of limits at infinity in X: one generalizes finite-energy harmonic functions in H(X) and the other a deficiency index of a natural operator in H(X) associated directly with the diffusion. We establish these results in the abstract, and we offer examples and applications. Our results are related to, but different from, potential theoretic notions of 'boundaries' in more standard random walk models. Comparisons are made.

97 MATHEMATICS AND COMPUTING↗

Time series, correlation matrices and random matrix models

In this set of five lectures the authors have presented techniques to analyze open classical and quantum systems using correlation matrices. For diverse reasons we shall see that random matrices play an important role to describe a null hypothesis or a minimum information hypothesis for the description of a quantum system or subsystem. In the former case various forms of correlation matrices of time series associated with the classical observables of some system. The fact that such series are necessarily finite, inevitably introduces noise and this finite time influence lead to a random or stochastic component in these time series. By consequence random correlation matrices have a random component, and corresponding ensembles are used. In the latter we use random matrices to describe high temperature environment or uncontrolled perturbations, ensembles of differing chaotic systems etc. The common theme of the lectures is thus the importance of random matrix theory in a wide range of fields in and around physics.

97 MATHEMATICS AND COMPUTING↗

On a framework for generating PoD curves assisted by numerical simulations

The Probability of Detection (PoD) curve method has emerged as an important tool for the assessment of the performance of NDE techniques, a topic of particular interest to the nuclear industry where inspection qualification is very important. The conventional experimental means of generating PoD curves though, can be expensive, requiring large data sets (covering defects and test conditions), and equipment and operator time. Several methods of achieving faster estimates for PoD curves using physics-based modelling have been developed to address this problem. Numerical modelling techniques are also attractive, especially given the ever-increasing computational power available to scientists today. Here we develop procedures for obtaining PoD curves, assisted by numerical simulation and based on Bayesian statistics. Numerical simulations are performed using Finite Element analysis for factors that are assumed to be independent, random and normally distributed. PoD curves so generated are compared with experiments on austenitic stainless steel (SS) plates with artificially created notches. We examine issues affecting the PoD curve generation process including codes, standards, distribution of defect parameters and the choice of the noise threshold. We also study the assumption of normal distribution for signal response parameters and consider strategies for dealing with data that may be more complex or sparse to justify this. These topics are addressed and illustrated through the example case of generation of PoD curves for pulse-echo ultrasonic inspection of vertical surface-breaking cracks in SS plates.

36 MATERIALS SCIENCE↗