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

PETSc/TAO Users Manual V.3.21

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) and the Toolkit for Advanced Optimization (TAO) for the numerical solution of partial differential equations (PDEs) and related problems on high-performance computers. PETSc/TAO is a suite of data structures and routines that provide the building blocks for implementing large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all distributed memory communication. PETSc/TAO includes a large suite of parallel linear solvers, nonlinear solvers, time integrators, and optimizers that may be used in application codes written in Fortran, C, C++, and Python (via petsc4py; see Getting Started ). The library is organized hierarchically, enabling users to employ the abstraction level most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users.

97 MATHEMATICS AND COMPUTING↗

Multiply scaled constrained nonlinear equation solvers

To improve the numerical stability of nonlinear equation solvers, a partitioned multiply scaled constraint scheme is developed. This scheme enables hierarchical levels of control for nonlinear equation solvers. To complement the procedure, partitioned convergence checks are established along with self-adaptive partitioning schemes. Overall, such procedures greatly enhance the numerical stability of the original solvers. To demonstrate and motivate the development of the scheme, the problem of nonlinear heat conduction is considered. In this context the main emphasis is given to successive substitution-type schemes. To verify the improved numerical characteristics associated with partitioned multiply scaled solvers, results are presented for several benchmark examples.

Padovan, Joe↗

Iterative methods in GPU-resident linear solvers for nonlinear constrained optimization

Linear solvers are major computational bottlenecks in a wide range of decision support and optimization computations. The challenges become even more pronounced on heterogeneous hardware, where traditional sparse numerical linear algebra methods are often inefficient. For example, methods for solving ill-conditioned linear systems have relied on conditional branching, which degrades performance on hardware accelerators such as graphical processing units (GPUs). To improve the efficiency of solving ill-conditioned systems, our computational strategy separates computations that are efficient on GPUs from those that need to run on traditional central processing units (CPUs). Our strategy maximizes the reuse of expensive CPU computations. Iterative methods, which thus far have not been broadly used for ill-conditioned linear systems, play an important role in our approach. In particular, we extend ideas from Arioli et al., (2007) to implement iterative refinement using inexact LU factors and flexible generalized minimal residual (FGMRES), with the aim of efficient performance on GPUs. In conclusion, we focus on solutions that are effective within broader application contexts, and discuss how early performance tests could be improved to be more predictive of the performance in a realistic environment.

97 MATHEMATICS AND COMPUTING↗

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↗

Parallel Computation of the Jacobian Matrix for Nonlinear Equation Solvers Using MATLAB

Demonstrating speedup for parallel code on a multicore shared memory PC can be challenging in MATLAB due to underlying parallel operations that are often opaque to the user. This can limit potential for improvement of serial code even for the so-called embarrassingly parallel applications. One such application is the computation of the Jacobian matrix inherent to most nonlinear equation solvers. Computation of this matrix represents the primary bottleneck in nonlinear solver speed such that commercial finite element (FE) and multi-body-dynamic (MBD) codes attempt to minimize computations. A timing study using MATLAB's Parallel Computing Toolbox was performed for numerical computation of the Jacobian. Several approaches for implementing parallel code were investigated while only the single program multiple data (spmd) method using composite objects provided positive results. Parallel code speedup is demonstrated but the goal of linear speedup through the addition of processors was not achieved due to PC architecture.

Rose, Geoffrey K.↗

Constrained hierarchical least square nonlinear equation solvers

The current paper develops a constrained hierarchical least square nonlinear equation solver. The procedure can handle the response behavior of systems which possess indefinite tangent stiffness characteristics. Due to the generality of the scheme, this can be achieved at various hierarchical application levels. For instance, in the case of finite element simulations, various combinations of either degree of freedom, nodal, elemental, substructural, and global level iterations are possible. Overall, this enables a solution methodology which is highly stable and storage efficient. To demonstrate the capability of the constrained hierarchical least square methodology, benchmarking examples are presented which treat structure exhibiting highly nonlinear pre- and postbuckling behavior wherein several indefinite stiffness transitions occur.

Padovan, J.↗

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↗

Test and Analyses of a Composite Multi-Bay Fuselage Panel Under Uni-Axial Compression

A composite panel containing three stringers and two frames cut from a vacuum-assisted resin transfer molded (VaRTM) stitched fuselage article was tested under uni-axial compression loading. The stringers and frames divided the panel into six bays with two columns of three bays each along the compressive loading direction. The two frames were supported at the ends with pins to restrict the out-of-plane translation. The free edges of the panel were constrained by knife-edges. The panel was modeled with shell finite elements and analyzed with ABAQUS nonlinear solver. The nonlinear predictions were compared with the test results in out-of-plane displacements, back-to-back surface strains on stringer flanges and back-to-back surface strains at the centers of the skin-bays. The analysis predictions were in good agreement with the test data up to post-buckling.

Li, Jian↗

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↗

Hierarchically partitioned nonlinear equation solvers

By partitioning solution space into a number of subspaces, a new multiply constrained partitioned Newton-Raphson nonlinear equation solver is developed. Specifically, for a given iteration, each of the various separate partitions are individually and simultaneously controlled. Due to the generality of the scheme, a hierarchy of partition levels can be employed. For finite-element-type applications, this includes the possibility of degree-of-freedom, nodal, elemental, geometric substructural, material and kinematically nonlinear group controls. It is noted that such partitioning can be continuously updated, depending on solution conditioning. In this context, convergence is ascertained at the individual partition level.

Padovan, Joseph↗

A Nonlinear Modal Aeroelastic Solver for FUN3D

A nonlinear structural solver has been implemented internally within the NASA FUN3D computational fluid dynamics code, allowing for some new aeroelastic capabilities. Using a modal representation of the structure, a set of differential or differential-algebraic equations are derived for general thin structures with geometric nonlinearities. ODEPACK and LAPACK routines are linked with FUN3D, and the nonlinear equations are solved at each CFD time step. The existing predictor-corrector method is retained, whereby the structural solution is updated after mesh deformation. The nonlinear solver is validated using a test case for a flexible aeroshell at transonic, supersonic, and hypersonic flow conditions. Agreement with linear theory is seen for the static aeroelastic solutions at relatively low dynamic pressures, but structural nonlinearities limit deformation amplitudes at high dynamic pressures. No flutter was found at any of the tested trajectory points, though LCO may be possible in the transonic regime.

Goldman, Benjamin D.↗

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↗

A vector unsymmetric eigenequation solver for nonlinear flutter analysis on high-performance computers

A finite element approach is presented for determining the nonlinear flutter characteristics of composite panels using unsteady, third-order piston theory aerodynamics. Both nonlinear structural (large-amplitude) and nonlinear aerodynamics terms are considered in the finite element formulation. Solution procedures are presented to solve the nonlinear panel flutter and the large-amplitude free vibration finite element equations. Nonlinear aerodynamic and linear structural finite element flutter results for composite panels are also presented. An efficient, vector-version generalized unsymmetric eigenequation solver is developed for large-amplitude vibration and nonlinear panel flutter analyses on high-performance computers.

Qin, Jiangning↗

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↗