Search NASA⌕ Search

SEARCH · Search NASA

Results for “discrete optimization”

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,441 records · Page 80

Exploratory Study for Continuous-time Parameter Estimation of Ankle Dynamics

Recently, a parallel pathway model to describe ankle dynamics was proposed. This model provides a relationship between ankle angle and net ankle torque as the sum of a linear and nonlinear contribution. A technique to identify parameters of this model in discrete-time has been developed. However, these parameters are a nonlinear combination of the continuous-time physiology, making insight into the underlying physiology impossible. The stable and accurate estimation of continuous-time parameters is critical for accurate disease modeling, clinical diagnosis, robotic control strategies, development of optimal exercise protocols for longterm space exploration, sports medicine, etc. This paper explores the development of a system identification technique to estimate the continuous-time parameters of ankle dynamics. The effectiveness of this approach is assessed via simulation of a continuous-time model of ankle dynamics with typical parameters found in clinical studies. The results show that although this technique improves estimates, it does not provide robust estimates of continuous-time parameters of ankle dynamics. Due to this we conclude that alternative modeling strategies and more advanced estimation techniques be considered for future work.

neuromuscular systems↗

Coupled Inertial Navigation and Flush Air Data Sensing Algorithm for Atmosphere Estimation

This paper describes an algorithm for atmospheric state estimation that is based on a coupling between inertial navigation and flush air data sensing pressure measurements. In this approach, the full navigation state is used in the atmospheric estimation algorithm along with the pressure measurements and a model of the surface pressure distribution to directly estimate atmospheric winds and density using a nonlinear weighted least-squares algorithm. The approach uses a high fidelity model of atmosphere stored in table-look-up form, along with simplified models of that are propagated along the trajectory within the algorithm to provide prior estimates and covariances to aid the air data state solution. Thus, the method is essentially a reduced-order Kalman filter in which the inertial states are taken from the navigation solution and atmospheric states are estimated in the filter. The algorithm is applied to data from the Mars Science Laboratory entry, descent, and landing from August 2012. Reasonable estimates of the atmosphere and winds are produced by the algorithm. The observability of winds along the trajectory are examined using an index based on the discrete-time observability Gramian and the pressure measurement sensitivity matrix. The results indicate that bank reversals are responsible for adding information content to the system. The algorithm is then applied to the design of the pressure measurement system for the Mars 2020 mission. The pressure port layout is optimized to maximize the observability of atmospheric states along the trajectory. Linear covariance analysis is performed to assess estimator performance for a given pressure measurement uncertainty. The results indicate that the new tightly-coupled estimator can produce enhanced estimates of atmospheric states when compared with existing algorithms.

Karlgaard, Christopher D.↗

Noise and error analysis and optimization in particle-based kinetic plasma simulations

In this paper we analyze the noise in macro-particle methods used in plasma physics and fluid dynamics, leading to approaches for minimizing the total error, focusing on electrostatic models in one dimension. We begin by describing kernel density estimation for continuous values of the spatial variable x, expressing the kernel in a form in which its shape and width are represented separately. The covariance matrix of the noise in the density is computed, first for uniform true density. The bandwidth of the covariance matrix C(x,y) is related to the width of the kernel. A feature that stands out is the presence of constant negative terms in the elements of the covariance matrix both on and off-diagonal. These negative correlations are related to the fact that the total number of particles is fixed at each time step; they also lead to the property ∫C(x,y)dy = 0. We investigate the effect of these negative correlations on the electric field computed by Gauss's law, finding that the noise in the electric field is related to a process called the Ornstein-Uhlenbeck bridge, leading to a covariance matrix of the electric field with variance significantly reduced relative to that of a Brownian process. For non-constant density, p(x), still with continuous x, we analyze the total error in the density estimation and discuss it in terms of bias-variance optimization (BVO). For some characteristic length l, determined by the density and its second derivative, and kernel width h, having too few particles within h leads to too much variance; for h that is large relative to l, there is too much smoothing of the density. The optimum between these two limits is found by BVO. For kernels of the same width, it is shown that this optimum (minimum) is weakly sensitive to the kernel shape. Next, we repeat the analysis for x discretized on a grid. In this case the charge deposition rule is determined by a particle shape. An important property to be respected in the discrete system is the exact preservation of total charge on the grid; this property is necessary to ensure that the electric field is equal at both ends, consistent with periodic boundary conditions. We find that if the particle shapes satisfy a partition of unity property, the particle charge deposited on the grid is conserved exactly. Further, if the particle shape is expressed as the convolution of a kernel with another kernel that satisfies the partition of unity, then the particle shape obeys the partition of unity. This property holds for kernels of arbitrary width, including widths that are not integer multiples of the grid spacing. Furthermore, we show results relaxing the approximations used to do BVO optimization analytically, by doing numerical computations of the total error as a function of the kernel width, on a grid in x. The comparison between numerical and analytical results shows good agreement over a range of particle shapes. We discuss the practical implications of our results, including the criteria for design and implementation of computationally efficient particle shapes that take advantage of the developed theory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Full-Induction Magnetohydrodynamics Solver for Liquid Metal Fusion Blankets in Vertex-CFD

Multiphysics modeling of liquid metal fusion blankets, which produce tritium and convert energy of neutrons created via fusion reactions into heat, is crucial for predicting performance, ensuring structural integrity, and optimizing energy production. While traditional blanket modeling of liquid metal flows during normal steady operating conditions commonly employs the inductionless approximation of the magnetohydrodynamics (MHD) equations, transient scenarios, when the plasma-confining magnetic field varies on millisecond time scales, require a full-induction MHD approach that dynamically evolves the magnetic field via the time-dependent induction equation. This paper presents the formulation, implementation, and initial verification of a full-induction MHD solver integrated within the open-source Vertex-CFD framework, which aims to achieve tight multiphysics coupling, a flexible software design enabling easy extension and addition of physics models, and performance portability across computing platforms. The solver utilizes finite element spatial discretization, implicit Runge–Kutta time integration, and an inexact Newton method to solve the resulting discrete nonlinear system, leveraging Trilinos packages for efficient computation. Verification against selected benchmark problems demonstrates accuracy and robustness of the solver. Furthermore, when the solver is applied to an idealized blanket model in 2.5D and full 3D, results obtained with Vertex-CFD are in good agreement with recently published quasi-2D simulations. These findings establish a computational foundation for future simulations of transient MHD phenomena in liquid metal blankets with Vertex-CFD, and open avenues for future extensions and performance optimizations.

Endeve, Eirik [ORNL] (ORCID:0000000312519507)↗

FEM-BEM coupling methods for Tokamak plasma axisymmetric free-boundary equilibrium computations in unbounded domains

Incorporating boundary conditions at infinity into simulations on bounded computational domains is a repeatedly occurring problem in scientific computing. The combination of finite element methods (FEM) and boundary element methods (BEM) is the obvious instrument, and we adapt here for the first time the two standard FEM-BEM coupling approaches to the free-boundary equilibrium problem: the Johnson–Nédélec coupling and the Bielak–MacCamy coupling. We recall also the classical approach for fusion applications, dubbed according to its first appearance von-Hagenow–Lackner coupling and present the less used alternative introduced by Albanese, Blum and de Barbieri in . We show that the von-Hagenow–Lackner coupling suffers from undesirable non-optimal convergence properties, that suggest that other coupling schemes, in particular Johnson–Nédélec or Albanese–Blum–de Barbieri are more appropriate for non-linear equilibrium problems. Moreover, we show that any of such coupling methods requires Newton-like iteration schemes for solving the corresponding non-linear discrete algebraic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Finite element analysis of multilayer coextrusion.

Multilayer coextrusion has become a popular commercial process for producing complex polymeric products from soda bottles to reflective coatings. A numerical model of a multilayer coextrusion process is developed based on a finite element discretization and two different free-surface methods, an arbitrary-Lagrangian-Eulerian (ALE) moving mesh implementation and an Eulerian level set method, to understand the moving boundary problem associated with the polymer-polymer interface. The goal of this work is to have a numerical capability suitable for optimizing and troubleshooting the coextrusion process, circumventing flow instabilities such as ribbing and barring, and reducing variability in layer thickness. Though these instabilities can be both viscous and elastic in nature, for this work a generalized Newtonian description of the fluid is used. Models of varying degrees of complexity are investigated including stability analysis and direct three-dimensional finite element free surface approaches. The results of this work show how critical modeling can be to reduce build test cycles, improve material choices, and guide mold design.

36 MATERIALS SCIENCE↗

Medial axis and local thickness computation using the Fast Sweeping Method

This report describes an efficient and robust voxel-based methodology for computing the medial axis, local thickness, and distance-to-skeleton of arbitrary three-dimensional geometries. It is assumed that the object can be represented by an exact or approximate signed distance function on a discrete grid. The gradient of such function is used to formulate a hyperbolic partial differential equation (PDE) that models the collapse of the position vector in space. By exploiting the causality property of the PDE, the Fast Sweeping Method is able to obtain the solution in a finite number of sweeps independent of the mesh resolution. The intersection of characteristic lines leads to the formation of shocks and a discrete bisector function is used to identify the medial axis. The same PDE approach is used to compute the local thickness inside the object and obtain the distance-to-skeleton field. Multiple examples are given in two and three dimensions along with a resolution study. The methodology has optimal complexity and yields subsecond computational times for geometries with over a million zones on a single core. The methodology is also capable of parallelization across shared and distributed memory architectures.

97 MATHEMATICS AND COMPUTING↗

R-Adaptivity to Enable Compression of Elementary Computations in Extreme-Scale Finite Element Simulators

Modern computing systems are capable of exascale calculations, which are revolutionizing the development and application of high-fidelity numerical models in computational science and engineering. While these systems continue to grow in processing power, the available system memory has not increased commensurately, and electrical power consumption continues to grow. A predominant approach to limit the memory usage in large-scale applications is to exploit the abundant processing power and continually recompute many low-level simulation quantities, rather than storing them. However, this approach can adversely impact the throughput of the simulation and diminish the benefits of modern computing architectures. We present three novel contributions to reduce the memory burden while maintaining, and sometimes improving, performance in simulations based on finite element discretizations. The first contribution develops dictionary-based data compression schemes that detect and exploit the structure of the discretization, due to redundancies across the finite element mesh. While these schemes are shown to reduce memory requirements by more than 99% on meshes with large numbers of identical mesh cells, there are applications where this structure does not exist. The second contribution leverages a recently developed augmented Lagrangian optimization algorithm to enable r-adaptivity for meshes with the goal of enhancing the redundancies in the mesh. The third contribution extends these methods to patch-based linear solvers and preconditioners by compressing local matrices. Numerical results demonstrate the effectiveness of the proposed methods to detect, enhance and exploit mesh structure on a suite of examples inspired by large-scale applications.

97 MATHEMATICS AND COMPUTING↗

Photon counting detectors for Fabry-Perot interferometers

Sealed channel plate photomultipliers with multiple discrete anodes for use as photon counting detectors in the image plane of Fabry-Perot interferometers are described. The influence of design and construction on performance of completed devices is discussed. Effects on spatial resolution, lifetime, and counting efficiency are described. It is shown that devices can be optimized for particular applications. The results should be generally applicable to resistive anode and wedge and strip anode types of sealed detectors.

Darlington, E. H.↗

A multiloop, digital flutter suppression control law synthesis case study

A methodology for obtaining a digital low-order, multiloop, robust control law for aeroelastic application from a full-state Linear Quadratic Gaussian design is presented. As part of the design methodology, the multivariable system robustness at the plant input and output is evaluated using singular value properties and improved using constrained optimization procedures. To validate the methodology, a digital flutter suppression system has been designed for the full-span Active Flexible Wing (AFW) wind-tunnel model as part of a collaborative effort between the NASA Langley Research Center and Rockwell International. Preliminary results for a low-order discrete, symmetric flutter suppression system design that significantly improved the AFW model stability are provided and the experiences gained during the design process are discussed.

Mukhopadhyay, Vivek↗

A variational method for finite element stress recovery and error estimation

A variational method for obtaining smoothed stresses from a finite element derived nonsmooth stress field is presented. The method is based on minimizing a functional involving discrete least-squares error plus a penalty constraint that ensures smoothness of the stress field. An equivalent accuracy criterion is developed for the smoothing analysis which results in a C sup 1-continuous smoothed stress field possessing the same order of accuracy as that found at the superconvergent optimal stress points of the original finite element analysis. Application of the smoothing analysis to residual error estimation is also demonstrated.

Tessler, A.↗

Active Flow Control for Trailing Edge Flap Separation

Active flow control (AFC) in the form of sweeping jet (SWJ) excitation and discrete steady jet excitation is used to control the flow separation on an NACA 0015 semispan wing with a deflected, simple-hinged, trailing edge flap. This geometry has been the focus of several recent publications that investigated methods to improve the efficiency of sweeping jet actuators. In the current study, the interaction of the AFC excitation with the separated flowfields present at several flap deflection angles was examined. Previous studies with this model have been limited to a maximum flap deflection angle of 40°. The flap deflection range was extended to 60! because systems studies have indicated that a high-lift system with simple-hinged flaps may require larger flap deflections than the Fowler flaps found on most high-lift systems. The results obtained at flap deflection angles of 20°, 40°, and 60° are presented and compared. Force and moment data, Particle Image Velocimetry (PIV) data, and steady and unsteady surface pressure data are used to describe the flowfield with and without AFC. With a flap deflection of 60°, increasing the SWJ actuator momentum at the flap shoulder increased lift due to an increase in circulation but did not completely eliminate the recirculation region above the flap surface. AFC using the discrete steady jet actuators of this study increased lift as well but required more mass flow than the SWJ actuators and had a detrimental effect on lift at the highest mass flow level tested. PIV results showed that the angle between the excitation and the flap surface was not optimal for attaching the separated shear layer.

Melton, LaTunia Pack↗

Achieving Breakthroughs in Global Hydrologic Science by Unlocking the Power of Multisensor, Multidisciplinary Earth Observations

Over the last half century, remote sensing has transformed hydrologic science. Whereas early efforts were devoted to observation of discrete variables, we now consider spaceborne missions dedicated to interlinked global hydrologic processes.Furthermore, cloud computing and computational techniquesare accelerating analyses of these data. How will the hydrologic community use these new resources to better understand the world’s water and relatedchallenges facing society? In this Commentary, we suggest that optimizing the benefits of remote sensing for advancing hydrologic research will happen byintegratingmultidisciplinary and multisensor data, leveraging commercial satellite measurements, and employingdata assimilation, cloud computing, and machine learning.We provide several recommendations to these ends. Plain Language Summary Observations from satellites have transformed hydrologic science. Early efforts, five decades ago, mapped attributes like snow cover, rainfall, topography, and vegetation, but now we consider new missions specifically designed to study global hydrologic processes. We also take advantageof new technologies like cloud computing and artificial intelligence. We describe strategiesfor maximizing the benefits of remote sensing for hydrology, encouraging research across disciplines using multiple sensors, using new commercially available satellites, and combining remote sensing measurements with hydrologic models.

Michael Durand↗

SU-C-BRC-03: Development of a Novel Strategy for On-Demand Monte Carlo and Deterministic Dose Calculation Treatment Planning and Optimization for External Beam Photon and Particle Therapy

Purpose: Accurate and fast dose calculation is a prerequisite of precision radiation therapy in modern photon and particle therapy. While Monte Carlo (MC) dose calculation provides high dosimetric accuracy, the drastically increased computational time hinders its routine use. Deterministic dose calculation methods are fast, but problematic in the presence of tissue density inhomogeneity. We leverage the useful features of deterministic methods and MC to develop a hybrid dose calculation platform with autonomous utilization of MC and deterministic calculation depending on the local geometry, for optimal accuracy and speed. Methods: Our platform utilizes a Geant4 based “localized Monte Carlo” (LMC) method that isolates MC dose calculations only to volumes that have potential for dosimetric inaccuracy. In our approach, additional structures are created encompassing heterogeneous volumes. Deterministic methods calculate dose and energy fluence up to the volume surfaces, where the energy fluence distribution is sampled into discrete histories and transported using MC. Histories exiting the volume are converted back into energy fluence, and transported deterministically. By matching boundary conditions at both interfaces, deterministic dose calculation account for dose perturbations “downstream” of localized heterogeneities. Hybrid dose calculation was performed for water and anthropomorphic phantoms. Results: We achieved <1% agreement between deterministic and MC calculations in the water benchmark for photon and proton beams, and dose differences of 2%–15% could be observed in heterogeneous phantoms. The saving in computational time (a factor ∼4–7 compared to a full Monte Carlo dose calculation) was found to be approximately proportional to the volume of the heterogeneous region. Conclusion: Our hybrid dose calculation approach takes advantage of the computational efficiency of deterministic method and accuracy of MC, providing a practical tool for high performance dose calculation in modern RT. The approach is generalizable to all modalities where heterogeneities play a large role, notably particle therapy.

60 APPLIED LIFE SCIENCES↗

Error estimates to smooth solutions of semi-discrete discontinuous Galerkin methods with quadrature rules for scalar conservation laws

Here, we focus on error estimates to smooth solutions of semi-discrete discontinuous Galerkin (DG) methods with quadrature rules for scalar conservation laws. The main techniques we use are energy estimate and Taylor expansion first introduced by Zhang and Shu in (Zhang and Shu, SIAM J Num Anal 42 (2004), 641–666). We show that, with p K (piecewise polynomials of degree k) finite elements in 1D problems, if the quadrature over elements is exact for polynomials of degree (2k) error estimates of O(h k+1/2 ) are obtained for general monotone fluxes, and optimal estimates of O(h k+1 ) are obtained for upwind fluxes. For multidimensional problems, if in addition quadrature over edges is exact for polynomials of degree (2k+1), error estimates of O(h k ) are obtained for general monotone fluxes, and O(h k+1/2 ) are obtained for monotone and sufficiently smooth numerical fluxes. Numerical results validate our analysis.

97 MATHEMATICS AND COMPUTING↗

Search on a hypercubic lattice using a quantum random walk. I. d>2

Random walks describe diffusion processes, where movement at every time step is restricted to only the neighboring locations. We construct a quantum random walk algorithm, based on discretization of the Dirac evolution operator inspired by staggered lattice fermions. We use it to investigate the spatial search problem, that is, to find a marked vertex on a d-dimensional hypercubic lattice. The restriction on movement hardly matters for d>2, and scaling behavior close to Grover's optimal algorithm (which has no restriction on movement) can be achieved. Using numerical simulations, we optimize the proportionality constants of the scaling behavior, and demonstrate the approach to that for Grover's algorithm (equivalent to the mean-field theory or the d{yields}{infinity} limit). In particular, the scaling behavior for d=3 is only about 25% higher than the optimal d{yields}{infinity} value.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient First-Order Algorithms for Large-Scale, Non-Smooth Maximum Entropy Models with Application to Wildfire Science

Maximum entropy (MaxEnt) models are a class of statistical models that use the maximum entropy principle to estimate probability distributions from data. Due to the size of modern data sets, MaxEnt models need efficient optimization algorithms to scale well for big data applications. State-of-the-art algorithms for MaxEnt models, however, were not originally designed to handle big data sets; these algorithms either rely on technical devices that may yield unreliable numerical results, scale poorly, or require smoothness assumptions that many practical MaxEnt models lack. In this paper, we present novel optimization algorithms that overcome the shortcomings of state-of-the-art algorithms for training large-scale, non-smooth MaxEnt models. Our proposed first-order algorithms leverage the Kullback–Leibler divergence to train large-scale and non-smooth MaxEnt models efficiently. For MaxEnt models with discrete probability distribution of n elements built from samples, each containing m features, the stepsize parameter estimation and iterations in our algorithms scale on the order of O(mn) operations and can be trivially parallelized. Moreover, the strong ℓ1 convexity of the Kullback–Leibler divergence allows for larger stepsize parameters, thereby speeding up the convergence rate of our algorithms. To illustrate the efficiency of our novel algorithms, we consider the problem of estimating probabilities of fire occurrences as a function of ecological features in the Western US MTBS-Interagency wildfire data set. Our numerical results show that our algorithms outperform the state of the art by one order of magnitude and yield results that agree with physical models of wildfire occurrence and previous statistical analyses of wildfire drivers.

Physics↗

Efficient Cache use for Stencil Operations on Structured Discretization Grids

We derive tight bounds on the cache misses for evaluation of explicit stencil operators on structured grids. Our lower bound is based on the isoperimetrical property of the discrete octahedron. Our upper bound is based on a good surface to volume ratio of a parallelepiped spanned by a reduced basis of the interference lattice of a grid. Measurements show that our algorithm typically reduces the number of cache misses by a factor of three, relative to a compiler optimized code. We show that stencil calculations on grids whose interference lattice have a short vector feature abnormally high numbers of cache misses. We call such grids unfavorable and suggest to avoid these in computations by appropriate padding. By direct measurements on a MIPS R10000 processor we show a good correlation between abnormally high numbers of cache misses and unfavorable three-dimensional grids.

Frumkin, Michael↗