Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Convex functions”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

CPU timing routines for a CONVEX C220 computer system

The timing routines available on the CONVEX C220 computer system in the Structural Mechanics Division (SMD) at NASA Langley Research Center are examined. The function of the timing routines, the use of the timing routines in sequential, parallel, and vector code, and the interpretation of the results from the timing routines with respect to the CONVEX model of computing are described. The timing routines available on the SMD CONVEX fall into two groups. The first group includes standard timing routines generally available with UNIX 4.3 BSD operating systems, while the second group includes routines unique to the SMD CONVEX. The standard timing routines described in this report are /bin/csh time,/bin/time, etime, and ctime. The routines unique to the SMD CONVEX are getinfo, second, cputime, toc, and a parallel profiling package made up of palprof, palinit, and palsum.

Bynum, Mary Ann↗
DOE OSTI2020

Convex Relaxation of Grid-Connected Energy Storage System Models With Complementarity Constraints in DC OPF

Including complementarity constraints in energy storage system (ESS) models in optimization problems ensure an optimal solution will not produce a physically unrealizable control strategy where there is simultaneous charging and discharging. However, the current approaches to impose complementarity constraints require the use of non-convex optimization methods. Here, we propose a convex relaxation for a common ESS model that has terms for both charging and discharging based on a penalty reformulation for use in a model predictive control (MPC) based optimal power flow (DC OPF) problem. In this approach, the complementarity constraints are omitted and a penalty term is added to the optimization objective function. For the DC OPF problem, we provide analysis for the conditions under which the convex relaxation of the complementarity constraint ensures that a solution with simultaneous ESS charging and discharging operation is suboptimal. Simulation results demonstrating ESS behavior with and without the penalty reformulation are provided for an MPC-based DC OPF problem on multiple IEEE test systems.

25 ENERGY STORAGE↗
NASA NTRS1977

Variational energy principle for compressible, baroclinic flow. 1: First and second variations of total kinetic action

The case of a cold gas in the absence of external force fields is considered. Since the only energy involved is kinetic energy, the total kinetic action (i.e., the space-time integral of the kinetic energy density) should serve as the total free-energy functional in this case, and as such should be a local minimum for all possible fluctuations about stable flow. This conjecture is tested by calculating explicit, manifestly covariant expressions for the first and second variations of the total kinetic action in the context of Lagrangian kinematics. The general question of the correlation between physical stability and the convexity of any action integral that can be interpreted as the total free-energy functional of the flow is discussed and illustrated for the cases of rectillinear and rotating shearing flows.

Schmid, L. A.↗
NASA NTRS1985

First derivatives of flow quantities behind two-dimensional, nonuniform supersonic flow over a convex corner

A method of determining spatial derivatives of flow quantities behind an expansion fan as a function of the curvature of the streamline behind the fan is developed. Taylor series expansions of flow quantities within the fan are used and boundary conditions satisfied to the first and second order so that the curvature of the characteristics in the fan may be determined. A system of linear equations for the spatial derivatives is then developed. An application of the method to shock coalescence including asymmetric effects is described.

Darden, C. M.↗
DOE OSTI2026

A variational framework for residual-based adaptivity in neural PDE solvers and operator learning

Residual-based adaptive strategies are widely used in scientific machine learning yet remain largely heuristic. We introduce a variational framework that formalizes these methods through convex transformations of the residual, where different transformations correspond to distinct objective functionals. For instance, exponential weights target uniform error minimization, while linear weights recover quadratic error minimization. This perspective reveals adaptive weighting as a means of selecting sampling distributions that optimize a primal objective, directly linking discretization choices to error metrics. This principled approach yields three key benefits: it enables systematic design of adaptive schemes, reduces discretization error by lowering estimator variance, and enhances learning dynamics by improving gradient signal-to-noise ratio. Extending the framework to operator learning, we demonstrate substantial performance gains across diverse optimizers and architectures. Our results provide a theoretical perspective for residual-based adaptivity and establish a foundation for principled discretization and training.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

First and second order convex approximation strategies in structural optimization

In this paper, various methods based on convex approximation schemes are discussed that have demonstrated strong potential for efficient solution of structural optimization problems. First, the convex linearization method (Conlin) is briefly described, as well as one of its recent generalizations, the method of moving asymptotes (MMA). Both Conlin and MMA can be interpreted as first-order convex approximation methods that attempt to estimate the curvature of the problem functions on the basis of semiempirical rules. Attention is next directed toward methods that use diagonal second derivatives in order to provide a sound basis for building up high-quality explicit approximations of the behavior constraints. In particular, it is shown how second-order information can be effectively used without demanding a prohibitive computational cost. Various first-order and second-order approaches are compared by applying them to simple problems that have a closed form solution.

Fleury, C.↗
DOE OSTI2020

Novel Technique for Developing Linearized Convex System Models from Experimentally Derived Data

This paper presents a novel technique for generating a convex system model from an experimentally derived data set which features variance among repeated measurements. The convex system model developed as a test case characterizes the dynamic system losses of a vanadium redox flow battery as a function of the active power output and the battery state of charge. The technique hinges on a pre-cleaning via clustering procedure which precedes the formation of a planar convex hull comprised of triangular simplices. The clustering procedure efficiently reduces the experimental data set while mitigating variance among repeated measurements and removes outliers. Ultimately, the lower evelope of the planar convex hull serves as the desired convex system model. The proposed technique reduces systematic model error which is otherwise present when directly developing a planar convex hull model based on an unreduced data set.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Convex Programs for Minimal-Area Problems

The minimal-area problem that defines string diagrams in closed string field theory asks for the metric of least area on a Riemann surface with the condition that all non-contractible closed curves have length at least 2π. This is an extremal length problem in conformal geometry as well as a problem in systolic geometry. Here, we consider the analogous minimal-area problem for homology classes of curves and, with the aid of calibrations and the max flow-min cut theorem, formulate it as a local convex program. We derive an equivalent dual program involving maximization of a concave functional. These two programs give new insights into the form of the minimal-area metric and are amenable to numerical solution. We explain how the homology problem can be modified to provide the solution to the original homotopy problem.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1976

Some existence and sufficient conditions of optimality

The role of the existence and sufficiency conditions in the field of optimal control was briefly described. The existence theorems are discussed for general nonlinear systems. However, the sufficiency conditions pertain to "nearly" linear systems with integral convex costs. Moreover, a brief discussion of linear systems with multiple-cost functions is presented.

Assefi, T.↗
NASA NTRS1979

Satellite drag coefficients calculated from measured distributions of reflected helium atoms

The primary objectives of this study were to obtain the necessary data and develop a calculation procedure that would facilitate predicting the atmospheric-helium contribution to the drag of a satellite having a predominantly convex exterior. Molecular-beam techniques were used to measure, for several incidence angles, the spatial and energy distributions of 7000 m/s helium atoms scattered from a 6061-T6 aluminum plate and an anodized 1235-0 aluminum surface. From these measured distributions, tangential and normal momentum accommodation coefficients were calculated as functions of incidence angle. Using these calculated accommodation coefficients, one can predict drag coefficients for satellites having predominantly convex exteriors. For spherical satellites, drag coefficients of 2.64 and 2.62 were predicted for the subject surfaces.

Liu, S.-M.↗
NASA NTRS1976

Structural optimization via a design space hierarchy

Mathematical programming techniques provide a general approach to automated structural design. An iterative method is proposed in which design is treated as a hierarchy of subproblems, one being locally constrained and the other being locally unconstrained. It is assumed that the design space is locally convex in the case of good initial designs and that the objective and constraint functions are continuous, with continuous first derivatives. A general design algorithm is outlined for finding a move direction which will decrease the value of the objective function while maintaining a feasible design. The case of one-dimensional search in a two-variable design space is discussed. Possible applications are discussed. A major feature of the proposed algorithm is its application to problems which are inherently ill-conditioned, such as design of structures for optimum geometry.

Vanderplaats, G. N.↗
NASA NTRS1990

Global optimization methods for engineering design

The problem is to find a global minimum for the Problem P. Necessary and sufficient conditions are available for local optimality. However, global solution can be assured only under the assumption of convexity of the problem. If the constraint set S is compact and the cost function is continuous on it, existence of a global minimum is guaranteed. However, in view of the fact that no global optimality conditions are available, a global solution can be found only by an exhaustive search to satisfy Inequality. The exhaustive search can be organized in such a way that the entire design space need not be searched for the solution. This way the computational burden is reduced somewhat. It is concluded that zooming algorithm for global optimizations appears to be a good alternative to stochastic methods. More testing is needed; a general, robust, and efficient local minimizer is required. IDESIGN was used in all numerical calculations which is based on a sequential quadratic programming algorithm, and since feasible set keeps on shrinking, a good algorithm to find an initial feasible point is required. Such algorithms need to be developed and evaluated.

Arora, Jasbir S.↗
NASA NTRS1993

Transition operators in electromagnetic-wave diffraction theory. II - Applications to optics

The theory developed by Hahne (1992) for the diffraction of time-harmonic electromagnetic waves from fixed obstacles is briefly summarized and extended. Applications of the theory are considered which comprise, first, a spherical harmonic expansion of the so-called radiation impedance operator in the theory, for a spherical surface, and second, a reconsideration of familiar short-wavelength approximation from the new standpoint, including a derivation of the so-called physical optics method on the basis of quasi-planar approximation to the radiation impedance operator, augmented by the method of stationary phase. The latter includes a rederivation of the geometrical optics approximation for the complete Green's function for the electromagnetic field in the presence of a smooth- and a convex-surfaced perfectly electrically conductive obstacle.

Hahne, G. E.↗
NASA NTRS2003

Icelandic Pseudocraters as Analogs to some Volcanic Cones on Mars

Pseudocraters are rootless vents formed by the interaction of lava flows with surface or near-surface water. This interaction can produce mild explosions and the accumulation of scoria and spatter into small constructs. Pseudocraters in several localities in Iceland were examined in the field and compared to similar appearing features observed on Mars. The Icelandic pseudocrater cones in this study range in size from 6 to 70 m in diameter, have summit craters which range from 2 to 28 m in diameter (many cones lack craters entirely), and have flanks that am either concave- up or convex-up. The size and spacing of Icelandic pseudo-craters might be a function of the availability of water, in which larger, closely spaced features result from efficient lava-water interaction, as suggested by the environments in which the features formed. Possible Martian pseudocrater cones in Amamnis Planitia range in diameter from 30 to 180 m and have craters 12 to 80 m in diameter. A numerical model for volcanic explosions was adapted to study the formation of pseudocraters under terrestrial and Martian conditions. The results suggest that explosions forming Martian cones require significantly less water (calculated masses am less by a factor of 4 to 16) than those forming Icelandic pseudokers, despite their larger sizes, This is attributed to the low gravity and atmospheric pressure in the Mars environment and is consistent with the likely lower abundance of water, which might be present as interstitial ice at shallow depths in the regolith. Locations of potential pseudocraters on Mars at latitudes as low as approximately 8 degrees N, imply the presence of crustal ice stores at the time of their formation.

Greeley, Ronald↗
DOE OSTI2024

Parallel hybrid quantum-classical machine learning for kernelized time-series classification

Supervised time-series classification garners widespread interest because of its applicability throughout a broad application domain including finance, astronomy, biosensors, and many others. Here, in this work, we tackle this problem with hybrid quantum-classical machine learning, deducing pairwise temporal relationships between time-series instances using a timeseries Hamiltonian kernel (TSHK). A TSHK is constructed with a sum of inner products generated by quantum states evolved using a parameterized time evolution operator. This sum is then optimally weighted using techniques derived from multiple kernel learning. Because we treat the kernel weighting step as a differentiable convex optimization problem, our method can be regarded as an end-to-end learnable hybrid quantum-classical-convex neural network, or QCC-net, whose output is a data set-generalized kernel function suitable for use in any kernelized machine learning technique such as the support vector machine (SVM). Using our TSHK as input to a SVM, we classify univariate and multivariate time-series using quantum circuit simulators and demonstrate the efficient parallel deployment of the algorithm to 127-qubit superconducting quantum processors using quantum multi-programming.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1979

Ultimate boundedness stability and controllability of hereditary systems

By generalizing the Liapunov-Yoshizawa techniques, necessary and sufficient conditions are given for uniform boundedness and uniform ultimate boundedness of a rather general class of nonlinear differential equations of neutral type. Among the applications treated by the methods are the Lienard equation of neutral type and hereditary systems of Lurie type. The absolute stability of this later equation is also investigated. A certain existence result of a solution of a neutral functional differential inclusion with two point boundary values is applied to study the exact function space controllability of a nonlinear neutral functional differential control system. A geometric growth condition is used to characterize both the function space and Euclidean controllability of another nonlinear delay system which has a compact and convex control set. This yields conditions under which perturbed nonlinear delay controllable systems are controllable.

Chukwu, E. N.↗