Search NASA⌕ Search

SEARCH · Search NASA

Results for “Elliptic equation”

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.

104 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Vortex splitting in two-dimensional fluids and non-neutral electron plasmas with smooth vorticity profiles

Initially, elliptical, quasi-two-dimensional (2D) fluid vortices can split into multiple pieces if the aspect ratio is sufficiently large due to the growth and saturation of perturbations known as Love modes on the vortex edge. Presented here are experiments and numerical simulations, showing that the aspect ratio threshold for vortex splitting is significantly higher for vortices with realistic, smooth edges than that predicted by a simple “vortex patch” model, where the vorticity is treated as piecewise constant inside a deformable boundary. The experiments are conducted by exploiting the E × B drift dynamics of collisionless, pure electron plasmas in a Penning–Malmberg trap, which closely model 2D vortex dynamics due to an isomorphism between the Drift–Poisson equations describing the plasmas and the Euler equations describing ideal fluids. The simulations use a particle-in-cell method to model the evolution of a set of point vortices. The aspect ratio splitting threshold ranges up to about twice as large as the vortex patch prediction and depends on the edge vorticity gradient. This is thought to be due to spatial Landau damping, which decreases the vortex aspect ratio over time and, thus, stabilizes the Love modes. Near the threshold, asymmetric splitting events are observed in which one of the split products contains much less circulation than the other. These results are relevant to a wide range of quasi-2D fluid systems, including geophysical fluids, astrophysical disks, and drift-wave eddies in tokamak plasmas.

Physics↗
DOE OSTI2026

Impact of QCD energy evolution on observables in heavy-ion collisions

Here, we study how the inclusion of energy dependence as dictated by quantum chromodynamic (QCD) small-x evolution equations affects key observables in ultra-relativistic heavy-ion collisions. Specifically, we incorporate JIMWLK evolution into the IP-Glasma framework, which serves as the initial condition for a simulation pipeline that includes viscous relativistic hydrodynamics and a hadronic afterburner. This approach enables a consistent modeling of highly energetic nuclei across varying Bjorken-x values, which are relevant for different collision energies and rapidity regions. In comparison to the standard IP-Glasma setup without small-x evolution, we observe pronounced changes in particle multiplicities and spectral distributions, especially in smaller systems and at the highest available energies. We further explore effects on anisotropic flow observables and correlations between mean transverse momentum and elliptic flow. Our findings underscore the critical role of nonlinear QCD evolution in accurately modeling the early stages of heavy-ion collisions, as well as its implications for extracting transport properties of the quark-gluon plasma.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Modeling the Yaw Behavior of Tail Fins for Small Wind Turbines: November 22, 2021 - May 21, 2024

This report describes the aerodynamic modelling of the yaw behavior of tail fins for small wind turbines (SWTs). The analysis is based on unsteady slender body theory (USBT) and is formulated to be used with the proposed tail fin module to be added to OpenFAST. Linearized USBT, which has been applied in the past to SWT tail fins, is developed in three main ways. First, USBT is extended to high yaw angles and aspect ratios by modelling the associated nonlinear vortex dynamics and the chordwise load distribution respectively. Second, we consider the effect of time-varying wind speed. The extended theory is compared to recent unpublished measurements at the University of Perugia, Italy, for the yaw behavior of delta, elliptical, and rectangular tail fins without a rotor and nacelle. The fins were released from initial yaw angles of -40 degrees and -80 degrees ; the latter is of sufficient magnitude to show the importance of the nonlinear yaw dynamics. Further, the friction in the model tail fin bearings was measured and modelled. The constants in the aerodynamic models were taken from the literature but significant improvement in accuracy is achieved by using system identification techniques to optimize the values. This leads to the third main finding: extended USBT is accurate for all generic tail fin shapes that we considered and is, therefore, very suitable for inclusion in aeroelastic codes for SWTs. The final development is of a general nonlinear equation for yaw response that is simpler than the extended USBT and is also suitable for inclusion in OpenFAST. The two nonlinear models are used to highlight the geometric requirements for good tail fin design.

distributed wind↗
DOE OSTI2020

Physics-Informed Generative Adversarial Networks for Stochastic Differential Equations

We developed a new class of physics-informed generative adversarial networks (PI-GANs) to solve forward, inverse, and mixed stochastic problems in a unified manner based on a limited number of scattered measurements. Unlike standard GANs relying solely on data for training, here we encoded into the architecture of GANs the governing physical laws in the form of stochastic differential equations (SDEs) using automatic differentiation. In particular, we applied Wasserstein GANs with gradient penalty (WGAN-GP) for its enhanced stability compared to vanilla GANs. We first tested WGAN-GP in approximating Gaussian processes of different correlation lengths based on data realizations collected from simultaneous reads at sparsely placed sensors. We obtained good approximation of the generated stochastic processes to the target ones even if there is a mismatch between the input noise dimensionality and the effective dimensionality of the target stochastic processes. We also studied the overfitting issue for both the discriminator and the generator, and we found that overfitting occurs also in the generator in addition to the discriminator as previously reported. Subsequently, we considered the solution of elliptic SDEs requiring approximations of three stochastic processes, namely the solution, the forcing, and the diffusion coefficient. Here again, we assumed data collected from simultaneous reads at a limited number of sensors for the multiple stochastic processes. Furthermore, three generators were used for the PI-GANs: two of them were feed forward deep neural networks (DNNs), while the other one was the neural network induced by the SDE. For the case where we have one group of data, we employed one feed forward DNN as the discriminator, while for the case of multiple groups of data we employed multiple discriminators in PI-GANs. We solved forward, inverse, and mixed problems without changing the framework of PI-GANs, obtaining both the means and the standard deviations of the stochastic solution and the diffusion coefficient in good agreement with benchmarks. In this work, we have demonstrated the effectiveness of PI-GANs in solving SDEs for about 120 dimensions. In principle, PI-GANs could tackle very high dimensional problems given more sensor data with low-polynomial growth in computational cost.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Sub-percentage measure of distances to redshift of 0.1 by a new cosmic ruler

ABSTRACT Distance-redshift diagrams probe expansion history of the Universe. We show that the stellar mass-binding energy (massE) relation of galaxies proposed in our previous study offers a new distance ruler at cosmic scales. By using elliptical galaxies in the main galaxy sample of the Sloan Digital Sky Survey Data Release 7, we construct a distance-redshift diagram over the redshift range from 0.05 to 0.2 with the massE ruler. The best-fit dark energy density is 0.675 ± 0.079 for flat Λ-cold dark matter (ΛCDM) model, consistent with those by other probes. At the median redshift of 0.11, the median distance is estimated to have a fractional error of 0.34 per cent, much lower than those by supernova (SN) Ia and baryonic acoustic oscillation (BAO) and even exceeding their future capability at this redshift. The above low-$\mathit{ z}$ measurement is useful for probing dark energy that dominates at the late Universe. For a flat dark energy equation of state model (flat wCDM), the massE alone constrains w to an error that is only a factor of 2.2, 1.7, and 1.3 times larger than those by BAO, SN Ia, and cosmic microwave background (CMB), respectively.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Hadamard products and BPS networks

We study examples of fourth-order Picard-Fuchs operators that are Hadamard products of two second-order Picard-Fuchs operators. Each second-order Picard-Fuchs operator is associated with a family of elliptic curves, and the Hadamard product computes period integrals on the fibred product of the two elliptic surfaces. We construct 3-cycles on this geometry as the union of 2-cycles in the fibre over contours on the base. We then use the special Lagrangian condition to constrain the contours on the base. This leads to a construction that is reminiscent of spectral networks and exponential networks that have previously appeared in string theory literature.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Statistical uncertainties of the v n { 2 k } harmonics from Q cumulants

Analytic formulas to calculate statistical uncertainties of v n { 2 k } harmonics extracted from the Q cumulants are presented. The Q cumulants are multivariate polynomial functions of the weighted means of 2m-particle azimuthal correlations, $\langle\langle 2 m \rangle\rangle$. Variances and covariances of the $\langle\langle 2 m \rangle\rangle$ are included in the analytic formulas of the uncertainties that can be calculated simultaneously with the calculations of the v n { 2 k } harmonics. The calculations are performed using a simple toy model, which roughly simulates elliptic flow azimuthal anisotropy with magnitudes around 0.05. The results are compared with the results obtained by the many data subsets, and by the bootstrapping method. The first one is a common way of estimation of the statistical uncertainties of the v n { 2 k } harmonics in a real experiment. In order to increase precision in the measurement of the v n { 2 k } harmonics, a large number of 15 000 subsets and the same number of the resampling in the bootstrap method is used. Unlike the other ways of the analytic calculation of the v n { 2 k } statistical uncertainties, our proposal that includes the use of squared weights in the calculation of both the variances and covariances, gives the best agreement with the results obtained from the subsets and bootstrap method. Additionally, a recurrence equation between Q cumulants of any order is also presented.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

A virtual element generalization on polygonal meshes of the Scott-Vogelius finite element method for the 2-D Stokes problem

The virtual element method (VEM) is a Galerkin approximation method that extends the finite element method to polytopal meshes. In this paper, we present a conforming formulation that generalizes the Scott-Vogelius finite element method (FEM) for the numerical approximation of the Stokes problem to polygonal meshes in the framework of the virtual element method. In particular, we consider a straightforward application of the virtual element approximation space for scalar elliptic problems to the vector case and approximate the pressure variable through discontinuous polynomials. We assess the effectiveness of the numerical approximation by investigating the convergence on a manufactured solution problem and a set of representative polygonal meshes. We numerically show that this formulation is convergent with optimal convergence rates except for the lowest-order case on triangular and square meshes where the method coincides with the P 1 - P 0 Scott-Vogelius scheme, which is well-known to be unstable.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A virtual element generalization on polygonal meshes of the Scott-Vogelius finite element method for the 2-D Stokes problem

The Virtual Element Method (VEM) is a Galerkin approximation method that extends the Finite Element Method (FEM) to polytopal meshes. In this paper, we present a conforming formulation that generalizes the Scott-Vogelius finite element method for the numerical approximation of the Stokes problem to polygonal meshes in the framework of the virtual element method. In particular, we consider a straightforward application of the virtual element approximation space for scalar elliptic problems to the vector case and approximate the pressure variable through discontinuous polynomials. We assess the effectiveness of the numerical approximation by investigating the convergence on a manufactured solution problem and a set of representative polygonal meshes. Finally, we numerically show that this formulation is convergent with optimal convergence rates except for the lowest-order case on triangular meshes, where the method coincides with the $\mathbb{P}_1$ – $\mathbb{P}_0$ Scott-Vogelius scheme, and on square meshes, which are situations that are well-known to be unstable.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Lattice Green’s Functions for High-Order Finite Difference Stencils

Lattice Green's Functions (LGFs) are fundamental solutions to discretized linear operators, and as such they are a useful tool for solving discretized elliptic PDEs on domains that are unbounded in one or more directions. The majority of existing numerical solvers that make use of LGFs rely on a second-order discretization and operate on domains with free-space boundary conditions in all directions. Under these conditions, fast expansion methods are available that enable precomputation of 2D or 3D LGFs in linear time, avoiding the need for brute-force multi-dimensional quadrature of numerically unstable integrals. Here we focus on higher-order discretizations of the Laplace operator on domains with more general boundary conditions, by (1) providing an algorithm for fast and accurate evaluation of the LGFs associated with high-order dimension-split centered finite differences on unbounded domains, and (2) deriving closed-form expressions for the LGFs associated with both dimension-split and Mehrstellen discretizations on domains with one unbounded dimension. Through numerical experiments we demonstrate that these techniques provide LGF evaluations with near machine-precision accuracy, and that the resulting LGFs allow for numerically consistent solutions to high-order discretizations of the Poisson's equation on fully or partially unbounded 3D domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Hierarchical Model Reduction Driven by Machine Learning for Parametric Advection-Diffusion-Reaction Problems in the Presence of Noisy Data

Abstract We propose a new approach to generate a reliable reduced model for a parametric elliptic problem, in the presence of noisy data. The reference model reduction procedure is the directional HiPOD method, which combines Hierarchical Model reduction with a standard Proper Orthogonal Decomposition, according to an offline/online paradigm. In this paper we show that directional HiPOD looses in terms of accuracy when problem data are affected by noise. This is due to the interpolation driving the online phase, since it replicates, by definition, the noise trend. To overcome this limit, we replace interpolation with Machine Learning fitting models which better discriminate relevant physical features in the data from irrelevant unstructured noise. The numerical assessment, although preliminary, confirms the potentialities of the new approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Robust Optimal Experimental Design of Infinite-Dimensional Bayesian Nonlinear Inverse Problems

Abstract. We consider robust optimal experimental design (ROED) for nonlinear Bayesian inverse problems governed by partial differential equations (PDEs). An optimal design is one that maximizes some utility quantifying the quality of the solution of an inverse problem. However, the optimal design is dependent on elements of the inverse problem such as the simulation model, the prior, or the measurement error model. ROED aims to produce an optimal design that is aware of the additional uncertainties encoded in the inverse problem and remains optimal even after variations in them. We follow a worst-case scenario approach to develop a new framework for robust optimal design of nonlinear Bayesian inverse problems. The proposed framework (a) is scalable and designed for infinite-dimensional Bayesian nonlinear inverse problems constrained by PDEs; (b) develops efficient approximations of the utility, namely the expected information gain; (c) employs eigenvalue sensitivity techniques to develop analytical forms and efficient evaluation methods of the gradient of the utility with respect to the uncertainties against which we wish to be robust; and (d) employs a probabilistic optimization paradigm that properly defines and efficiently solves the resulting combinatorial max-min optimization problem. The effectiveness of the proposed approach is illustrated for optimal sensor placement problem in an inverse problem governed by an elliptic PDE.

Chowdhary, Abhijit↗
DOE OSTI2024

The nonlinear behavior of generic tail fins for small wind turbines

This paper describes analysis and measurements of the yaw response of tail fins for small wind turbines. It is based on an extension of unsteady slender body theory (USBT) to cover non-slender fins and high angles of incidence, both of which make the theory nonlinear. We provide three main additions to the substantial literature on linearized USBT for tail fins. First, USBT is extended to high angles by modeling the nonlinear vortex dynamics. Second, the restriction to slender bodies is removed by modeling the chordwise load variation. Third, we consider the effect of time-varying wind speed. Further, the extended theory is compared to wind tunnel measurements of the yaw behavior of delta, elliptical, and rectangular tail fins without a rotor and nacelle. The fins were released from initial yaw angles of -40° and -80°; the latter is of sufficient magnitude to show the importance of the nonlinear yaw dynamics. Generally good agreement was found between the theory and measurements, and the theory was shown to be more accurate than a “polar” or quasi-steady model which uses only the lift and drag of a delta planform. Of the three planforms, the rectangular one showed the lowest accuracy in terms of frequency but the damping was accurately predicted. Overall, the results demonstrate the importance of nonlinearity in the response of a yawing tail fin, particularly for the higher aspect ratio fins at large yaw angles.

17 WIND ENERGY↗
DOE OSTI2021

Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications

Deep neural networks have been successfully employed in an extensive variety of research areas, including solving partial differential equations. Despite its significant success, there are some challenges in effectively training DNN, such as avoiding overfitting in over-parameterized DNNs and accelerating the optimization in DNNs with pathological curvature. Here, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in nonconvex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in the preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning solutions of elliptic PDE, which demonstrate the accuracy and efficiency of the present work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗