Search NASA⌕ Search

SEARCH · Search NASA

Results for “Robust solver”

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 37 records · Page 2

Recent Advances of PyROS: A Pyomo Solver for Nonconvex Two-Stage Robust Optimization in Process Systems Engineering

This poster highlights uncertainty and technical risk reduction capabilities in CCSI2, with a focus on robust optimization. It presents recent advances of the two-stage robust optimization (RO) solver PyROS and applications to advanced energy systems optimization. To demonstrate the computational performance and reliability of PyROS, a benchmarking study on a library of over 8,500 small-scale RO problems is presented. Further, PyROS is used to obtain robust system designs of a MEA-based CO2 absorber under uncertainty in the thermodynamic property models for a variety of CO2 capture rate threshold requirements. Overall, the results demonstrate that the PyROS solver, including recent extensions to multi-stage RO settings, provides a reliable avenue to optimize the design and operation of advanced energy systems subject to various sources of parametric uncertainty.

Sherman, Jason↗

Recent Advances in PyROS: The Pyomo Solver for Two-Stage Nonconvex Robust Optimization

The slides present recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. Overall, the results highlight the effectiveness of PyROS for obtaining robust solutions to optimization problems with uncertain equality constraints.

Sherman, Jason↗

Recent Advances in PyROS: The Pyomo Solver for Two-Stage Nonconvex Robust Optimization

The slides present recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. Overall, the results highlight the effectiveness of PyROS for obtaining robust solutions to optimization problems with uncertain equality constraints.

Sherman, Jason↗

Recent Advances of PyROS: A Pyomo Solver for Nonconvex Two-Stage Robust Optimization in Process Systems Engineering

The document presents recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. An amine-based CO2 capture case study is presented to demonstrate the utility of PyROS for large-scale process models. Overall, the results highlight the effectiveness of PyROS for obtaining robust solutions to optimization problems with uncertain equality constraints.

Sherman, Jason↗

Toward robust scalable algebraic multigrid solvers.

This talk highlights some multigrid challenges that arise from several application areas including structural dynamics, fluid flow, and electromagnetics. A general framework is presented to help introduce and understand algebraic multigrid methods based on energy minimization concepts. Connections between algebraic multigrid prolongators and finite element basis functions are made to explored. It is shown how the general algebraic multigrid framework allows one to adapt multigrid ideas to a number of different situations. Examples are given corresponding to linear elasticity and specifically in the solution of linear systems associated with extended finite elements for fracture problems.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Petascale solvers for anisotropic PDEs in atmospheric modelling on GPU clusters

Memory bound applications such as solvers for large sparse systems of equations remain a challenge for GPUs. Fast solvers should be based on numerically efficient algorithms and implemented such that global memory access is minimised. To solve systems with trillions ( O ( 10 12 ) ) unknowns the code has to make efficient use of several million individual processor cores on large GPU clusters. We describe the multi-GPU implementation of two algorithmically optimal iterative solvers for anisotropic PDEs which are encountered in (semi-) implicit time stepping procedures in atmospheric modelling. In this application the condition number is large but independent of the grid resolution and both methods are asymptotically optimal, albeit with different absolute performance. In particular, an important constant in the discretisation is the CFL number; only the multigrid solver is robust to changes in this constant. We parallelise the solvers and adapt them to the specific features of GPU architectures, paying particular attention to efficient global memory access. We achieve a performance of up to 0.78 PFLOPs when solving an equation with 0.55 · 10 12 unknowns on 16384 GPUs; this corresponds to about 3% of the theoretical peak performance of the machine and we use more than 40% of the peak memory bandwidth with a Conjugate Gradient (CG) solver. Although the other solver, a geometric multigrid algorithm, has a slightly worse performance in terms of FLOPs per second, overall it is faster as it needs less iterations to converge; the multigrid algorithm can solve a linear PDE with half a trillion unknowns in about one second.

Computer Science↗

Finite Volume Discretization of the Euler Equations in Pronghorn

Modeling flow and heat transfer in high temperature gas reactors (HTGR) requires the ability to model a wide range of flow speeds from slow (natural convection), to intermediate (forced-flow conditions), to supersonic regimes (depressurization) for a wide range of geometries including the pebble bed, upper and lower plenum, and risers. In previous work, Pronghorn has effectively modeled low-to-medium speed flows in scenarios such as the one described in the two-dimensional PBMR-400 benchmark, using its finite-element-based streamline-upwind Petrov-Galerkin (SUPG) stabilized implementation of the Euler equations. However, limitations of this method become apparent when dealing with more complicated geometries (e.g. imposing slip boundary conditions at nodes belonging to two different boundaries) and when gas speeds are fast enough for shocks and supersonic flow to occur. For these problems, the finite-element-based solver lacks robustness and is plagued by slow iterative convergence or even divergence. In order to address these challenges, the Pronghorn code at INL has been updated with new, modified versions of its original equations. The new Pronghorn models are built on the finite volume method with a Harten-Lax-van Leer-Contact (HLLC) Riemann solver based numerical flux method, which (1) allows imposing slip boundary conditions much more robustly and (2) performs well for a wide range of flow speeds. The finite-volume-based flow solver will form the basis for a robust coarse-mesh thermal-hydraulics capability in Pronghorn.

97 MATHEMATICS AND COMPUTING↗

Extending the density functional embedding theory to finite temperature and an efficient iterative method for solving for embedding potentials

A key element in the density functional embedding theory (DFET) is the embedding potential. We discuss two major issues related to the embedding potential: (1) its non-uniqueness and (2) the numerical difficulty for solving for it, especially for the spin-polarized systems. To resolve the first issue, we extend DFET to finite temperature: all quantities, such as the subsystem densities and the total system’s density, are calculated at a finite temperature. This is a physical extension since materials work at finite temperatures. We show that the embedding potential is strictly unique at T > 0. To resolve the second issue, we introduce an efficient iterative embedding potential solver. We discuss how to relax the magnetic moments in subsystems and how to equilibrate the chemical potentials across subsystems. The solver is robust and efficient for several non-trivial examples, in all of which good quality spin-polarized embedding potentials were obtained. We also demonstrate the solver on an extended periodic system: iron body-centered cubic (110) surface, which is related to the modeling of the heterogeneous catalysis involving iron, such as the Fischer-Tropsch and the Haber processes. This work would make it efficient and accurate to perform embedding simulations of some challenging material problems, such as the heterogeneous catalysis and the defects of complicated spin configurations in electronic materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Implicit integration methods for dislocation dynamics

In dislocation dynamics simulations, strain hardening simulations require integrating stiff systems of ordinary differential equations in time with expensive force calculations, discontinuous topological events, and rapidly changing problem size. Current solvers in use often result in small time steps and long simulation times. Faster solvers may help dislocation dynamics simulations accumulate plastic strains at strain rates comparable to experimental observations. Here, this paper investigates the viability of high order implicit time integrators and robust nonlinear solvers to reduce simulation run times while maintaining the accuracy of the computed solution. In particular, implicit Runge-Kutta time integrators are explored as a way of providing greater accuracy over a larger time step than is typically done with the standard second-order trapezoidal method. In addition, both accelerated fixed point and Newton's method are investigated to provide fast and effective solves for the nonlinear systems that must be resolved within each time step. Results show that integrators of third order are the most effective, while accelerated fixed point and Newton's method both improve solver performance over the standard fixed point method used for the solution of the nonlinear systems.

36 MATERIALS SCIENCE↗

High-order partitioned spectral deferred correction solvers for multiphysics problems

We present an arbitrarily high-order, conditionally stable, partitioned spectral deferred correction (SDC) method for solving multiphysics problems using a sequence of pre-existing single-physics solvers. This method extends the work in [1], [2], which used implicit-explicit Runge-Kutta methods (IMEX) to build high-order, partitioned multiphysics solvers. We consider a generic multiphysics problem modeled as a system of coupled ordinary differential equations (ODEs), coupled through coupling terms that can depend on the state of each subsystem; therefore the method applies to both a semi-discretized system of partial differential equations (PDEs) or problems naturally modeled as coupled systems of ODEs. The sufficient conditions to build arbitrarily high-order partitioned SDC schemes are derived. Based on these conditions, various of partitioned SDC schemes are designed. The stability of the first-order partitioned SDC scheme is analyzed in detail on a coupled, linear model problem. We show that the scheme is conditionally stable, and under conditions on the coupling strength, the scheme can be unconditionally stable. We demonstrate the performance of the proposed partitioned solvers on several classes of multiphysics problems with moderate coupling strength. They include a stiff linear system of ODEs, advection-diffusion-reaction systems, and fluid-structure interaction problems with both incompressible and compressible flows, where we verify the design order of the SDC schemes and study various stability properties. We also directly compare the accuracy, stability, and cost of the proposed partitioned SDC solver with the partitioned IMEX method in [1], [2] on this suite of test problems. The results suggest that the high-order partitioned SDC solvers are more robust than the partitioned IMEX solvers for the numerical examples considered in this work, while the IMEX methods require fewer implicit solves.

97 MATHEMATICS AND COMPUTING↗

An Adaptive Newton-Based Free-Boundary Grad–Shafranov Solver

Equilibria in magnetic confinement devices result from force balancing between the Lorentz force and the plasma pressure gradient. In an axisymmetric configuration like a tokamak, such an equilibrium is described by an elliptic equation for the poloidal magnetic flux, commonly known as the Grad–Shafranov equation. It is challenging to develop a scalable and accurate free-boundary Grad–Shafranov solver, since it is a fully nonlinear optimization problem that simultaneously solves for the magnetic field coil current outside the plasma to control the plasma shape. In this work, we develop a Newton-based free-boundary Grad–Shafranov solver using adaptive finite elements and preconditioning strategies. The free-boundary interaction leads to the evaluation of a domain-dependent nonlinear form of which its contribution to the Jacobian matrix is achieved through shape calculus. The optimization problem aims to minimize the distance between the plasma boundary and specified control points while satisfying two nontrivial constraints, which correspond to the nonlinear finite element discretization of the Grad–Shafranov equation and a constraint on the total plasma current involving a nonlocal coupling term. The linear system is solved by a block factorization, and AMG is called for subblock elliptic operators. The unique contributions of this work include the treatment of a global constraint, preconditioning strategies, nonlocal reformulation, and the implementation of adaptive finite elements. Furthermore, it is found that the resulting Newton solver is robust, successfully reducing the nonlinear residual to 1e-6 and lower in a small handful of iterations while addressing the challenging case to find a Taylor state equilibrium where conventional Picard-based solvers fail to converge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Massively parallel solvers for elliptic partial differential equations in numerical weather and climate prediction

The demand for substantial increases in the spatial resolution of global weather and climate prediction models makes it essential to use numerically efficient and highly scalable algorithms to solve the equations of large-scale atmospheric fluid dynamics. For stability and efficiency reasons, several of the operational forecasting centres, in particular the Met Office and the European Centre for Medium-Range Weather Forecasts (ECMWF) in the UK, use semi-implicit semi-Lagrangian time-stepping in the dynamical core of the model. The additional burden with this method is that a three-dimensional elliptic partial differential equation (PDE) for the pressure correction has to be solved at every model time step and this often constitutes a significant proportion of the time spent in the dynamical core. In global models, this PDE must be solved in a thin spherical shell. To run within tight operational time-scales, the solver has to be parallelized and there seems to be a (perceived) misconception that elliptic solvers do not scale to large processor counts and hence implicit time-stepping cannot be used in very high-resolution global models. After reviewing several methods for solving the elliptic PDE for the pressure correction and their application in atmospheric models, we demonstrate the performance and very good scalability of Krylov subspace solvers and multigrid algorithms for a representative model equation with more than 1010 unknowns on 65 536 cores on the High-End Computing Terascale Resource (HECToR), the UK's national supercomputer. Here, we tested and optimized solvers from two existing numerical libraries (the Distributed and Unified Numerics Environment (DUNE) and Parallel High Performance Preconditioners (hypre)) and implemented both a conjugate gradient solver and a geometric multigrid algorithm based on a tensor-product approach, which exploits the strong vertical anisotropy of the discretized equation. We study both weak and strong scalability and compare the absolute solution times for all methods; in contrast to one-level methods, the multigrid solver is robust with respect to parameter variations.

58 GEOSCIENCES↗

A scalable, matrix-free multigrid preconditioner for finite element discretizations of heterogeneous Stokes flow

In this paper we describe a computational methodology that is specifically designed for studying three-dimensional geodynamic processes governed by heterogeneous visco-plastic Stokes flow. The method employs a hybrid spatial discretization consisting of a View the MathML sourceQ2-P1disc mixed finite element formulation for the Stokes problem, coupled to a material-point formulation which is used for representing material state and history-dependent variables. The applicability and practicality of this methodology is realized through the development of an efficient, scalable and robust variable viscosity Stokes preconditioner. In this work, these objectives are achieved through exploiting matrix-free operators and a geometric multigrid preconditioner employing hybrid coarse level operators, Chebyshev smoothers and hybrid Krylov coarse level solvers. The robustness and parallel efficiency of this strategy is demonstrated using an idealized geodynamic model. Lastly, we apply the new methodology to study geodynamic models of continental rifting and break-up in order to understand the diverse range of passive continental margins we observe on Earth today

Geodynamics↗

An optimization-based approach to tailor the mechanical response of soft metamaterials undergoing rate-dependent instabilities

An optimization-based design framework is proposed to tune the response of soft metamaterials involving both geometric instabilities and nonlinear viscoelastic material behavior. Designing the response of soft metamaterials to harness instabilities and undergo large, tailored configuration changes will enable advancements in soft robotics, shock and vibration mitigation, and flexible electronics. In line with the metamaterial concept, the response of these materials is governed to a large extent by the geometric and topological makeup of their small-scale features. However, the link between structure and response is less intuitive for soft metamaterials due to their reliance upon highly nonlinear responses triggered by geometric instabilities. This is further complicated by the effects of viscoelastic relaxation, which recent studies have shown to alter the emergence of instabilities in non-intuitive ways. Here, these effects are accounted for in our framework to achieve various design objectives, including tailored force–displacement response and maximized energy absorption from both geometric and material effects. To fully automate this process, it is essential to have a completely robust equation solver for forward problems involving instabilities and viscoelastic relaxation. We achieve this by casting the search for stable mechanical equilibrium — i.e. the forward problem — as a minimization problem and utilize a trust region algorithm to robustly handle instabilities and follow energetically-favorable equilibrium paths through critical points.

97 MATHEMATICS AND COMPUTING↗

Albany/FELIX: A parallel, scalable and robust, finite element, first-order Stokes approximation ice sheet solver built for advanced analysis

This paper describes a new parallel, scalable and robust finite element based solver for the first-order Stokes momentum balance equations for ice flow. The solver, known as Albany/FELIX , is constructed using the component-based approach to building application codes, in which mature, modular libraries developed as a part of the Trilinos project are combined using abstract interfaces and template-based generic programming, resulting in a final code with access to dozens of algorithmic and advanced analysis capabilities. Following an overview of the relevant partial differential equations and boundary conditions, the numerical methods chosen to discretize the ice flow equations are described, along with their implementation. The results of several verification studies of the model accuracy are presented using (1) new test cases for simplified two-dimensional (2-D) versions of the governing equations derived using the method of manufactured solutions, and (2) canonical ice sheet modeling benchmarks. Model accuracy and convergence with respect to mesh resolution are then studied on problems involving a realistic Greenland ice sheet geometry discretized using hexahedral and tetrahedral meshes. Also explored as a part of this study is the effect of vertical mesh resolution on the solution accuracy and solver performance. The robustness and scalability of our solver on these problems is demonstrated. Lastly, we show that good scalability can be achieved by preconditioning the iterative linear solver using a new algebraic multilevel preconditioner, constructed based on the idea of semi-coarsening.

54 ENVIRONMENTAL SCIENCES↗

ExaSGD: 2021 Kernel Thrust Activities

The Kernel Thrust milestone ADSE22-214 covers the development of device-capable optimization algorithms and solvers technologies required by the ExaSGD project’s software stack in order to solve security-constrained alternating current optimal power flow (SC-ACOPF) problems on emerging exascale architectures. To this extent, in FY21 the main objective of the Kernel Thrust was (i) provide robust optimization solver(s) that run efficiently on hardware accelerator devices (i.e., NVIDIA and AMD GPUs) to perform intra-node computations and (ii) provide coarse-grain parallel optimization capabilities that exploit the decomposition opportunities present in the SC-ACOPF challenge problems to provide exascale-capable solvers.

97 MATHEMATICS AND COMPUTING↗

OptiBench: An Optimization Benchmark Tool for Renewable Energy Problems

We propose a benchmark framework and visualization tool, OptiBench, for analyzing the performance of state-of-the-art optimization solvers across a variety of optimization problems in renewable energy research. Our framework is designed from the ground up in the Julia programming language and enables analysis at scale on high performance computing (HPC) systems. Our visualization tool allows effortless evaluation of optimization solver performance, robustness, and accuracy through intuitive plots, e.g., performance profiles, heat maps, and distribution plots. We have tested three benchmark suites relevant to the modeling of renewable energy systems, viz., CUTEst, PGLib-OPF, and WaterTAP water treatment optimization problems. We illustrate benchmarking of CUTEst using OptiBench on the National Renewable Energy Laboratory's (NREL) HPC Kestrel. Our findings indicate that MA57 HSL linear solver demonstrated the best overall performance for an experimental IPOPT implementation. Our work is ongoing and we intend to add support for more optimization solvers and benchmark test suites in the future.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗