SEARCH · Search NASA

Results for “Optimal sizing method”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 559 records · Page 31

All sources NASA NTRS DOE OSTI

DOE OSTI2026

Data Summarization and Inference at Scale

This is the final report for the DOE ASCR grant SC-0022260, Data Summarization and Inference at Scale, PI: Alex Pothen, Purdue University. The goal of the project was to solve data-intensive and compute-intensive problems in the physical sciences, engineering, information science, data science, etc. by designing and implementing new algorithms that could work with a subset of the data. The four subgoals were: (a) The solution of problems where the data is too large to be stored in the memory of a computer. In this streaming model of computation, the data arrives as a stream of elements to the computer, each element is processed as it arrives, and a decision is made to discard the data or to store it; only a small subset of the data proportional to the size of the output solution is stored, and when all the data has been streamed, a solution to the problem is computed from the stored subset. (b) The use of machine learning methods to compute solutions to data-intensive problems. The use of GPUs is critical to obtain high performance on machine learning tasks, but their memory sizes are smaller relative to that of CPUs. For large-scale problems, the data is sampled many times, and small samples are used with repetition, for robustness, to compute solutions to inference tasks. This sampling reduces the memory required to solve the problem, but attention is needed to avoid slow convergence to the solutions, and reduced accuracy of inference. We propose submodular optimization, Large Language Models, and physics-informed neural networks to enable GPU computations here. (c) Modeling and visualization of high-dimensional data using interpretable features. Clinical proteomic data sets from immunology for the detection of cancer and other diseases are temporal and high-dimensional, and algorithms for visualizing these data sets using clinically interpretable features are lacking. We propose methods that compute distances based on the optimal transportation problem and graph edit distances to address this problem. We also propose the use of optimal transport-based distances, spatial statistics, and network structure to classify image data sets, We apply these algorithms to electron micrographs of the peripheral nervous system in the digestive tract. (d) The design of data-intensive algorithms on emerging architectures, specifically, noisy, intermediate-scale quantum (NISQ) devices. Quantum computers offer the possibility of exploring large solution spaces due to the principle of superposition, but current quantum computers are limited by few qubits, short coherence times due to noise, poor interconections among the qubits, etc. We propose the use of the divide and conquer paradigm to solve large-scale problems, wherein collections of small subproblems are solved on the quantum devices, and the solutions to the subproblems are integrated into a solution for the original problem on a classical computer.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

An in-depth field validation of “DUSST”: A novel low-maintenance soiling measurement device

This study presents indoor and field validation results for two versions of the “DUSST” optical soiling sensor, intended to be a low-cost and low-maintenance device for measuring photovoltaic soiling losses. Indoor testing covers irradiance calibration and temperature dependencies, which are necessary to achieve high accuracy, low uncertainty field measurements. Field testing includes an array of different environments including Saudi Arabia, California, Utah, and Colorado. DUSST versions include a configuration with a 530-nm light emitting diode (LED) (discussed in previous work) and a unit with seven white LEDs and a polycarbonate collimating optic. The new design increases light intensity fivefold and demonstrates a single linear calibration coefficient is effective to measure soiling losses as high as 75%. Field data from Utah and California demonstrate that daily soiling loss measurements and soiling rate calculations closely match both reference cell and full-size module measurements of soiling losses and soiling rates. Corrective methods employed on the Utah DUSST sensor suggest that it is possible to achieve measurement errors as low as ±0.1% at two standard deviations. Field data from both Colorado and Saudi Arabia demonstrate that LED lens soiling can occur and that further design optimizations are needed. The lesson learned from all the field deployment locations suggests directions for future design improvements.

14 SOLAR ENERGY↗

DOE OSTI2020

Achieving high volumetric EDLC carbons via hydrothermal carbonization and cyclic activation

A novel activation method involving hydrothermal carbonization (HTC) and a pressure-induced low temperature oxidation has been demonstrated for cellulose derived HTC char by using hydrogen peroxide as an active di-oxygen source. The optimized porosity versus gravimetric capacitance results from cellulose derived HTC char synthesized at 220 °C. Almost homogeneous and small particle size micro-ellipse/sphere, relatively high surface area and narrow pore size distributions lead to a high bulk density, i.e. 0.73 g cm -3 , of coating type electrodes, which is much denser than those manufactured from steam activated carbons for supercapacitor industry, i.e., 0.52 g cm -3 . The resulting carbon prepared herein achieves a relatively high volumetric capacitance in an organic electrolyte-based supercapacitor reaching a competitive value of industrial system with the features of environment friendly, cost-effective as well as high yield, and less energy consumption.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2021

Optimal dimensionality selection for independent component analysis of transcriptomic data

Independent component analysis is an unsupervised machine learning algorithm that separates a set of mixed signals into a set of statistically independent source signals. Applied to high-quality gene expression datasets, independent component analysis effectively reveals both the source signals of the transcriptome as co-regulated gene sets, and the activity levels of the underlying regulators across diverse experimental conditions. Two major variables that affect the final gene sets are the diversity of the expression profiles contained in the underlying data, and the user-defined number of independent components, or dimensionality, to compute. Availability of high-quality transcriptomic datasets has grown exponentially as high-throughput technologies have advanced; however, optimal dimensionality selection remains an open question. We computed independent components across a range of dimensionalities for four gene expression datasets with varying dimensions (both in terms of number of genes and number of samples). We computed the correlation between independent components across different dimensionalities to understand how the overall structure evolves as the number of user-defined components increases. We then measured how well the resulting gene clusters reflected known regulatory mechanisms, and developed a set of metrics to assess the accuracy of the decomposition at a given dimension. We found that over-decomposition results in many independent components dominated by a single gene, whereas under-decomposition results in independent components that poorly capture the known regulatory structure. From these results, we developed a new method, called OptICA, for finding the optimal dimensionality that controls for both over- and under-decomposition. Specifically, OptICA selects the highest dimension that produces a low number of components that are dominated by a single gene. We show that OptICA outperforms two previously proposed methods for selecting the number of independent components across four transcriptomic databases of varying sizes. OptICA avoids both over-decomposition and under-decomposition of transcriptomic datasets resulting in the best representation of the organism’s underlying transcriptional regulatory network.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS1975

A random search algorithm for laboratory computers

The small laboratory computer is ideal for experimental control and data acquisition. Postexperimental data processing is often performed on large computers because of the availability of sophisticated programs, but costs and data compatibility are negative factors. Parameter optimization can be accomplished on the small computer, offering ease of programming, data compatibility, and low cost. A previously proposed random-search algorithm ('random creep') was found to be very slow in convergence. A method is proposed (the 'random leap' algorithm) which starts in a global search mode and automatically adjusts step size to speed convergence. A FORTRAN executive program for the random-leap algorithm is presented which calls a user-supplied function subroutine. An example of a function subroutine is given which calculates maximum-likelihood estimates of receiver operating-characteristic parameters from binary response data. Other applications in parameter estimation, generalized least squares, and matrix inversion are discussed.

Curry, R. E.↗

NASA NTRS1999

New Approaches to HSCT Multidisciplinary Design and Optimization

New approaches to MDO have been developed and demonstrated during this project on a particularly challenging aeronautics problem- HSCT Aeroelastic Wing Design. To tackle this problem required the integration of resources and collaboration from three Georgia Tech laboratories: ASDL, SDL, and PPRL, along with close coordination and participation from industry. Its success can also be contributed to the close interaction and involvement of fellows from the NASA Multidisciplinary Analysis and Optimization (MAO) program, which was going on in parallel, and provided additional resources to work the very complex, multidisciplinary problem, along with the methods being developed. The development of the Integrated Design Engineering Simulator (IDES) and its initial demonstration is a necessary first step in transitioning the methods and tools developed to larger industrial sized problems of interest. It also provides a framework for the implementation and demonstration of the methodology. Attachment: Appendix A - List of publications. Appendix B - Year 1 report. Appendix C - Year 2 report. Appendix D - Year 3 report. Appendix E - accompanying CDROM.

Schrage, Daniel P.↗

NASA NTRS2000

Adjoint Techniques for Topology Optimization of Structures Under Damage Conditions

The objective of this cooperative agreement was to seek computationally efficient ways to optimize aerospace structures subject to damage tolerance criteria. Optimization was to involve sizing as well as topology optimization. The work was done in collaboration with Steve Scotti, Chauncey Wu and Joanne Walsh at the NASA Langley Research Center. Computation of constraint sensitivity is normally the most time-consuming step of an optimization procedure. The cooperative work first focused on this issue and implemented the adjoint method of sensitivity computation (Haftka and Gurdal, 1992) in an optimization code (runstream) written in Engineering Analysis Language (EAL). The method was implemented both for bar and plate elements including buckling sensitivity for the latter. Lumping of constraints was investigated as a means to reduce the computational cost. Adjoint sensitivity computation was developed and implemented for lumped stress and buckling constraints. Cost of the direct method and the adjoint method was compared for various structures with and without lumping. The results were reported in two papers (Akgun et al., 1998a and 1999). It is desirable to optimize topology of an aerospace structure subject to a large number of damage scenarios so that a damage tolerant structure is obtained. Including damage scenarios in the design procedure is critical in order to avoid large mass penalties at later stages (Haftka et al., 1983). A common method for topology optimization is that of compliance minimization (Bendsoe, 1995) which has not been used for damage tolerant design. In the present work, topology optimization is treated as a conventional problem aiming to minimize the weight subject to stress constraints. Multiple damage configurations (scenarios) are considered. Each configuration has its own structural stiffness matrix and, normally, requires factoring of the matrix and solution of the system of equations. Damage that is expected to be tolerated is local and represents a small change in the stiffness matrix compared to the baseline (undamaged) structure. The exact solution to a slightly modified set of equations can be obtained from the baseline solution economically without actually solving the modified system.. Shennan-Morrison-Woodbury (SMW) formulas are matrix update formulas that allow this (Akgun et al., 1998b). SMW formulas were therefore used here to compute adjoint displacements for sensitivity computation and structural displacements in damaged configurations.

Akgun, Mehmet A.↗

NASA NTRS1999

Optimization of Aerospace Structure Subject to Damage Tolerance Criteria

The objective of this cooperative agreement was to seek computationally efficient ways to optimize aerospace structures subject to damage tolerance criteria. Optimization was to involve sizing as well as topology optimization. The work was done in collaboration with Steve Scotti, Chauncey Wu and Joanne Walsh at the NASA Langley Research Center. Computation of constraint sensitivity is normally the most time-consuming step of an optimization procedure. The cooperative work first focused on this issue and implemented the adjoint method of sensitivity computation in an optimization code (runstream) written in Engineering Analysis Language (EAL). The method was implemented both for bar and plate elements including buckling sensitivity for the latter. Lumping of constraints was investigated as a means to reduce the computational cost. Adjoint sensitivity computation was developed and implemented for lumped stress and buckling constraints. Cost of the direct method and the adjoint method was compared for various structures with and without lumping. The results were reported in two papers. It is desirable to optimize topology of an aerospace structure subject to a large number of damage scenarios so that a damage tolerant structure is obtained. Including damage scenarios in the design procedure is critical in order to avoid large mass penalties at later stages. A common method for topology optimization is that of compliance minimization which has not been used for damage tolerant design. In the present work, topology optimization is treated as a conventional problem aiming to minimize the weight subject to stress constraints. Multiple damage configurations (scenarios) are considered. Each configuration has its own structural stiffness matrix and, normally, requires factoring of the matrix and solution of the system of equations. Damage that is expected to be tolerated is local and represents a small change in the stiffness matrix compared to the baseline (undamaged) structure. The exact solution to a slightly modified set of equations can be obtained from the baseline solution economically without actually solving the modified system. Sherrnan-Morrison-Woodbury (SMW) formulas are matrix update formulas that allow this. SMW formulas were therefore used here to compute adjoint displacements for sensitivity computation and structural displacements in damaged configurations.

Akgun, Mehmet A.↗

NASA NTRSDate not supplied

Computationally Guided Development of Components for High Energy Density Solid-State Lithium-Sulfur Batteries

All electric vertical take-off and landing vehicles (eVTOL) for urban air mobility (UAM) concepts face numerous challenging technical barriers before their introduction into the consumer marketplace. The most challenging of these technical barriers to overcome is developing an energy storage system capable of meeting the rigorous aerospace safety and performance criteria1. The performance metrics for eVTOL craft, such as specific energy, specific power, and safety, exceed those of electric automobiles by a factor of two to four. Current state-of-the-art (SOA) lithium-ion batteries are incapable of meeting the key performance criteria of energy and safety for eVTOL. Therefore, next generation advanced chemistries and designs must be developed to meet required performance metrics for electric aviation2. Beyond lithium-ion chemistries, such as lithium-sulfur, show promise in their high energy, while limitations exist in their power and cyclability due to low electrical conductivity and high intermediate solubility in organic liquid electrolytes. Several strategies to overcome the low electrical conductivity involve the use of selenium as a dopant in the active sulfur material, along with the incorporation of 2-dimensional electron-conducting holey-graphene to improve the composite cathodes electronic conductivity. Furthermore, combining this chemistry with a solid-electrolyte avoids the components’ dissolution issues3. However, the development of composite solid-state cathodes is non-trivial as several components must be intimately mixed so that the active component has sufficient access to both electrons and lithium ions to undergo full electrochemical conversion. Mathematical modeling of battery components can assist experimental design through a robust and rigorous combination of computational modeling techniques covering multiple length scales. The objective is to leverage modern computational materials methods combined with battery multiphysics tools to develop radically advanced compatible cathode and electrolyte materials, build and test solid state lithium-sulfur cells and packs. A NASA-based cross-organizational team of high-powered experts combined integrated computational predictive modeling, fundamental chemistry analysis, advanced material science, and battery cell development to tackle this very challenging, multidisciplinary problem. This presentation will show a multiscale computational modeling approach that has produced a novel particle dynamics method called Solid Electrolyte Sphere Approximation Model (SESAM). SESAM modeling targets the 1-10 µm scale structures and provides electromechanical and grain interactions for predictive design guidelines for the manufacturing of solid-state components. Parameters such as particle size and volume fraction of the constituent materials were modeled and experimentally fabricated to optimize electrochemical performance through improved microstructure design. Experimental feedback was provided through ionic and electronic conductivity assessment and structural analysis of developed materials and cell components.

battery↗

DOE OSTI2025

Autonomous organic synthesis for redox flow batteries via flexible batch Bayesian optimization

Traditional trial-and-error methods for materials discovery are inefficient to meet the urgent demands posed by the rapid progression of climate change. This urgency has driven the increasing interest in integrating robotics and machine learning into materials research to accelerate experimental learning. However, idealized decision-making frameworks to achieve maximum sampling efficiency are not always compatible with high-throughput experimental workflows inside a laboratory. For multi-step chemical processes, differences in hardware capacities can complicate the digital framework by introducing constraints on the maximum number of samples in each step of the experiment, hence causing varying batch sizes in variable selection within the same batch. Therefore, designing flexible sampling algorithms is necessary to accommodate the multi-step synthesis with practical constraints unique to each high-throughput workflow. In this work, we designed and employed three strategies on a high-throughput robotic platform to optimize the sulfonation reaction of redox-active molecules used in flow batteries. Our strategies adapt to the multi-step experimental workflow, where their formulation and heating steps are separate, causing varying batch size requirements. By strategically sampling using clustering and mixed-variable batch Bayesian optimization, we were able to iteratively identify optimal conditions that maximize the yields. Our work presents a flexible approach that allows tailoring the machine learning decision-making to suit the practical constraints in individual high-throughput experimental platforms, followed by performing resource-efficient yield optimization using available open-source Python libraries.

Tamura, Clara [Univ. of Washington, Seattle, WA (U↗

DOE OSTI2022

Optimal operation and sizing of pumped thermal energy storage for net benefits maximization

Abstract Current trends in the modern grid are leading to the development and deployment of energy storage to help integrate increasing variable renewable energy sources into the grid. This paper studies a pumped thermal energy storage (PTES) system for multiple grid services including energy arbitrage, frequency regulation, spinning and non‐spinning reserve, and resource adequacy. Optimal dispatch methods are proposed for individual services as well as value stacking from multiple services to maximize the economic benefits. Assessment results demonstrate the superiority of value stacking. Specifically, the study shows the maximum revenue from an individual grid service with a 30‐MWh PTES system was $522,520, while the value stacking could increase the benefits to $678,477. In addition, sensitivity analyses were conducted to explore the cost‐effectiveness of a PTES system with different combinations of power transfer limits and energy capacity. It was found that the power transfer limit had a greater impact than the energy capacity on the benefits. The proposed method could help determine the optimal duration of a future PTES system.

25 ENERGY STORAGE↗

DOE OSTI2019

Digital memcomputing: From logic to dynamics to topology

Digital memcomputing machines (DMMs) are a class of computational machines designed to solve combinatorial optimization problems. A practical realization of DMMs can be accomplished via electrical circuits of highly non-linear, point-dissipative dynamical systems engineered so that periodic orbits and chaos can be avoided. A given logic problem is first mapped into this type of dynamical system whose point attractors represent the solutions of the original problem. A DMM then finds the solution via a succession of elementary instantons whose role is to eliminate solitonic configurations of logical inconsistency (“logical defects”) from the circuit. By employing a supersymmetric theory of dynamics, a DMM can be described by a cohomological field theory that allows for computation of certain topological matrix elements on instantons that have the mathematical meaning of intersection numbers on instantons. We discuss the “dynamical” meaning of these matrix elements, and argue that the number of elementary instantons needed to reach the solution cannot exceed the number of state variables of DMMs, which in turn can only grow at most polynomially with the size of the problem. These results shed further light on the relation between logic, dynamics and topology in digital memcomputing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

Optimized attenuated interaction: Enabling stochastic Bethe–Salpeter spectra for large systems

We develop an improved stochastic formalism for the Bethe–Salpeter equation (BSE), based on an exact separation of the effective-interaction W into two parts, W = (W – vW) + vW, where the latter is formally any translationally invariant interaction, vW(r – r'). When optimizing the fit of the exchange kernel vW to W, using a stochastic sampling W, the difference W – vW becomes quite small. Then, in the main BSE routine, this small difference is stochastically sampled. Furthermore, the number of stochastic samples needed for an accurate spectrum is then largely independent of system size. While the method is formally cubic in scaling, the scaling prefactor is small due to the constant number of stochastic orbitals needed for sampling W.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2020

Variations of the physical parameters of the blazar Mrk 421 based on analysis of the spectral energy distributions

Abstract We report on the variations of the physical parameters of the jet observed in the blazar Mrk 421, and discuss the origin of X-ray flares in the jet, based on analysis of several spectral energy distributions (SEDs). The SEDs are modeled using the one-zone synchrotron self-Compton model, its parameters determined using a Markov chain Monte Carlo method. The lack of data at TeV energies means many of the parameters cannot be uniquely determined and are correlated. These are studied in detail. We find that the optimal solution can be uniquely determined only when we apply a constraint to one of four parameters: the magnetic field (B), the Doppler factor, the size of the emitting region, and the normalization factor of the electron energy distribution. We used 31 sets of SEDs from 2009 to 2014 with optical–UV data observed with UVOT/Swift and the Kanata telescope, X-ray data with XRT/Swift, and γ-ray data with the Fermi Large Area Telescope. The result of our SED analysis suggests that, in the X-ray faint state, the emission occurs in a relatively small area (∼1016 cm) with a relatively strong magnetic field (B ∼ 10−1 G). The X-ray bright state shows a tendency opposite to that of the faint state, that is, a large emitting area (∼1018 cm), probably downstream of the jet, and a weak magnetic field (B ∼ 10−3 G). The high X-ray flux was due to an increase in the maximum energy of electrons. On the other hand, the presence of two kinds of emitting areas implies that the one-zone model is unsuitable for reproducing at least part of the observed SEDs.

Yamada, Yurika↗

DOE OSTI2020

Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems

Security-constrained unit commitment (SCUC) is a fundamental problem in power systems and electricity markets. In practical settings, SCUC is repeatedly solved via mixed-integer linear programming (MIP), sometimes multiple times per day, with only minor changes in input data. In this work, we propose a number of machine learning techniques to effectively extract information from previously solved instances in order to significantly improve the computational performance of MIP solvers when solving similar instances in the future. Based on statistical data, we predict redundant constraints in the formulation, good initial feasible solutions, and affine subspaces where the optimal solution is likely to lie, leading to a significant reduction in problem size. Computational results on a diverse set of realistic and large-scale instances show that using the proposed techniques, SCUC can be solved on average 4.3 times faster with optimality guarantees and 10.2 times faster without optimality guarantees, with no observed reduction in solution quality. Out-of-distribution experiments provide evidence that the method is somewhat robust against data-set shift. Summary of Contribution. The paper describes a novel computational method, based on a combination of mixed-integer linear programming (MILP) and machine learning (ML), to solve a challenging and fundamental optimization problem in the energy sector. The method advances the state-of-the-art, not only for this particular problem, but also, more generally, in solving discrete optimization problems via ML. We expect that the techniques presented can be readily used by practitioners in the energy sector and adapted, by researchers in other fields, to other challenging operations research problems that are solved routinely.

Machine Learning↗

DOE OSTI2022

Predicting Switchgrass Biomass Yields Using a Spectral Vegetation Index Derived from Multispectral Satellite Imagery

Successful scaling of perennial bioenergy crop production requires a landscape design that optimizes the benefits of finite lands for people, communities, and environments. Utilizing marginal areas is the key to sustainable bioenergy crop production (Ssegane et al., 2015, 2016). Marginal areas are often small-sized lands and unevenly distributed across the agricultural landscape (Ssegane et al., 2016); thus, a systematic, semi-automated remote sensing method is needed as an effective means of estimating bioenergy crop yields across landscapes. Argonne National Laboratory (Argonne) is currently developing a tool, Scaling Up Perennial Bioenergy Economics and Ecosystem Services Tool (SUPERBEEST), to identify marginal agricultural lands and quantify environmental and economic effects of perennial bioenergy crop production systems. The tool aims to provide users a path to foster the sustainable and productive integration of bioenergy crops in the Midwestern agricultural landscape. Reliable, cost-effective, and timely estimation of bioenergy crop yields using remote sensing would help calculate and track the success of integrated bioenergy crops in the landscape for those communities. Argonne previously conducted feasibility studies for estimating biomass yields for bioenergy feedstock, corn and perennial grass using spectral vegetation indices (SVIs)1 derived from optical imagery (Hamada et al., 2015, 2021). In both studies, SVIs, more specifically those sensitive to plant chlorophyll or nitrogen contents, showed potential for estimating or predicting biomass yields with a correlation of determination (R2) ranging from 0.54 to 0.96, indicating a value for further investigation as a viable means of quantifying bioenergy feedstock production across large landscapes. Thus, the goal of this study is to evaluate the feasibility of use of SVIs as a means of estimating or predicting switchgrass biomass yields at harvest using publicly available multispectral satellite imagery. The feasibility analysis was performed using four study areas of mature switchgrass located in Virginia. Objectives are to (1) examine the SVIs and establish their relationships with switchgrass biomass yields at harvest, (2) develop a parsimonious image processing model for predicting at-harvest yields by applying the relationships with the most promising spectral index and (3) map switchgrass yields predicted by the image processing model across the study sites. The calibration to field data will rely on switchgrass biomass yields determined by the baling method, representing a potential challenge to the analysis but an important practical aspect for future applications. With this research design, the study aimed to gain insights into enabling remote sensing-based estimation of bioenergy crop yields in a reliable, cost- effective, and timely manner across large, heterogeneous landscapes.

09 BIOMASS FUELS↗

NASA NTRS2002

Very Large Scale Optimization

The purpose of this research under the NASA Small Business Innovative Research program was to develop algorithms and associated software to solve very large nonlinear, constrained optimization tasks. Key issues included efficiency, reliability, memory, and gradient calculation requirements. This report describes the general optimization problem, ten candidate methods, and detailed evaluations of four candidates. The algorithm chosen for final development is a modern recreation of a 1960s external penalty function method that uses very limited computer memory and computational time. Although of lower efficiency, the new method can solve problems orders of magnitude larger than current methods. The resulting BIGDOT software has been demonstrated on problems with 50,000 variables and about 50,000 active constraints. For unconstrained optimization, it has solved a problem in excess of 135,000 variables. The method includes a technique for solving discrete variable problems that finds a "good" design, although a theoretical optimum cannot be guaranteed. It is very scalable in that the number of function and gradient evaluations does not change significantly with increased problem size. Test cases are provided to demonstrate the efficiency and reliability of the methods and software.

Vanderplaats, Garrett↗

NASA NTRS1994

A parametric sensitivity study for single-stage-to-orbit hypersonic vehicles using trajectory optimization

The class of hypersonic vehicle configurations with single stage-to-orbit (SSTO) capability reflect highly integrated airframe and propulsion systems. These designs are also known to exhibit a large degree of interaction between the airframe and engine dynamics. Consequently, even simplified hypersonic models are characterized by tightly coupled nonlinear equations of motion. In addition, hypersonic SSTO vehicles present a major system design challenge; the vehicle's overall mission performance is a function of its subsystem efficiencies including structural, aerodynamic, propulsive, and operational. Further, all subsystem efficiencies are interrelated, hence, independent optimization of the subsystems is not likely to lead to an optimum design. Thus, it is desired to know the effect of various subsystem efficiencies on overall mission performance. For the purposes of this analysis, mission performance will be measured in terms of the payload weight inserted into orbit. In this report, a trajectory optimization problem is formulated for a generic hypersonic lifting body for a specified orbit-injection mission. A solution method is outlined, and results are detailed for the generic vehicle, referred to as the baseline model. After evaluating the performance of the baseline model, a sensitivity study is presented to determine the effect of various subsystem efficiencies on mission performance. This consists of performing a parametric analysis of the basic design parameters, generating a matrix of configurations, and determining the mission performance of each configuration. Also, the performance loss due to constraining the total head load experienced by the vehicle is evaluated. The key results from this analysis include the formulation of the sizing problem for this vehicle class using trajectory optimization, characteristics of the optimal trajectories, and the subsystem design sensitivities.

Lovell, T. Alan↗