Search NASA⌕ Search

SEARCH · Search NASA

Results for “multilevel 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 127 records · Page 7

Optimal resolution in maximum entropy image reconstruction from projections with multigrid acceleration

We consider the problem of image reconstruction from a finite number of projections over the space L(sup 1)(Omega), where Omega is a compact subset of the set of Real numbers (exp 2). We prove that, given a discretization of the projection space, the function that generates the correct projection data and maximizes the Boltzmann-Shannon entropy is piecewise constant on a certain discretization of Omega, which we call the 'optimal grid'. It is on this grid that one obtains the maximum resolution given the problem setup. The size of this grid grows very quickly as the number of projections and number of cells per projection grow, indicating fast computational methods are essential to make its use feasible. We use a Fenchel duality formulation of the problem to keep the number of variables small while still using the optimal discretization, and propose a multilevel scheme to improve convergence of a simple cyclic maximization scheme applied to the dual problem.

Limber, Mark A.↗

Multigrid with Overlapping Patches

Solving boundary value problems with optimal efficiency requires adaptivity and multilevel techniques. Previously, an implementation of the AFACx algorithm is presented that is based on rectangular Cartesian grids. This implementation does not allow for the over]ap of grids that lie on the same level of refinement. We investigate the case in which these grids overlap. A standard technique for overlapping grids is the Schwarz algorithm. Some ways of using the Schwarz algorithm in a standard multigrid scheme are presented. Also, a problem that arises in some situations with non-aligned, overlapping grids is described. This situation comes up in a natural way when the Schwarz algorithm is used as a relaxation scheme within a multilevel algorithm. We identify the reason for the bad convergence and show that by more sophisticated interpolation the difficulties can be overcome. Then we present a multiplicative Schwarz algorithm for a large number of grids that has a high potential for parallelization. Finally we give some numerical results for the FACx algorithm with overlapping grids on each refinement level. The implementation of the described codes uses C++ and the array class libraries A++ and P++. Using the A++/P++ programming environment, it was possible to move from a serial code to a parallel code within a few days.

Berndt, Markus↗

Parallel Element Agglomeration Algebraic Multigrid and Upscaling Library

ParFELAG is a parallel distributed memory C++ library for numerical upscaling of finite element discretizations. It provides optimal complesity algorithms ro build multilevel hierarchies and solvers that can be used for solving a wide class of partial differential equations (elliptic, hyperbolic, saddle point problems) on general unstructured mesh (under the assumption that the topology of the agglomerated entities is correct). Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.

Source record↗

Parallel Element Agglomeration Algebraic Multigrid and Upscaling Library

ParELAG is a parallel C++ library for numerical upscaling of finite element discretizations and element-based algebraic multigrid solvers. It provides optimal complexity algorithms to build multilevel hierarchies and solvers that can be used for solving a wide class of partial differential equations (elliptic, hyperbolic, saddle point problems) on general unstructured meshes. Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.

Barker, Andrew T.↗

Optimizing Asynchronous Multi-Level Checkpoint/Restart Configurations with Machine Learning

With the emergence of versatile storage systems, multi-level checkpointing (MLC) has become a common approach to gain efficiency. However, multi-level checkpoint/restart can cause enormous I/O traffic on HPC systems. To use multilevel checkpointing efficiently, it is important to optimize check-point/restart configurations. Current approaches, namely modeling and simulation, are either inaccurate or slow in determining the optimal configuration for a large scale system. In this paper, we show that machine learning models can be used in combination with accurate simulation to determine the optimal checkpoint configurations. We also demonstrate that more advanced techniques such as neural networks can further improve the performance in optimizing checkpoint configurations.

checkpoint-restart↗

Development of Multiobjective Optimization Techniques for Sonic Boom Minimization

A discrete, semi-analytical sensitivity analysis procedure has been developed for calculating aerodynamic design sensitivities. The sensitivities of the flow variables and the grid coordinates are numerically calculated using direct differentiation of the respective discretized governing equations. The sensitivity analysis techniques are adapted within a parabolized Navier Stokes equations solver. Aerodynamic design sensitivities for high speed wing-body configurations are calculated using the semi-analytical sensitivity analysis procedures. Representative results obtained compare well with those obtained using the finite difference approach and establish the computational efficiency and accuracy of the semi-analytical procedures. Multidisciplinary design optimization procedures have been developed for aerospace applications namely, gas turbine blades and high speed wing-body configurations. In complex applications, the coupled optimization problems are decomposed into sublevels using multilevel decomposition techniques. In cases with multiple objective functions, formal multiobjective formulation such as the Kreisselmeier-Steinhauser function approach and the modified global criteria approach have been used. Nonlinear programming techniques for continuous design variables and a hybrid optimization technique, based on a simulated annealing algorithm, for discrete design variables have been used for solving the optimization problems. The optimization procedure for gas turbine blades improves the aerodynamic and heat transfer characteristics of the blades. The two-dimensional, blade-to-blade aerodynamic analysis is performed using a panel code. The blade heat transfer analysis is performed using an in-house developed finite element procedure. The optimization procedure yields blade shapes with significantly improved velocity and temperature distributions. The multidisciplinary design optimization procedures for high speed wing-body configurations simultaneously improve the aerodynamic, the sonic boom and the structural characteristics of the aircraft. The flow solution is obtained using a comprehensive parabolized Navier Stokes solver. Sonic boom analysis is performed using an extrapolation procedure. The aircraft wing load carrying member is modeled as either an isotropic or a composite box beam. The isotropic box beam is analyzed using thin wall theory. The composite box beam is analyzed using a finite element procedure. The developed optimization procedures yield significant improvements in all the performance criteria and provide interesting design trade-offs. The semi-analytical sensitivity analysis techniques offer significant computational savings and allow the use of comprehensive analysis procedures within design optimization studies.

Chattopadhyay, Aditi↗

Bridging Python to Silicon: The SODA Toolchain

Systems performing scientific computing, data analysis, and machine learning tasks have a growing demand for application-specific accelerators that can provide high computational performance while meeting strict size and power requirements. However, the algorithms and applications that need to be accelerated are evolving at a rate that is incompatible with manual design processes based on hardware description languages. Agile hardware design tools based on compiler techniques can help by quickly producing an application-specific integrated circuit (ASIC) accelerator starting from a high-level algorithmic description. Here, we present the software-defined accelerator (SODA) synthesizer, a modular and open-source hardware compiler that provides automated end-to-end synthesis from high-level software frameworks to ASIC implementation, relying on multilevel representations to progressively lower and optimize the input code. Our approach does not require the application developer to write any register-transfer level code, and it is able to reach up to 364 giga floating point operations per second (GFLOPS)/W efficiency (32-bit precision) on typical convolutional neural network operators.

97 MATHEMATICS AND COMPUTING↗

MatRIS: Addressing the Challenges for Portability and Heterogeneity Using Tasking for Matrix Decomposition (Cholesky)

The ubiquitous in-node heterogeneity of HPC and cloud computing platforms makes software portability and performance optimization extremely challenging. Described here, the MatRIS multilevel math library abstraction framework employs tasking to alleviate these difficulties. MatRIS includes the IRIS task-based runtime on the bottom level and exposes different layers of abstraction to render algorithms architecturally agnostic. MatRIS ensures the decomposition and creation of tasks that represent the necessary encapsulation of the optimized kernels from both vendor and open-source math libraries. Once built, MatRIS can select different combinations of accelerators at runtime, making it portable even on diverse heterogeneous architectures. By leveraging the IRIS runtime’s features for managing heterogeneity, MatRIS deploys algorithms that remove the need to specify orchestration and data transfer. This study describes how the serial task abstraction of a tiled Cholesky factorization is made portable and scalable in the case of multi-device and multi-vendor heterogeneity on a node with NVIDIA and AMD GPUs by using MatRIS. First, we demonstrate that Cholesky in MatRIS provides multi-GPU scalability that offers competitive performance versus cuSolverMG. Then, we present the challenges and opportunities for heterogeneous execution.

Monil, M. A. H.↗

Practical implementation of an accurate method for multilevel design sensitivity analysis

Solution techniques for handling large scale engineering optimization problems are reviewed. Potentials for practical applications as well as their limited capabilities are discussed. A new solution algorithm for design sensitivity is proposed. The algorithm is based upon the multilevel substructuring concept to be coupled with the adjoint method of sensitivity analysis. There are no approximations involved in the present algorithm except the usual approximations introduced due to the discretization of the finite element model. Results from the six- and thirty-bar planar truss problems show that the proposed multilevel scheme for sensitivity analysis is more effective (in terms of computer incore memory and the total CPU time) than a conventional (one level) scheme even on small problems. The new algorithm is expected to perform better for larger problems and its applications on the new generation of computer hardwares with 'parallel processing' capability is very promising.

Nguyen, Duc T.↗

Understanding Multilevel Selection May Facilitate Management of Arbuscular Mycorrhizae in Sustainable Agroecosystems

Studies in natural ecosystems show that adaptation of arbuscular mycorrhizal (AM) fungi and other microbial plant symbionts to local environmental conditions can help ameliorate stress and optimize plant fitness. This local adaptation arises from the process of multilevel selection, which is the simultaneous selection of a hierarchy of groups. Studies of multilevel selection in natural ecosystems may inform the creation of sustainable agroecosystems through developing strategies to effectively manage crop microbiomes including AM symbioses. Field experiments show that the species composition of AM fungal communities varies across environmental gradients, and that the biomass of AM fungi and their benefits for plants generally diminish when fertilization and irrigation eliminate nutrient and water limitations. Furthermore, pathogen protection by mycorrhizas is only important in environments prone to plant damage due to pathogens. Consequently, certain agricultural practices may inadvertently select for less beneficial root symbioses because the conventional agricultural practices of fertilization, irrigation, and use of pesticides can make these symbioses superfluous for optimizing crop performance. The purpose of this paper is to examine how multilevel selection influences the flow of matter, energy, and genetic information through mycorrhizal microbiomes in natural and agricultural ecosystems, and propose testable hypotheses about how mycorrhizae may be actively managed to increase agricultural sustainability.

59 BASIC BIOLOGICAL SCIENCES↗

An improved computational approach for multilevel optimum design

A penalty-function algorithm employing Newton's method with approximate second derivatives (Haftka and Starnes, 1980) is developed for two-level hierarchical design optimization problems. The difficulties posed by discontinuous behavior in typical multilevel problems are explained and illustrated for the case of a three-bar truss; the algorithm is formulated; and its advantages are demonstrated in the problem of a portal framework having three beams (described by six cross-section parameters), subjected to two loading conditions, and to be constructed in six different materials for comparison. The final design parameters are listed in a table.

Haftka, R. T.↗

Integrated structure/control design - Present methodology and future opportunities

Attention is given to current methodology applied to the integration of the optimal design process for structures and controls. Multilevel linear decomposition techniques proved to be most effective in organizing the computational efforts necessary for ISCD (integrated structures and control design) tasks. With the development of large orbiting space structures and actively controlled, high performance aircraft, there will be more situations in which this concept can be applied.

Weisshaar, T. A.↗

Toward an optimal online checkpoint solution under a two-level HPC checkpoint model

The traditional single-level checkpointing method suffers from significant overhead on large-scale platforms. Hence, multilevel checkpointing protocols have been studied extensively in recent years. The multilevel checkpoint approach allows different levels of checkpoints to be set (each with different checkpoint overheads and recovery abilities), in order to further improve the fault tolerance performance of extreme-scale HPC applications. How to optimize the checkpoint intervals for each level, however, is an extremely difficult problem. In this paper, we construct an easy-to-use two-level checkpoint model. Checkpoint level 1 deals with errors with low checkpoint/recovery overheads such as transient memory errors, while checkpoint level 2 deals with hardware crashes such as node failures. Compared with previous optimization work, our new optimal checkpoint solution offers two improvements: (1) it is an online solution without requiring knowledge of the job length in advance, and (2) it shows that periodic patterns are optimal and determines the best pattern. We evaluate the proposed solution and compare it with the most up-to-date related approaches on an extreme-scale simulation testbed constructed based on a real HPC application execution. Simulation results show that our proposed solution outperforms other optimized solutions and can improve the performance significantly in some cases. Specifically, with the new solution the wall-clock time can be reduced by up to 25.3% over that of other state-of-the-art approaches. Lastly, a brute-force comparison with all possible patterns shows that our solution is always within 1% of the best pattern in the experiments.

97 MATHEMATICS AND COMPUTING↗

Multi-output multilevel best linear unbiased estimators via semidefinite programming

Multifidelity forward uncertainty quantification (UQ) problems often involve multiple quantities of interest and heterogeneous models (e.g., different grids, equations, dimensions, physics, surrogate and reduced-order models). While computational efficiency is key in this context, multi-output strategies in multilevel/multifidelity methods are either sub-optimal or non-existent. In this paper we extend multilevel best linear unbiased estimators (MLBLUE) to multi-output forward UQ problems and we present new semidefinite programming formulations for their optimal setup. Not only do these formulations yield the optimal number of samples required, but also the optimal selection of low-fidelity models to use. While existing MLBLUE approaches are single-output only and require a non-trivial nonlinear optimization procedure, the new multi-output formulations can be solved reliably and efficiently. Here, we demonstrate the efficacy of the new methods and formulations in practical UQ problems with model heterogeneity.

97 MATHEMATICS AND COMPUTING↗

A Generic Two-Vector Model Predictive Control for Hybrid Multilevel Converters

In this article, a generic two-vector model predictive control (TV-MPC) strategy is proposed for the hybrid multilevel converters (HMCs). The proposed method selects two optimal voltage vectors among all the vector candidates using a geometric positioning approach to reduce the computational burden, which is a common issue in the existing MPC methods for HMC. Then duty cycles of the two selected vectors are optimized to minimize the current tracking error, such that the current tracking performance can be enhanced compared with the conventional MPC. In addition, the voltages of the floating dc capacitors can be balanced by evaluating all switching sequences that belong to the optimal voltage vectors with optimal duty cycles. Here, the concept of the proposed TV-MPC is generic and applicable for any HMCs. A typical HMC based on active neutral-point-clamped topology is adopted as a case study in this work. Comprehensive simulation and experimental studies are performed on an all silicon-carbide HMC prototype to validate the effectiveness of the proposed control scheme.

42 ENGINEERING↗

A resettable in-line particle concentrator using AC electrokinetics for distributed monitoring of microalgae in source waters

Green algae have been studied as an important and effective biomarker to indicate water quality due to their sensitivity to toxic agents in freshwater sources. But, conventional methods to monitor algal physiology use a chlorophyll fluorometer whose use is hampered by high-cost, large footprint, and limited sensitivity for practical samples containing low algal concentration. In order to overcome these constraints, we developed a multi-level electrode platform for resettable trapping of algae via AC electro-osmosis (ACEO) and negative dielectrophoresis. Preliminary experiments were performed in freshwater with conductivity of 0.02 S/m. Algal trapping was demonstrated at a low voltage of 2 V. The concentration effect was experimentally verified by measuring the fluorescence intensity of algae and using hemocytometer counting chambers at the inlet and outlet of the multilevel microchannel lab-on-a-chip. An optimal frequency was found for trapping, which agrees with the frequency dependence of ACEO flow velocity. Through-flow rate and electrode dimensions were optimized as well. Trapping efficiencies within the range of 26% - 65% have been obtained. A maximum trapping rate of 182 cells/s was obtained with a flow rate of 20 l/min. Our lab-on-a-chip shows high potential for improving the limit of detection in algal monitoring and enabling the development of a portable, integrated and automated system for monitoring the quality of source drinking waters.

30 DIRECT ENERGY CONVERSION↗

High efficiency ground data transmission

It is demonstrated that state-of-the-art communications technology can be implemented and reliably operated on a global basis to increase the transmission rates and efficiencies on circuits with bandwidths greater than the typical speech channel. Optimization is affected by optimum clock recovery procedures, multilevel pulse amplitude modulation, single sideband amplitude modulation, transversal filter equalizers, data scrambling, and active compensation for phase instability.

Dickinson, W. B.↗

Using a derivative-free optimization method for multiple solutions of inverse transport problems

Identifying unknown components of an object that emits radiation is an important problem for national and global security. Radiation signatures measured from an object of interest can be used to infer object parameter values that are not known. This problem is called an inverse transport problem. An inverse transport problem may have multiple solutions and the most widely used approach for its solution is an iterative optimization method. This paper proposes a stochastic derivative-free global optimization algorithm to find multiple solutions of inverse transport problems. The algorithm is an extension of a multilevel single linkage (MLSL) method where a mesh adaptive direct search (MADS) algorithm is incorporated into the local phase. Furthermore, numerical test cases using uncollided fluxes of discrete gamma-ray lines are presented to show the performance of this new algorithm.

42 ENGINEERING↗