Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimal start”

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

An indirect method for numerical optimization using the Kreisselmeir-Steinhauser function

A technique is described for converting a constrained optimization problem into an unconstrained problem. The technique transforms one of more objective functions into reduced objective functions, which are analogous to goal constraints used in the goal programming method. These reduced objective functions are appended to the set of constraints and an envelope of the entire function set is computed using the Kreisselmeir-Steinhauser function. This envelope function is then searched for an unconstrained minimum. The technique may be categorized as a SUMT algorithm. Advantages of this approach are the use of unconstrained optimization methods to find a constrained minimum without the draw down factor typical of penalty function methods, and that the technique may be started from the feasible or infeasible design space. In multiobjective applications, the approach has the advantage of locating a compromise minimum design without the need to optimize for each individual objective function separately.

Wrenn, Gregory A.↗
NASA NTRS2010

Cost Optimization and Technology Enablement COTSAT-1

Cost Optimized Test of Spacecraft Avionics and Technologies (COTSAT-1) is an ongoing spacecraft research and development project at NASA Ames Research Center (ARC). The space industry was a hot bed of innovation and development at its birth. Many new technologies were developed for and first demonstrated in space. In the recent past this trend has reversed with most of the new technology funding and research being driven by the private industry. Most of the recent advances in spaceflight hardware have come from the cell phone industry with a lag of about 10 to 15 years from lab demonstration to in space usage. NASA has started a project designed to address this problem. The prototype spacecraft known as Cost Optimized Test of Spacecraft Avionics and Technologies (COTSAT-1) and CheapSat work to reduce these issues. This paper highlights the approach taken by NASA Ames Research center to achieve significant subsystem cost reductions. The COSTAT-1 research system design incorporates use of COTS (Commercial Off The Shelf), MOTS (Modified Off The Shelf), and GOTS (Government Off The Shelf) hardware for a remote sensing spacecraft. The COTSAT-1 team demonstrated building a fully functional spacecraft for $500K parts and $2.0M labor. The COTSAT-1 system, including a selected science payload, is described within this paper. Many of the advancements identified in the process of cost reduction can be attributed to the use of a one-atmosphere pressurized structure to house the spacecraft components. By using COTS hardware, the spacecraft program can utilize investments already made by commercial vendors. This ambitious project development philosophy/cycle has yielded the COTSAT-1 flight hardware. This paper highlights the advancements of the COTSAT-1 spacecraft leading to the delivery of the current flight hardware that is now located at NASA Ames Research Center. This paper also addresses the plans for COTSAT-2.

Spremo, Stevan↗
NASA NTRS2012

Recursive Branching Simulated Annealing Algorithm

This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.

Bolcar, Matthew↗
NASA NTRSDate not supplied

Introducing Tropical Geometric Approaches to Delay Tolerant Networking Optimization

Delay Tolerant Networking (DTN) is the standard approach to the networking of space systems with the goal of supporting the Solar System Internet (SSI). Current space networks have a small scale and often depend on rigorously scheduled (pre-determined) contact opportunities; this manual approach inhibits scalability. The goal of this paper is to recast these scheduling problems in order to apply the optimization machinery of tropical geometry. Contact opportunities in space are dependent on such factors as orbital mechanics and asset availability, which induce time-varying connectivity; indeed, end-to-end connectivity might never occur. Routing optimization within this structure is classically difficult and typically utilizes Dijkstra's algorithm as applied to contact graphs. Alternatively, we follow the successes of tropical geometry in train schedule optimization, job assignments, and even traditional networking, by extending this approach to this more general (i.e. disconnected) problem space. These successes imply tropical geometry provides a useful framework in the context of DTNs, starting with applications to queuing theory and long-haul links. Recently, tropical geometry has been applied to parametric path optimization on graphs with variable edge weights. In this work, we extend these advances to account for the problem of routing in a space network, and find that tropical geometry is well-suited to the challenges offered by this new setting, including contact schedules featuring probabilities. Our approach leverages the combinatorial nature of the problem to give feasible shortest path trees in the presence of variable channel conditions and latency, evolving topologies, and uncertainty inherent in space routing. We discuss our tropical approach to DTN for two Python implementations, a Verilog Tropical ALU implementation, tropical frameworks for other parametric graph problems, and solution stability. Lastly, a program for future work is included to illuminate the path ahead.

Delay Tolerant Networking↗
NASA NTRS2007

Multi-Objective Online Initialization of Spacecraft Formations

This paper extends a previously developed method for finding spacecraft initial conditions (ICs) that minimize the drift resulting from J2 disturbances while also minimizing the fuel required to attain those ICs. It generalizes the single spacecraft optimization to a formation-wide optimization valid for an arbitrary number of vehicles. Additionally, the desired locations of the spacecraft, separate from the starting location, can be specified, either with respect to a reference orbit, or relative to the other spacecraft in the formation. The three objectives (minimize drift, minimize fuel, and maintain a geometric template) are expressed as competing costs in a linear optimization, and are traded against one another through the use of scalar weights. By carefully selecting these weights and re-initializing the formation at regular intervals, a closed-loop, formation-wide control system is created. This control system can be used to reconfigure the formations on the fly, and creates fuel-efficient plans by placing the spacecraft in semi-invariant orbits. The overall approach is demonstrated through nonlinear simulations for two formations a GEO orbit, and an elliptical orbit.

Jeffrey, Matthew↗
DOE OSTI2022

End-to-end optimization for battery materials and molecules by combining graph neural networks and reinforcement learning

The National Renewable Energy Laboratory (NREL), together with the Colorado School of Mines (CSM) and Colorado State University (CSU), has developed a machine learning-enhanced approach to design new battery materials. Currently, such materials are designed in part via numerous expensive high-fidelity computational simulations that predict the performance of a given composition. Even with computational screening tools, the vast landscape of possible molecular or crystal structures exceeds current and future computational capacity. Improving the efficiency by which new materials can be optimized will therefore disrupt the cost, risk, and time required to bring new energy solutions to the marketplace. Predicting the properties of an organic molecule or periodic crystalline material given its structure has grown increasingly common. These approaches leverage large-scale computational and experimental databases and ML approaches such as graph neural networks. The inverse design problem of finding a material that possesses desired properties is substantially more challenging, since enumerating all valid material structures is not feasible. In this project, we leveraged recent success in reinforcement learning to efficiently navigate this high-dimensional search space. Just as algorithms can find the optimal chess moves from nearly limitless options, we train an approach to evolve a simple starting structure into a complex structure that possess the desired properties. Our solution has been demonstrated by applying it to two related design application tasks for short- and long-term energy storage, respectively: (1) the design of solid-state ion conductors and (2) the design of organic redox-active materials. The project has resulted an open-source software library for material design, documented examples of applying the library to both organic and inorganic material optimization, and peer-reviewed publications detailing the data, computational models, and resulting candidate materials.

25 ENERGY STORAGE↗
DOE OSTI2022

End-to-End Optimization for Battery Materials and Molecules by Combining Graph Neural Networks and Reinforcement Learning

The National Renewable Energy Laboratory (NREL), together with the Colorado School of Mines (CSM) and Colorado State University (CSU), has developed a machine learning-enhanced approach to the design of new battery materials. Currently, such materials are designed in part via numerous expensive high-fidelity computational simulations that predict the performance of a given composition. Even with computational screening tools, the vast landscape of possible molecular or crystal structures exceeds current and future computational capacity. Improving the efficiency by which new materials can be optimized will therefore disrupt the cost, risk, and time required to bring new energy solutions to the marketplace. Predicting the properties of an organic molecule or periodic crystalline material given its structure has grown increasingly common. These approaches leverage large-scale computational and experimental databases and ML approaches such as graph neural networks. The inverse design problem of finding a material that possesses desired properties is substantially more challenging, since enumerating all valid material structures is not feasible. In this project, we leveraged recent success in reinforcement learning to efficiently navigate this high-dimensional search space. Just as algorithms can find the optimal chess moves from nearly limitless options, we train an approach to evolve a simple starting structure into a complex structure that possess the desired properties. Our solution has been demonstrated by applying it to two related design application tasks for short- and long-term energy storage, respectively: (1) the design of solid-state ion conductors and (2) the design of organic redox-active materials. The project has resulted an open-source software library for material design, documented examples of applying the library to both organic and inorganic material optimization, and peer-reviewed publications detailing the data, computational models, and resulting candidate materials.

25 ENERGY STORAGE↗
NASA NTRS1981

Optimal transfer between close near-circular orbits

A nonlinear analysis is carried out for the optimal transfer between close near-circular noncoplanar orbits with no limit on time. The degeneracy of the linear analyses of Marec and Edelbaum is, thereby, removed and with the aid of a generalized Jacobi test, it is established that the minimum-impulse transfer requires, at most, three impulses. A field of extremals is generated in an orbit element space starting with the initial state and anticipated adjoint variables and integrating these variables by using the optimal thrust control law that maximizes the variational Hamiltonian. The nonoptimality of any four-impulse strategy is determined numerically by observing the reflection of every extremal from either an envelope (conjugate point test) or a switching surface on or before the application of the fourth impulse. This test is carried out in Regions I, II, and III of Marec, as well as the special transition region of Breakwell near the boundary of Region III.

Kechichian, J.↗
NASA NTRS2008

Development of a Smooth Trajectory Maneuver Method to Accommodate the Ares I Flight Control Constraints

Six degree-of-freedom (DOF) launch vehicle trajectories are designed to follow an optimized 3-DOF reference trajectory. A vehicle has a finite amount of control power that it can allocate to performing maneuvers. Therefore, the 3-DOF trajectory must be designed to refrain from using 100% of the allowable control capability to perform maneuvers, saving control power for handling off-nominal conditions, wind gusts and other perturbations. During the Ares I trajectory analysis, two maneuvers were found to be hard for the control system to implement; a roll maneuver prior to the gravity turn and an angle of attack maneuver immediately after the J-2X engine start-up. It was decided to develop an approach for creating smooth maneuvers in the optimized reference trajectories that accounts for the thrust available from the engines. A feature of this method is that no additional angular velocity in the direction of the maneuver has been added to the vehicle after the maneuver completion. This paper discusses the equations behind these new maneuvers and their implementation into the Ares I trajectory design cycle. Also discussed is a possible extension to adjusting closed-loop guidance.

Pinson, Robin M.↗
DOE OSTI2023

Robust scalable initialization for Bayesian variational inference with multi-modal Laplace approximations

Predictive modeling typically relies on Bayesian model calibration to provide uncertainty quantification. Variational inference utilizing fully independent (“mean-field”) Gaussian distributions are often used as approximate probability density functions. This simplification is attractive since the number of variational parameters grows only linearly with the number of unknown model parameters. However, the resulting diagonal covariance structure and unimodal behavior can be too restrictive to provide useful approximations of intractable Bayesian posteriors that exhibit highly non-Gaussian behavior, including multimodality. High-fidelity surrogate posteriors for these problems can be obtained by considering the family of Gaussian mixtures. Gaussian mixtures are capable of capturing multiple modes and approximating any distribution to an arbitrary degree of accuracy, while maintaining some analytical tractability. Unfortunately, variational inference using Gaussian mixtures with full-covariance structures suffers from a quadratic growth in variational parameters with the number of model parameters. The existence of multiple local minima due to strong nonconvex trends in the loss functions often associated with variational inference present additional complications, These challenges motivate the need for robust initialization procedures to improve the performance and computational scalability of variational inference with mixture models. In this work, we propose a method for constructing an initial Gaussian mixture model approximation that can be used to warm-start the iterative solvers for variational inference. The procedure begins with a global optimization stage in model parameter space. In this step, local gradient-based optimization, globalized through multistart, is used to determine a set of local maxima, which we take to approximate the mixture component centers. Around each mode, a local Gaussian approximation is constructed via the Laplace approximation. Finally, the mixture weights are determined through constrained least squares regression. The robustness and scalability of the proposed methodology is demonstrated through application to an ensemble of synthetic tests using high-dimensional, multimodal probability density functions. Here, the practical aspects of the approach are demonstrated with inversion problems in structural dynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Low-depth Clifford circuits approximately solve MaxCut

We introduce a quantum-inspired approximation algorithm for MaxCut based on low-depth Clifford circuits. We start by showing that the solution unitaries found by the adaptive quantum approximation optimization algorithm (ADAPT-QAOA) for the MaxCut problem on weighted fully connected graphs are (almost) Clifford circuits. Motivated by this observation, we devise an approximation algorithm for MaxCut, ADAPT-Clifford, that searches through the Clifford manifold by combining a minimal set of generating elements of the Clifford group. Our algorithm finds an approximate solution of MaxCut on an N -vertex graph by building a depth O ( N ) Clifford circuit. The algorithm has runtime complexity O ( N 2 ) and O ( N 3 ) for sparse and dense graphs, respectively, and space complexity O ( N 2 ) , with improved solution quality achieved at the expense of more demanding runtimes. We implement ADAPT-Clifford and characterize its performance on graphs with positive and signed weights. The case of signed weights is illustrated with the paradigmatic Sherrington-Kirkpatrick model, for which our algorithm finds solutions with ground-state mean energy density corresponding to ∼ 94 % of the Parisi value in the thermodynamic limit. The case of positive weights is investigated by comparing the cut found by ADAPT-Clifford with the cut found with the Goemans-Williamson (GW) algorithm. For both sparse and dense instances we provide copious evidence that, up to hundreds of nodes, ADAPT-Clifford finds cuts of lower energy than GW. Published by the American Physical Society 2024

Muñoz-Arias, Manuel H. (ORCID:000000025711029X)↗
DOE OSTI2025

Evaluating pulse-shaping capabilities of next-generation pulsed power architectures

This project evaluated the pulse shaping capabilities of next-generation pulsed power (NGPP) architectures. NGPP architectures share several common attributes including multiple independent pulse-generation lines, a radial water-insulated impedance transformer, and a central vacuum insulated load region. A multi-module circuit model was developed, incorporating independent pulse-generation lines and a 2-D transmission line mesh of the radial impedance transformer to assess the effects of azimuthal asymmetry in pulse-shaped experiments. Circuit model simulations demonstrated that NGPP architectures are able to produce the the desired current pulse shapes for exemplar NGPP experiments. Additionally, the project explored automated methods for experiment design, including derivative -ree optimization and machine learning. Pulse-shaped experiments require designers to determine machine parameters that reliably produce the desired current pulse at the load, a process that typically relies on expert knowledge and iterative adjustments using the Z circuit model. Given the increased complexity of NGPP systems, this manual approach may be impractical. While the evaluated methods do not eliminate the need for manual iteration, they can reduce the time required for experiment design. Derivative-free optimization automates much of the trial-and-error process, providing a close starting point for manual adjustments or making small modifications to near-final designs. Meanwhile, deep neural network methods can generate a good qualitative match to the desired current pulse in under one second without requiring circuit model simulations.

42 ENGINEERING↗
NASA NTRS1975

An algorithm for the space shuttle scheduling problem

The problem of determining launch times for a set of missions is considered. Launch times must satisfy early start time and resource constraints. The investigation reported is concerned with the minimization of the number of missions which are launched after specified late start times. An algorithm is presented which, under certain restrictive assumptions, provides an optimal solution. If the restrictive assumptions are not satisfied, the algorithm may be used to obtain a lower bound on the number of missions flown late.

Fisher, M. L.↗
NASA NTRS1991

A shooting approach to suboptimal control

The shooting method is used to solve the suboptimal control problem where the control history is assumed to be piecewise linear. Suboptimal solutions can be obtained without difficulty and can lead to accurate approximate controls and good starting multipliers for the regular shooting method by increasing the number of nodes. Optimal planar launch trajectories are presented for the advanced launch system.

Hull, David G.↗
DOE OSTI2020

Neutrinos from the Galactic Center Hosting a Hypernova Remnant

Similar to star-forming galaxies or starburst galaxies, star-forming regions in our Galaxy can host cosmic-ray (CR) accelerators and rich gas as targets of hadronuclear interaction. By our estimations, the IceCube neutrino observatory might detect muon neutrinos from a CR accelerator associated with a molecular cloud complex in our Galaxy. The associated high-energy gamma-ray emission might be observed by the Cherenkov Telescope Array (CTA), High-Altitude Water Cherenkov Gamma-Ray Observatory (HAWC), and Large High Altitude Air Shower Observatory (LHAASO). Furthermore, taking the Galactic Center (GC) region as an example, we assume that a hypernova exploded in the past in the GC. We simulate the acceleration of CRs in the hypernova remnant (HNR) as well as their confinement and escape. The high-energy protons escape from the HNR, diffuse around the GC, interact with molecular clouds, and then produce gamma-rays and neutrinos. In the optimal cases, the GC would be a promising 100 TeV gamma-ray source for LHAASO’s one-month observation. We propose that neutrino-induced searching for starting track-like and high-energy starting events (HESEs) observed by IceCube, from the GC region with a radius of 1°.8, would help us discover the particle accelerator in the GC or constrain our models. Under the constraint from high-energy gamma-ray observations by the H.E.S.S. telescope, we estimate the exposure time needed to make a significant discovery for the optimal cases. The analysis combining observations of IceCube and ANTARES, starting track-like events and HESEs, future observations by neutrino detectors IceCube-Gen2 and KM3net, and gamma-ray telescopes CTA, HAWC, and LHAASO would help to constrain our models.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Safe Deep Reinforcement Learning for Robust Frequency and Voltage-Constrained Networked Microgrid Restoration

Here, this paper proposes a safe soft actor-critic reinforcement learning (RL) algorithm–based controller for networked microgrid restoration. It formulates the post black-start start as a finite-horizon constrained Markov decision process. The RL agent co-optimizes real and reactive power set-points for both grid-forming and grid-following inverters under explicit voltage and frequency constraints, while enforcing proper power sharing via the Mean Active Power Sharing Index (MPSI) and Mean Reactive Power Sharing Index (MQSI). Numerical results obtained on the IEEE 123-bus distribution system show that the proposed method achieves a mean voltage build-up time of 0.01 s without breaching the 5% sharing-violation budget under various load scenarios, considering MPSI and MQSI indices. These findings demonstrate that the proposed method yields fast and safe black-start schedules without resorting to heuristic penalties.

Selim, Alaa [Dartmouth College, Hanover, NH (Unite↗
DOE OSTI2023

Selective laser melting of oxide dispersion strengthened MA956 alloy and its surface finishing by magnetic field assisted finishing

Selective laser melting (SLM) is a prominent metal additive manufacturing (AM) capable of processing a myriad of engineering materials with high precision and design freedom. However, similar to other AM processes, poor surface finishing has been an omnipresent problem in SLM technology. In this study, magnetic field assisted finishing (MAF) was used to finish SLM fabricated oxide dispersion strengthened (ODS) MA956, an iron-chromium-aluminum alloy. The effect of laser processing parameters on part density and surface roughness was first studied. Using a multi-objective optimization technique, the optimal parameters to obtain the highest density and lowest surface roughness were determined. Finally, MAF was applied to the parts built with the obtained optimal SLM parameters, but without significant improvement on the surfaces of as-printed samples. Hence, the surfaces of as-printed samples were post-processed (ground) to yield better initial surface conditions prior to MAF. The effect of initial roughness, iron particles size, and abrasive size on MAF performance was studied. Initial roughness had the most dominant effect followed by abrasive size. The underlying mechanism behind the dependency on initial roughness on final surface quality was analyzed by studying the change on the surface profiles with different starting initial roughness. The initial roughness required for MAF to be effective was determined. In conclusion, using the optimal processing conditions, MAF was applied to the post-processed samples to attain the final average surface roughness (R a ) as little as 0.36 μm starting from initial average roughness (R a ) of 1.53 μm.

36 MATERIALS SCIENCE↗
NASA NTRS1999

Ames Optimized TCA Configuration

Configuration design at Ames was carried out with the SYN87-SB (single block) Euler code using a 193 x 49 x 65 C-H grid. The Euler solver is coupled to the constrained (NPSOL) and the unconstrained (QNMDIF) optimization packages. Since the single block grid is able to model only wing-body configurations, the nacelle/diverter effects were included in the optimization process by SYN87's option to superimpose the nacelle/diverter interference pressures on the wing. These interference pressures were calculated using the AIRPLANE code. AIRPLANE is an Euler solver that uses a unstructured tetrahedral mesh and is capable of computations about arbitrary complete configurations. In addition, the buoyancy effects of the nacelle/diverters were also included in the design process by imposing the pressure field obtained during the design process onto the triangulated surfaces of the nacelle/diverter mesh generated by AIRPLANE. The interference pressures and nacelle buoyancy effects are added to the final forces after each flow field calculation. Full details of the (recently enhanced) ghost nacelle capability are given in a related talk. The pseudo nacelle corrections were greatly improved during this design cycle. During the Ref H and Cycle 1 design activities, the nacelles were only translated and pitched. In the cycle 2 design effort the nacelles can translate vertically, and pitch to accommodate the changes in the lower surface geometry. The diverter heights (between their leading and trailing edges) were modified during design as the shape of the lower wing changed, with the drag of the diverter changing accordingly. Both adjoint and finite difference gradients were used during optimization. The adjoint-based gradients were found to give good direction in the design space for configurations near the starting point, but as the design approached a minimum, the finite difference gradients were found to be more accurate. Use of finite difference gradients was limited by the CPU time limit available on the Cray machines. A typical optimization run using finite difference gradients can use only 30 to 40 design variables and one optimization iteration within the 8 hour queue limit for the chosen grid size and convergence level. The efficiency afforded by the adjoint method allowed for 50-120 design variables and 5-10 optimization iterations in the 8 hour queue. Geometric perturbations to the wing and fuselage were made using the Hicks/Henne (HH) shape functions. The HH functions were distributed uniformly along the chords of the wing defining sections and lofted linearly. During single-surface design, constraints on thickness and volume at selected wing stations were imposed. Both fuselage camber and cross-sectional area distributions were permitted to change during design. The major disadvantage to the use of these functions is the inherent surface waviness produced by repeated use of such functions. Many smoothing operations were required following optimization runs to produce a configuration with reasonable smoothness. Wagner functions were also used on the wing sections but were never used on the fuselage. The Wagner functions are a family of increasingly oscillatory functions that have also been used extensively in airfoil design. The leading and trailing edge regions of the wing were designed by use of polynomial and monomial functions respectively. Twist was attempted but was abandoned because of little performance improvement available from changing the baseline twist.

Cliff, Susan E.↗