Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Nonlinear Solvers”

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 55 records · Page 3

Implementing a unified solver for nonlinearly constrained optimization

SQP and interior-point methods (also referred to as Lagrange-Newton methods) typically share key algorithmic components, such as strategies for computing descent directions and mechanisms that promote global convergence. Building on this insight, we introduce a unifying framework with eight building blocks that abstracts the workflows of Lagrange-Newton methods. We then present Uno, a modular C++ solver that implements our unifying framework and allows the automatic combination of a wide range of strategies with no programming effort from the user. Uno is meant to (1) organize mathematical optimization strategies into a coherent hierarchy; (2) offer a wide range of efficient and robust methods that can be compared for a given instance; (3) enable researchers to experiment with novel optimization strategies; and (4) reduce the cost of development and maintenance of multiple optimization solvers. Uno’s software design allows user to compose new customized solvers for emerging optimization areas such as robust optimization or optimization problems with complementarity constraints, while building on reliable nonlinear optimization techniques. We demonstrate that Uno is highly competitive against state-of-the-art solvers filterSQP, IPOPT, SNOPT, MINOS, LANCELOT, LOQO, and CONOPT on a subset of 429 small problems from the CUTE collection. Uno is available as open-source software under the MIT license at https://github.com/cvanaret/Uno and via its C, Julia, Python, Fortran, and AMPL interfaces.

97 MATHEMATICS AND COMPUTING↗

Fast methods incorporating direct elliptic solvers for nonlinear applications in fluid dynamics

Semidirect methods are discussed, their present role, as well as some developments for their application in computational fluid dynamics. A semidirect method is a computational scheme that uses a fast, direct, elliptic solver as the driving algorithm for the iterative solution of finite difference equations. Specific subtopics include: (1) direct Cauchy Riemann solvers for first order elliptic equations; (2) application of the semidirect method to the mixed elliptic hyperbolic problem of steady, inviscid transonic flow; and (3) the treatment of interior conditions, such as those on an airfoil or wing, in semidirect methods.

Martin, E. D.↗

Fast nonlinear iterative solver for an implicit, energy-conserving, asymptotic-preserving charged-particle orbit integrator

Here recently, an asymptotic-preserving (AP) particle orbit integrator has been proposed with remarkable properties including exact energy conservation, the ability to capture of all first-order drifts (including the ∇B-drift), the ability to capture trapped-passing boundaries with parallel velocity extremely close to the critical velocity, and the ability to transition from strongly to weakly magnetized spatial regions. The new AP orbit integrator is implicit, employing a Crank-Nicolson (CN) temporal discretization to ensure exact energy conservation. This, in turn, requires a local nonlinear iteration involving particle velocities and positions, and the local electromagnetic fields, to obtain the new-time solution. Ref. [1] did not attempt to provide an efficient solver for this system, and employed a brute-force GMRES-driven Jacobian-free Newton-Krylov (JFNK) solver to invert the particle orbit equations at every timestep for expediency. While JFNK is robust and reliable, it is also expensive and very intrusive for practical implementations of the method (it requires having the JFNK machinery available and solving a 6 x 6 Jacobian system iteratively once per iteration per particle).

97 MATHEMATICS AND COMPUTING↗

New Time Integrators and Capabilities in SUNDIALS Versions 6.2.0-7.4.0

SUNDIALS is a well-established numerical library that provides robust and efficient time integrators and nonlinear solvers. This article overviews several significant improvements and new features added over the last 3 years to support scientific simulations run on high-performance computing systems. Notably, three new classes of one-step methods have been implemented: low storage Runge–Kutta, symplectic partitioned Runge–Kutta, and operator splitting. In addition, we describe new timestep adaptivity support for multirate methods, adjoint sensitivity analysis capabilities for explicit Runge–Kutta methods, additional options for Anderson acceleration in nonlinear solvers, and improved error handling and logging.

Computer science↗

A memory-distributed quasi-Newton solver for nonlinear programming problems with a small number of general constraints

We approach the problem of parallelizing state-of-the-art nonlinear programming optimization algorithms.Specifically, we focus on parallelizing quasi-Newton interior-point methods that use limited-memory secant Hessian approximations. Such interior-point methods are known to have better convergence properties and to be more effective on large-scale problems than gradient-based and derivative-free optimization algorithms. We target nonlinear and potentially nonconvex optimization problems with an arbitrary number of bound constraints and a small number of general equality and inequality constraints on the optimization variables. These problems occur for example in the form of optimal control, optimal design, and inverse problems governed by ordinary or partial differential equations, whenever they are expressed in a “reduced-space” optimization approach. We introduce and analyze the time and space complexity of a decomposition method for solving the quasi-Newton linear systems that leverages the fact that the quasi-Newton Hessian matrix has a small number of dense blocks that border a low-rank update of a diagonal matrix. This enables an efficient parallelization on memory-distributed computers of the iterations of the optimization algorithm, a state-of-the-art filter line-search interior-point algorithm by Wächter et. al. We illustrate the efficiency of the proposed method by solving structural topology optimization problems on up to 4608 cores on a parallel machine.

97 MATHEMATICS AND COMPUTING↗

A Monte Carlo Thermal Radiative Transfer Solver with Nonlinear Elimination

Here in this paper, we present a new Monte Carlo method for solving the thermal radiative transfer (TRT) equations via the method of nonlinear elimination (NLEM). This method is inspired by the previous application of NLEM to thermal radiation diffusion. Our approach, called diffusion accelerated Implicit Monte Carlo (DAIMC), is a hybrid technique which combines a Monte Carlo method for solving a purely-absorbing transport equation and a diffusion solution that accounts for effective scattering, or absorption–reemission. The method aims to improve the implicitness of the traditional implicit Monte Carlo (IMC) method. We derive DAIMC generally for 3D Cartesian geometries, but in this paper, we present results and analysis in 1D slab geometry. These preliminary results indicate that DAIMC implementations may provide more accurate and robust TRT solutions than IMC in certain test problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Input-output-controlled nonlinear equation solvers

To upgrade the efficiency and stability of the successive substitution (SS) and Newton-Raphson (NR) schemes, the concept of input-output-controlled solvers (IOCS) is introduced. By employing the formal properties of the constrained version of the SS and NR schemes, the IOCS algorithm can handle indefiniteness of the system Jacobian, can maintain iterate monotonicity, and provide for separate control of load incrementation and iterate excursions, as well as having other features. To illustrate the algorithmic properties, the results for several benchmark examples are presented. These define the associated numerical efficiency and stability of the IOCS.

Padovan, Joseph↗

LIME 0.5

LIME 0.5 is an initial version of a Lightweight Integrating Multi-physics Environment for coupling codes. LIME by itself is not a code for doing multiphysics simulations. Instead, LIME provides the key high-level software, a flexible but defined approach, and interface requirements for a collection of (potentially disparate) physics codes to be combined with strong coupling (when needed) though non-linear solution methods (e.g. JFNK, fixed point), thus creating a new multi-physics simulation capability customized for a particular need. The approach taken is designed to; preserve and leverage any important specialized algorithms and/or functionality an existing application may provide; minimize the requirements barrier for an application to participate; and work within advanced solver frameworks (e.g. as extensions to the Trilinos/NOX nonlinear solver libraries, PETSc, . . .). Of note is that components/physics codes that can be coupled within LIME are NOT limited to: components written in one particular language; a particular numerical discretization approach ( e.g. Finite Element); or physical models expressed as PDE's.

Hooper, Russell↗

LIME 0.5

LIME 0.5 is an initial version of a Lightweight Integrating Multi-physics Environment for coupling codes. LIME by itself is not a code for doing multiphysics simulations. Instead, LIME provides the key high-level software, a flexible but defined approach, and interface requirements for a collection of (potentially disparate) physics codes to be combined with strong coupling (when needed) though non-linear solution methods (e.g. JFNK, fixed point), thus creating a new multi-physics simulation capability customized for a particular need. The approach taken is designed to; preserve and leverage any important specialized algorithms and/or functionality an existing application may provide; minimize the requirements barrier for an application to participate; and work within advanced solver frameworks (e.g. as extensions to the Trilinos/NOX nonlinear solver libraries, PETSc, . . .). Of note is that components/physics codes that can be coupled within LIME are NOT limited to: components written in one particular language; a particular numerical discretization approach ( e.g. Finite Element); or physical models expressed as PDE's.

Source record↗

A Nonlinear Schur Complement Solver for CFD-Based Multidisciplinary Models

CFD-based multidisciplinary models are the fundamental building blocks of multidis- ciplinary design optimization frameworks. Linear and nonlinear solutions of these coupled models are difficult, especially when the Jacobian matrices represent a saddle point problem, where a block-diagonal corresponding to a discipline is non-invertible. These scenarios necessitate the use of a coupled solver algorithm such as the Newton’s method instead of the popular block Gauss– Seidel-based methods because of this non-invertible block. To address this challenge, we introduce a nonlinear Schur complement solver suitable for CFD-based multidisciplinary models. The solver leverages the specialized linear and nonlinear solvers of the CFD code, and therefore, does not require the solution of a large coupled linear system as the coupled Newton’s method. Further- more, because the solver primarily uses the specialized linear and nonlinear solvers of the CFD code, it does not suffer from the same robustness limitations as the coupled Newton’s method. In this work, we will implement this solver in NASA’s OpenMDAO framework and demonstrate its effectiveness using a CFD-based aeropropulsive model. The solver will contribute to the develop- ment of aeropropulsive design optimization and CFD-based design optimization methods with the ultimate goal of accelerating the design and integration of advanced propulsion systems.

Nonlinear Solvers↗

Enabling New Flexibility in the SUNDIALS Suite of Nonlinear and Differential/Algebraic Equation Solvers

In recent years, the SUite of Nonlinear and DIfferential/ALgebraic equation Solvers (SUNDIALS) has been redesigned to better enable the use of application-specific and third-party algebraic solvers and data structures. Throughout this work, we have adhered to specific guiding principles that minimized the impact to current users while providing maximum flexibility for later evolution of solvers and data structures. The redesign was done through the addition of new linear and nonlinear solvers classes, enhancements to the vector class, and the creation of modern Fortran interfaces. The vast majority of this work has been performed “behind-the-scenes,” with minimal changes to the user interface and no reduction in solver capabilities or performance. These changes allow SUNDIALS users to more easily utilize external solver libraries and create highly customized solvers, enabling greater flexibility on extreme-scale, heterogeneous computational architectures.

97 MATHEMATICS AND COMPUTING↗

eddy Users Manual

eddy is a collection of tools - nonlinear solvers, meshing, post-processing, visualization, optimization, etc. - for performing scale-resolving simulations of multi-physics applications. The framework is designed to enable advanced R&D on a variety of topics by leveraging a mature capability for scale resolving simulations, and simultaneously be an appropriate tool for application analysis and support. Currently, eddy is at a relatively low technical readiness level (TRL), and users and developers should maintain appropriate expectations. The technical details behind eddy are outlined in several publications which can be consulted for more information [1–10]. The solvers are built around an unstructured high-order capability, and heavily utilize the tensor product sum-factorization approach for efficiency. The unsteady formulation utilizes a fully implicit space-time approach with a matrix-free Newton- Krylov method. A primitive steady-state solver is available for testing purposes, but is not expected to converge for all but simple verification cases. The Navier-Stokes fluid solvers do not support either RANS or hybrid-RANS capability, only LES and wall-modeled LES approaches. All of the solvers within eddy support three modes of operation: a primal solve of the full nonlinear problem, and two linearization approaches of the primal solve - the ad joint and the tangent solution. Details on how to select and use these three modes are outlined in Sec. 3.

Murman, Scott M.↗

Performance analysis of fully explicit and fully implicit solvers within a spectral element shallow-water atmosphere model

In this study, explicit Runge–Kutta methods and implicit multistep methods utilizing a Newton–Krylov nonlinear solver are evaluated for a range of configurations of the shallow-water dynamical core of the spectral element community atmosphere model to evaluate their computational performance. These configurations are designed to explore the attributes of each method under different but relevant model usage scenarios including varied spectral order within an element, static regional refinement, and scaling to the largest problem sizes. This analysis is performed within the shallow-water dynamical core option of a full climate model code base to enable a wealth of simulations for study, with the aim of informing solver development within the more complete hydrostatic dynamical core used for climate research. The limitations and benefits to using explicit versus implicit methods, with different parameters and settings, are discussed in light of the trade-offs with Message Passing Interface (MPI) communication and memory and their inherent efficiency bottlenecks. Given the performance behavior across the configurations analyzed here, the recommendation for future work using the implicit solvers is conditional based on scale separation and the stiffness of the problem. For the regionally refined configurations, the implicit method has about the same efficiency as the explicit method, without considering efficiency gains from a preconditioner. The potential for improvement using a preconditioner is greatest for higher spectral order configurations, where more work is shifted to the linear solver. Finally, initial simulations with OpenACC directives to utilize a Graphics Processing Unit (GPU) when performing function evaluations show improvements locally, and that overall gains are possible with adjustments to data exchanges.

58 GEOSCIENCES↗