SEARCH · Search NASA

Results for “optimization, inverse problems”

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 127 records · Page 7

All sources NASA NTRS DOE OSTI

NASA NTRS1997

Efficient Gradient-Based Shape Optimization Methodology Using Inviscid/Viscous CFD

The formerly developed preconditioned-biconjugate-gradient (PBCG) solvers for the analysis and the sensitivity equations had resulted in very large error reductions per iteration; quadratic convergence was achieved whenever the solution entered the domain of attraction to the root. Its memory requirement was also lower as compared to a direct inversion solver. However, this memory requirement was high enough to preclude the realistic, high grid-density design of a practical 3D geometry. This limitation served as the impetus to the first-year activity (March 9, 1995 to March 8, 1996). Therefore, the major activity for this period was the development of the low-memory methodology for the discrete-sensitivity-based shape optimization. This was accomplished by solving all the resulting sets of equations using an alternating-direction-implicit (ADI) approach. The results indicated that shape optimization problems which required large numbers of grid points could be resolved with a gradient-based approach. Therefore, to better utilize the computational resources, it was recommended that a number of coarse grid cases, using the PBCG method, should initially be conducted to better define the optimization problem and the design space, and obtain an improved initial shape. Subsequently, a fine grid shape optimization, which necessitates using the ADI method, should be conducted to accurately obtain the final optimized shape. The other activity during this period was the interaction with the members of the Aerodynamic and Aeroacoustic Methods Branch of Langley Research Center during one stage of their investigation to develop an adjoint-variable sensitivity method using the viscous flow equations. This method had algorithmic similarities to the variational sensitivity methods and the control-theory approach. However, unlike the prior studies, it was considered for the three-dimensional, viscous flow equations. The major accomplishment in the second period of this project (March 9, 1996 to March 8, 1997) was the extension of the shape optimization methodology for the Thin-Layer Navier-Stokes equations. Both the Euler-based and the TLNS-based analyses compared with the analyses obtained using the CFL3D code. The sensitivities, again from both levels of the flow equations, also compared very well with the finite-differenced sensitivities. A fairly large set of shape optimization cases were conducted to study a number of issues previously not well understood. The testbed for these cases was the shaping of an arrow wing in Mach 2.4 flow. All the final shapes, obtained either from a coarse-grid-based or a fine-grid-based optimization, using either a Euler-based or a TLNS-based analysis, were all re-analyzed using a fine-grid, TLNS solution for their function evaluations. This allowed for a more fair comparison of their relative merits. From the aerodynamic performance standpoint, the fine-grid TLNS-based optimization produced the best shape, and the fine-grid Euler-based optimization produced the lowest cruise efficiency.

Baysal, Oktay↗

NASA NTRS1993

Using parallel banded linear system solvers in generalized eigenvalue problems

Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speed-up is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.

Zhang, Hong↗

NASA NTRS2004

On Improving Efficiency of Differential Evolution for Aerodynamic Shape Optimization Applications

Differential Evolution (DE) is a simple and robust evolutionary strategy that has been proven effective in determining the global optimum for several difficult optimization problems. Although DE offers several advantages over traditional optimization approaches, its use in applications such as aerodynamic shape optimization where the objective function evaluations are computationally expensive is limited by the large number of function evaluations often required. In this paper various approaches for improving the efficiency of DE are reviewed and discussed. These approaches are implemented in a DE-based aerodynamic shape optimization method that uses a Navier-Stokes solver for the objective function evaluations. Parallelization techniques on distributed computers are used to reduce turnaround times. Results are presented for the inverse design of a turbine airfoil. The efficiency improvements achieved by the different approaches are evaluated and compared.

Madavan, Nateri K.↗

NASA NTRS2004

Optimal Aerosol Parameterization for Remote Sensing Retrievals

We have developed a new algorithm for the retrieval of aerosol and gases from SAGE It1 solar transmission measurements. This algorithm improves upon the NASA operational algorithm in several key aspects, including solving the problem non-linearly and incorporating a new methodology for separating the contribution of aerosols and gases. In order to extract aerosol information we have built a huge database of aerosol models for both stratospheric and tropospheric aerosols, and polar stratospheric cloud particles. This set of models allows us to calculate a vast range of possible extinction spectra for aerosols. and from these, derive a set of eigenvectors which then provide the basis set used in our inversion algorithm. Our aerosol algorithm and retrievals are described in several articles (listed in References Section) published under this grant. In particular they allow us to analyze the spectral properties of aerosols and PSCs and ultimately derive their microphysical properties. We have found some considerable differences between our spectra and the ones derived from the SAGE III operational algorithm. These are interesting as they provide an independent check on the validity of published aerosol data and, in particular, on their associated uncertainties. In order to understand these differences, we are assembling independent aerosol data from other sources with which to make comparisons. We have carried out extensive comparisons of our ozone retrievals with both SAGE III and independent lidar, ozonesonde, and satellite measurements (Polyakov et al., 2004). These show very good agreement throughout the stratosphere and help to quantify differences which can be attributed to natural variation in ozone versus that produced by algorithmic differences. In the mid - upper stratosphere, agreement with independent data was generally within 5 - 20%. but in the lower stratosphere the differences were considerably larger. We believe that a large proportion of this discrepancy in the lower stratosphere is attributable to natural variation, and is also seen in comparisons between lidar and ozonesonde measurements. NO2 profiles obtained with our algorithm were compared to those obtained through the SAGE III operational algorithm and exhibited differences of 20 - 40%. Our retrieved profiles agree with the HALOE NO2 measurements significantly better than those of the operational retrieval. In other work (described below), we are extending our aerosol retrievals into the infrared regime and plan to perform retrievals from combined uv-visible-infrared spectra. This work will allow us to use the spectra to derive the size and composition of aerosols, and we plan to employ our algorithms in the analysis of PSC spectra. We are presently also developing a limb-scattering algorithm to retrieve aerosol data from limb measurements of solar scattered radiation.

Newchurch, Michael J.↗

NASA NTRS1974

Study of genetic direct search algorithms for function optimization

The results are presented of a study to determine the performance of genetic direct search algorithms in solving function optimization problems arising in the optimal and adaptive control areas. The findings indicate that: (1) genetic algorithms can outperform standard algorithms in multimodal and/or noisy optimization situations, but suffer from lack of gradient exploitation facilities when gradient information can be utilized to guide the search. (2) For large populations, or low dimensional function spaces, mutation is a sufficient operator. However for small populations or high dimensional functions, crossover applied in about equal frequency with mutation is an optimum combination. (3) Complexity, in terms of storage space and running time, is significantly increased when population size is increased or the inversion operator, or the second level adaptation routine is added to the basic structure.

Zeigler, B. P.↗

NASA NTRS1977

Optimal low-thrust takeoff from an orbit about an oblate planet

Future space missions to the outer planets may depend upon the use of low-thrust propulsion systems. As these planets are decidedly oblate, the question of the effect of that oblateness on a low-thrust trajectory is of some interest. In this paper the problem of optimal energy increase is attacked under the assumption that the coefficients for the second zonal harmonic, and the nondimensional thrust acceleration are the same order of magnitude. By means of a two-variable asymptotic expansion technique, a near optimal control program is generated and the first-order uniformly valid approximation for the corresponding trajectory is obtained. Tangential thrust is shown to be a good near-optimal thrust program even in the presence of oblateness effects. The optimal control program is found to be oscillatory and quite similar to the optimal control for energy increase in an inverse square gravitational field.

Jacobson, R. A.↗

NASA NTRS2017

Characterization of a Method for Inverse Heat Conduction Using Real and Simulated Thermocouple Data

It is often impractical to instrument the external surface of high-speed vehicles due to the aerothermodynamic heating. Temperatures can instead be measured internal to the structure using embedded thermocouples, and direct and inverse methods can then be used to estimate temperature and heat flux on the external surface. Two thermocouples embedded at different depths are required to solve direct and inverse problems, and filtering schemes are used to reduce noise in the measured data. Accuracy in the estimated surface temperature and heat flux is dependent on several factors. Factors include the thermocouple location through the thickness of a material, the sensitivity of the surface solution to the error in the specified location of the embedded thermocouples, and the sensitivity to the error in thermocouple data. The effect of these factors on solution accuracy is studied using the methodology discussed in the work of Pizzo, et. al.1 A numerical study is performed to determine if there is an optimal depth at which to embed one thermocouple through the thickness of a material assuming that a second thermocouple is installed on the back face. Solution accuracy will be discussed for a range of embedded thermocouple depths. Moreover, the sensitivity of the surface solution to (a) the error in the specified location of the embedded thermocouple and to (b) the error in the thermocouple data are quantified using numerical simulation, and the results are discussed.

Pizzo, Michelle E.↗

NASA NTRS2021

Multiobjective Multidisciplinary Optimization of Low-Boom Supersonic Transports Using Multifidelity Models

A multidisciplinary optimization (MDO) method has been developed to design a computational fluid dynamics (CFD) based low-boom configuration that can be obtained from a Pareto solution of a low-fidelity multiobjective MDO problem with mission constraints. This paper refines the developed MDO method by using multifidelity models for CFD-based multiobjective MDO and a better method for the system-level trade between the target low boom ground noise level and the overland range. The refined MDO method can generate a low-boom configuration that satisfies the mission requirements, has the lowest takeoff gross weight and the longest range for the low-boom mission, trims the low-boom cruise flight with fuel redistributions, and has a reversed equivalent area distribution closely matching a low-boom target with ground noise level below 70 PLdB. The validity of the refined MDO method is demonstrated by a design study of a low-boom supersonic transport that carries 40 passengers, flies a low-boom mission with cruise Mach of 1.7 and range of 3500 nm, and cruises overwater at Mach 1.8 with range of 3882 nm. Moreover, the refined MDO method eliminates the difference between the assumed cruise weight for CFD-based low-boom inverse design optimization and the estimated cruise weight of the optimal inverse design solution with respect to the mission requirements.

MDO↗

NASA NTRS1982

Optimal two-impulse transfer between specified terminal states of Keplerian orbits

The integrals of motion for an inverse-square force field and a necessary condition for optimality are used in a transfer orbit co-ordinate system to formulate the solution of the optimal two-impulse transfer between fixed position and velocity vectors on Keplerian orbits. In this co-ordinate system, the equations reveal two asymptotes that are useful in analysing the solution. It is shown that there are only two real extremals (both minimums) which are separated by an asymptote. An approximate analytic solution is also obtained by ignoring a quadratic term whose coefficient is approximately zero for a large class of orbit transfer problems.

Jezewski, D. J.↗

NASA NTRS1992

Practical considerations in waverider applications

This paper proposes a practical perspective for waverider shapes with respect to their use in the commercial and military aerospace industry. Also, integration problems that must be considered when deriving these shapes for operational aircraft are discussed and general approaches to solving them are suggested. The inverse design methodology that is used to generate waverider geometries is discussed as a potentially powerful tool for the aerospace industry in the design of practical operational high-speed (Mach 4 to 25) aircraft. Further, it is suggested that unless this methodology proves to be a valuable tool in the near future, it will not likely find a customer in the aerospace industry and may become no more than an interesting academic study in aerodynamic optimization.

Stevens, Daniel R.↗

NASA NTRS2012

Parametric Deformation of Discrete Geometry for Aerodynamic Shape Design

We present a versatile discrete geometry manipulation platform for aerospace vehicle shape optimization. The platform is based on the geometry kernel of an open-source modeling tool called Blender and offers access to four parametric deformation techniques: lattice, cage-based, skeletal, and direct manipulation. Custom deformation methods are implemented as plugins, and the kernel is controlled through a scripting interface. Surface sensitivities are provided to support gradient-based optimization. The platform architecture allows the use of geometry pipelines, where multiple modelers are used in sequence, enabling manipulation difficult or impossible to achieve with a constructive modeler or deformer alone. We implement an intuitive custom deformation method in which a set of surface points serve as the design variables and user-specified constraints are intrinsically satisfied. We test our geometry platform on several design examples using an aerodynamic design framework based on Cartesian grids. We examine inverse airfoil design and shape matching and perform lift-constrained drag minimization on an airfoil with thickness constraints. A transport wing-fuselage integration problem demonstrates the approach in 3D. In a final example, our platform is pipelined with a constructive modeler to parabolically sweep a wingtip while applying a 1-G loading deformation across the wingspan. This work is an important first step towards the larger goal of leveraging the investment of the graphics industry to improve the state-of-the-art in aerospace geometry tools.

Anderson, George R.↗

NASA NTRS2013

Downscaling Satellite Precipitation with Emphasis on Extremes: A Variational 1-Norm Regularization in the Derivative Domain

The increasing availability of precipitation observations from space, e.g., from the Tropical Rainfall Measuring Mission (TRMM) and the forthcoming Global Precipitation Measuring (GPM) Mission, has fueled renewed interest in developing frameworks for downscaling and multi-sensor data fusion that can handle large data sets in computationally efficient ways while optimally reproducing desired properties of the underlying rainfall fields. Of special interest is the reproduction of extreme precipitation intensities and gradients, as these are directly relevant to hazard prediction. In this paper, we present a new formalism for downscaling satellite precipitation observations, which explicitly allows for the preservation of some key geometrical and statistical properties of spatial precipitation. These include sharp intensity gradients (due to high-intensity regions embedded within lower-intensity areas), coherent spatial structures (due to regions of slowly varying rainfall),and thicker-than-Gaussian tails of precipitation gradients and intensities. Specifically, we pose the downscaling problem as a discrete inverse problem and solve it via a regularized variational approach (variational downscaling) where the regularization term is selected to impose the desired smoothness in the solution while allowing for some steep gradients(called 1-norm or total variation regularization). We demonstrate the duality between this geometrically inspired solution and its Bayesian statistical interpretation, which is equivalent to assuming a Laplace prior distribution for the precipitation intensities in the derivative (wavelet) space. When the observation operator is not known, we discuss the effect of its misspecification and explore a previously proposed dictionary-based sparse inverse downscaling methodology to indirectly learn the observation operator from a database of coincidental high- and low-resolution observations. The proposed method and ideas are illustrated in case studies featuring the downscaling of a hurricane precipitation field.

Hurricanes↗

NASA NTRS1992

Inference in infinite-dimensional inverse problems - Discretization and duality

Many techniques for solving inverse problems involve approximating the unknown model, a function, by a finite-dimensional 'discretization' or parametric representation. The uncertainty in the computed solution is sometimes taken to be the uncertainty within the parametrization; this can result in unwarranted confidence. The theory of conjugate duality can overcome the limitations of discretization within the 'strict bounds' formalism, a technique for constructing confidence intervals for functionals of the unknown model incorporating certain types of prior information. The usual computational approach to strict bounds approximates the 'primal' problem in a way that the resulting confidence intervals are at most long enough to have the nominal coverage probability. There is another approach based on 'dual' optimization problems that gives confidence intervals with at least the nominal coverage probability. The pair of intervals derived by the two approaches bracket a correct confidence interval. The theory is illustrated with gravimetric, seismic, geomagnetic, and helioseismic problems and a numerical example in seismology.

Stark, Philip B.↗

NASA NTRS2000

Validation of a "Kane's Dynamics" Model for the Active Rack Isolation System

Many microgravity space-science experiments require vibratory acceleration levels unachievable without active isolation. The Boeing Corporation's Active Rack Isolation System (ARIS) employs a novel combination of magnetic actuation and mechanical linkages, to address these isolation requirements on the International Space Station (ISS). ARIS provides isolation at the rack (international Standard Payload Rack, or ISPR) level. Effective model-based vibration isolation requires (1) an isolation device, (2) an adequate dynamic (i.e., mathematical) model of that isolator, and (3) a suitable, corresponding controller, ARIS provides the ISS response to the first requirement. In November 1999, the authors presented a response to the second ("A 'Kane's Dynamics' model for the Active Rack Isolation System", Hampton and Beech) intended to facilitate an optimal-controls approach to the third. This paper documents the validation of that high-fidelity dynamic model of ARIS. As before, this model contains the full actuator dynamics, however, the umbilical models are not included in this presentation. The validation of this dynamics model was achieved by utilizing two Commercial Off the Shelf (COTS) software tools: Deneb's ENVISION, and Online Dynamics' AUTOLEV. ENVISION is a robotics software package developed for the automotive industry that employs 3-dimensional (3-D) Computer Aided Design (CAD) models to facilitate both forward and inverse kinematics analyses. AUTOLEV is a DOS based interpreter that is designed in general to solve vector based mathematical problems and specifically to solve Dynamics problems using Kane's method.

Beech, Geoffrey S.↗

NASA NTRS1996

Quasi-Optimal Schwarz Methods for the Conforming Spectral Element Discretization

Fast methods are proposed for solving the system K(sub N)x = b resulting from the discretization of self-adjoint elliptic equations in three dimensional domains by the spectral element method. The domain is decomposed into hexahedral elements, and in each of these elements the discretization space is formed by polynomials of degree N in each variable. Gauss-Lobatto-Legendre (GLL) quadrature rules replace the integrals in the Galerkin formulation. This system is solved by the preconditioned conjugate gradients method. The conforming finite element space on the GLL mesh consisting of piecewise Q(sub 1) elements produces a stiffness matrix K(sub h) that is spectrally equivalent to the spectral element stiffness matrix K(sub N). The action of the inverse of K(sub h) is expensive for large problems, and is therefore replaced by a Schwarz preconditioner B(sub h) of this finite element stiffness matrix. The preconditioned operator then becomes B(sub h)(exp -l)K(sub N). The technical difficulties stem from the nonregularity of the mesh. Tools to estimate the convergence of a large class of new iterative substructuring and overlapping Schwarz preconditioners are developed. This technique also provides a new analysis for an iterative substructuring method proposed by Pavarino and Widlund for the spectral element discretization.

Casarin, Mario↗

NASA NTRS2001

Computationally efficient control allocation

A computationally efficient method for calculating near-optimal solutions to the three-objective, linear control allocation problem is disclosed. The control allocation problem is that of distributing the effort of redundant control effectors to achieve some desired set of objectives. The problem is deemed linear if control effectiveness is affine with respect to the individual control effectors. The optimal solution is that which exploits the collective maximum capability of the effectors within their individual physical limits. Computational efficiency is measured by the number of floating-point operations required for solution. The method presented returned optimal solutions in more than 90% of the cases examined; non-optimal solutions returned by the method were typically much less than 1% different from optimal and the errors tended to become smaller than 0.01% as the number of controls was increased. The magnitude of the errors returned by the present method was much smaller than those that resulted from either pseudo inverse or cascaded generalized inverse solutions. The computational complexity of the method presented varied linearly with increasing numbers of controls; the number of required floating point operations increased from 5.5 i, to seven times faster than did the minimum-norm solution (the pseudoinverse), and at about the same rate as did the cascaded generalized inverse solution. The computational requirements of the method presented were much better than that of previously described facet-searching methods which increase in proportion to the square of the number of controls.

Durham, Wayne↗

NASA NTRS2024

Piezoelectric impedance-based high-accuracy damage identification using sparsity conscious multi-objective optimization inverse analysis

Two elements are essential in structural health monitoring utilizing dynamic responses: response measurement with high-frequency contents, i.e., small characteristic wavelengths, that can adequately reflect damage features, and effective inverse identification analysis that is however oftentimes under-determined. The advancement of smart structure integration has led to active interrogation through frequency-sweeping piezoelectric impedance measurement at high frequency range. In this research we develop a multi-objective optimization formulation for the identification of damage location and severity utilizing piezoelectric impedance. While one optimization objective is to match the response measurement with finite element model prediction in the damage parametric space, the other is the number of locations of damage, i.e., the sparsity of damage index as the solution vector, since damage usually occurs within a small number of locations. This multi-objective formulation fits well the under-determined nature of damage identification, as it naturally provides multiple solutions as basis for further elucidation. The challenge remaining is how to find a small solution set that can include the actual damage scenario. Here we develop a novel inverse identification framework utilizing the intelligent swarm optimizer which possesses flexibility for enhancement. We first embed a sparsity enforcement process into the population generation of the optimizer, which yields a solution repository intrinsically possessing sparsity. We then apply reinforcement learning so the agents can adaptively opt for local strategies with the aim of enriching the searching patterns to diversify the solutions. Through the incorporation of a Q-table, searching toward more promising directions will be rewarded. Our case analyses employing experimental data indicate that this sparsity-conscious multi-objective particle swarm optimization technique can lead to a small solution set which generally encompasses the true damage scenario. This effectively solves the structural damage identification problem with piezoelectric impedance measurement.

Yang Zhang↗

NASA NTRS1993

Goddard problem in presence of a dynamic pressure limit

The Goddard problem is that of maximizing the final altitude for a vertically ascending, rocket-powered vehicle under the influence of an inverse square gravitational field and atmospheric drag. The present paper deals with the effects of two additional constraints, namely, a dynamic pressure limit and specified final time. Nine different switching structures involving zero-thrust arcs, full-thrust arcs, singular-thrust arcs, and state-constrained arcs are obtained when the value of the dynamic pressure limit is varied between zero and infinity and the final time is specified between the minimum possible time within which all of the fuel can be burned and the natural final time that emerges for the problem with final time unspecified. For all points in the aforementioned domain of dynamic pressure limit and prescribed final time, the associated optimal switching structure is clearly identified. Finally, a simple intuitive feedback law is presented for the free time problem. For all values of prescribed dynamic pressure limit, this strategy yields a loss in final altitude of less than 3 percent with respect to the associated optimal solution.

Seywald, Hans↗