Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “nonlinear 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 91 records · Page 5

High-fidelity Multidisciplinary Sensitivity Analysis and Design Optimization for Rotorcraft Applications

A multidisciplinary sensitivity analysis of rotorcraft simulations involving tightly coupled high-fidelity computational fluid dynamics and comprehensive analysis solvers is presented and evaluated. A sensitivity-enabled fluid dynamics solver and a nonlinear flexible multibody dynamics solver are coupled to predict aerodynamic loads and structural responses of helicopter rotor blades. A discretely consistent adjoint-based sensitivity analysis available in the fluid dynamics solver provides sensitivities arising from unsteady turbulent flows and unstructured dynamic overset meshes, while a complex-variable approach is used to compute structural sensitivities with respect to aerodynamic loads. The multidisciplinary sensitivity analysis is conducted through integrating the sensitivity components from each discipline of the coupled system. Accuracy of the coupled system is validated by conducting simulations for a benchmark rotorcraft model and comparing solutions with established analyses and experimental data. Sensitivities of lift computed by the multidisciplinary sensitivity analysis are verified by comparison with the sensitivities obtained by complex-variable simulations. Finally the multidisciplinary sensitivity analysis is applied to a constrained gradient-based design optimization for a HART-II rotorcraft configuration.

Wang, Li↗

Analysis of a parallelized nonlinear elliptic boundary value problem solver with application to reacting flows

A parallelized finite difference code based on the Newton method for systems of nonlinear elliptic boundary value problems in two dimensions is analyzed in terms of computational complexity and parallel efficiency. An approximate cost function depending on 15 dimensionless parameters is derived for algorithms based on stripwise and boxwise decompositions of the domain and a one-to-one assignment of the strip or box subdomains to processors. The sensitivity of the cost functions to the parameters is explored in regions of parameter space corresponding to model small-order systems with inexpensive function evaluations and also a coupled system of nineteen equations with very expensive function evaluations. The algorithm was implemented on the Intel Hypercube, and some experimental results for the model problems with stripwise decompositions are presented and compared with the theory. In the context of computational combustion problems, multiprocessors of either message-passing or shared-memory type may be employed with stripwise decompositions to realize speedup of O(n), where n is mesh resolution in one direction, for reasonable n.

Keyes, David E.↗

Direct Estimation of Parameters in ODE Models Using WENDy: Weak-Form Estimation of Nonlinear Dynamics

Abstract We introduce the Weak-form Estimation of Nonlinear Dynamics (WENDy) method for estimating model parameters for non-linear systems of ODEs. Without relying on any numerical differential equation solvers, WENDy computes accurate estimates and is robust to large (biologically relevant) levels of measurement noise. For low dimensional systems with modest amounts of data, WENDy is competitive with conventional forward solver-based nonlinear least squares methods in terms of speed and accuracy. For both higher dimensional systems and stiff systems, WENDy is typically both faster (often by orders of magnitude) and more accurate than forward solver-based approaches. The core mathematical idea involves an efficient conversion of the strong form representation of a model to its weak form, and then solving a regression problem to perform parameter inference. The core statistical idea rests on the Errors-In-Variables framework, which necessitates the use of the iteratively reweighted least squares algorithm. Further improvements are obtained by using orthonormal test functions, created from a set of $$C^{\infty }$$ C ∞ bump functions of varying support sizes.We demonstrate the high robustness and computational efficiency by applying WENDy to estimate parameters in some common models from population biology, neuroscience, and biochemistry, including logistic growth, Lotka-Volterra, FitzHugh-Nagumo, Hindmarsh-Rose, and a Protein Transduction Benchmark model. Software and code for reproducing the examples is available at https://github.com/MathBioCU/WENDy .

97 MATHEMATICS AND COMPUTING↗

Aeroelastic Analysis Using Deforming Cartesian Grids

Ongoing work in air-vehicle design illustrates the potential of advanced concepts to provide significant improvements in efficiency; but with their incorporation of lightweight flexible structures, such configurations may require active control systems to ensure reliability and safety. However, many contemporary analysis methods are inefficient for aeroelastic analysis and design of such configurations. This paper describes the development of a new approach that automates the geometry setup, mesh generation, and assembly of fluid–structural coupling interfaces to enable efficient aeroelastic and aeroservoelastic analysis of advanced concepts. The core elements for this approach are a cut-cell Cartesian grid-based computational fluid dynamics solver, a nonlinear beam element structural model, a conservative fluid–structural interface treatment, and the formulation and implementation of a new deforming grid capability within the cut-cell Cartesian grid solver. In this paper, emphasis is on this latter component with detailed description given of the mesh motion strategy, evaluation of fluxes and structural loads at the surface, and computation of geometrical properties such as cell volume, directed face areas, centroids, and motion-induced fluxes for deforming Cartesian grids required to advance the flow states. Aeroelastic simulations exercising the capability show favorable agreement with data and predictions in the literature for subsonic and supersonic applications.

97 MATHEMATICS AND COMPUTING↗

Aerothermodynamic Analysis of a Flexible Thermal Protection System under Reentry Loads

The Carryall Block 1 reentry vehicle being developed by Outpost Space utilizes a strut supported semirigid deployable heatshield. This consists of a flexible thermal protection system, a heat-resistant fabric stack, stretched over actuated spars. The advantages of a deployable heatshield include reduced heat loading and earlier deceleration in the trajectory. However, the nature of the flexible thermal protection system necessitates considering the loaded shape of the heat shield. The flexible thermal protection system will deflect under reentry loads leading to areas of higher heating rates as well as a reduced axial coefficient as compared to the nominal shape. The Carryall Block 1 is analyzed using NASA’s FUN3D and DPLR CFD solvers with a deflected shape based on the catenary equations. The aerodynamic results are found to be within a percent for both solvers and both structured and unstructured mesh types. Fluid Structure Interaction (FSI) analysis is currently a work in progress, using file I/O to communicate between FUN3D and LS-DYNA, a commercial nonlinear structural solver. Challenges in deforming the geometry, mesh, and initial results are presented here.

thermal protection system↗

Scalable multilevel Monte Carlo methods exploiting parallel redistribution on coarse levels

Here, we study an element agglomeration coarsening strategy that requires data redistribution at coarse levels when the number of coarse elements becomes smaller than the number of MPI processes used on the finest level. The overall procedure generates coarse elements (general unstructured unions of fine grid elements) within the framework of element-based algebraic multigrid methods (or AMGe) studied previously. The AMGe-generated coarse spaces have the ability to exhibit approximation properties of the same order as the fine-level spaces since by construction they contain the piecewise polynomials of the same order as on the fine level. These approximation properties are key for the successful use of AMGe in multilevel solvers for nonlinear partial differential equations as well as for multilevel Monte Carlo (MLMC) simulations. The ability to coarsen without being constrained by the number of MPI processes, as described in the present paper, allows to improve the scalability of these solvers as well as the overall MLMC method. The paper illustrates this latter fact with detailed scalability study of MLMC simulations applied to model Darcy equations with a stochastic log-normal permeability field.

AMGe↗

Modifying PASVART to solve singular nonlinear 2-point boundary problems

To study the buckling and post-buckling behavior of shells and various other structures, one must solve a nonlinear 2-point boundary problem. Since closed-form analytic solutions for such problems are virtually nonexistent, numerical approximations are inevitable. This makes the availability of accurate and reliable software indispensable. In a series of papers Lentini and Pereyra, expanding on the work of Keller, developed PASVART: an adaptive finite difference solver for nonlinear 2-point boundary problems. While the program does produce extremely accurate solutions with great efficiency, it is hindered by a major limitation. PASVART will only locate isolated solutions of the problem. In buckling problems, the solution set is not unique. It will contain singular or bifurcation points, where different branches of the solution set may intersect. Thus, PASVART is useless precisely when the problem becomes interesting. To resolve this deficiency we propose a modification of PASVART that will enable the user to perform a more complete bifurcation analysis. PASVART would be combined with the Thurston bifurcation solution: as adaptation of Newton's method that was motivated by the work of Koiter 3 are reinterpreted in terms of an iterative computational method by Thurston.

Fulton, James P.↗

Multilevel well modeling in aggregation-based nonlinear multigrid for multiphase flow in porous media

A full approximation scheme (FAS) nonlinear multigrid solver for two-phase flow and transport problems driven by wells with multiple perforations is developed here. It is an extension to our previous work on FAS solvers for diffusion and transport problems. The solver is applicable to discrete problems defined on unstructured grids as the coarsening algorithm is aggregation-based and algebraic. To construct coarse basis that can better capture the radial flow near wells, coarse grids in which perforated well cells are not near the coarse-element interface are desired. This is achieved by an aggregation algorithm proposed in this paper that makes use of the location of well cells in the cell-connectivity graph. Numerical examples in which the FAS solver is compared against Newton's method on benchmark problems are given. In particular, for a refined version of the SAIGUP model, the FAS solver is at least 35% faster than Newton's method for time steps with a CFL number greater than 10.

58 GEOSCIENCES↗

Aeroelastic Indicial Response Reduced-Order Modeling for Flexible Flight Vehicles

A reduced-order modeling method capable of providing computationally efficient predictions of the nonlinear, unsteady aerodynamics encountered by flexible flight vehicles under- going forced oscillations is presented. Models are developed using indicial response theory, which characterizes a vehicle’s dynamics through identification of time-accurate aerodynamic responses due to step changes in the vehicle-state parameters, e.g., angle-of-attack, pitch rate. A coupled computational fluid dynamics aeroelastic analysis is proposed for identifying step (indicial) responses of flexible vehicles. In this approach, aeroelastic indicial responses are simulated via prescribed rigid body motions, while fluid-structure interactions are captured at the subiterative level through coupling to a linear modal structural solver. A nonlinear extension of indicial response theory is applied through time-dependent linear interpolation of a database of locally linear aeroelastic step responses. Reduced-order models are then created using the mathematical principle of convolution applied to the interpolated aeroelastic indicial responses to predict the time-dependent aerodynamic response of a flexible vehicle to any arbitrary prescribed flight maneuver. The NASA FUN3D computational fluid dynamics solver is utilized for simulating full-order trajectories and indicial response functions. Aerodynamic predictions were generated for the X-56A aircraft undergoing a series of harmonic forced oscillations. The s are shown to provide a practical option for evaluating the unsteady aerodynamics of flexible vehicles using high-fidelity simulations.

Hiller, Brett↗

Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures

Here, we investigate how to port the standard interior-point method to new exascale architectures for block-structured nonlinear programs with state equations. Computationally, we decompose the interior-point algorithm into two successive operations: the evaluation of the derivatives and the solution of the associated Karush-Kuhn-Tucker (KKT) linear system. Our method accelerates both operations using two levels of parallelism. First, we distribute the computations on multiple processes using coarse parallelism. Second, each process uses SIMD/GPU accelerators locally to accelerate the operations using fine-grained parallelism. The KKT system is reduced by eliminating the inequalities and the state variables from the corresponding equations. We demonstrate our method's capability on the supercomputer Polaris, a testbed for the future exascale Aurora system. Each node is equipped with four GPUs, a setup amenable to our two-level approach. Our experiments on the stochastic optimal power flow problem show that the reduction method is 50x faster than the sparse linear solver HSL MA57 running in serial on the CPU, and 6x faster than Pardiso running in parallel on CPU on the same number of processes.

97 MATHEMATICS AND COMPUTING↗

PETSc/TAO developments for GPU-based early exascale systems

The Portable Extensible Toolkit for Scientific Computation (PETSc) library provides scalable solvers for nonlinear time-dependent differential and algebraic equations and for numerical optimization via the Toolkit for Advanced Optimization (TAO). PETSc is used in dozens of scientific fields and is an important building block for many simulation codes. During the U.S. Department of Energy’s Exascale Computing Project, the PETSc team has made substantial efforts to enable efficient utilization of the massive fine-grain parallelism present within exascale compute nodes and to enable performance portability across exascale architectures. We recap some of the challenges that designers of numerical libraries face in such an endeavor, and then discuss the many developments we have made, which include the addition of new GPU backends, features supporting efficient on-device matrix assembly, better support for asynchronicity and GPU kernel concurrency, and new communication infrastructure. In conclusion, we evaluate the performance of these developments on some pre-exascale systems as well as the early exascale systems Frontier and Aurora, using compute kernel, communication layer, solver, and mini-application benchmark studies, and then close with a few observations drawn from our experiences on the tension between portable performance and other goals of numerical libraries.

Exascale Computing Project (ECP)↗

Optimizing the design and operation of water networks: Two decomposition approaches

We consider the design and operation of water networks simultaneously. Water network problems can be divided into two categories: the design problem and the operation problem. The design problem involves determining the appropriate pipe sizing and placements of pump stations, while the operation problem involves scheduling pump stations over multiple time periods to account for changes in supply and demand. Our focus is on networks that involve water co-produced with oil and gas. While solving the optimization formulation for such networks, we found that obtaining a primal (feasible) solution is more challenging than obtaining dual bounds using off-the-shelf mixed-integer nonlinear programming solvers. Therefore, we propose two methods to obtain good primal solutions. One method involves a decomposition framework that utilizes a convex reformulation, while the other is based on time decomposition. To test our proposed methods, we conduct computational experiments on a network derived from the PARETO case study.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Efficient co-solution of time step size and independent state in simulations of fluid-driven fracture propagation with embedded meshes

Here we present an efficient time-continuation scheme for fluid-driven fracture propagation problems in the extended finite element method framework. The approach applies a monolithic solution strategy to a fully coupled and implicit approximation of hydro-mechanical systems in conjunction with simultaneous linear elastic propagation of multiple fractures. At the end of each time step, the process ensures that the weakest fracture tip is in an equilibrium propagation regime. Furthermore, the solution process provides an initialization procedure for the newly created fracture spaces and an a priori estimate of the stress intensity factor growth rate, improving simulation robustness, and efficiency. The solution process is validated using the Kristianovich-Geertsma-de Klerk analytical solution under the toughness- and viscosity-dominated regimes. It is also extended to and demonstrated on problems with multiple fractures undergoing simultaneous propagation with stress shadow interactions. Numerical examples demonstrate that the solution process can reduce the required computational cost by one order of magnitude compared to other existing methods.

42 ENGINEERING↗

Multiscale model predictive control of battery systems for frequency regulation markets using physics-based models

In this work, we propose a multiscale model predictive control (MPC) framework for stationary battery systems that exploits high-fidelity models to trade-off short-term economic incentives provided by energy and frequency regulation (FR) markets and long-term degradation effects. We find that the MPC framework can drastically reduce long-term degradation while properly responding to FR and energy market signals (compared to MPC formulations that use low-fidelity models). Our results also provide evidence that sophisticated battery models can be embedded within closed-loop MPC simulations by using modern nonlinear programming solvers (we provide an efficient and easy-to-use implementation in Julia). We use insights obtained with our simulations to design a low-complexity MPC formulation that matches the behavior obtained with high-fidelity models. This is done by designing a suitable terminal penalty term that implicitly captures long-term degradation. The results suggest that complex degradation behavior can be accounted for in low-complexity MPC formulations by properly designing the cost function. We believe that our proof-of-concept results can be of industrial relevance, as battery vendors are seeking to participate in fast-changing electricity markets while maintaining asset integrity.

42 ENGINEERING↗

Toward performance-portable PETSc for GPU-based exascale systems

The Portable Extensible Toolkit for Scientific computation (PETSc) library delivers scalable solvers for nonlinear time-dependent differential and algebraic equations and for numerical optimization. The PETSc design for performance portability addresses fundamental GPU accelerator challenges and stresses flexibility and extensibility by separating the programming model used by the application from that used by the library, and it enables application developers to use their preferred programming model, such as Kokkos, RAJA, SYCL, HIP, CUDA, or OpenCL, on upcoming exascale systems. Furthermore, a blueprint for using GPUs from PETSc-based codes is provided, and case studies emphasize the flexibility and high performance achieved on current GPU-based systems.

97 MATHEMATICS AND COMPUTING↗

Joint Design of Multimodal Transit Networks and Shared Autonomous Mobility Fleets

Providing quality transit service to travelers in low-density areas, particularly travelers without personal vehicles, is a constant challenge for transit agencies. The advent of fully-autonomous vehicles (AVs) and their inclusion in mobility service fleets may allow transit agencies to offer better service and/or reduce their own capital and operational costs. This study focuses on the problem of allocating resources between transit patterns and operating (or subsidizing) shared-use AV mobility services (SAMSs) in a large metropolitan area. To address this question, a joint transit network redesign and SAMS fleet size determination problem (JTNR-SFSDP) is introduced, and a bi-level mathematical programming formulation and solution approach are presented. The upper-level problem modifies a transit network frequency setting problem (TNFSP) formulation via incorporating SAMS fleet size as a decision variable and allowing the removal of bus routes. The lower-level problem consists of a dynamic combined mode choice-traveler assignment problem (DCMC-TAP) formulation. The heuristic solution procedure involves solving the upper-level problem using a nonlinear programming solver and solving the lower-level problem using an iterative agent-based assignment-simulation approach. To illustrate the effectiveness of the modeling framework, this study uses traveler demand from Chicago along with the regions existing multimodal transit network. The computational results indicate significant traveler benefits, in terms of improved average traveler wait times, associated with optimizing the joint design of multimodal transit networks and SAMS fleets compared with the initial transit network design.

bi-level programming↗

A Julia Framework for Graph-Structured Nonlinear Optimization

Graph theory provides a convenient framework for modeling and solving structured optimization problems. Under this framework, the modeler can arrange/assemble the components of an optimization model (variables, constraints, objective functions, and data) within nodes and edges of a graph, and this representation can be used to visualize, manipulate, and solve the problem. In this work, we present a Julia framework for modeling and solving graph-structured nonlinear optimization problems. Our framework integrates the modeling package Plasmo.jl (which facilitates the construction and manipulation of graph models) and the nonlinear optimization solver MadNLP.jl (which provides capabilities for exploiting graph structures to accelerate solution). We illustrate with a simple example how model construction and manipulation can be performed in an intuitive manner using Plasmo.jl and how the model structure can be exploited by MadNLP.jl. We also demonstrate the scalability of the framework by targeting a large-scale, stochastic gas network problem that contains over 1.7 million variables.

Cole, David↗

A Two-Stage Decomposition Approach for AC Optimal Power Flow

The alternating current optimal power flow (AC-OPF) problem is critical to power system operations and planning, but it is generally hard to solve due to its nonconvex and large-scale nature. Furthermore, this paper proposes a scalable decomposition approach in which the power network is decomposed into a master network and a number of subnetworks, where each network has its own AC-OPF subproblem. This formulates a two-stage optimization problem and requires only a small amount of communication between the master and subnetworks. The key contribution is a smoothing technique that renders the response of a subnetwork differentiable with respect to the input from the master problem, utilizing properties of the barrier problem formulation that naturally arises when subproblems are solved by a primal-dual interior-point algorithm. Consequently, existing efficient nonlinear programming solvers can be used for both the master problem and the subproblems. The advantage of this framework is that speedup can be obtained by processing the subnetworks in parallel, and it has convergence guarantees under reasonable assumptions. The formulation is readily extended to instances with stochastic subnetwork loads. Numerical results show favorable performance and illustrate the scalability of the algorithm which is able to solve instances with more than 11 million buses.

24 POWER TRANSMISSION AND DISTRIBUTION↗