Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Nonsmooth”

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 55 records · Page 3

Genetic algorithm-based geometry calibration for dynamic compression x-ray diffraction experiments

An important component of dynamic compression x-ray diffraction (XRD) experiment analysis is geometry calibration: proper data interpretation requires knowledge of the precise detector position and orientation and, if the experiment involves a single-crystal sample, knowledge of the lattice orientation. The determination of these parameters in the arbitrary three-dimensional (3D) scattering geometries often present in dynamic compression facilities is challenging, as the associated optimization problem can be highly nonlinear, nonsmooth, and discontinuous. We present a genetic algorithm-based approach for performing dynamic compression XRD calibrations that overcomes these obstacles. We provide details regarding the image processing, algorithm implementation, and open-source software deployment and demonstrate the capability of the approach to calibrate the detector and crystal parameters in 3D geometries. Notably, we demonstrate the solver’s capacity to find the crystal orientation without a priori rotation constraints.

Brown, Nathan P. [Sandia National Laboratories (SN↗

Giant Graviton Expansion from Bubbling Geometry: Discreteness from Quantized Geometry

The superconformal index of half-BPS states in N = 4 supersymmetric Yang-Mills with gauge group U⁡(N) admits an expansion in terms of giant gravitons, J N (q) = J ∞ ⁡(q)⁢Σ$^{∞}_{m=0}$ q m⁢N ⁢ J^ m ⁡(q), where m is the number of giant gravitons and J ∞ ⁡(q) is the graviton index. The expansion can be viewed as the implementation of trace relations for finite N. We derive this expansion directly in supergravity from the class of half-BPS solutions due to Lin, Lunin, and Maldacena in type IIB supergravity. The moduli space of these configurations can be quantized using covariant quantization methods. We show how this quantization leads to the precise expression for the expansion in terms of giant gravitons. Our proposal provides a derivation of the giant graviton expansion directly in terms of quantized supergravity degrees of freedom, and it recovers discrete data via quantum geometries that are classically nonsmooth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Semiglobal Safety-Filtered Extremum Seeking With Unknown CBFs

We introduce a safe extremum-seeking (Safe ES) algorithm which achieves the minimization of an unknown objective function while ensuring that an unknown, yet measured, control barrier function (CBF) remains above an arbitrarily small negative value for all time. In other words, “practical safety” is maintained during the entire period of convergence to the constrained extremum. Our design is based on quadratic program (QP) CBF style filters for safety, which is applied in an average and estimated sense. Using nonsmooth analysis tools, we guarantee semiglobal practical asymptotic (SPA) stability of the global constrained optimum, practical convergence to the safe set if starting in a condition violating the CBF, and practical safety for all time—semiglobally—if starting in safe set. The safety result of the paper is analogous with modern notions of SPA stability, guaranteeing that, for any small violation of safety, there exist design coefficients which guarantee that such a small violation is not exceeded. The paper outlines a set of sufficient conditions on the barrier and objective functions, and by way of a Lyapunov argument, we demonstrate that nonconvex constrained optimization problems can be solved. We present these results in the setting of a static map and a dynamical system. A simulation example illustrates the results.

97 MATHEMATICS AND COMPUTING↗

Scalable Plug-and-Play ADMM with Convergence Guarantees

Plug-and-play priors (PnP) is a broadly applicable methodology for solving inverse problems by exploiting statistical priors specified as denoisers. Recent work has reported the state-of-the-art performance of PnP algorithms using pre-trained deep neural nets as denoisers in a number of imaging applications. However, current PnP algorithms are impractical in large-scale settings due to their heavy computational and memory requirements. This work addresses this issue by proposing an incremental variant of the widely used PnP-ADMM algorithm, making it scalable to problems involving a large number measurements. Here, we theoretically analyze the convergence of the algorithm under a set of explicit assumptions, extending recent theoretical results in the area. Additionally, we show the effectiveness of our algorithm with nonsmooth data-fidelity terms and deep neural net priors, its fast convergence compared to existing PnP algorithms, and its scalability in terms of speed and memory.

97 MATHEMATICS AND COMPUTING↗

Toward Accelerating Discovery via Physics-Driven and Interactive Multifidelity Bayesian Optimization

Both computational and experimental material discovery bring forth the challenge of exploring multidimensional and often nondifferentiable parameter spaces, such as phase diagrams of Hamiltonians with multiple interactions, composition spaces of combinatorial libraries, processing spaces, and molecular embedding spaces. Often these systems are expensive or time consuming to evaluate a single instance, and hence classical approaches based on exhaustive grid or random search are too data intensive. This resulted in strong interest toward active learning methods such as Bayesian optimization (BO) where the adaptive exploration occurs based on human learning (discovery) objective. However, classical BO is based on a predefined optimization target, and policies balancing exploration and exploitation are purely data driven. In practical settings, the domain expert can pose prior knowledge of the system in the form of partially known physics laws and exploration policies often vary during the experiment. Here, we propose an interactive workflow building on multifidelity BO (MFBO), starting with classical (data-driven) MFBO, then expand to a proposed structured (physics-driven) structured MFBO (sMFBO), and finally extend it to allow human-in-the-loop interactive interactive MFBO (iMFBO) workflows for adaptive and domain expert aligned exploration. These approaches are demonstrated over highly nonsmooth multifidelity simulation data generated from an Ising model, considering spin–spin interaction as parameter space, lattice sizes as fidelity spaces, and the objective as maximizing heat capacity. Detailed analysis and comparison show the impact of physics knowledge injection and real-time human decisions for improved exploration with increased alignment to ground truth. Here, the associated notebooks allow to reproduce the reported analyses and apply them to other systems.

97 MATHEMATICS AND COMPUTING↗

Variance-Reduced Accelerated First-Order Methods: Central Limit Theorems and Confidence Statements

In this paper, we consider a strongly convex stochastic optimization problem and propose three classes of variable sample-size stochastic first-order methods: (i) the standard stochastic gradient descent method, (ii) its accelerated variant, and (iii) the stochastic heavy-ball method. In each scheme, the exact gradients are approximated by averaging across an increasing batch size of sampled gradients. We prove that when the sample size increases at a geometric rate, the generated estimates converge in mean to the optimal solution at an analogous geometric rate for schemes (i)–(iii). Based on this result, we provide central limit statements, whereby it is shown that the rescaled estimation errors converge in distribution to a normal distribution with the associated covariance matrix dependent on the Hessian matrix, the covariance of the gradient noise, and the step length. If the sample size increases at a polynomial rate, we show that the estimation errors decay at a corresponding polynomial rate and establish the associated central limit theorems (CLTs). Under certain conditions, we discuss how both the algorithms and the associated limit theorems may be extended to constrained and nonsmooth regimes. As a result, we provide an avenue to construct confidence regions for the optimal solution based on the established CLTs and test the theoretical findings on a stochastic parameter estimation problem.

Lei, Jinlong↗

A Scalable Mixed-Integer Decomposition Method for Security-Constrained Optimal Power Flow with Complementarity Constraints

This project aimed to develop a scalable algorithm for security-constrained optimal power flow (SCOPF) under contingency scenarios. In particular, the SCOPF problem targeted in the GO Competition is challenging because of the nonconvexity, its nonsmoothness, and the problem size, which increases with the number of contingency events. Complementarity constraints imposed in post-contingency variables are particularly challenging because they lead to a violation of constraint qualifications at any feasible point.

97 MATHEMATICS AND COMPUTING↗

On backscatter from spatially varying surfaces

The theory of radar backscatter from rough (spatially varying) surfaces is discussed. An integral equation developed to describe the radar backscatter from a perfectly conducting surface is applied to nonsmooth surfaces. The results are compared with those obtained by Beckmann as well as those obtained by Wright. Differences between the three solutions are discussed.

Grody, N. C.↗

Production of polydisperse sprays.

A device which produces a spray with a controllable drop size distribution is described. This system is especially well suited for generating nonsmooth (e.g., bimodal) distributions, although smooth distributions can also be produced. Droplets of uniform size result from the rapid growth of an oscillatory disturbance in a free liquid jet. Simultaneous generation of droplets of various diameters by this method produces the polydisperse spray. The range of drop diameters is approximately 300-3000 microns.

Pierce, T. H.↗

A new consistent spatial differencing scheme for the transonic full-potential equation

A new spatial differencing scheme for the transonic full-potential equation in conservative form has been developed. This scheme guarantees zero truncation error on any curvilinear mesh for freestream flows in either two- or three-space dimensions. Solutions obtained with this new differencing scheme, away from freestream regions, exhibit greatly improved accuracy, especially for nonsmooth or singular meshes.

Flores, J.↗

Non-oscillatory spectral Fourier methods for shock wave calculations

A non-oscillatory spectral Fourier method is presented for the solution of hyperbolic partial differential equations. The method is based on adding a nonsmooth function to the trigonometric polynomials which are the usual basis functions for the Fourier method. The high accuracy away from the shock is enhanced by using filters. Numerical results confirm that no oscillations develop in the solution. Also, the accuracy of the spectral solution of the inviscid Burgers equation is shown to be higher than a fixed order.

Cai, Wei↗

Optimization-based design of control systems for flexible structures

The purpose of this presentation is to show that it is possible to use nonsmooth optimization algorithms to design both closed-loop finite dimensional compensators and open-loop optimal controls for flexible structures modeled by partial differential equations. An important feature of our approach is that it does not require modal decomposition and hence is immune to instabilities caused by spillover effects. Furthermore, it can be used to design control systems for structures that are modeled by mixed systems of coupled ordinary and partial differential equations.

Polak, E.↗

Essentially nonoscillatory spectral Fourier methods for shock wave calculations

An essentially nonoscillatory spectral Fourier method for the solution of hyperbolic partial differential equations is presented. The method is based on adding a nonsmooth function to the trigonometric polynomials which are the usual basis functions for the Fourier method. The high accuracy away from the shock is enhanced by using filters. Numerical results confirm that essentially no oscillations develop in the solution.

Cai, Wei↗

Supercomputer optimizations for stochastic optimal control applications

Supercomputer optimizations for a computational method of solving stochastic, multibody, dynamic programming problems are presented. The computational method is valid for a general class of optimal control problems that are nonlinear, multibody dynamical systems, perturbed by general Markov noise in continuous time, i.e., nonsmooth Gaussian as well as jump Poisson random white noise. Optimization techniques for vector multiprocessors or vectorizing supercomputers include advanced data structures, loop restructuring, loop collapsing, blocking, and compiler directives. These advanced computing techniques and superconducting hardware help alleviate Bellman's curse of dimensionality in dynamic programming computations, by permitting the solution of large multibody problems. Possible applications include lumped flight dynamics models for uncertain environments, such as large scale and background random aerospace fluctuations.

Chung, Siu-Leung↗

New displacement-based methods for optimal truss topology design

Two alternate methods for maximum stiffness truss topology design are presented. The ground structure approach is used, and the problem is formulated in terms of displacements and bar areas. This large, nonconvex optimization problem can be solved by a simultaneous analysis and design approach. Alternatively, an equivalent, unconstrained, and convex problem in the displacements only can be formulated, and this problem can be solved by a nonsmooth, steepest descent algorithm. In both methods, the explicit solving of the equilibrium equations and the assembly of the global stiffness matrix are circumvented. A large number of examples have been studied, showing the attractive features of topology design as well as exposing interesting features of optimal topologies.

Bendsoe, Martin P.↗

On the use of distributed sensing in control of large flexible spacecraft

Distributed processing technology is being developed to process signals from distributed sensors using distributed computations. Thiw work presents a scheme for calculating the operators required to emulate a conventional Kalman filter and regulator using such a computer. The scheme makes use of conventional Kalman theory as applied to the control of large flexible structures. The required computation of the distributed operators given the conventional Kalman filter and regulator is explained. A straightforward application of this scheme may lead to nonsmooth operators whose convergence is not apparent. This is illustrated by application to the Mini-Mast, a large flexible truss at the Langley Research Center used for research in structural dynamics and control. Techniques for developing smooth operators are presented. These involve spatial filtering as well as adjusting the design constants in the Kalman theory. Results are presented that illustrate the degree of smoothness achieved.

Montgomery, Raymond C.↗

Active adhesion concepts for in-orbit structural construction

The in-orbit assembly of structural elements is presently addressed by means of a continuum-based theory of active-adhesion contact/impact which assumes the manufacturability of active adhesion elements by piezoelectric (and similarly behaving) materials. Block bonding characteristics can furnish an effective alternative to optimal control-based, impact surge force-mitigation strategies, especially in the numerous nonsmooth control problems that are difficult to synthesize and implement. Attention is given to design concepts employing combined serial/parallel-bonded active adhesion elements composed of cascaded piezoelectric devices.

Park, K. C.↗

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.↗