SEARCH · Engineering Papers
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.
Using a geometric growth condition, both the function space and Euclidean controllability of a nonlinear delay system which has a compact and convex control set are characterized. This extends analogous results for ordinary differential systems, and it yields conditions under which perturbed nonlinear delay controllable systems are controllable.
In many applications, physical domains are geometrically complex making it challenging to perform coarse-scale approximation. A defeaturing process is often used to simplify the domain in preparation for approximation and analysis at the coarse scale. In this paper, a methodology is presented for constructing a coarse-scale reproducing basis on geometrically complex domains given an initial fine-scale mesh of the fully featured domain. The initial fine-scale mesh can be of poor quality and extremely refined. The construction of the basis functions begins with a coarse-scale covering of the domain and generation of weighting functions with local support. Manifold geodesics are used to define distances within the local support for general applicability to non-convex domains. Conventional moving least squares is used to construct the coarse-scale reproducing basis. Applications in quasi-interpolation and linear elasticity are presented.
Abstract We explore the geometry behind the modular bootstrap and its image in the space of Taylor coefficients of the torus partition function. In the first part, we identify the geometry as an intersection of planes with the convex hull of moment curves onR + ⊗ℤ, with boundaries characterized by the total positivity of generalized Hankel matrices. We phrase the Hankel constraints as a semi-definite program, which has several advantages, such as the validity of bounds irrespective of spin truncation. We derive bounds on the gap, twist-gap, and the space of Taylor coefficients themselves. We find that if the gap is above$$ {\Delta }_{\textrm{gap}}^{\ast } $$ ∆ gap ∗ , where$$ \frac{c-1}{12}<{\Delta}_{\textrm{gap}}^{\ast }<\frac{c}{12} $$ c − 1 12 < Δ gap ∗ < c 12 , all coefficients become bounded on both sides and kinks develop in the space. In the second part, we propose an analytic method of imposing the integrality condition for the degeneracy number in the spinless bootstrap, which leads to a non-convex geometry. We find that even at very low derivative order this condition rules out regions otherwise allowed by bootstraps at high derivative order.
A computational method and system based on a hybrid of an artificial neural network (NN) and a support vector machine (SVM) (see figure) has been conceived as a means of maximizing or minimizing an objective function, optionally subject to one or more constraints. Such maximization or minimization could be performed, for example, to optimize solve a data-regression or data-classification problem or to optimize a design associated with a response function. A response function can be considered as a subset of a response surface, which is a surface in a vector space of design and performance parameters. A typical example of a design problem that the method and system can be used to solve is that of an airfoil, for which a response function could be the spatial distribution of pressure over the airfoil. In this example, the response surface would describe the pressure distribution as a function of the operating conditions and the geometric parameters of the airfoil. The use of NNs to analyze physical objects in order to optimize their responses under specified physical conditions is well known. NN analysis is suitable for multidimensional interpolation of data that lack structure and enables the representation and optimization of a succession of numerical solutions of increasing complexity or increasing fidelity to the real world. NN analysis is especially useful in helping to satisfy multiple design objectives. Feedforward NNs can be used to make estimates based on nonlinear mathematical models. One difficulty associated with use of a feedforward NN arises from the need for nonlinear optimization to determine connection weights among input, intermediate, and output variables. It can be very expensive to train an NN in cases in which it is necessary to model large amounts of information. Less widely known (in comparison with NNs) are support vector machines (SVMs), which were originally applied in statistical learning theory. In terms that are necessarily oversimplified to fit the scope of this article, an SVM can be characterized as an algorithm that (1) effects a nonlinear mapping of input vectors into a higher-dimensional feature space and (2) involves a dual formulation of governing equations and constraints. One advantageous feature of the SVM approach is that an objective function (which one seeks to minimize to obtain coefficients that define an SVM mathematical model) is convex, so that unlike in the cases of many NN models, any local minimum of an SVM model is also a global minimum.
This paper studies the optimal meter placement problem for distribution system state estimation given limited measurement resources. We formulate the problem as a mixed integer semi-definite programming that minimizes the worst case estimation errors over a set of operating points. To solve the problem, we first relax the problem as a convex optimization problem. Motivated by the lack of scalability of existing solvers, we next leverage the special structure of the cost function and propose an algorithm based on barrier method that solves the problem with significantly better numerical performance. The proposed method has been validated on the IEEE 13-bus, IEEE 123-bus, and IEEE 8,500-bus feeders.
A document describes mathematical derivations and applications of autonomous guidance algorithms for maneuvering spacecraft in the vicinities of small astronomical bodies like comets or asteroids. These algorithms compute fuel- or energy-optimal trajectories for typical maneuvers by solving the associated optimal-control problems with relevant control and state constraints. In the derivations, these problems are converted from their original continuous (infinite-dimensional) forms to finite-dimensional forms through (1) discretization of the time axis and (2) spectral discretization of control inputs via a finite number of Chebyshev basis functions. In these doubly discretized problems, the Chebyshev coefficients are the variables. These problems are, variously, either convex programming problems or programming problems that can be convexified. The resulting discrete problems are convex parameter-optimization problems; this is desirable because one can take advantage of very efficient and robust algorithms that have been developed previously and are well established for solving such problems. These algorithms are fast, do not require initial guesses, and always converge to global optima. Following the derivations, the algorithms are demonstrated by applying them to numerical examples of flyby, descent-to-hover, and ascent-from-hover maneuvers.
An expansion is derived for the solution to the transport equation in two dimensions subject to boundary conditions given for an arbitrary convex region. Questions of high-energy transport are considered along with the properties of the dose response function. The expansion of the solution of the transport equation is presented in terms of a parameter which measures the lateral dispersion of an unidirectional beam. This parameter is usually small and the expansion is expected to converge rapidly. The dominant term in the expansion is related to fluence-to-dose conversion factors in a semiinfinite slab for normal incidence. A convenient parameterization of the conversion factors is provided along with numerical examples.
In this work, we investigate loss landscapes of the variational quantum eigensolver (VQE) by quantifying the number of local minima through empirical analyses. We focus on minimal models in chemistry and physics so that we can do a complete analysis using more computationally expensive tools. We employ Hessian eigenvalue calculations and the nudged elastic band algorithm to characterize these landscapes. Our results expand upon the existing literature by highlighting the optimization challenges faced by VQE. We find that, as the number of parameters in our ansatz increases, the number of basins increases while the corresponding loss function values converge toward the global minimum value. This observation implies that overparameterization may lead to an ``effective convexity'' in VQE loss landscapes, a phenomenon supported by theoretical and numerical work in classical machine learning.
Rigorous uniform geometrical theory of diffraction (UTD) diffraction coefficients are presented for a coated convex cylinder simulated with generalized impedance boundary conditions. In particular, ray solutions are obtained which remain valid in the transition region and reduce uniformly to those in the deep lit and shadow regions. These involve new transition functions in place of the usual Fock-type integrals, characteristics to the impedance cylinder. A uniform asymptotic solution is also presented for observations in the close vicinity of the cylinder. The diffraction coefficients for the convex cylinder are obtained via a generalization of the corresponding ones for the circular cylinder.
Rigorous uniform geometrical theory of diffraction (UGTD) diffraction coefficients are presented for a coated convex cylinder simulated with generalized impedance boundary conditions. In particular, ray solutions are obtained which remain valid in the transition region and reduce uniformly to those in the deep lit and shadow regions. These involve new transition functions in place of the usual Fock-type integrals, characteristic to the impedance cylinder. A uniform asymptotic solution is also presented for observations in the close vicinity of the cylinder. As usual, the diffraction coefficients for the convex cylinder are obtained via a generalization of the corresponding ones for the circular cylinder.
Elastoplasticity models often introduce a scalar-valued yield function to implicitly represent the boundary between elastic and plastic material states. Here this paper introduces a new alternative where the yield envelope is represented by a manifold of which the topology and the geometry are learned from a set of data points in a parametric space (e.g. principal stress space, π-plane). Here, deep geometric learning enables us to reconstruct a highly complex yield envelope by breaking it down into multiple coordinate charts. The global atlas that consists of these coordinate charts in return allows us to represent the yield surface via multiple overlapping patches, each with a specific local parametrization. This setup provides several advantages over the classical implicit function representation approach. For instance, the availability of coordinate charts enables us to introduce an alternative stress integration algorithm where the trial stress may project directly on a local patch and hence circumvent the issues related to non-smoothness and the lack of convexity of yield surfaces. Meanwhile, the local parametric approach also enables us to predict hardening/softening locally in the parametric space, even without complete knowledge of the yield surface. Comparisons between the classical yield function approach on the non-smooth plasticity and anisotropic cam-clay plasticity model are provided to demonstrate the capacity of the models for highly precise yield surface and the feasibility of the implementation of the learned model in the local stress integration algorithm.
Advances in performance and analysis capabilities have accelerated the development of object tracking algorithms for atmospheric research. This has resulted in a growing number of studies using Lagrangian tracking techniques to analyze the evolution of atmospheric phenomena and the underlying processes. However, the increasing complexity and variety of tracking algorithms present a steep learning curve for new users and make it difficult for existing users to compare algorithm performance. We introduce CoCoMET (Community Cloud Model Evaluation Toolkit), an open-source toolkit that addresses these issues. CoCoMET simplifies the process of running multiple tracking algorithms simultaneously and analyzing objects in both model and observational datasets by specifying parameters in a single configuration file. It standardizes input data from different sources into a consistent format and unifies the tracking output across algorithms. CoCoMET enhances the functionality of existing tracking methods by calculating additional properties such as cell growth and dissipation rates, perimeter, surface area, convexity, and irregularity. In addition, CoCoMET includes a novel method for identifying mergers and splits in 2D and 3D tracks and supports the integration of Eulerian/stationary datasets external to the tracking data for process studies. Its potential utility is demonstrated through examples of model intercomparison, model evaluation against observations, and comparisons between tracking algorithms. Designed for open-source environments, CoCoMET will continue to expand with future releases, incorporating more input data types and tracking algorithms.
The system of linear differential equations which indicated the approach of separation and the so-called "boundary-layer thickness" by Gruschwitz is extended in this report to include the case where the friction layer is subject to centrifugal forces. Evaluation of the data yields a strong functional dependence of the momentum change and wall drag on the boundary-layer thickness radius of curvature ratio for the wall. It is further shown that the transition from laminar to turbulent flow occurs at somewhat higher Reynolds Numbers at the convex wall than at the flat plate, due to the stabilizing effect of the centrifugal forces.
Here an efficient and accurate generalization of the removed-sphere method (RSM) to solve the Poisson equation for total charge density in a solid with space-filling convex Voronoi polyhedra (VPs) and any symmetry is presented. The generalized RSM avoids the use of multipoles and VP shape functions for cellular integrals, which have associated ill-convergent large, double-internal L sums in spherical-harmonic expansions, so that fast convergence in single-L sums is reached. Our RSM adopts full Ewald formulation to work for all configurations or when symmetry breaking occurs, such as for atomic displacements or elastic constant calculations. The structure-dependent coefficients A L that define RSM can be calculated once for a fixed structure and speed up the whole self-consistent-field procedure. The accuracy and rapid convergence properties are confirmed using two analytic models, including the Coulomb potential and energy. We then implement the full-potential RSM using the Green's function Korringa-Kohn-Rostoker (KKR) method for real applications and compare the results with other first-principle methods and experimental data, showing that they are equally as accurate.
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.
In this study, we perform a case study on imagery from the Haiti earthquake that evaluates a novel object-based approach for characterizing earthquake induced surface effects of liquefaction against a traditional pixel based change technique. Our technique, which combines object-oriented change detection with discriminant/categorical functions, shows the power of distinguishing earthquake-induced surface effects from changes in buildings using the object properties concavity, convexity, orthogonality and rectangularity. Our results suggest that object-based analysis holds promise in automatically extracting earthquake-induced damages from high-resolution aerial/satellite imagery.
Here, in this paper, we propose and study neural network-based methods for solutions of high-dimensional quadratic porous medium equation (QPME). Three variational formulations of this nonlinear PDE are presented: a strong formulation and two weak formulations. For the strong formulation, the solution is directly parameterized with a neural network and optimized by minimizing the PDE residual. It can be proved that the convergence of the optimization problem guarantees the convergence of the approximate solution in the $L^1$ sense. The weak formulations are derived following (Brenier in Examples of hidden convexity in nonlinear PDEs, 2020) which characterizes the very weak solutions of QPME. Specifically speaking, the solutions are represented with intermediate functions who are parameterized with neural networks and are trained to optimize the weak formulations. Extensive numerical tests are further carried out to investigate the pros and cons of each formulation in low and high dimensions. This is an initial exploration made along the line of solving high-dimensional nonlinear PDEs with neural network-based methods, which we hope can provide some useful experience for future investigations.
High-entropy materials are characterized by their complex compositions, typically comprising five or more elements in near-equiatomic proportions. Applying this concept to metal ions in metal−organic frameworks (MOFs) has paved the way for exploring a new class of high-entropy MOFs. While the compositional strategy of high-entropy materials leverages configurational entropy to aid thermodynamic stability, it also poses significant analytical challenges due to the vast compositional landscape and diverse phases that these materials can adopt. We present a computational study of several complexities associated with selecting potential high-entropy versions of a prototype lanthanidebased MOF. We compute the energetics of metal mixing of these heterometallic MOFs using density functional theory (DFT) and machine learning interatomic potential (MLIP) methods. The use of MLIP methods allows a systematic exploration of the convex hull of thermodynamically stable MOF structures containing up to 5 distinct metals.