Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Convex 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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Minimal norm constrained interpolation

In computational fluid dynamics and in CAD/CAM, a physical boundary is usually known only discreetly and most often must be approximated. An acceptable approximation preserves the salient features of the data such as convexity and concavity. In this dissertation, a smooth interpolant which is locally concave where the data are concave and is locally convex where the data are convex is described. The interpolant is found by posing and solving a minimization problem whose solution is a piecewise cubic polynomial. The problem is solved indirectly by using the Peano Kernal theorem to recast it into an equivalent minimization problem having the second derivative of the interpolant as the solution. This approach leads to the solution of a nonlinear system of equations. It is shown that Newton's method is an exceptionally attractive and efficient method for solving the nonlinear system of equations. Examples of shape-preserving interpolants, as well as convergence results obtained by using Newton's method are also shown. A FORTRAN program to compute these interpolants is listed. The problem of computing the interpolant of minimal norm from a convex cone in a normal dual space is also discussed. An extension of de Boor's work on minimal norm unconstrained interpolation is presented.

Irvine, L. D.↗
NASA NTRS1988

A methodology for the synthesis of robust feedback systems

A new methodology is developed for the synthesis of linear, time-variant (LTI) controllers for multivariable LTI systems. The resulting closed-loop system is nominally stable and exhibits a known level of performance. In addition, robustness of the feedback system is guaranteed, i.e., stability and performance are retained in the presence of multiple unstructured uncertainty blocks located at various points in the feedback loop. The design technique is referred to as the Causality Recovery Methodology (CRM). The CRM relies on the Youla parameterization of all stabilizing compensators to ensure nominal stability of the feedback system. A frequency-domain inequality in terms of the structured singular value mu defines the robustness specification. The optimal compensator, with respect to the mu condition, is shown to be noncausal in general. The aim of the CRM is to find a stable, causal transfer function matrix that approximates the robustness characteristics of the optimal solution. The CRM, via a series of infinite-dimensional convex programs, produces a closed-loop system whose performance robustness is at least as good as that of any initial design. The algorithm is approximated by a finite dimensional process for the purposes of implementation. Two numerical examples confirm the potential viability of the CRM concept; however, the robustness improvement comes at the expense of increased computational burden and compensator complexity.

Milich, David Albert↗
DOE OSTI2022

Well-Balanced Second-Order Convex Limiting Technique for Solving the Serre–Green–Naghdi Equations

In this article, we introduce a numerical method for approximating the dispersive Serre–Green–Naghdi equations with topography using continuous finite elements. The method is an extension of the hyperbolic relaxation technique introduced in Guermond et al. (J Comput Phys 450:110809, 2022). It is explicit, second-order accurate in space, third-order accurate in time, and is invariant-domain preserving. It is also well balanced and parameter free. Special attention is given to the convex limiting technique when physical source terms are added in the equations. The method is verified with academic benchmarks and validated by comparison with laboratory experimental data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Convex Data-Driven Approach for Nonlinear Control Synthesis

We consider a class of nonlinear control synthesis problems where the underlying mathematical models are not explicitly known. We propose a data-driven approach to stabilize the systems when only sample trajectories of the dynamics are accessible. Our method is built on the density-function-based stability certificate that is the dual to the Lyapunov function for dynamic systems. Unlike Lyapunov-based methods, density functions lead to a convex formulation for a joint search of the control strategy and the stability certificate. This type of convex problem can be solved efficiently using the machinery of the sum of squares (SOS). For the data-driven part, we exploit the fact that the duality results in the stability theory can be understood through the lens of Perron–Frobenius and Koopman operators. This allows us to use data-driven methods to approximate these operators and combine them with the SOS techniques to establish a convex formulation of control synthesis. The efficacy of the proposed approach is demonstrated through several examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Multi-plane moment-of-fluid interface reconstruction in 3D

Moment-of-fluid (MOF) methods for interface reconstruction approximate the region occupied by material in each mesh element only through reference to its geometric moments. Here, we present a 3D MOF method that represents the material (POM) in each cell as the convex intersection of the cell and multiple half-spaces, each selected to minimize the least-squares error between computed moments of the approximated material and provided reference moments. This optimization problem is highly non-linear and non-convex, making the numerical result very sensitive to the initial guess. To create an effective initial guess in each cell, we construct an ellipsoid from 0th–2nd order reference moments such that its shape corresponds with that of the POM. Within this ellipsoid we inscribe a polyhedron, and initialize the minimization problem with the half-spaces defined by each of its faces. The inscribed polyhedron has minimally 4 faces, and using up to 3rd order moments permits optimization over up to 20 unknown values. We therefore define MOF methods that utilize 4, 5, or 6 half-spaces, correspondingly initialized with the faces of a single inscribed tetrahedron, triangular prism, or hexahedron. Stability of the non-linear optimization is further improved with a prepossessing step that normalizes the reference moments according to the axes of the reference ellipsoid. Using this approach, the non-linear least-squares solver reliably converges to a near-global minimum from a single initial guess. We demonstrate accuracy and robustness using single-cell and multi-cell examples over a wide spectrum of geometry. In particular, we demonstrate our ability to exactly reproduce several important and complex features defined by up to four half-spaces, such as corners, filaments, filament tips, and embedded material in the cell.

3D interface reconstruction↗
DOE OSTI2022

Cyber-Resilient Frequency Control of Power Grids with Energy Storage Systems

The integration of synchronous generators and energy storage systems operated through communication networks introduces new challenges and vulnerabilities to the electric grid, where cyber attacks can corrupt sensor measurements or control inputs and interrupt functions such as frequency regulation. This paper proposes a defense methodology for the design of resilient operating constraints imposed on each generation and storage unit in order to prevent any attack sequence from driving the system's frequency to unsafe conditions. The resilient operating constraints are found by using ellipsoidal approximations of the reachable set of the power system, leading to a convex optimization problem with linear matrix inequalities. Numerical results in a single-area power system with synchronous generation and energy storage demonstrate how the resilient constraints provide security guarantees against any type of attack affecting frequency measurements or controller setpoints.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1981

Weighted-mean scheme for solving incompressible viscous flow

The problem of how a boundary layer responds to the motion of a convexed vortex on a porous wall was investigated. The wall velocity is approximately given by Darcy's law. The vorticity-stream function approach was adopted for solving Navier-Stokes equations of two dimensional incompressible viscous flows. The weighted-mean scheme was used for constructing finite difference approximations of spatial derivatives. Several test problems were solved and numerical results demonstrate clearly the accuracy, stability, and efficiency of the scheme. The weighted mean scheme then can be applied to the vortical flow problem.

Huynh, Q. Q.↗
NASA NTRS1988

Analysis of the EM scattering from arbitrary open-ended waveguide cavities using axial Gaussian Beam tracking

The electromagnetic (EM) scattering from a planar termination located inside relatively arbitrarily shaped open-ended waveguide cavities with smoothly curved interior walls is analyzed using a Gaussian Beam (GB) expansion of the incident plane wave fields in the open end. The cavities under consideration may contain perfectly-conducting interior walls with or without a thin layer of material coating, or the walls may be characterized by an impedance boundary condition. In the present approach, the GB's are tracked only to the termination of the waveguide cavity via beam reflections from interior waveguide cavity walls. The Gaussian beams are tracked approximately only along their beam axes; this approximation which remains valid for relatively well focussed beams assumes that an incident GB gives rise to a reflected GB with parameters related to the incident beam and the radius of curvature of the wall. It is found that this approximation breaks down for GB's which come close to grazing a convex surface and when the width of the incident beam is comparable to the radius of curvature of the surface. The expansion of the fields at the open end depend on the incidence angle only through the expansion coefficients, so the GB's need to be tracked through the waveguide cavity only once for a wide range of incidence angles. At the termination, the sum of all the GB's are integrated using a result developed from a generalized reciprocity principle, to give the fields scattered from the interior of the cavity. The rim edge at the open end of the cavity is assumed to be sharp and the external scattering from the rim is added separately using Geometrical Theory of Diffraction. The results based on the present approach are compared with solutions based on the hybrid asymptotic modal method. The agreement is found to be very good for cavities made up of planar surfaces, and also for cavities with curved surfaces which are not too long with respect to their width.

Burkholder, R. J.↗
DOE OSTI2023

Reducing Conservativeness of Polytopic Linear-Parameter-Varying Robust Vehicle Sideslip Angle Observer Through Minimum-Area Convex Quadrilateral Design

The polytopic linear-parameter-varying (LPV) method has become increasingly popular for designing intelligent control and estimation systems for ground vehicles, particularly for the vehicle sideslip angle observer. In vehicle lateral dynamics, the vehicle longitudinal velocity-induced nonlinearities are conventionally outer-approximated with polytopes such as rectangles or triangles to obtain a polytopic LPV system. Yet, such polytopic approximations tend to be conservative and may lead to inadequate observer performance. To address this issue, a minimum-area convex quadrilateral construction is proposed in this paper to reduce design conservatism. The suggested design is demonstrated through the synthesis of an LPV H ∞ robust vehicle sideslip angle observer. Furthermore, a dSPACE-ASM simulation study is conducted to demonstrate the effectiveness and the advantage of the proposed polytopic construction over a baseline approach.

Zhou, Xingyu↗
DOE OSTI2022

Nonconvex regularization for sparse neural networks

Convex ℓ 1 regularization using an infinite dictionary of neurons has been suggested for constructing neural networks with desired approximation guarantees, but can be affected by an arbitrary amount of over-parametrization. This can lead to a loss of sparsity and result in networks with too many active neurons for the given data, in particular if the number of data samples is large. As a remedy, in this paper, a nonconvex regularization method is investigated in the context of shallow ReLU networks: We prove that in contrast to the convex approach, any resulting (locally optimal) network is finite even in the presence of infinite data (i.e., if the data distribution is known and the limiting case of infinite samples is considered). Moreover, here we show that approximation guarantees and existing bounds on the network size for finite data are maintained.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Robust second-order approximation of the compressible Euler equations with an arbitrary equation of state

Here, this paper is concerned with the approximation of the compressible Euler equations supplemented with an arbitrary or tabulated equation of state. The proposed approximation technique is robust, formally second-order accurate in space, invariant-domain preserving, and works for every equation of state, tabulated or analytic, provided the pressure is nonnegative. An entropy surrogate functional that grows across shocks is proposed. The numerical method is verified with novel analytical solutions and then validated with several computational benchmarks seen in the literature including problems with composite waves.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗
NASA NTRS1981

An algorithm for the rapid location of an extreme of a function subject only to geometric restrictions

The requirements of symmetry and convexity in the application of algorithms for the minimization or maximization of a function are discussed. It is argued that if a function of a single variable is convex and symmetric in a neighborhood of an extremum, the extremum may be approximated to the precision that increases by at least a power of two per functional evaluation. The procedure may be used to drive a complex optimization procedure in the multivariate area estimation problem encountered in remote sensing.

Terrell, G. R.↗
DOE OSTI2024

Adaptive Power Flow Approximations With Second-Order Sensitivity Insights

The power flow equations are fundamental to power system planning, analysis, and control. However, the inherent non-linearity and non-convexity of these equations present formidable obstacles in problem-solving processes. To mitigate these challenges, recent research has proposed adaptive power flow linearizations that aim to achieve accuracy over wide operating ranges. The accuracy of these approximations inherently depends on the curvature of the power flow equations within these ranges, which necessitates considering second-order sensitivities. In this paper, we leverage second-order sensitivities to both analyze and improve power flow approximations. We evaluate the curvature across broad operational ranges and subsequently utilize this information to inform the computation of various sample-based power flow approximation techniques. Additionally, we leverage second-order sensitivities to guide the development of rational approximations that yield linear constraints in optimization problems. In conclusion, this approach is extended to enhance accuracy beyond the limitations of linear functions across varied operational scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Relaxed Multibang Regularization for the Combinatorial Integral Approximation

Multibang regularization and combinatorial integral approximation decompositions are two actively researched techniques for integer optimal control. In this work, we consider a class of polyhedral functions that arise particularly as convex lower envelopes of multibang regularizers and show that they have beneficial properties with respect to regularization of relaxations of integer optimal control problems. We extend the algorithmic framework of the combinatorial integral approximation such that a subsequence of the computed discrete-valued controls converges to the infimum of the regularized integer control problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Tunable noninteracting free-energy density functionals for high-energy-density physics applications

In this work, we introduce the concept of a tunable noninteracting free-energy density functional and present two examples realized: (i) via a simple one-parameter convex combination of two existing functionals and (ii) via the construction of a generalized gradient approximation (GGA) enhancement factor that contains one free parameter and is designed to satisfy a set of incorporated constraints. Functional (i), constructed as a combination of the local Thomas–Fermi and a pseudopotential-adapted GGA for the noninteracting free-energy, has already demonstrated its practical usability for establishing the high temperature end of the equation of state of deuterium [Phys. Rev. B 104, 144104 (2021)] and CHON resin [Phys. Rev. E 106, 045207 (2022)] for inertial confinement fusion applications. Hugoniot calculations for liquid deuterium are given as another example of how the application of computationally efficient orbital-free density functional theory (OF-DFT) can be utilized with the employment of the developed functionals. Once the functionals have been tuned such that the OF-DFT Hugoniot calculation matches the Kohn–Sham solution at some low-temperature point, agreement with the reference Kohn–Sham results for the rest of the high temperature Hugoniot path is very good with relative errors for compression and pressure on the order of 2% or less.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗