Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational 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,099 records · Page 61

Optimization on a Network-based Parallel Computer System for Supersonic Laminar Wing Design

A set of Computational Fluid Dynamics (CFD) routines and flow transition prediction tools are integrated into a network based parallel numerical optimization routine. Through this optimization routine, the design of a 2-D airfoil and an infinitely swept wing will be studied in order to advance the design cycle capability of supersonic laminar flow wings. The goal of advancing supersonic laminar flow wing design is achieved by wisely choosing the design variables used in the optimization routine. The design variables are represented by the theory of Fourier series and potential theory. These theories, combined with the parallel CFD flow routines and flow transition prediction tools, provide a design space for a global optimal point to be searched. Finally, the parallel optimization routine enables gradient evaluations to be performed in a fast and parallel fashion.

Garcia, Joseph A.↗

Robust optimization for intensity-modulated proton therapy with soft spot sensitivity regularization

In this work, we developed a novel computationally efficient robust optimization method for IMPT. The robustness is calculated as the spot sensitivity to both range and shift perturbations. The dose fidelity term is then regularized by the sensitivity term for the flexibility and trade-off between the dosimetry and the robustness. In the stress test, SenR is more resilient to unexpected uncertainties. These advantages in combination with its fast computation time make it a viable candidate for clinical IMPT planning.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Large-Scale Numerical Simulations of Human Motion

This paper examines the feasibility of using massively-parallel and vector-processing supercomputers to solve large-scale optimal control problems for human movement. Specifically, we compare the computational expense of determining the optimal controls for the single support phase of walking using a conventional serial machine (a Silicon Graphics Personal Iris 4D25 workstation), a MIMD parallel machine (an Intel iPSC/860 comprising 128 processors), and a parallel-vector-processing machine (a Cray Y-MP 8/864). With the human body modeled as a 14 degree-of-freedom linkage actuated by 46 musculotendinous units, computation of the optimal controls for walking could take up to 3 months of CPU time on the Iris. Both the Cray Y-MP and the Intel iPSC/860 are able to reduce this time to practical levels. The optimal control solution for walking can be found with about 77 hours of CPU time on the Cray, and with about 88 hours of CPU time on the Intel. Although the overall speeds of the Cray and the Intel were found to be similar, the unique capabilities of each machine are best suited to different parts of the optimal control algorithm used. The Intel performed best in the calculation of the derivatives of the performance criterion and the constraints. In contrast, the Cray performed best during parameter optimization of the controls. These results suggest that the ideal computer architecture for solving very large-scale optimal control problems is a hybrid system in which a vector-processing machine is integrated into the communication network of a MIMD parallel machine.

Anderson, Frank C.↗

Efficient Method for Optimizing Placement of Sensors

A computationally efficient method has been developed to enable optimization of the placement of sensors for the purpose of diagnosis of a complex engineering system (e.g., an aircraft or spacecraft). The method can be used both in (1) designing a sensor system in which the number and positions of sensors are initially not known and must be determined and (2) adding sensors to a pre-existing system to increase the diagnostic capability. The optimal-sensor-placement problem can be summarized as involving the following concepts, issues, and subproblems: a) Degree of Diagnosability - This is a concept for characterizing the set of faults that can be discriminated by use of a given set of sensors. b) Minimal Sensor Set - The idea is one of finding a minimal set of sensors that guarantees a specific degree of diagnosability. c) Minimal-Cost Sensors - In a case in which different sensors are assigned with different costs, it is desired to choose the least costly set of sensors that affords a specific degree of diagnosability.

Fijany, Amir↗

Quantum Technologies for UAS (QTech)

Harness the power of quantum technologies to assure the availability of UAS communications against disruptions. Make use of quantum computing (e.g. quantum optimization) and quantum communication (e.g. quantum key distribution) to address the availability cybersecurity challenge. Our approach is three-fold: (1) Utilize quantum optimization algorithms to design robust network with routing redundancy that can respond adaptively to dynamically changing real-time environment and disruptions, (2) Utilize quantum optimization algorithms resource allocation for detection, localization, and tracking of mobile communication disruption agents, (3) Utilize quantum key distribution (QKD) to execute secure key sharing in high data rate optical communication and/or anti-jamming protocols for secure RF communication.

Quantum Computing↗

Computationally restoring the potency of a clinical antibody against Omicron

The COVID-19 pandemic underscored the promise of monoclonal antibody-based prophylactic and therapeutic drugs and revealed how quickly viral escape can curtail effective options. When the SARS-CoV-2 Omicron variant emerged in 2021, many antibody drug products lost potency, including Evusheld and its constituent, cilgavimab. Cilgavimab, like its progenitor COV2-2130, is a class 3 antibody that is compatible with other antibodies in combination4 and is challenging to replace with existing approaches. Rapidly modifying such high-value antibodies to restore efficacy against emerging variants is a compelling mitigation strategy. We sought to redesign and renew the efficacy of COV2-2130 against Omicron BA.1 and BA.1.1 strains while maintaining efficacy against the dominant Delta variant. Here we show that our computationally redesigned antibody, 2130-1-0114-112, achieves this objective, simultaneously increases neutralization potency against Delta and subsequent variants of concern, and provides protection in vivo against the strains tested: WA1/2020, BA.1.1 and BA.5. Deep mutational scanning of tens of thousands of pseudovirus variants reveals that 2130-1-0114-112 improves broad potency without increasing escape liabilities. Our results suggest that computational approaches can optimize an antibody to target multiple escape variants, while simultaneously enriching potency. Our computational approach does not require experimental iterations or pre-existing binding data, thus enabling rapid response strategies to address escape variants or lessen escape vulnerabilities.

60 APPLIED LIFE SCIENCES↗

Multiplexed Anodic Stripping Voltammetry Detection of Heavy Metals in Water Using Nanocomposites Modified Screen-Printed Electrodes Integrated With a 3D-Printed Flow Cell

In this study, we present multiplexed anodic stripping voltammetry (ASV) detection of heavy metal ions (HMIs)—As(III), Cd(II), and Pb(II)—using a homemade electrochemical cell consisting of dual working, reference and counter screen-printed electrodes (SPE) on polyimide substrate integrated with a 3D-printed flow cell. Working and counter electrodes were fabricated by the screen-printing of graphite paste while the Ag/AgCl paste was screen-printed as a reference electrode (Ag/AgCl quasi-reference electrode). The working electrodes were modified with (BiO) 2 CO 3 -reduced graphene oxide (rGO)-Nafion [(BiO) 2 CO 3 -rGO-Nafion] and Fe 3 O 4 magnetic nanoparticles (Fe 3 O 4 MNPs) decorated Au nanoparticles (AuNPs)-ionic liquid (IL) (Fe 3 O 4 -Au-IL) nanocomposites separately to enhance HMIs sensing. Electrochemical detection was achieved using square wave ASV technique. The desired structure of the flow electrochemical cell was optimized by the computational fluid dynamic (CFD). Different experimental parameters for stripping analysis of HMIs were optimized including deposition time, deposition potential and flow rate. The linear range of calibration curves with the sensing nanocomposites modified SPE for the three metal ions was from 0–50 μg/L. The limits of detection (S/N = 3) were estimated to be 2.4 μg/L for As(III), 1.2 μg/L for Pb(II) and 0.8 μg/L for Cd(II). Furthermore, the homemade flow anodic stripping sensor platform was used to detect HMIs in simulated river water with a 95–101% recovery, indicating high selectivity and accuracy and great potential for applicability even in complex matrices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computation of forces and stresses in solids: Towards accurate structural optimization with auxiliary-field quantum Monte Carlo

The accurate computation of forces and other energy derivatives has been a long-standing challenge for quantum Monte Carlo methods. A number of technical obstacles contribute to this challenge. We discuss how these obstacles can be removed with the auxiliary-field quantum Monte Carlo (AFQMC) approach. AFQMC is a general, high-accuracy, many-body total-energy method for molecules and solids. The implementation of back-propagation for pure estimators allows direct calculation of gradients of the energy via the Hellmann-Feynman theorem. A planewave basis with norm-conserving pseudopotentials is used for the study of periodic bulk materials. Completeness of the planewave basis minimizes the effect of so-called Pulay terms. The ionic pseudopotentials, which can be incorporated in AFQMC in exactly the same manner as in standard independent-electron methods, regulate the force and stress estimators and eliminate any potential divergence of the Monte Carlo variances. The resulting approach allows applications of full geometry optimizations in bulk materials. As a result, it also paves the way for many-body computations of the phonon spectrum in solids.

36 MATERIALS SCIENCE↗

Exploration of Optimizing FPGA-based Qubit Controller for Experiments on Superconducting Quantum Computing Hardware

This work explores avenues and target areas for optimizing FPGA-based control hardware for experiments conducted on superconducting quantum computing systems and serves as an introduction to some of the current research at the intersection of classical and quantum computing hardware. With the promise of building larger-scale error-corrected quantum computers based on superconducting qubit architecture, innovations to room-temperature control electronics are needed to bring these quantum realizations to fruition. The QICK (Quantum Instrumentation Control Kit) is one leading experimental FPGA-based implementations. However, its integration into other experimental quantum computing architectures, especially those using superconducting radiofrequency (SRF) cavities, is largely unexplored. We identify some key target areas for optimizing control electronics for superconducting qubit architectures and provide some preliminary results to the resolution of a control pulse waveform. With optimizations targeted at 3D superconducting qubit setups, we hope to bring to light some of the requirements in classical computational methodologies to bring out the full potential of this quantum computing architecture, and to convey the excitement of progress in this research.

43 PARTICLE ACCELERATORS↗

Unstructured Finite Volume Computational Thermo-Fluid Dynamic Method for Multi-Disciplinary Analysis and Design Optimization

This paper describes a finite volume computational thermo-fluid dynamics method to solve for Navier-Stokes equations in conjunction with energy equation and thermodynamic equation of state in an unstructured coordinate system. The system of equations have been solved by a simultaneous Newton-Raphson method and compared with several benchmark solutions. Excellent agreements have been obtained in each case and the method has been found to be significantly faster than conventional Computational Fluid Dynamic(CFD) methods and therefore has the potential for implementation in Multi-Disciplinary analysis and design optimization in fluid and thermal systems. The paper also describes an algorithm of design optimization based on Newton-Raphson method which has been recently tested in a turbomachinery application.

Majumdar, Alok↗

Nacelle/Diverter Integration into the Design Optimization Process Using Pseudo, Warped, and Real Nacelles

The computational results of the optimized complete configurations, including nacelles and diverters, are presented in terms of drag count improvement compared with the TCA baseline configuration at Mach 2.4, C(sub L)=0.1. The three candidate designs are designated by the organization from which they were derived. ARC represents the Ames Research Center 1-03 design, BCAG represents the Boeing Commercial Aircraft Group's design from Seattle, and BLB represents the design from Boeing Long Beach. All CFD methods are in unanimous agreement that the Ames 1-03 configuration has the largest performance improvement, followed closely by the BCAG configuration, with a much smaller improvement attained by Boeing Long Beach. The Ames design was obtained using the single-block wing/body code SYN87-SB with its "pseudo" nacelle option-an elaborate technique for incorporating nacelle/diverter effects into the design optimization process. This technique uses AIRPLANE surface pressure coefficient data with and without the nacelles/diverters. Further details of this method are described. It is reasonable to expect that further improvements could be achieved by including the "real" nacelles directly into the optimization process by use of the newly-developed multiblock optimization code, SYN107-MB, which can handle full configurations.

Cliff, Susan E.↗

Adaptive Sampling of Time Series During Remote Exploration

This work deals with the challenge of online adaptive data collection in a time series. A remote sensor or explorer agent adapts its rate of data collection in order to track anomalous events while obeying constraints on time and power. This problem is challenging because the agent has limited visibility (all its datapoints lie in the past) and limited control (it can only decide when to collect its next datapoint). This problem is treated from an information-theoretic perspective, fitting a probabilistic model to collected data and optimizing the future sampling strategy to maximize information gain. The performance characteristics of stationary and nonstationary Gaussian process models are compared. Self-throttling sensors could benefit environmental sensor networks and monitoring as well as robotic exploration. Explorer agents can improve performance by adjusting their data collection rate, preserving scarce power or bandwidth resources during uninteresting times while fully covering anomalous events of interest. For example, a remote earthquake sensor could conserve power by limiting its measurements during normal conditions and increasing its cadence during rare earthquake events. A similar capability could improve sensor platforms traversing a fixed trajectory, such as an exploration rover transect or a deep space flyby. These agents can adapt observation times to improve sample coverage during moments of rapid change. An adaptive sampling approach couples sensor autonomy, instrument interpretation, and sampling. The challenge is addressed as an active learning problem, which already has extensive theoretical treatment in the statistics and machine learning literature. A statistical Gaussian process (GP) model is employed to guide sample decisions that maximize information gain. Nonsta tion - ary (e.g., time-varying) covariance relationships permit the system to represent and track local anomalies, in contrast with current GP approaches. Most common GP models are stationary, e.g., the covariance relationships are time-invariant. In such cases, information gain is independent of previously collected data, and the optimal solution can always be computed in advance. Information-optimal sampling of a stationary GP time series thus reduces to even spacing, and such models are not appropriate for tracking localized anomalies. Additionally, GP model inference can be computationally expensive.

Thompson, David R.↗

Understanding the Design Space of Sparse/Dense Multiphase Dataflows for Mapping Graph Neural Networks on Spatial Accelerators

Graph Neural Networks (GNNs) have garnered a lot of recent interest because of their success in learning representations from graph-structured data across several critical applications in cloud and HPC. Owing to their unique compute and memory characteristics that come from an interplay between dense and sparse phases of computations, the emergence of reconfigurable dataflow (aka spatial) accelerators offers promise for acceleration by mapping optimized dataflows (i.e., computation order and parallelism) for both phases. The goal of this work is to characterize and understand the design-space of dataflow choices for running GNNs on spatial accelerators in order for the compilers to optimize the dataflow based on the workload. Specifically, we propose a taxonomy to describe all possible choices for mapping the dense and sparse phases of GNNs spatially and temporally over a spatial accelerator, capturing both the intra-phase dataflow and the inter-phase (pipelined) dataflow. Using this taxonomy, we do deep-dives into the cost and benefits of several dataflows and perform case studies on implications of hardware parameters for dataflows and value of flexibility to support pipelined execution.

97 MATHEMATICS AND COMPUTING↗

Optimal Twirling Depth for Classical Shadows in the Presence of Noise

The classical shadows protocol is an efficient strategy for estimating properties of an unknown state p using a small number of state copies and measurements. In its original form, it involves twirling the state with unitaries from some ensemble and measuring the twirled state in a fixed basis. It was recently shown that for computing local properties, optimal sample complexity (copies of the state required) is remarkably achieved for unitaries drawn from shallow depth circuits composed of local entangling gates, as opposed to purely local (zero depth) or global twirling (infinite depth) ensembles. Here, we consider the sample complexity as a function of the depth of the circuit, in the presence of noise. We find that this noise has important implications for determining the optimal twirling ensemble. Under fairly general conditions, we (i) show that any single-site noise can be accounted for using a depolarizing noise channel with an appropriate damping parameter f, (ii) compute thresholds f th at which optimal twirling reduces to local twirling for Pauli operators, (iii) nth order Renyi entropies (n ≥2), and (iv) provide a meaningful upper bound t max on the optimal circuit depth for any finite noise strength f, which applies to observables and entanglement entropy measurements. In conclusion, these thresholds strongly constrain the search for optimal strategies to implement shadow tomography and are easily tailored to the experimental system at hand.

97 MATHEMATICS AND COMPUTING↗

Optimization of Aerospace Structure Subject to Damage Tolerance Criteria

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

Akgun, Mehmet A.↗

Path optimization with limited sensing ability

We propose a computational strategy to find the optimal path for a mobile sensor with limited coverage to traverse a cluttered region. The goal is to find one of the shortest feasible paths to achieve the complete scan of the environment. We pose the problem in the level set framework, and first consider a related question of placing multiple stationary sensors to obtain the full surveillance of the environment. By connecting the stationary locations using the nearest neighbor strategy, we form the initial guess for the path planning problem of the mobile sensor. Then the path is optimized by reducing its length, via solving a system of ordinary differential equations (ODEs), while maintaining the complete scan of the environment. Furthermore, we use intermittent diffusion, which converts the ODEs into stochastic differential equations (SDEs), to find an optimal path whose length is globally minimal. To improve the computation efficiency, we introduce two techniques, one to remove redundant connecting points to reduce the dimension of the system, and the other to deal with the entangled path so the solution can escape the local traps. Numerical examples are shown to illustrate the effectiveness of the proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗