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

An aggregation-based nonlinear multigrid solver for two-phase flow and transport in porous media

A nonlinear multigrid solver for two-phase flow and transport in a mixed fractional-flow velocity-pressure-saturation formulation is proposed. The solver, which is under the framework of the full approximation scheme (FAS), extends our previous work on nonlinear multigrid for heterogeneous diffusion problems. The coarse spaces in the multigrid hierarchy are constructed by first aggregating degrees of freedom, and then solving some local flow problems. The mixed formulation and the choice of coarse spaces allow us to assemble the coarse problems without visiting finer levels during the solving phase, which is crucial for the scalability of multigrid methods. Specifically, a natural generalization of the upwind flux can be evaluated directly on coarse levels using the precomputed coarse flux basis vectors. We find that the resulting solver is applicable to problems discretized on general unstructured grids. The performance of the proposed nonlinear multigrid solver in comparison with the standard single level Newton's method is demonstrated through challenging numerical examples. It is observed that the proposed solver is robust for highly nonlinear problems and clearly outperforms Newton's method in the case of high Courant-Friedrichs-Lewy (CFL) numbers.

58 GEOSCIENCES↗

NONLINEAR MULTIGRID SOLVER EXPLOITING AMGe COARSE SPACES WITH APPROXIMATION PROPERTIES

The paper introduces a nonlinear multigrid solver for mixed nite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstruc- tured problems is the guaranteed approximation property of the AMGe coarse spaces that were developed recently at Lawrence Livermore National Laboratory. These give the ability to derive stable and accurate coarse nonlinear discretization problems. The previous attempts (including ones with the original AMGe method, [5, 11]), were less successful due to lack of such good approximation properties of the coarse spaces. With coarse spaces with approximation properties, our FAS approach on un- structured meshes should be as powerful/successful as FAS on geometrically re ned meshes. For comparison, Newton's method and Picard iterations with an inner state-of-the-art linear solver is compared to FAS on a nonlinear saddle point problem with applications to porous media ow. It is demonstrated that FAS is faster than Newton's method and Picard iterations for the experiments considered here. Due to the guaranteed approximation properties of our AMGe, the coarse spaces are very accurate, providing a solver with the potential for mesh-independent convergence on general unstructured meshes.

97 MATHEMATICS AND COMPUTING↗

PyTrilinos

PyTrilinos is a Python interface to selected Trilinos packages. This makes Trilinos linear algebra classes, linear solvers, preconditioners, nonlinear solvers, eigensolvers, and tools available to Python programmers. This broadens the user base of Trilinos, and facilitates rapid prototyping of scientific codes and interactive manipulation of large, distributed data sets.

Spotz, William↗

PyTrilinos

PyTrilinos is a Python interface to selected Trilinos packages. This makes Trilinos linear algebra classes, linear solvers, preconditioners, nonlinear solvers, eigensolvers, and tools available to Python programmers. This broadens the user base of Trilinos, and facilitates rapid prototyping of scientific codes and interactive manipulation of large, distributed data sets.

Source record↗

IMIGO: An Optimal Adaptive Nonlinear Program for Accelerator Optics Modeling and Other Applications

Model-based electron accelerator control is the maintenance of optimal parameters of an electron beam such as its orbit, size, and shape, as well as machine parameters such as tunes. It works well when the model reflects reality. SLAC pioneered this technique in SPEAR about thirty decades ago. Similar techniques are now employed in particle accelerator and synchrotron laboratories around the world. There is still an inherently complex problem related to the employment of such techniques to manage the operation and analysis of accelerators and storage rings. The problem arises from the use by those techniques of complex numerical algorithms commonly known as nonlinear solvers that are difficult to control and operate. Lessons learned at SLAC have led to the development of a new, simple-to-use, and iterative nonlinear solver that holds much promise not only in advancing the derivation of errors in accelerators and storage rings at SLAC, but also in its ability to tackle a range of complex engineering problems. A CRADA project was recently completed to build on this experience at SLAC, and to collaborate with an outside company GO AI Services to further develop and validate this nonlinear solver for robust SLAC accelerator. In this report, we present the project report submitted to DOE and SLAC.

Accelerators↗

A Proposed Global Optimum Algebraic Iterative Solver for Modeling of Lattice Element Errors

Model-based electron accelerator control is the maintenance of optimal parameters of an electron beam such as its orbit, size, and shape, as well as machine parameters such as tunes. It works well when the model reflects reality. SLAC pioneered this technique in SPEAR about thirty decades ago. Similar techniques are now employed in particle accelerator and synchrotron laboratories around the world. There is still an inherently complex problem related to the employment of such techniques to manage the operation and analysis of accelerators and storage rings. The problem arises from the use by those techniques of complex numerical algorithms commonly known as nonlinear solvers that are difficult to control and operate. Lessons learned at SLAC have led to the development of a new, simple-to-use, and iterative nonlinear solver that holds much promise not only in advancing the derivation of errors in accelerators and storage rings at SLAC, but also in its ability to tackle a range of complex engineering problems. We intend to further develop and validate this nonlinear solver for robust SLAC accelerator and other applications.

ACCSYS↗

Lattice Element Error Solver for Modeling of Accelerators, Storage Ring, Transport Systems, and Insertion Devices

The goals of CRADA 350 were achieved in this Phase I SBIR work. Specifically, a software environment was developed which included a nonlinear solver, OASIS. During the Phase I work, we applied the algorithm to a number of nonlinear-solver benchmark problems, including SLAC accelerator problems. By searching over only two optimization-control parameters, this Phase I work has enabled the development of a systematic procedure to facilitate the finding of a “best-guessed” global minimum solution for various types of non-linear problems with different size and complexity. This set of rules was codified and led to a versatile nonlinear program, IMIGO.

43 PARTICLE ACCELERATORS↗

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 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↗

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↗