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,081 records · Page 60

Resource distribution under spatiotemporal uncertainty of disease spread: Stochastic versus robust approaches

We consider the problem of optimizing locations of distribution centers (DCs) and plans for distributing resources such as test kits and vaccines, under spatiotemporal uncertainties of disease spread and demand for the resources. We aim to balance the operational cost (including costs of deploying facilities, shipping, and storage) and quality of service (reflected by demand coverage), while ensuring equity and fairness of resource distribution across multiple populations. We compare a sample-based stochastic programming (SP) approach with a distributionally robust optimization (DRO) approach using a moment-based ambiguity set. Numerical studies are conducted on instances of distributing COVID-19 vaccines in the United States and test kits, to compare SP and DRO models with a deterministic formulation using estimated demand and with the current resource distribution plans implemented in the US. We demonstrate the results over distinct phases of the pandemic to estimate the cost and speed of resource distribution depending on scale and coverage, and show the “demand-driven” properties of the SP and DRO solutions. Furthermore, our results further indicate that if the worst-case unmet demand is prioritized, then the DRO approach is preferred despite of its higher overall cost. Nevertheless, the SP approach can provide an intermediate plan under budgetary restrictions without significant compromises in demand coverage.

97 MATHEMATICS AND COMPUTING↗

Structure-aware Initialization via Numerical Continuation and Informed Priors

Scientific machine learning (SciML) often operates in ill-conditioned, weakly identifiable regimes due to limited data or indirect observations. In such settings, optimization and inference are highly sensitive to the starting point, making initialization--often under-reported--a consequential degree of freedom. Random initialization is not a neutral default as it induces an implicit prior over candidate solutions and can systematically bias the result, producing large run-to-run variability. Here, we formalize this view by treating initialization as a hidden confounder in SciML and develop a unifying theory for structure-aware initialization via numerical continuation, constructing warm starts from related problem instances. Across representative tasks, including physics-informed neural networks, maximum likelihood estimation, and variational inference, warm starts have been shown to consistently reduce optimization effort and improve reliability.

Data integrity↗

Towards Scalable Optimal Sequence Homology Detection

Abstract—The field of bioinformatics and computational biol- ogy is experiencing a data revolution — experimental techniques to procure data have increased in throughput, improved in accuracy and reduced in costs. This has spurred an array of high profile sequencing and data generation projects. While the data repositories represent untapped reservoirs of rich information critical for scientific breakthroughs, the analytical software tools that are needed to analyze large volumes of such sequence data have significantly lagged behind in their capacity to scale. In this paper, we address homology detection, which is a funda- mental problem in large-scale sequence analysis with numerous applications. We present a scalable framework to conduct large- scale optimal homology detection on massively parallel super- computing platforms. Our approach employs distributed memory work stealing to effectively parallelize optimal pairwise alignment computation tasks. Results on 120,000 cores of the Hopper Cray XE6 supercomputer demonstrate strong scaling and up to 2.42 × 107 optimal pairwise sequence alignments computed per second (PSAPS), the highest reported in the literature.

Daily, Jeffrey A.↗

Optimization-based mesh correction with volume and convexity constraints

Here, we consider the problem of finding a mesh such that 1) it is the closest, with respect to a suitable metric, to a given source mesh having the same connectivity, and 2) the volumes of its cells match a set of prescribed positive values that are not necessarily equal to the cell volumes in the source mesh. Also, this volume correction problem arises in important simulation contexts, such as satisfying a discrete geometric conservation law and solving transport equations by incremental remapping or similar semi-Lagrangian transport schemes. In this paper we formulate volume correction as a constrained optimization problem in which the distance to the source mesh defines an optimization objective, while the prescribed cell volumes, mesh validity and/or cell convexity specify the constraints. We solve this problem numerically using a sequential quadratic programming (SQP) method whose performance scales with the mesh size. To achieve scalable performance we develop a specialized multigrid-based preconditioner for optimality systems that arise in the application of the SQP method to the volume correction problem. Numerical examples illustrate the importance of volume correction, and showcase the accuracy, robustness and scalability of our approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Topology optimization of 3D photonic crystals with complete bandgaps

The design of photonic crystals with complete bandgaps has recently received considerable research focus for numerous reasons. This work leverages well-known nonlinear programming techniques to alleviate the non-smoothness caused by degenerate eigenvalues such that topology optimization problems can be solved with the open-source IPOPT software. A fully-vectorial plane wave expansion technique is used with an iterative eigensolver to efficiently predict dispersion properties of candidate structures. Nonlinear programming is employed to solve the inverse problem of designing three-dimensional periodic structures that exhibit complete two-dimensional (2D) and three-dimensional (3D) photonic bandgaps. Mesh refinement is performed to alleviate the large computational burden of designing and analyzing photonic crystals, and a periodic density filter is implemented to impose a minimum feature size for manufacturability considerations.

97 MATHEMATICS AND COMPUTING↗

Microscopically based energy density functionals for nuclei using the density matrix expansion: Implementation and pre-optimization

In a recent series of articles, Gebremariam, Bogner, and Duguet derived a microscopically based nuclear energy density functional by applying the density matrix expansion (DME) to the Hartree-Fock energy obtained from chiral effective field theory two- and three-nucleon interactions. Owing to the structure of the chiral interactions, each coupling in the DME functional is given as the sum of a coupling constant arising from zero-range contact interactions and a coupling function of the density arising from the finite-range pion exchanges. Because the contact contributions have essentially the same structure as those entering empirical Skyrme functionals, a microscopically guided Skyrme phenomenology has been suggested in which the contact terms in the DME functional are released for optimization to finite-density observables to capture short-range correlation energy contributions from beyond Hartree-Fock. The present article is the first attempt to assess the ability of the newly suggested DME functional, which has a much richer set of density dependencies than traditional Skyrme functionals, to generate sensible and stable results for nuclear applications. The results of the first proof-of-principle calculations are given, and numerous practical issues related to the implementation of the new functional in existing Skyrme codes are discussed. Using a restricted singular value decomposition optimization procedure, it is found that the new DME functional gives numerically stable results and exhibits a small but systematic reduction of our test {chi}{sup 2} function compared to standard Skyrme functionals, thus justifying its suitability for future global optimizations and large-scale calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optimization of COMPASS-U Support Structure

The global support structure for Compass Upgrade (COMPASS-U) employs many bolted and pinned components to improve the manufacturability of the whole structures. This is a departure from other designs used for highly loaded tokamaks, like Alcator C-Mod which used large forgings. Modeling of the numerous connections and interfaces was a challenge. This article will describe how to optimize the C-frame support structure with the goal to eliminate differential displacements at those interfaces and, importantly, minimize toroidal mutual displacement at the sliding joint of the toroidal field (TF) coils. The global support structure consists of 16 C-frames, and it can be simplified as a 1/8th cyclic symmetry model due to the eight vertical rods mounting that connect bottom CS and PF1-3 assemblies to the C-frames. Structure variants with different connection webs between two neighboring C-frames have been analyzed. The preloading of bolts can be split into several preload substeps to simulate the real assembly process of the COMPASS-U support structure. Additionally, the TF crown and the wedge plate can be further improved to become a solid part to better hold the TF coils.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Accelerating Engineered Microbe Optimization through Machine Learning and Multi-Omics Datasets [Abstract]

The Agile Biofoundry (ABF) is a multi-national lab consortium funded by the DOE Bioenergy Technologies Office that has developed a biofoundry enabling the rapid deployment of bioproducts into the market. The ABF is a flexible platform that can adjust to the needs of numerous government, academic and industrial partners, thus enabling them to rapidly develop and optimize the production of a wide range of bioproducts. To demonstrate this capability, three ABF labs (NTESS, LBNL, and PNNL) have collaborated with the biomanufacturer Lygos, Inc. to use the ABF to demonstrate a high-throughput Design-Build-Test-Learn (DBTL) engineering cycle incorporating multi-omics analysis and machine learning with best in industry cycle times.

60 APPLIED LIFE SCIENCES↗

Passivity-Short-based Stability Analysis on Electricity Market Trading System Considering Negative Price

This paper deals with a distributed decision method for determining the electricity price considering the negative price in the market trading. In addition, we analyze the stability and convergence properties for the market trading system using the concept of passivity-short. At first, mathematical models of market participants' behavior which maximize their own profits are discussed. Then, we construct a trading system based on dynamic pricing considering plug and play operation that each market participant intermittently participates in market trading. As for the optimal electricity price, even if the optimal price might be negative, we indicate the stability of the system can be guaranteed by using passivity-short which is a relaxed concept of passivity. Finally, numerical simulation results illustrate that each value decided by the market trading converges to the optimal value.

Muto, Keita↗

CONORBIT: constrained optimization by radial basis function interpolation in trust regions

Here, this paper presents CONORBIT (CONstrained Optimization by Radial Basis function Interpolation in Trust regions), a derivative-free algorithm for constrained black-box optimization where the objective and constraint functions are computationally expensive. CONORBIT employs a trust-region framework that uses interpolating radial basis function (RBF) models for the objective and constraint functions, and is an extension of the ORBIT algorithm. It uses a small margin for the RBF constraint models to facilitate the generation of feasible iterates, and extensive numerical tests confirm that such a margin is helpful in improving performance. CONORBIT is compared with other algorithms on 27 test problems, a chemical process optimization problem, and an automotive application. Numerical results show that CONORBIT performs better than COBYLA, a sequential penalty derivative-free method, an augmented Lagrangian method, a direct search method, and another RBF-based algorithm on the test problems and on the automotive application.

97 MATHEMATICS AND COMPUTING↗

Optimization of irradiation configuration in laser fusion utilizing self-organizing electrodynamic system

A simple numerical method to determine an optimum beam configuration for highly uniform irradiation is proposed for direct-drive laser fusion systems and is applied to an arbitrary number of laser beams, N{sub B}. Driven by the Coulomb repulsion force, N{sub B} randomly distributed like charges move on a spherical surface to settle with a stable configuration having the minimum Coulomb energy for the system. Such resultant charge configurations practically do not depend on the initial conditions, and thus the solutions are very robust and unique. The irradiation uniformity is numerically assessed by overlapping N{sub B} beam patterns and calculating the laser absorption based on various spatial absorption patterns for the individual beams. The present method provides some improved illumination configurations for laser fusion compared with previously proposed designs. In particular, new coordinates for N{sub B}=48 and 72 are found to give an extraordinarily higher uniformity than for other numbers of N{sub B}. The influence of system imperfection on the irradiation uniformity is also discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Spatial Entanglement and Optimal Single-Mode Coupling

The challenge of optimizing the emission into single spatial modes of photons from spontaneous parametric down-conversion is addressed from the perspective of spatial entanglement. It is shown that single-mode coupling is most efficient in the absence of entanglement. Evidence of the relationship between spatial entanglement and pump focusing is revealed through experimental results, and numerical simulations show that spatial entanglement and single-mode coupling are optimized under nearly identical pump parameters.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

High-order, stable, and conservative boundary schemes for central and compact finite differences

Stable and conservative numerical boundary schemes are constructed such that they do not diminish the overall accuracy of the method for interior schemes of orders 4, 6, and 8 using both explicit (central) and compact finite differences. Previous attempts to develop stable numerical boundary schemes for non-linear problems have resulted in schemes which significantly reduced the global accuracy and/or required some form of artificial dissipation. Thus, the schemes developed in this paper are the first to not require this tradeoff, while also ensuring discrete conservation and allowing for direct boundary condition enforcement. After outlining a general procedure for the construction of conservative boundary schemes of any order, a simple, yet novel, optimization strategy which focuses directly on the compressible Euler equations is presented. Furthermore, the result of this non-linear optimization process is a set of high-order, stable, and conservative numerical boundary schemes which demonstrate excellent stability and convergence properties on an array of linear and non-linear hyperbolic problems.

97 MATHEMATICS AND COMPUTING↗

Uniform secondary current distribution at disk electrodes under Tafel kinetics enabled by concentric current-shielding rings

Non-uniform secondary current distribution at rotating disk electrodes (RDE) is a common problem when using resistive electrolyte media or large applied currents. In a recent publication, we have shown that auxiliary electrodes such as the ring of a rotating ring disk electrode (RRDE) can help suppress current non-uniformities at the disk enabling reliable electroanalytical measurements. However, this previous work considered linear kinetics where current distribution non-uniformities were moderate. In the present contribution, we consider current distribution non-uniformities encountered under Tafel kinetics. We show, for the case of 2,5-dihydroxy-1,4-benzoquinone (DHBQ) reduction, that optimally chosen ring conditions serve to provide effective shielding at the disk edge rendering the overall disk current distribution to be uniform. Numerical modeling and scaling analysis (using the Wagner number) are presented to aid a user in determining the optimal ring current density for achieving uniform disk current distribution under Tafel kinetics. This approach is especially useful when studying soluble-soluble redox transitions for which, unlike deposit distribution in electrodeposition, the current distribution non-uniformity is not visually apparent.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Adaptive Mesh Refinement Simulations for Turbulent Reacting Flow

With the increased availability of exascale computing hardware, detailed simulations of realistic devices can be performed at practically relevant time and length scales. Insights into the multiscale driving mechanisms in compressible reacting flow systems with complex geometry, such as combustors, can be used for design optimization and technology improvements. However, to effectively perform these simulations, advanced numerical algorithms must be used to maintain solution accuracy without incurring undue computational costs. PeleC, part of the Pele suite of codes, leverages block-structured adaptive mesh refinement (AMR) through the AMReX library to capture fine-scale flow features in compressible reacting flows. In this talk, we discuss recent improvements to the numerical algorithms, particularly in regard to describing flows at complex boundary structures, and PeleC's performance on exascale computing hardware. We will demonstrate that PeleC is well-suited for modern, extreme-scale, heterogenous compute platforms.

combustion↗

Improving Data Transfer Throughput with Direct Search Optimization

Improving data transfer throughput over high-speed long-distance networks has become increasingly difficult. Numerous factors such as nondeterministic congestion, dynamics of the transfer protocol, and multiuser and multitask source and destination endpoints, as well as interactions among these factors, contribute to this difficulty. A promising approach to improving throughput consists in using parallel streams at the application layer.We formulate and solve the problem of choosing the number of such streams from a mathematical optimization perspective. We propose the use of direct search methods, a class of easy-to-implement and light-weight mathematical optimization algorithms, to improve the performance of data transfers by dynamically adapting the number of parallel streams in a manner that does not require domain expertise, instrumentation, analytical models, or historic data. We apply our method to transfers performed with the GridFTP protocol, and illustrate the effectiveness of the proposed algorithm when used within Globus, a state-of-the-art data transfer tool, on productionWAN links and servers. We show that when compared to user default settings our direct search methods can achieve up to 10x performance improvement under certain conditions. We also show that our method can overcome performance degradation due to external compute and network load on source end points, a common scenario at high performance computing facilities.

Balaprakash, Prasanna↗

Field Dislocation Mechanics for heterogeneous elastic materials: A numerical spectral approach

Spectral methods using Fast Fourier Transform (FFT) algorithms have recently seen a surge in interest in the mechanics of materials community. The present work addresses the critical question of determining accurate local mechanical fields using FFT methods without artificial fluctuations arising from materials and defects induced discontinuities. Precisely, this work introduces a numerical approach based on intrinsic discrete Fourier transforms for the simultaneous treatment of material discontinuities arising from the presence of dislocations and from elastic stiffness heterogeneities. To this end, the elasto-static equations of the field dislocation mechanics theory for periodic heterogeneous materials are numerically solved with FFT in the case of dislocations in proximity of inclusions of varying stiffness. An optimal intrinsic discrete Fourier transform method is sought based on two distinct schemes. A centered finite difference scheme for differential rules are used for numerically solving the Poisson-type equation in the Fourier space, while centered finite differences on a rotated grid is chosen for the computation of the modified Fourier–Green’s operator associated with the Lippmann–Schwinger-type equation. By comparing different methods with analytical solutions for an edge dislocation in a composite material, it is found that the present spectral method is accurate, devoid of any numerical oscillation, and efficient even for an infinite phase elastic contrast like a hole embedded in a matrix containing a dislocation. The present FFT method is then used to simulate physical cases such as the elastic fields of dislocation dipoles located near the matrix/inclusion interface in a 2D composite material and the ones due to dislocation loop distributions surrounding cubic inclusions in 3D composite material. In these configurations, the spectral method allows investigating accurately the elastic interactions and image stresses due to dislocation fields in the presence of elastic inhomogeneities.

36 MATERIALS SCIENCE↗

Reconstruction of jointly sparse vectors via manifold optimization

In this paper, we consider the challenge of reconstructing jointly sparse vectors from linear measurements. Firstly, we show that by utilizing the rank of the output data matrix we can reduce the problem to a full column rank case. This result reveals a reduction in the computational complexity of the original problem and enables a simple implementation of joint sparse recovery algorithms for full-rank setting. Secondly, we propose a new method for joint sparse recovery in the form of a non-convex optimization problem on a non-compact Stiefel manifold. In our numerical experiments our method outperforms the commonly used l 2,1 minimization in the sense that much fewer measurements are required for accurate sparse reconstructions. Here, we postulate this approach possesses the desirable rank aware property, that is, being able to take advantage of the rank of the unknown matrix to improve the recovery.

97 MATHEMATICS AND COMPUTING↗