Search NASA⌕ Search

SEARCH · Search NASA

Results for “piecewise approximation”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

A Feynman-Kac based numerical method for the exit time probability of a class of transport problems

The exit time probability, which gives the likelihood that an initial condition leaves a prescribed region of the phase space of a dynamical system at, or before, a given time, is arguably one of the most natural and important transport problems. In this work, we present an accurate and efficient numerical method for computing this probability for systems described by non-autonomous (time-dependent) stochastic differential equations (SDEs) or their equivalent Fokker-Planck partial differential equations. The method is based on the direct approximation of the Feynman-Kac formula that establishes a link between the adjoint Fokker-Planck equation and the forward SDE. The Feynman-Kac formula is approximated using the Gauss-Hermite quadrature rules and piecewise cubic Hermite interpolating polynomials, and a GPU accelerated matrix representation is used to compute the entire time evolution of the exit time probability using a single pass of the algorithm. The method is unconditionally stable, exhibits second order convergence in space, first order convergence in time, and it is straightforward to parallelize. Applications are presented to the advection diffusion of a passive tracer in a fluid flow exhibiting chaotic advection, and to the runaway acceleration of electrons in a plasma in the presence of an electric field, collisions, and radiation damping. Benchmarks against analytical solutions as well as comparisons with explicit and implicit finite difference standard methods for the adjoint Fokker-Planck equation are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

The impacts of convex piecewise linear cost formulations on AC optimal power flow

Despite strong connections through shared application areas, research efforts on power market optimization (e.g., unit commitment) and power network optimization (e.g., optimal power flow) remain largely independent. A notable illustration of this is the treatment of power generation cost functions, where nonlinear network optimization has largely used polynomial representations and market optimization has adopted piecewise linear encodings. This work combines state-of-the-art results from both lines of research to understand the best mathematical formulations of the nonlinear AC optimal power flow problem with piecewise linear generation cost functions. An extensive numerical analysis of non-convex models, linear approximations, and convex relaxations across fifty-four realistic test cases illustrates that nonlinear optimization methods are surprisingly sensitive to the mathematical formulation of piecewise linear functions. The results indicate that a poor formulation choice can slow down algorithm performance by a factor of ten, increasing the runtime from seconds to minutes. Furthermore, these results provide valuable insights into the best formulations of nonlinear optimal power flow problems with piecewise linear cost functions, an important step towards building a new generation of energy markets that incorporate the nonlinear AC power flow model.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2020

hp -VPINNs: Variational physics-informed neural networks with domain decomposition

We formulate a general framework for hp-variational physics-informed neural networks (hp-VPINNs) based on the nonlinear approximation of shallow and deep neural networks and hp-refinement via domain decomposition and projection onto the space of high-order polynomials. The trial space is the space of neural network, which is defined globally over the entire computational domain, while the test space contains piecewise polynomials. Specifically in this study, the hp-refinement corresponds to a global approximation with a local learning algorithm that can efficiently localize the network parameter optimization. Here, we demonstrate the advantages of hp-VPINNs in both accuracy and training cost for several numerical examples of function approximation and in solving differential equations.

42 ENGINEERING↗
DOE OSTI2021

Decentralized Filtering Adaptive Neural Network Control for Uncertain Switched Interconnected Nonlinear Systems

This article presents a novel decentralized filtering adaptive neural network control framework for uncertain switched interconnected nonlinear systems. Each subsystem has its own decentralized controller based on the established decentralized state predictor. For each subsystem, the nonlinear uncertainties are approximated by a Gaussian radial basis function (GRBF) neural network incorporated with a piecewise constant adaptive law, where the adaptive law will update adaptive parameters from the error dynamics between the host system and the decentralized state predictor by discarding the unknowns, whereas a decentralized filtering control law is derived to cancel both local and mismatched uncertainties from other subsystems, as well as achieve the local objective tracking of the host system. The achievement of global objective depends on the achievement of local objective for each subsystem. The matched uncertainties are canceled directly by adopting their opposite in the control signal, whereas a dynamic inversion of the system is required to eliminate the effect of the mismatched uncertainties on the output. By exploiting the average dwell time principle, the error bounds between the real system and the virtual reference system, which defines the best performance that can be achieved by the closed-loop system, are derived. A numerical example is given to illustrate the effectiveness of the decentralized filtering adaptive neural network control architecture by comparing against the model reference adaptive control (MRAC).

Average dwell time, decentralized, filtering adapt↗
DOE OSTI2025

Closed-Form Approximation of the Total Variation Proximal Operator

Total variation (TV) is a widely used function for regularizing imaging inverse problems that is particularly appropriate for images whose underlying structure is piecewise constant. TV regularized optimization problems are typically solved using proximal methods, but the way in which they are applied is constrained by the absence of a closed-form expression for the proximal operator of the TV function. A closed-form approximation of the TV proximal operator has previously been proposed, but its accuracy was not theoretically explored in detail. Here, we address this gap by making several new theoretical contributions, proving that the approximation leads to a proximal operator of some convex function, it is equivalent to a gradient descent step on a smoothed version of TV, and that its error can be fully characterized and controlled with its scaling parameter. We experimentally validate our theoretical results on image denoising and sparse-view computed tomography (CT) image reconstruction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Artificial intelligence “sees” split electrons

Chemical bonds between atoms are stabilized by the exchange-correlation (xc) energy, a quantum-mechanical effect in which “social distancing” by electrons lowers their electrostatic repulsion energy. Kohn-Sham density functional theory (DFT) states that the electron density determines this xc energy, but the density functional must be approximated. Furthermore, this is usually done by satisfying exact constraints of the exact functional (making the approximation predictive), by fitting to data (making it interpolative), or both. Two exact constraints—the ensemble-based piecewise linear variation of the total energy with respect to fractional electron number and fractional electron z-component of spin —require hard-to-control nonlocality. On page 1385 of this issue, Kirkpatrick et al. have taken a big step toward more accurate predictions for chemistry through the machine learning of molecular data plus the fractional charge and spin constraints, expressed as data that a machine can learn.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2026

Charge And Dynamic Current On Tubular Antennas For Various Drive Conditions

The mixed boundary value problem of a tubular conductor is solved using an approximate representation of its Fourier coefficients. A two term solution is derived, which represents the solution over an extremely broad range of aspect ratios. This representation is used to find the electrostatic solution and capacitance of a charged tube as well as the solution of a tube in a uniform field and its dipole moment. This second case is directly useful as a model for a monopole electric field probe. This approximation is a special case of a representation using a combination of Chebyshev and Legendre polynomials. Combining the charged tube and tube in a uniform field allows the solution of voltage driven tubular antennas. Comparisons are made with numerical solutions using piecewise sinusoidal representations of the current. The results are also generalized to the dynamic case and up to and beyond the first resonance. Simple corrections for finite gap and delta gap drives to magnetic frill drives are examined using infinite tube integral transform representations. Corrections between magnetic frill drives and coaxial drives are also given. Approximate drive corrections using conformal mapping and an effective radius are also discussed. Finally, this efficient current representation is applied to the magnetic problem involving simple tubular solenoids.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Solving Eco-Driving Problems Using Indirect Collocation Method and Smooth Representation

Here, we discuss the eco-driving problem, considering both electric and conventional powertrains, and presents a pathway to solving it numerically using an indirect collocation method. Despite the low-order system dynamics, the piecewise fuel/efficiency map, gear shifting, and real-world traffic/road situations bring system discontinuities/switchings and pure state constraints into the problem formulation, which make the problem highly nonlinear and nontrivial to solve. This letter introduces smooth approximations to convert the original problem to an unconstrained (and penalized) smooth boundary-value problem. This approach eliminates the discussion of the switching structure and leads to a lightweight Newton-method-based solution procedure.

42 ENGINEERING↗
DOE OSTI2020

Adaptive Hybridizable Discontinuous Galerkin discretization of the Grad–Shafranov equation by extension from polygonal subdomains

In this work, we propose a high-order adaptive numerical solver for the semilinear elliptic boundary value problem modeling magnetic plasma equilibrium in axisymmetric confinement devices. In the fixed boundary case, the equation is posed on curved domains with piecewise smooth curved boundaries that may present corners. The solution method we present is based on the hybridizable discontinuous Galerkin method and sidesteps the need for geometry-conforming triangulations thanks to a transfer technique that allows to approximate the solution using only a polygonal subset as computational domain. Moreover, the solver features automatic mesh refinement driven by a residual-based a posteriori error estimator. As the mesh is locally refined, the computational domain is automatically updated in order to always maintain the distance between the actual boundary and the computational boundary of the order of the local mesh diameter. Numerical evidence is presented of the suitability of the estimator as an approximate error measure for physically relevant equilibria with pressure pedestals, internal transport barriers, and current holes on realistic geometries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Self-similar Reynolds-averaged mechanical–scalar turbulence models for reshocked Richtmyer–Meshkov instability-induced mixing in the small Atwood number limit

Analytical self-similar solutions to two-, three-, and four-equation Reynolds-averaged mechanical–scalar turbulence models describing incompressible turbulent Richtmyer–Meshkov instability-induced mixing in planar geometry derived in the small Atwood number limit are extended to construct models for reshocked Richtmyer–Meshkov mixing. In this study, the models are based on the turbulent kinetic energy K and its dissipation rate ε, together with the scalar variance S and its dissipation rate χ modeled either differentially or algebraically. The three- and four-equation models allow for a simultaneous description of mechanical and scalar mixing, i.e., mixing layer growth and molecular mixing. Mixing layer growth parameters and other physical observables were obtained explicitly as functions of the model coefficients and were used to calibrate the model coefficients. Here, the solutions for the singly shocked Richtmyer–Meshkov case for the mixing layer width and the turbulent fields are used to construct piecewise-continuous generalizations of these quantities for times after reshock. For generality, the post-reshock mixing layer width is not assumed to grow with the same power-law as the pre-reshock width, and an impulsive approximation applied to Rayleigh–Taylor instability growth is used to establish the expression for the post-reshock width. A four-equation model is then used to illustrate the spatiotemporal behavior of the mean and turbulent fields and late-time turbulent equation budgets across the mixing layer. The reference solutions derived here can provide systematic calibrations and better understanding of mechanical–scalar turbulence models and their predictions for reshocked Richtmyer–Meshkov instability-induced turbulent mixing in the very large Reynolds number limit.

42 ENGINEERING↗
DOE OSTI2021

Adiabatic behavior of an elliptical vortex in a time-dependent external strain flow

The adiabatic behavior of two-dimensional (2D) fluid vortices subject to slowly varying, time-dependent external strain flows is studied theoretically, and experimentally using magnetized non-neutral electron plasmas. Here the E × B drift dynamics of the electrons perpendicular to the magnetic field are analogous to the motion of fluid vorticity under the 2D Euler equations describing ideal fluids. A low-dimensional elliptical vortex patch model is used along with a WKB approximation to derive a formula for the breaking of an adiabatic invariant due to the changing external flow. The invariant is interpreted as the amplitude of a perturbative oscillation about a stable fixed point corresponding to a steady elliptical vortex. Smooth, hyperbolic tangent and piecewise linear ramp functions are considered for the external strain time dependence. Standard exponential breaking is observed in the former case, whereas the latter exhibits a power-law breaking curve with periodic modulation. It is found that a driving term in the equations of motion contributes the majority of the breaking whereas the frequency variation plays a weaker, but significant role. The experimental data agree closely with the theoretical model. The most significant deviation is due to inviscid damping behavior associated with the smooth edges of the experimental vortices, which tends to reduce the amplitude of the oscillation. Finally, the results are compared and contrasted with other related experimental, numerical, and theoretical work.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Evaluating route to impact convergence of the harmonic balance method for piecewise-smooth systems

Here in this work, we investigate the applicability of the harmonic balance method (HBM) to predict periodic solutions of a single degree-of-freedom forced Duffing oscillator with freeplay nonlinearity. By studying the route to impact, which refers to a parametric study as the contact stiffness increases from soft to hard, the convergence behavior of the HBM can be understood in terms of the strength of the non-smooth forcing term. HBM results are compared to time-integration results to facilitate an evaluation of the accuracy of nonlinear periodic responses. An additional contribution of this study is to perform convergence and stability analysis specifically for isolas generated by the non-smooth nonlinearity. Residual error analysis is used to determine the approximate number of harmonics required to get results accurate to a given error tolerance. Hill’s method and Floquet theory are employed to compute the stability of periodic solutions and identify the types of bifurcations in the system.

42 ENGINEERING↗
DOE OSTI2024

Algorithm 1049: The Delaunay Density Diagnostic

Accurate approximation of a real-valued function depends on two aspects of the available data: the density of inputs within the domain of interest and the variation of the outputs over that domain. There are few methods for assessing whether the density of inputs is sufficient to identify the relevant variations in outputs—i.e., the “geometric scale” of the function—despite the fact that sampling density is closely tied to the success or failure of an approximation method. In this article, we introduce a general purpose, computational approach to detecting the geometric scale of real-valued functions over a fixed domain using a deterministic interpolation technique from computational geometry. The algorithm is intended to work on scalar data in moderate dimensions (2–10). Our algorithm is based on the observation that a sequence of piecewise linear interpolants will converge to a continuous function at a quadratic rate (in L 2 norm) if and only if the data are sampled densely enough to distinguish the feature from noise (assuming sufficiently regular sampling). We present numerical experiments demonstrating how our method can identify feature scale, estimate uncertainty in feature scale, and assess the sampling density for fixed (i.e., static) datasets of input–output pairs. Finally, we include analytical results in support of our numerical findings and have released lightweight code that can be adapted for use in a variety of data science settings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A discontinuous piecewise polynomial generalized moving least squares scheme for robust finite element analysis on arbitrary grids

A variational approach is developed with a meshless discretization to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. Here, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality, which we call discontinuous piecewise polynomial generalized moving least squares (DPP-GMLS). At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework, providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5 x improvement in accuracy and allows for taking an 8 x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Accurate Compression of Tabulated Chemistry Models with Partition of Unity Networks

Tabulated chemistry models are widely used to simulate large-scale turbulent fires in applications including energy generation and fire safety. Tabulation via piecewise Cartesian interpolation suffers from the curse-of-dimensionality, leading to a prohibitive exponential growth in parameters and memory usage as more dimensions are considered. Artificial neural networks (ANNs) have attracted attention for constructing surrogates for chemistry models due to their ability to perform high-dimensional approximation. However, due to well-known pathologies regarding the realization of suboptimal local minima during training, in practice they do not converge and provide unreliable accuracy. Partition of unity networks (POUnets) are a recently introduced family of ANNs which preserve notions of convergence while performing high-dimensional approximation, discovering a mesh-free partition of space which may be used to perform optimal polynomial approximation. In this work, we assess their performance with respect to accuracy and model complexity in reconstructing unstructured flamelet data representative of nonadiabatic pool fire models. Our results show that POUnets can provide the desirable accuracy of classical spline-based interpolants with the low memory footprint of traditional ANNs while converging faster to significantly lower errors than ANNs. For example, we observe POUnets obtaining target accuracies in two dimensions with 40 to 50 times less memory and roughly double the compression in three dimensions. We also address the practical matter of efficiently training accurate POUnets by studying convergence over key hyperparameters, the impact of partition/basis formulation, and the sensitivity to initialization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

A weighted Shifted Boundary Method for free surface flow problems

The Shifted Boundary Method (SBM) belongs to the class of unfitted (or immersed, or embedded) finite element methods and was recently introduced for the Poisson, linear advection/diffusion, Stokes, Navier-Stokes, acoustics, and shallow-water equations. By reformulating the original boundary value problem over a surrogate (approximate) computational domain, the SBM avoids integration over cut cells and the associated problematic issues regarding numerical stability and matrix conditioning. Accuracy is maintained by modifying the original boundary conditions using Taylor expansions. Hence the name of the method, that shifts the location and values of the boundary conditions. In this article, we extend the SBM to the simulation of incompressible Navier-Stokes flows with moving free-surfaces, by appropriately weighting its variational form with the elemental volume fraction of active fluid. This approach prevents spurious pressure oscillations in time, which would otherwise be produced if the total active fluid volume were to change abruptly over a time step. In fact, the proposed weighted SBM method induces small mass (i.e., volume) conservation errors, which converge quadratically in the case of piecewise-linear finite element interpolations, as the grid is refined. Finally, we present an extensive set of two- and three-dimensional tests to demonstrate the robustness and accuracy of the method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Density functional theory of material design: fundamentals and applications—II

Abstract This is the second and the final part of the review on density functional theory (DFT), referred to as DFT-II. In the first review, DFT-I, we have discussed wavefunction-based methods, their complexity, and basics of density functional theory. In DFT-II, we focus on fundamentals of DFT and their implications for the betterment of the theory. We start our presentation with the exact DFT results followed by the concept of exchange-correlation (xc) or Fermi-Coulomb hole and its relationship with xc energy functional. We also provide the exact conditions for the xc-hole, xc-energy and xc-potential along with their physical interpretation. Next, we describe the extension of DFT for non-integer number of electrons, the piecewise linearity of total energy and discontinuity of chemical potential at integer particle numbers, and derivative discontinuity of the xc potential, which has consequences on fundamental gap of solids. After that, we present how one obtains more accurate xc energy functionals by going beyond the LDA. We discuss the gradient expansion approximation (GEA), generalized gradient approximation (GGA), and hybrid functional approaches to designing better xc energy functionals that give accurate total energies. However, these functionals fail to predict properties like the ionization potential and the band gap. Thus, we next describe different methods of modelling these potentials and results of their application for calculation of the band gaps of different solids to highlight accuracy of different xc potentials. Finally, we conclude with a glimpse on orbital-free density functional theory and the machine learning approach.

36 MATERIALS SCIENCE↗