Results for “cover optimization”

DOE OSTI2023

Printable, emissivity-adaptive and albedo-optimized covering for year-round energy saving

Radiative cooling uses high-emissivity materials to passively cool the surface of outdoor objects, such as building roofs on hot days. The issue of overcooling with this technology on cold days can be addressed by structures with thermal emissivity that is adaptive to temperature. Despite recent advances in temperature-adaptive structures, great challenges remain in their fabrication feasibility and unoptimized solar heating that may override the radiative cooling benefit. Here, in this work, we develop a printable, emissivity-adaptive and albedo-optimized covering (PEAC) based on recyclable materials with roll-to-roll fabrication. A PEAC automatically switches its sky-window emissivity from 0.25 to 0.85 when the surface temperature exceeds a pre-set transition temperature, delivering an albedo optimized for maximal year-round energy saving or thermal comfort in a given climate.

36 MATERIALS SCIENCE↗

NASA NTRS2024

Optimizing Thin Cover Layers for Optically Clear Electrodynamic Dust Shields

This project looked at optimizing the dielectric cover layer on top of an optically clear glass electrodynamic dust shield (EDS). The EDS is a device that uses high voltage electric fields to remove dust from surfaces. Currently, the EDS uses 2000 volts to remove dust, but by optimizing the cover layer and the geometry of the EDS, this voltage can be lowered to improve safety and reduce electromagnetic interference (EMI) and the complexity of supporting systems. This project was able to demonstrate successful dust clearing on an EDS with 750 volts in high vacuum (~1E-5 torr) conditions. The EDS had a trace spacing of 500 μm, and the Parylene C cover layer had a thickness of 25 μm. There is still a substantial amount of room for improvement of these devices, which may be able to push the operating voltage even lower.

Particulate Contamination↗

NASA NTRS1991

Intelligent perturbation algorithms for space scheduling optimization

Intelligent perturbation algorithms for space scheduling optimization are presented in the form of the viewgraphs. The following subject areas are covered: optimization of planning, scheduling, and manifesting; searching a discrete configuration space; heuristic algorithms used for optimization; use of heuristic methods on a sample scheduling problem; intelligent perturbation algorithms are iterative refinement techniques; properties of a good iterative search operator; dispatching examples of intelligent perturbation algorithm and perturbation operator attributes; scheduling implementations using intelligent perturbation algorithms; major advances in scheduling capabilities; the prototype ISF (industrial Space Facility) experiment scheduler; optimized schedule (max revenue); multi-variable optimization; Space Station design reference mission scheduling; ISF-TDRSS command scheduling demonstration; and example task - communications check.

Kurtzman, Clifford R.↗

NASA NTRS1974

Optimal aeroelastic design of an oblique wing structure

A procedure is presented for determining the optimal cover panel thickness of a wing structure to meet specified strength and static aeroelastic divergence requirements for minimum weight. Efficient reanalysis techniques using discrete structural and aerodynamic methods are used in conjunction with redesign algorithms driven by optimality criteria. The optimality conditions for the divergence constraint are established, and expressions are obtained for derivatives of the dynamic pressure at divergence with respect to design variables. The procedure is applied to an oblique wing aircraft where strength and stiffness are critical design considerations for sizing the cover thickness of the wing structure.

Gwin, L. B.↗

NASA NTRS2006

Optimal Control of Shock Wave Turbulent Boundary Layer Interactions Using Micro-Array Actuation

The intent of this study on micro-array flow control is to demonstrate the viability and economy of Response Surface Methodology (RSM) to determine optimal designs of micro-array actuation for controlling the shock wave turbulent boundary layer interactions within supersonic inlets and compare these concepts to conventional bleed performance. The term micro-array refers to micro-actuator arrays which have heights of 25 to 40 percent of the undisturbed supersonic boundary layer thickness. This study covers optimal control of shock wave turbulent boundary layer interactions using standard micro-vane, tapered micro-vane, and standard micro-ramp arrays at a free stream Mach number of 2.0. The effectiveness of the three micro-array devices was tested using a shock pressure rise induced by the 10 shock generator, which was sufficiently strong as to separate the turbulent supersonic boundary layer. The overall design purpose of the micro-arrays was to alter the properties of the supersonic boundary layer by introducing a cascade of counter-rotating micro-vortices in the near wall region. In this manner, the impact of the shock wave boundary layer (SWBL) interaction on the main flow field was minimized without boundary bleed.

Anderson, Bernhard H.↗

DOE OSTI2020

Recent advances in computational mathematics and applications

We are honored to bring you this special issue dedicated to recent advances in computational mathematics and applications in science and engineering. The papers in this special issue were presented in ”Conference on Computational Mathematics and Applications (CCMA)” held at the University of Nevada Las Vegas (UNLV) during October 25–27, 2019. The conference has attracted about 90 attendees from six countries. The 15 papers in the special issue comprise a diverse collection of theoretical numerical analysis as well as applications in various subjects. Topics cover optimal control of PDEs, discontinuous Galerkin methods, fluid flow in porous media, turbulence flow, static and moving interface problems, complex fluids composed by the mixture of Newtonian fluid and nematic (liquid crystal) flows, modeling of ocean–atmosphere system, image segmentation algorithm, uncertainty quantification problems for turbulence model and Maxwell’s equations, iterative solver for systems resulting from mixed methods, and novel methods for solving systems of nonlinear equations. As the Guest Editors we would like to thank Dr. Leland Jameson at NSF (National Science Foundation) for kindly supporting our conference proposal which made this conference possible. We would also like to thank Darren Sugrue from Elsevier who provided partial support for our conference, and Thennarasu Gunasekaran and his production team from Elsevier who produced this nice special issue. We are grateful to many people (Dr. Zhijian Wu, Lori Ornelas, Elsa Juarez, and many Ph.D. students) at the Department of Mathematical Sciences of UNLV who provided tremendous support for the conference. Finally, we very much appreciate all authors who contributed their precious results to this special issue.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1985

DSN 34-meter Antenna Optics Analysis for Wideband SETI Investigations

A DSN 34-meter symmetric Cassegrain antenna configuration is examined for wideband use over the frequency range of 1 to 10 GHz, rather than only at the narrow-band operational design frequencies of 2.295 GHz (S-band) and 8.448 GHz (X-band). Aperture efficiency and surface efficiency are calculated as the components determining the gain of the antenna. Noise temperature contributions arise from the ground, atmosphere, and quadripod scattering. These components are calculated as a function of frequency elevation angle to determine a G/T (gain/system noise temperature) figure-of-merit for a nominal 34-meter antenna configuration. A computational method was developed which will enable design of a multi-horn antenna feed system to optimally cover the 1 to 10 GHz frequency range.

Slobin, S. D.↗

NASA NTRS1998

Parallel Directionally Split Solver Based on Reformulation of Pipelined Thomas Algorithm

In this research an efficient parallel algorithm for 3-D directionally split problems is developed. The proposed algorithm is based on a reformulated version of the pipelined Thomas algorithm that starts the backward step computations immediately after the completion of the forward step computations for the first portion of lines This algorithm has data available for other computational tasks while processors are idle from the Thomas algorithm. The proposed 3-D directionally split solver is based on the static scheduling of processors where local and non-local, data-dependent and data-independent computations are scheduled while processors are idle. A theoretical model of parallelization efficiency is used to define optimal parameters of the algorithm, to show an asymptotic parallelization penalty and to obtain an optimal cover of a global domain with subdomains. It is shown by computational experiments and by the theoretical model that the proposed algorithm reduces the parallelization penalty about two times over the basic algorithm for the range of the number of processors (subdomains) considered and the number of grid nodes per subdomain.

Povitsky, A.↗

NASA NTRS1991

Optimization of composite sandwich cover panels subjected to compressive loadings

An analysis and design method is presented for the design of composite sandwich cover panels that includes transverse shear effects and damage tolerance considerations. This method is incorporated into an optimization program called SANDOP (SANDwich OPtimization). SANDOP is used in the present study to design optimized composite sandwich cover panels for transport aircraft wing applications as a demonstration of its capabilities. The results of this design study indicate that optimized composite sandwich cover panels have approximately the same structural efficiency as stiffened composite cover panels designed to identical constraints. Results indicate that inplane stiffness requirements have a large effect on the weight of these composite sandwich cover panels at higher load levels. Increasing the maximum allowable strain and the upper percentage limit of the 0 degree and plus or minus 45 degree plies can yield significant weight savings. The results show that the structural efficiency of these optimized composite sandwich cover panels is relatively insensitive to changes in core density.

Cruz, Juan R.↗

NASA NTRS1991

Optimization of composite sandwich cover panels subjected to compressive loadings

An analysis and design method is presented for the design of composite sandwich cover panels that include the transverse shear effects and damage tolerance considerations. This method is incorporated into a sandwich optimization computer program entitled SANDOP. As a demonstration of its capabilities, SANDOP is used in the present study to design optimized composite sandwich cover panels for for transport aircraft wing applications. The results of this design study indicate that optimized composite sandwich cover panels have approximately the same structural efficiency as stiffened composite cover panels designed to satisfy individual constraints. The results also indicate that inplane stiffness requirements have a large effect on the weight of these composite sandwich cover panels at higher load levels. Increasing the maximum allowable strain and the upper percentage limit of the 0 degree and +/- 45 degree plies can yield significant weight savings. The results show that the structural efficiency of these optimized composite sandwich cover panels is relatively insensitive to changes in core density. Thus, core density should be chosen by criteria other than minimum weight (e.g., damage tolerance, ease of manufacture, etc.).

Cruz, Juan R.↗

DOE OSTI2025

G-Mapper: Learning a Cover in the Mapper Construction

The Mapper algorithm is a visualization technique in topological data analysis (TDA) that outputs a graph reflecting the structure of a given dataset. However, the Mapper algorithm requires tuning several parameters in order to generate a “nice” Mapper graph. This paper focuses on selecting the cover parameter. We present an algorithm that optimizes the cover of a Mapper graph by splitting a cover repeatedly according to a statistical test for normality. Our algorithm is based on G-means clustering, which searches for the optimal number of clusters in 𝑘-means by iteratively applying the Anderson–Darling test. Our splitting procedure employs a Gaussian mixture model to carefully choose the cover according to the distribution of the given data. In conclusion, experiments for synthetic and real-world datasets demonstrate that our algorithm generates covers so that the Mapper graphs retain the essence of the datasets, while also running significantly faster than a previous iterative method.

G-means clustering↗

NASA NTRS1989

Optimal q-Markov COVER for finite precision implementation

The existing q-Markov COVER realization theory does not take into account the problems of arithmetic errors due to both the quantization of states and coefficients of the reduced order model. All q-Markov COVERs allow some freedom in the choice of parameters. Here, researchers exploit this freedom in the existing theory to optimize the models with respect to these finite wordlength effects.

Williamson, Darrell↗

NASA NTRS1975

Research in orbit determination optimization for space trajectories

Research data covering orbit determination, optimization techniques, and trajectory design for manned space flights are summarized.

Pines, S.↗

NASA NTRS1979

Design of transonic airfoil sections using a similarity theory

In the present paper, it is shown that numerical optimization is a powerful tool for designing transonic wings and airfoils. Nixon's (1978) similarity theory is extended to cover design optimization problems. Some ground rules for designing shock-free airfoils are proposed and their application is demonstrated by examples. Advantages which accrue from integrating similarity theory into the numerical optimization procedure are noted.

Nixon, D.↗

NASA NTRS1978

Needs and trends in structural dynamics

The paper discusses dynamic analyses and testing of aerospace vehicles and the application of such analyses and testing to nonaerospace fields. Items covered in the section on dynamic analyses of aerospace vehicles include self-induced and forced oscillatory loads, approaches to dynamic modeling and analysis, nonlinear analyses, and integrated dynamics design and optimization. Items covered in the section on the dynamic testing of aerospace vehicles include integrated test philosophy, test facilities, and ways of improving performance and reducing costs. The nonaerospace applications that are discussed include ground and water transportation, medicine, and nuclear power plants.

Morosow, G.↗

DOE OSTI2020

Dakota A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis: Version 6.12 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Dakota A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis (V.6.14) (Theory Manual)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.13 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗