SEARCH · Search NASA
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.
Novel photo-writable and thermally switchable polymeric materials exhibit a refractive index change of .DELTA.n.gtoreq.1.0 when exposed to UV light or heat. For example, lithography can be used to convert a non-conjugated precursor polymer to a conjugated polymer having a higher index-of-refraction. Further, two-photon lithography can be used to pattern high-spatial frequency structures.
The use of computational fluid dynamics (CFD) for the analysis of sonic booms generated by aircraft has been shown to increase the accuracy and reliability of predictions. CFD takes into account important three-dimensional and nonlinear effects that are generally neglected by modified linear theory (MLT) methods. Up to the present time, CFD methods have been primarily used for analysis or prediction. Some investigators have used CFD to impact the design of low boom configurations using trial and error methods. One investigator developed a hybrid design method using a combination of Modified Linear Theory (e.g. F-functions) and CFD to provide equivalent area due to lift driven by a numerical optimizer to redesign or modify an existing configuration to achieve a shaped sonic boom signature. A three-dimensional design methodology has not yet been developed that completely uses nonlinear methods or CFD. Constrained numerical optimization techniques have existed for some time. Many of these methods use gradients to search for the minimum of a specified objective function subject to a variety of design variable bounds, linear and nonlinear constraints. Gradient based design optimization methods require the determination of the objective function gradients with respect to each of the design variables. These optimization methods are efficient and work well if the gradients can be obtained analytically. If analytical gradients are not available, the objective gradients or derivatives with respect to the design variables must be obtained numerically. To obtain numerical gradients, say, for 10 design variables, might require anywhere from 10 to 20 objective function evaluations. Typically, 5-10 global iterations of the optimizer are required to minimize the objective function. In terms of using CFD as a design optimization tool, the numerical evaluation of gradients can require anywhere from 100 to 200 CFD computations per design for only 10 design variables. If one CFD computation requires an hour of computational time on a Cray computer, one can see that the use of constrained numerical optimization quickly becomes impractical.Hence, in order to practically couple a numerical design optimization technique with a CFD method, the CFD method must be extremely efficient with running times on the order of only minutes. The CFD Euler code developed under NASA sponsorship and referred to as MIM3D-SB for the most part fulfills these efficiency requirements. Analysis of wing- body configurations can be computed in a matter of a few minutes. The present study will concentrate on the feasibility of the use of this CFD code in conjunction with a numerical design optimization technique for the sonic boom reduction of candidate HSCT configurations. A preliminary supersonic aircraft design system has been established that utilizes the numerical design optimization code NPSOL developed at Stanford University coupled with the supersonic NUM3D-SB CFD code. Many questions still need to be answered in regard to using CFD and numerical optimizers as design tools. There are difficulties related to both the CFD codes and the numerical optimizers. Numerical optimizers can converge to a local minima rather than a global minima. This behavior is largely a function of the initial guess in the design space. The optimizer also is searching for a minimum of the function in terms of its derivative without any regard to the actual function value. Numerically (i.e. CFD) determined gradients can also generate spurious numerical local minima. In addition, for the sonic boom problem, grid fineness will also determine the accuracy of the final design solution. Design optimization methods work well on problems defined by continuous objective functions. The sonic boom signature design problem is not necessarily defined by a continuous objective function. The signature can have a variety of shapes; i.e. from N-wave to multiple shocks. The far-field or ground signature may not transition continuously from one shape to another and hence, may exhibit discontinuous behavior. This is also a source of difficulty in using design optimization methods.In the following sections, several low boom and one reference aircraft configuration will be analyzed to predict their sonic boom signature characteristics. Modifications to some of these designs will also be presented to demonstrate the feasibility of using CFD as a design tool and to demonstrate the feasibility of designing shaped sonic boom signatures. Design modifications to some configurations will be presented to demonstrate the feasibility of achieving shaped signatures with reduced levels and not necessarily to represent realistic or aerodynamically efficient design modifications. Fuselage volume or camber are used as design variables in order to have a minimal effect on the primary wing aerodynamics. The paper will also seek to demonstrate whether a hybrid or ramped signature is feasible to achieve. For the low-boom configurations, the CFD predicted signatures will be compared qualitatively to their MLT design signatures.
Formal optimization methods and eigenvalue gradient information are used to develop a stabilizing control law for a closed loop linear system that is initially unstable. The method was originally formulated by using direct, constrained optimization methods with the constraints being the real parts of the eigenvalues. However, because of problems in trying to achieve stabilizing control laws, the problem was reformulated to be solved differently. The method described uses the Davidon-Fletcher-Powell minimization technique to solve an indirect, constrained minimization problem in which the performance index is the Kreisselmeier-Steinhauser function of the real parts of all the eigenvalues. The method is applied successfully to solve two different problems: the determination of a fourth-order control law stabilizes a single-input single-output active flutter suppression system and the determination of a second-order control law for a multi-input multi-output lateral-directional flight control system. Various sets of design variables and initial starting points were chosen to show the robustness of the method.
In this paper, genetic algorithm based and gradient-based topology optimization is presented in application to a real hardware design problem. Preliminary design of a planetary lander mockup structure is accomplished using these methods that prove to provide major weight savings by addressing the structural efficiency during the design cycle. This paper presents two alternative formulations of the topology optimization problem. The first is the widely-used gradient-based implementation using commercially available algorithms. The second is formulated using genetic algorithms and internally developed capabilities. These two approaches are applied to a practical design problem for hardware that has been built, tested and proven to be functional. Both formulations converged on similar solutions and therefore were proven to be equally valid implementations of the process. This paper discusses both of these formulations at a high level.
Experiments in DIII-D have been carried out to test a novel actuator management approach in tokamaks. Here, the actuator management scheme is posed as a nonlinear-optimization problem in which the actuator commands are calculated in real time according to the changing control priorities, plasma state, and actuator availability. Such optimization problem is solved using the augmented Lagrangian method, combined with a gradient projection method and a conjugate-gradient iteration algorithm. The algorithmic approach followed in this work does not depend on the particular control objectives or actuators considered, which facilitates its integration with other independently-designed control components within a plasma-control system. In addition, the actuator-management algorithm is able to handle the optimization problem in a computationally efficient manner, making it suitable for real-time implementations. Initial DIII-D results in the steady-state high-q min scenario have demonstrated the capabilities of the actuator manager to perform both simultaneous multiple mission and repurposing sharing, which will be required in ITER.
Constructing fast quantum logic gates is critical to building a scalable quantum computer. We consider a qudit, a quantum version of a bit that can take an arbitrary number of states, coupled with a cavity. In this project, we wish to force the qudit to reach the 0-state, for any possible initial state. The coupled system changes in time according to Lindblad’s equation, an ordinary differential equation on the density matrix of the quantum system. Lindblad’s equation contains some parameters that we can control, so-called control functions. We seek control functions which force the qudit to the 0-state within 2 microseconds, which is much faster than what is currently done in practice. The search method is gradient descent, a numerical optimization method that uses gradient information to iteratively improve the control parameters. My contribution to this project is an attempt to speed up the computation of the gradient. It currently takes about 40 seconds to compute the gradient which involves solving a set of ODEs sequentially. Current supercomputers have thousands of cores, but sequential computations can only make use of 1 core at a time. We wish to divide up the work better, so that we can use many more cores at once. To this end, we have implemented the Multigrid Reduction in Time (MGRIT) algorithm. We perform a systematic parameter search on how to best apply this algorithm. Results indicate a 25 percent speed up for solving Lindblad’s equation and determining how close the final state is the 0-state.
Crystal growth method based on controlled power reduction under stabilizing thermal gradients, eliminating chemical heterogeneities
In this work we derive and implement analytic nuclear gradients and derivative couplings for a constrained complete active space self-consistent field with a small active space designed to model electron or hole transfer. Using a Lagrangian formalism, we are able to differentiate both the CASSCF energy and the constraint (which is required for smooth surfaces over a wide range of parameter space), and the resulting efficient algorithm can be immediately applied to nonadiabatic dynamics simulations of charge transfer processes. Here, we run initial surface-hopping simulations of a proton coupled electron transfer event for a phenoxyl–phenol system.
In this study we describe a method for controlling both the residual stress and the through-thickness stress gradient of aluminum nitride (AlN) thin films using a multi-step deposition process that varies the applied radio frequency (RF) substrate bias. The relationship between the applied RF substrate bias and the AlN residual stress is characterized using AlN films grown on oxidized silicon substrates is determined using 100 nm–1.5 μm thick blanket AlN films that are deposited with 60–100 W applied RF biases; the stress-bias relationship is found to be well described using a power law relationship. Using this relationship, we develop a model for varying the RF bias in a series of discrete deposition steps such that each deposition step has zero average stress. The applied RF bias power in these steps is tailored to produce AlN films that have minimized both the residual stress and the film stress gradient. AlN cantilevers were patterned from films deposited using this technique, which show reduced curvature compared to those deposited using a single RF bias setting, indicating a reduction of the stress gradient in the films.
Electric field gradients (EFGs) for heavy nuclei in diatomic molecules (hydrogen halides and group-13 iodides), uranyl (UO 2 2+ ), and a uranyl carbonate complex, were computed with different formally exactly (or nearly exactly) decoupled two-component relativistic Hamiltonians: the “exact two-component” (X2C) method, the Barysz–Sadlej–Snijders (BSS) approach, and up to 35th order in the Douglas–Kroll–Hess (DKH) expansion, utilizing a new implementation in the open-source NWChem quantum chemistry package. Results from two-component Hartree–Fock and density functional theory (DFT) calculations at the scalar relativistic approximation as well as including spin–orbit coupling are reported. Picture-change corrected EFGs obtained with X2C, BSS, and high-order DKH are shown to be numerically equivalent. Effects from spin–orbit coupling on the EFGs tend to be moderate but should not be excluded for reliable predictions. Picture-change effects on the EFG of a heavy atom can be as large as the correct picture-change corrected value, as is shown for the uranium EFG in the uranyl systems. The results demonstrate the necessity of simultaneously including spin–orbit and picture-change effects in calculations of heavy atom EFGs.
Multidisciplinary design optimization (MDO) is an important step in the conceptual design and evaluation of launch vehicles since it can have a significant impact on performance and life cycle cost. The objective is to search the system design space to determine values of design variables that optimize the performance characteristic subject to system constraints. Gradient-based optimization routines have been used extensively for aerospace design optimization. However, one limitation of gradient based optimizers is their need for gradient information. Therefore, design problems which include discrete variables can not be studied. Such problems are common in launch vehicle design. For example, the number of engines and material choices must be integer values or assume only a few discrete values. In this study, genetic algorithms are investigated as an approach to MDO problems involving discrete variables and discontinuous domains. Optimization by genetic algorithms (GA) uses a search procedure which is fundamentally different from those gradient based methods. Genetic algorithms seek to find good solutions in an efficient and timely manner rather than finding the best solution. GA are designed to mimic evolutionary selection. A population of candidate designs is evaluated at each iteration, and each individual's probability of reproduction (existence in the next generation) depends on its fitness value (related to the value of the objective function). Progress toward the optimum is achieved by the crossover and mutation operations. GA is attractive since it uses only objective function values in the search process, so gradient calculations are avoided. Hence, GA are able to deal with discrete variables. Studies report success in the use of GA for aircraft design optimization studies, trajectory analysis, space structure design and control systems design. In these studies reliable convergence was achieved, but the number of function evaluations was large compared with efficient gradient methods. Applicaiton of GA is underway for a cost optimization study for a launch-vehicle fuel-tank and structural design of a wing. The strengths and limitations of GA for launch vehicle design optimization is studied.
Herein we derive and implement analytic energy gradients for the single-reference driven similarity renormalization group second-order perturbation theory (DSRG-PT2). The resulting equations possess an asymptotic scaling that is identical to that of the second-order Møller–Plesset perturbation theory (MP2), indicating that the exponential regularizer in the DSRG equations does not introduce formal difficulties in the gradient theory. We apply the DSRG-PT2 method to optimizing the geometries of 15 small molecules. The equilibrium bond lengths computed with DSRG-PT2 are found similar to those of MP2, yielding a mean absolute error of 0.0033 Å and a standard deviation of 0.0045 Å when compared with coupled cluster with singles, doubles, and perturbative triples.
The generalized minimal residual algorithm (GMRES) is a conjugate-gradient like method that applies directly to nonsymmetric linear systems of equations. In this paper, GMRES is modified to handle nonlinear equations characteristic of computational fluid dynamics. Attention is devoted to the concept of preconditioning and the role it plays in assuring rapid convergence. A formulation is developed that allows GMRES to be preconditioned by the solution procedures already built into existing computer codes. Examples are provided that demonstrate the ability of GMRES to greatly improve the robustness and rate of convergence of current state-of-the-art fluid dynamics codes. Theoretical aspects of GMRES are presented that explain why it works. Finally, the advantage GMRES enjoys over related methods such as conjugate gradients are discussed.
This paper describes a method to solve a system of N linear equations in N steps. A quadratic form is developed involving the sum of the squares of the residuals of the equations. Equating the quadratic form to a constant yields a surface which is an ellipsoid. For different constants, a family of similar ellipsoids can be generated. Starting at an arbitrary point an orthogonal basis is constructed and the center of the family of similar ellipsoids is found in this basis by a sequence of projections. The coordinates of the center in this basis are the solution of linear system of equations. A quadratic form in N variables requires N projections. That is, the current method is an exact method. It is shown that the sequence of projections is equivalent to a special case of the Gram-Schmidt orthogonalization process. The current method enjoys an advantage not shared by the classic Method of Conjugate Gradients. The current method can be extended to nonlinear systems without modification. For nonlinear equations the Method of Conjugate Gradients has to be augmented with a line-search procedure. Results for linear and nonlinear problems are presented.
We investigate the use of sparse matrices and OpenMP multi-threading on linear algebra operations involving them. Several sparse matrix data structures are presented. Implementation of the multi- threading primarily occurs in the level one and two BLAS functions used within the four algorithms investigated{the Power Method, Conjugate Gradient, Biconjugate Gradient, and Jacobi's Method. The bene ts of launching threads once per high level algorithm are explored.
In this paper, we consider a strongly convex stochastic optimization problem and propose three classes of variable sample-size stochastic first-order methods: (i) the standard stochastic gradient descent method, (ii) its accelerated variant, and (iii) the stochastic heavy-ball method. In each scheme, the exact gradients are approximated by averaging across an increasing batch size of sampled gradients. We prove that when the sample size increases at a geometric rate, the generated estimates converge in mean to the optimal solution at an analogous geometric rate for schemes (i)–(iii). Based on this result, we provide central limit statements, whereby it is shown that the rescaled estimation errors converge in distribution to a normal distribution with the associated covariance matrix dependent on the Hessian matrix, the covariance of the gradient noise, and the step length. If the sample size increases at a polynomial rate, we show that the estimation errors decay at a corresponding polynomial rate and establish the associated central limit theorems (CLTs). Under certain conditions, we discuss how both the algorithms and the associated limit theorems may be extended to constrained and nonsmooth regimes. As a result, we provide an avenue to construct confidence regions for the optimal solution based on the established CLTs and test the theoretical findings on a stochastic parameter estimation problem.
Purpose: The use of positron emission tomography (PET) within radiotherapy treatment planning requires the availability of reliable and accurate segmentation tools. PET automatic segmentation (PET-AS) methods have been recommended for the delineation of tumors, but there is still a lack of thorough validation and cross-comparison of such methods using clinically relevant data. In particular, studies validating PET segmentation tools mainly use phantoms with thick plastic walls inserts of simple spherical geometry and have not specifically investigated the effect of the target object geometry on the delineation accuracy. Our work therefore aimed at generating clinically realistic data using nonspherical thin-wall plastic inserts, for the evaluation and comparison of a set of eight promising PET-AS approaches. Methods: Sixteen nonspherical inserts were manufactured with a plastic wall of 0.18 mm and scanned within a custom plastic phantom. These included ellipsoids and toroids derived with different volumes, as well as tubes, pear- and drop-shaped inserts with different aspect ratios. A set of six spheres of volumes ranging from 0.5 to 102 ml was used for a baseline study. A selection of eight PET-AS methods, written in house, was applied to the images obtained. The methods represented promising segmentation approaches such as adaptive iterative thresholding, region-growing, clustering and gradient-based schemes. The delineation accuracy was measured in terms of overlap with the computed tomography reference contour, using the dice similarity coefficient (DSC), and error in dimensions. Results: The delineation accuracy was lower for nonspherical inserts than for spheres of the same volume in 88% cases. Slice-by-slice gradient-based methods, showed particularly lower DSC for tori (DSC < 0.5), caused by a failure to recover the object geometry. The region-growing method reached high levels of accuracy for most inserts (DSC > 0.76 except for tori) but showed the largest errors in the recovery of pears and drops dimensions (higher than 10% and 30% of the true length, respectively). Large errors were visible for one of the gradient-based contouring methods when delineating drop-shaped inserts. Low DSC due to systematic underestimation of the volumes was observed for our fuzzy clustering method when using nonspherical inserts. The adaptive iterative thresholding method produced the highest DSC score on our nonspherical dataset (DSC > 0.83, except for tori) and showed robustness to the insert geometry. Conclusions: This study investigated the accuracy of eight PET-AS methods for the delineation of objects with a range of nonspherical geometries. The authors’ results confirmed the robustness of some segmentation approaches, but also showed the weaknesses of some of the other methods implemented, which were not observed with spherical inserts. This work therefore highlights the importance of using a variety of thin-wall inserts with complex geometries for the validation of PET-AS methods and provided useful information for further development of the methods tested.
The percent level energy spread and large divergence of laser-plasma beam are the main challenges of realizing compact short-wavelength free-electron lasers based on laser-plasma accelerators. These issues can be solved with proposed transverse gradient undulator method or bunch decompression method along with proper transport design. We present a study of using an expected 500 MeV laser-plasma beam with 0.3 mm•mrad normalized emittance and 0.3 mrad divergence at Peking University to drive compact free-electron laser at 30 nm. We employ the bunch decompression method with a chromatic matching beamline as well as the transverse gradient undulator method with assumed matched beam. Simulation shows that 700 MW power, 9.7 fs pulse duration and 0.85% relative bandwidth FEL output can be obtained using chromatic matched bunch decompression method. As a result FEL with similar performance can be obtained using the transverse gradient undulator scheme.