Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical Optimization”

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 1,729 records · Page 96

An introduction to partial differential equations constrained optimization

Partial differential equation (PDE) constrained optimization is designed to solve control, design, and inverse problems with underlying physics. A distinguishing challenge of this technique is the handling of large numbers of optimization variables in combination with the complexities of discretized PDEs. Over the last several decades, advances in algorithms, numerical simulation, software design, and computer architectures have allowed for the maturation of PDE constrained optimization (PDECO) technologies with subsequent solutions to complicated control, design, and inverse problems. This special journal edition, entitled “PDE-Constrained Optimization”, features eight papers that demonstrate new formulations, solution strategies, and innovative algorithms for a range of applications. In particular, these contributions demonstrate the impactfulness on our engineering and science communities. This paper offers short remarks to provide some perspective and background for PDECO, in addition to summaries of the eight papers.

97 MATHEMATICS AND COMPUTING↗

Global stochastic optimization of stellarator coil configurations

In the construction of a stellarator, the manufacturing and assembling of the coil system is a dominant cost. These coils need to satisfy strict engineering tolerances, and if those are not met the project could be cancelled as in the case of the National Compact Stellarator Experiment (NCSX) project. Therefore, our goal is to find coil configurations that increase construction tolerances without compromising the performance of the magnetic field. In this paper, we develop a gradient-based stochastic optimization model which seeks robust stellarator coil configurations in high dimensions. In particular, we design a two-step method: first, we perform an approximate global search by a sample efficient trust-region Bayesian optimization; second, we refine the minima found in step one with a stochastic local optimizer. To this end, we introduce two stochastic local optimizers: BFGS applied to the sample average approximation; and Adam, equipped with a control variate for variance reduction. Numerical simulations performed on a W7-X-like coil configuration demonstrate that our global optimization approach finds a variety of promising local solutions at less than 0.1% of the cost of previous work, which considered solely local stochastic optimization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A multifidelity Bayesian optimization method for inertial confinement fusion design

Due to their cost, experiments for inertial confinement fusion (ICF) heavily rely on numerical simulations to guide design. As simulation technology progresses, so too can the fidelity of models used to plan for new experiments. However, these high-fidelity models are by themselves insufficient for optimal experimental design, because their computational cost remains too high to efficiently and effectively explore the numerous parameters required to describe a typical experiment. Therefore, traditionally, ICF design has relied on low-fidelity modeling to initially identify potentially interesting design regions, which are then subsequently explored via selected high-fidelity modeling. In this paper, we demonstrate that this two-step approach can be insufficient: even for simple design problems, a two-step optimization strategy can lead high-fidelity searching toward incorrect regions and consequently waste computational resources on parameter regimes far away from the true optimal solution. We reveal that a primary cause of this behavior in ICF design problems is the presence of low-fidelity optima in different regions of the parameter space far away from high-fidelity optima. To address this issue, we propose an iterative multifidelity Bayesian optimization method based on Gaussian Process Regression that leverages both low- and high-fidelity models simultaneously. We demonstrate, using both two- and eight-dimensional ICF test problems, that our algorithm can effectively utilize both low-fidelity and high-fidelity models to refine the designs. This approach proves to be more efficient than relying solely on high-fidelity modeling for optimization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Analysis of Nonlinear Dynamics by Square Matrix Method

The nonlinear dynamics of a system with periodic structure can be analyzed using a square matrix. In this paper, we show that because the special property of the square matrix constructed for nonlinear dynamics, we can reduce the dimension of the matrix from the original large number for high order calculation to low dimension in the first step of the analysis. Then a stable Jordan decomposition is obtained with much lower dimension. The transformation to Jordan form provides an excellent action-angle approximation to the solution of the nonlinear dynamics, in good agreement with trajectories and tune obtained from tracking. And more importantly, the deviation from constancy of the new action-angle variable provides a measure of the stability of the phase space trajectories and their tunes. Thus the square matrix provides a novel method to optimize the nonlinear dynamic system. The method is illustrated by many examples of comparison between theory and numerical simulation. Finally, in particular, we show that the square matrix method can be used for optimization to reduce the nonlinearity of a system.

43 PARTICLE ACCELERATORS↗

Application of low dissipation and dispersion Runge-Kutta schemes to benchmark problems in computational aeroacoustics

We investigate accurate and efficient time advancing methods for computational aeroacoustics, where non-dissipative and non-dispersive properties are of critical importance. Our analysis pertains to the application of Runge-Kutta methods to high-order finite difference discretization. In many CFD applications, multi-stage Runge-Kutta schemes have often been favored for their low storage requirements and relatively large stability limits. For computing acoustic waves, however, the stability consideration alone is not sufficient, since the Runge-Kutta schemes entail both dissipation and dispersion errors. The time step is now limited by the tolerable dissipation and dispersion errors in the computation. In the present paper, it is shown that if the traditional Runge-Kutta schemes are used for time advancing in acoustic problems, time steps greatly smaller than that allowed by the stability limit are necessary. Low Dissipation and Dispersion Runge-Kutta (LDDRK) schemes are proposed, based on an optimization that minimizes the dissipation and dispersion errors for wave propagation. Optimizations of both single-step and two-step alternating schemes are considered. The proposed LDDRK schemes are remarkably more efficient than the classical Runge-Kutta schemes for acoustic computations. Numerical results of each Category of the Benchmark Problems are presented. Moreover, low storage implementations of the optimized schemes are discussed. Special issues of implementing numerical boundary conditions in the LDDRK schemes are also addressed.

Hu, F. Q.↗

Numerical study of proppant transport and settling processes in fractures

Reservoir stimulation by creating hydraulically conductive fractures is the key step for enabling enhanced geothermal systems (EGS). The effectiveness of stimulation is significantly influenced by the deposition of proppant inside induced fractures. The transportation and settling of proppant in a propagating fracture is controlled by a multitude of operational and physical parameters, including the fracturing fluid rheology, injection rate, proppant concentration, fracture length/aperture evolution, proppant size/density/shape, etc. A numerical tool that robustly and efficiently accounts for all important attributes can facilitate the design and optimization of reservoir stimulation. This study presents the novel computational tool ELK (ELectrical fracKing) developed for the numerical simulation of proppant-fluid mixture circulation in a fractured geothermal reservoir. We enriched the MOOSE-based PorousFlow module with a suite of equations to consider the fluid-proppant mixture with particle-particle/fluid interactions, which include gravitational settling, particle convection, particle hampering, and strong density and viscosity contrasts. The computational tool is validated by comparing the predicted proppant bed evolution against two different laboratory scale experiments of proppant transport in a fixed aperture channel. Further parameter studies were performed, and the modeling results show that the proppant deposition is determined by the mixing characteristics and settling of the particles from the slurry. Concentration-dependent density and viscosity lead to an inhomogeneous distribution of the proppant, particle collision, and enhanced settling at the bottom of the fractures. Preliminary coupling with dynamic fracture propagation shows promising results and will be further developed to simulate hydraulic stimulation at high fidelity.

15 GEOTHERMAL ENERGY↗

A Multi-Objective Bayesian Optimization Approach Using the Weighted Tchebycheff Method

Abstract Bayesian optimization (BO) is a low-cost global optimization tool for expensive black-box objective functions, where we learn from prior evaluated designs, update a posterior surrogate Gaussian process model, and select new designs for future evaluation using an acquisition function. This research focuses upon developing a BO model with multiple black-box objective functions. In the standard multi-objective (MO) optimization problem, the weighted Tchebycheff method is efficiently used to find both convex and non-convex Pareto frontiers. This approach requires knowledge of utopia values before we start optimization. However, in the BO framework, since the functions are expensive to evaluate, it is very expensive to obtain the utopia values as a prior knowledge. Therefore, in this paper, we develop a MO-BO framework where we calibrate with multiple linear regression (MLR) models to estimate the utopia value for each objective as a function of design input variables; the models are updated iteratively with sampled training data from the proposed MO-BO. These iteratively estimated mean utopia values are used to formulate the weighted Tchebycheff MO acquisition function. The proposed approach is implemented in two numerical test examples and one engineering design problem of optimizing thin tube geometries under constant loading of temperature and pressure, with minimizing the risk of creep-fatigue failure and design cost, along with risk-based and manufacturing constraints. Finally, the model accuracy with frequentist, Bayesian and without MLR-based calibration are compared to true Pareto solutions.

Engineering↗

Rapid thermal processing chamber for in-situ x-ray diffraction

Rapid thermal processing (RTP) is widely used for processing a variety of materials, including electronics and photovoltaics. Presently, optimization of RTP is done primarily based on ex-situ studies. As a consequence, the precise reaction pathways and phase progression during the RTP remain unclear. More awareness of the reaction pathways would better enable process optimization and foster increased adoption of RTP, which offers numerous advantages for synthesis of a broad range of materials systems. To achieve this, we have designed and developed a RTP instrument that enables real-time collection of X-ray diffraction data with intervals as short as 100 ms, while heating with ramp rates up to 100 °Cs{sup −1}, and with a maximum operating temperature of 1200 °C. The system is portable and can be installed on a synchrotron beamline. The unique capabilities of this instrument are demonstrated with in-situ characterization of a Bi{sub 2}O{sub 3}-SiO{sub 2} glass frit obtained during heating with ramp rates 5 °C s{sup −1} and 100 °C s{sup −1}, revealing numerous phase changes.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Direct discontinuous Galerkin method and its variations for second order elliptic equations

In this study, we study direct discontinuous Galerkin method (Liu and Yan in SIAM J Numer Anal 47(1):475–698, 2009) and its variations (Liu and Yan in Commun Comput Phys 8(3):541–564, 2010; Vidden and Yan in J Comput Math 31(6):638–662, 2013; Yan in J Sci Comput 54(2–3):663–683, 2013) for 2nd order elliptic problems. A priori error estimate under energy norm is established for all four methods. Optimal error estimate under L 2 norm is obtained for DDG method with interface correction (Liu and Yan in Commun Comput Phys 8(3):541–564, 2010) and symmetric DDG method (Vidden and Yan in J Comput Math 31(6):638–662, 2013). A series of numerical examples are carried out to illustrate the accuracy and capability of the schemes. Numerically we obtain optimal (k+1)th order convergence for DDG method with interface correction and symmetric DDG method on nonuniform and unstructured triangular meshes. An interface problem with discontinuous diffusion coefficients is investigated and optimal (k+1)th order accuracy is obtained. Peak solutions with sharp transitions are captured well. Highly oscillatory wave solutions of Helmholz equation are well resolved.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal helicopter trajectory planning for terrain following flight

Helicopters operating in high threat areas have to fly close to the earth surface to minimize the risk of being detected by the adversaries. Techniques are presented for low altitude helicopter trajectory planning. These methods are based on optimal control theory and appear to be implementable onboard in realtime. Second order necessary conditions are obtained to provide a criterion for finding the optimal trajectory when more than one extremal passes through a given point. A second trajectory planning method incorporating a quadratic performance index is also discussed. Trajectory planning problem is formulated as a differential game. The objective is to synthesize optimal trajectories in the presence of an actively maneuvering adversary. Numerical methods for obtaining solutions to these problems are outlined. As an alternative to numerical method, feedback linearizing transformations are combined with the linear quadratic game results to synthesize explicit nonlinear feedback strategies for helicopter pursuit-evasion. Some of the trajectories generated from this research are evaluated on a six-degree-of-freedom helicopter simulation incorporating an advanced autopilot. The optimal trajectory planning methods presented are also useful for autonomous land vehicle guidance.

Menon, P. K. A.↗

Automated property optimization via ab initio O(N) elongation method: Application to (hyper-)polarizability in DNA

An automated property optimization method was developed based on the ab initio O(N) elongation (ELG) method and applied to the optimization of nonlinear optical (NLO) properties in DNA as a first test. The ELG method mimics a polymerization reaction on a computer, and the reaction terminal of a starting cluster is attacked by monomers sequentially to elongate the electronic structure of the system by solving in each step a limited space including the terminal (localized molecular orbitals at the terminal) and monomer. The ELG-finite field (ELG-FF) method for calculating (hyper-)polarizabilities was used as the engine program of the optimization method, and it was found to show linear scaling efficiency while maintaining high computational accuracy for a random sequenced DNA model. Furthermore, the self-consistent field convergence was significantly improved by using the ELG-FF method compared with a conventional method, and it can lead to more feasible NLO property values in the FF treatment. The automated optimization method successfully chose an appropriate base pair from four base pairs (A, T, G, and C) for each elongation step according to an evaluation function. From test optimizations for the first order hyper-polarizability (β) in DNA, a substantial difference was observed depending on optimization conditions between “choose-maximum” (choose a base pair giving the maximum β for each step) and “choose-minimum” (choose a base pair giving the minimum β). In contrast, there was an ambiguous difference between these conditions for optimizing the second order hyper-polarizability (γ) because of the small absolute value of γ and the limitation of numerical differential calculations in the FF method. It can be concluded that the ab initio level property optimization method introduced here can be an effective step towards an advanced computer aided material design method as long as the numerical limitation of the FF method is taken into account.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Centroidal Voronoi tessellation based methods for optimal rain gauge location prediction

With more satellite and model precipitation data becoming available, new analytical methods are needed that can take advantage of emerging data patterns to make well informed predictions in many hydrological applications. Herein we propose a new strategy where we extract precipitation variability patterns and use correlation map to build the resulting density map that serves as an input to centroidal Voronoi tessellation construction that optimizes placement of precipitation gauges. We provide results of numerical experiments based on the data from the Alto-Adige region in Northern Italy and Oklahoma and compare them against actual gauge locations. This method provides an automated way for choosing new gauge locations and can be generalized to include physical constraints and to tackle other types of resource allocation problems.

54 ENVIRONMENTAL SCIENCES↗

On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices

Conjugate gradient type methods are considered for the solution of large linear systems Ax = b with complex coefficient matrices of the type A = T + i(sigma)I where T is Hermitian and sigma, a real scalar. Three different conjugate gradient type approaches with iterates defined by a minimal residual property, a Galerkin type condition, and an Euclidian error minimization, respectively, are investigated. In particular, numerically stable implementations based on the ideas behind Paige and Saunder's SYMMLQ and MINRES for real symmetric matrices are proposed. Error bounds for all three methods are derived. It is shown how the special shift structure of A can be preserved by using polynomial preconditioning. Results on the optimal choice of the polynomial preconditioner are given. Also, some numerical experiments for matrices arising from finite difference approximations to the complex Helmholtz equation are reported.

Freund, Roland↗

Sulfated glycopeptide nanostructures for multipotent protein activation

Biological systems have evolved to utilize numerous proteins with capacity to bind polysaccharides for the purpose of optimizing their function. A well-known subset of these proteins with binding domains for the highly diverse sulfated polysaccharides are important growth factors involved in biological development and tissue repair. Here, we report on supramolecular sulfated glycopeptide nanostructures, which display a trisulfated monosaccharide on their surfaces and bind five critical proteins with very different polysaccharide binding domains. Binding does not disrupt the filamentous shape of the nanostructures or their internal β-sheet backbone, but must involve accessible adaptive configurations to interact with such different proteins. The glycopeptide nanostructures amplified signaling of bone morphogenetic protein 2 significantly more than the natural sulfated polysaccharide heparin, and promoted regeneration of bone in the spine with a protein dose that is 100-fold lower than expected. These super-bioactive nanostructures may enable many therapies in the horizon involving proteins.

36 MATERIALS SCIENCE↗

Design for Resilience in Infrastructure Distribution Networks

The recognition that resilience is a critical aspect of infrastructure resilience has caused the national and homeland security communities to ask “How does one ensure infrastructure resilience?” Previous analysis methods have primarily focused on system recovery activities following the occurrence of a disruptive event. In this report, we expand on those methods by including pre-disruption investment options, in addition to post-event recovery activities, as means to infrastructure resilience. The report describes a stochastic optimization model for designing network infrastructure resilience to a variety of uncertain potential disruptions. The model seeks investment-recovery combinations that minimize the overall cost to a regional distribution network. A set of numerical experiments illustrates how changes to disruption scenarios probabilities affect the optimal resilient design investments.

Vugrin, Eric D.↗

Soft-Decision Decoding of Binary Linear Block Codes Based on an Iterative Search Algorithm

This correspondence presents a suboptimum soft-decision decoding scheme for binary linear block codes based on an iterative search algorithm. The scheme uses an algebraic decoder to iteratively generate a sequence of candidate codewords one at a time using a set of test error patterns that are constructed based on the reliability information of the received symbols. When a candidate codeword is generated, it is tested based on an optimality condition. If it satisfies the optimality condition, then it is the most likely (ML) codeword and the decoding stops. If it fails the optimality test, a search for the ML codeword is conducted in a region which contains the ML codeword. The search region is determined by the current candidate codeword and the reliability of the received symbols. The search is conducted through a purged trellis diagram for the given code using the Viterbi algorithm. If the search fails to find the ML codeword, a new candidate is generated using a new test error pattern, and the optimality test and search are renewed. The process of testing and search continues until either the MEL codeword is found or all the test error patterns are exhausted and the decoding process is terminated. Numerical results show that the proposed decoding scheme achieves either practically optimal performance or a performance only a fraction of a decibel away from the optimal maximum-likelihood decoding with a significant reduction in decoding complexity compared with the Viterbi decoding based on the full trellis diagram of the codes.

Lin, Shu↗

The Quantum Approximation Optimization Algorithm for MaxCut: A Fermionic View

Farhi et al. recently proposed a class of quantum algorithms, the Quantum Approximate Optimization Algorithm (QAOA), for approximately solving combinatorial optimization problems. A level-p QAOA circuit consists of steps in which a classical Hamiltonian, derived from the cost function, is applied followed by a mixing Hamiltonian. The 2p times for which these two Hamiltonians are applied are the parameters of the algorithm. As p increases, however, the parameter search space grows quickly. The success of the QAOA approach will depend, in part, on finding effective parameter-setting strategies. Here, we analytically and numerically study parameter setting for QAOA applied to MAXCUT. For level-1 QAOA, we derive an analytical expression for a general graph. In principle, expressions for higher p could be derived, but the number of terms quickly becomes prohibitive. For a special case of MAXCUT, the Ring of Disagrees, or the 1D antiferromagnetic ring, we provide an analysis for arbitrarily high level. Using a Fermionic representation, the evolution of the system under QAOA translates into quantum optimal control of an ensemble of independent spins. This treatment enables us to obtain analytical expressions for the performance of QAOA for any p. It also greatly simplifies numerical search for the optimal values of the parameters. By exploring symmetries, we identify a lower-dimensional sub-manifold of interest; the search effort can be accordingly reduced. This analysis also explains an observed symmetry in the optimal parameter values. Further, we numerically investigate the parameter landscape and show that it is a simple one in the sense of having no local optima.

quantum algorithm↗

Formation of optical pulses by modulating the resonant quantum transition frequency in a spectrally inhomogeneous medium

We consider the conversion of monochromatic radiation in the case of resonant interaction with a quantum system under the condition of harmonic modulation of the quantum transition frequency by the action of additional nonresonant radiation due to the Stark or Zeeman effect, taking into account the inhomogeneous broadening of the quantum transition line. It is shown analytically and numerically that resonant radiation can be converted in a train of ultrashort pulses with a peak intensity exceeding manifold the incident wave intensity. The possibility of the additional compression of the produced pulses is studied by compensating the inherent frequency modulation in a medium with a quadratic or programmable dispersion. The optimal values of the radiation - matter interaction parameters are found numerically. It is shown that generation of femtosecond optical pulses of radiation quasi-resonant to the {delta} transition of the atomic hydrogen Balmer series is possible. (nonlinear-optics phenomena)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗