Synthesizing Sound and Precise Abstract Transformers for Nonlinear Hyperbolic PDE Solvers
Explore the source record for details and available documents.
Mathematics and Computing↗
SEARCH · Search NASA
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.
A two-and-a-half dimensional symplectic space-charge solver
The nonlinear space-charge effect plays a significant role in high-intensity accelerators and has been extensively studied using multi-particle tracking methods. In this paper, we present a novel 2.5- dimensional symplectic space-charge solver specifically designed for long beam bunches. We begin by detailing its application to a transverse Gaussian density distribution under open boundary conditions in a straight system, where a semi-analytical expression is derived. We then demonstrate the solver’s adaptation to arbitrary distributions in open space, as well as within rectangular and round conducting pipes. Finally, we discuss the extension of this solver to circular accelerator systems. This study shows that the fast 2.5-dimensional solver can be a good approximation to the fully three-dimensional solver for long bunches in large circular accelerators.
Beam code development & simulation techniques↗
Efficient proximal subproblem solvers for a nonsmooth trust-region method
In [R. J. Baraldi and D. P. Kouri, Mathematical Programming, (2022), pp. 1-40], we introduced an inexact trust-region algorithm for minimizing the sum of a smooth nonconvex and nonsmooth convex function. The principle expense of this method is in computing a trial iterate that satisfies the so-called fraction of Cauchy decrease condition—a bound that ensures the trial iterate produces sufficient decrease of the subproblem model. In this paper, we expound on various proximal trust-region subproblem solvers that generalize traditional trust-region methods for smooth unconstrained and convex-constrained problems. We introduce a simplified spectral proximal gradient solver, a truncated nonlinear conjugate gradient solver, and a dogleg method. Finally, we compare algorithm performance on examples from data science and PDE-constrained optimization.
97 MATHEMATICS AND COMPUTING↗
On relaxations of the max k -cut problem formulations
Here, a tight continuous relaxation is a crucial factor in solving mixed integer formulations of many NP-hard combinatorial optimization problems. The (weighted) max k-cut problem is a fundamental combinatorial optimization problem with multiple notorious mixed integer optimization formulations. In this paper, we explore four existing mixed integer optimization formulations of the max k-cut problem. Specifically, we show that the continuous relaxation of a binary quadratic optimization formulation of the problem is: (i) stronger than the continuous relaxation of two mixed integer linear optimization formulations and (ii) at least as strong as the continuous relaxation of a mixed integer semidefinite optimization formulation. We also conduct a set of experiments on multiple sets of instances of the max k-cut problem using state-of-the-art solvers that empirically confirm the theoretical results in item (i). Furthermore, these numerical results illustrate the advances in the efficiency of global non-convex quadratic optimization solvers and more general mixed integer nonlinear optimization solvers. As a result, these solvers provide a promising option to solve combinatorial optimization problems. Our codes and data are available on GitHub.
97 MATHEMATICS AND COMPUTING↗
A unified funnel restoration SQP algorithm
We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of basic algorithmic ingredients that unifies a broad range of nonlinear optimization solvers. This framework has been implemented in the open-source solver Uno, a Swiss Army knife-like C++ optimization framework that unifies many nonlinearly constrained nonconvex optimization solvers. We illustrate the framework with a sequential quadratic programming (SQP) algorithm that maintains an acceptable upper bound on the constraint violation, called a funnel, that is monotonically decreased to control the feasibility of the iterates. Infeasible quadratic subproblems are handled by a feasibility restoration strategy. Globalization is controlled by a line search or a trust-region method. We prove global convergence of the trust-region funnel SQP method, building on known results from filter methods. We implement the algorithm in Uno, and we provide extensive test results for the trust-region line-search funnel SQP on small CUTEst instances.
Kiessling, David [Katholieke Univ. Leuven, Heverle↗
An optimization-inspired solver for inequality constrained nonlinear solid mechanics.
Abstract not provided.
Tupek, Michael↗
An efficient procedure for cascade aeroelastic stability determination using nonlinear, time-marching aerodynamic solvers
A numerical eigenvalue problem formulation and a practical calculation procedure for exact eigenvalues and corresponding eigenvectors are developed and applied to a nonlinear, two-dimensional, time-marching full potential solver for cascade aeroelastic stability analysis. This procedure is based on the Lanczos recursive method and it directly calculates stability information about a nonlinear steady state. It is compared to conventional approaches in the frequency and time domains developed earlier and is found to be 100-10.000 times more computationally efficient. Eigenvalue constellations and the flutter results for flow through a cascade SR5 propfan airfoil are presented.
Mahajan, Aparajit J.↗
Aerodynamic Shape Optimization Using A Real-Number-Encoded Genetic Algorithm
A new method for aerodynamic shape optimization using a genetic algorithm with real number encoding is presented. The algorithm is used to optimize three different problems, a simple hill climbing problem, a quasi-one-dimensional nozzle problem using an Euler equation solver and a three-dimensional transonic wing problem using a nonlinear potential solver. Results indicate that the genetic algorithm is easy to implement and extremely reliable, being relatively insensitive to design space noise.
Holst, Terry L.↗
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↗
High-order fully implicit solver for all-speed fluid dynamics: AUSM ride from nearly incompressible variable-density flows to shock dynamics
We introduce a novel Newton–Krylov (NK)-based fully implicit algorithm for solving fluid flows in a wide range of flow conditions—from variable density nearly incompressible to supersonic shock dynamics. The key enabling feature of our all-speed solver is the ability to efficiently solve conservation laws by choosing a set of independent variables that produce a well-conditioned Jacobian matrix for the linear iterations of the global nonlinear iterative solver. In particular, instead of choosing to discretize the conservative variables (density, momentum, total energy), which is traditionally used in Eulerian high-speed compressible fluid dynamics, we demonstrate superior performance by discretizing the primitive variables—pressure–velocity–temperature in the very low-Mach flow limits or density–velocity–temperature/entropy in the shock dynamics range. Moreover, our method allows us to avoid direct inversion of the mass matrix in discrete time derivatives, which is usually an additional source for stiffness, especially pronounced when going to very high-order schemes with non-orthogonal basis functions. Here, we show robust solutions obtained for discontinuous finite element discretization up to seventh-order accuracy. Another important aspect of the solution algorithm is the Advection Upstream Splitting Method (AUSM), adopted to compute numerical fluxes within our reconstructed discontinuous Galerkin (rDG) spatial discretization scheme. The use of the low-Mach modification of the hyperbolic flux operator is found to be necessary for enabling robust simulations of very stiff liquids and metals for Mach numbers below M=10 -5 , which is well known to be very computationally challenging for compressible solvers. We demonstrate that our fully implicit rDG-NK solver with the AUSM + -up flux treatment produces efficient and high-resolution numerical solutions at all speeds, ranging from vanishing Mach numbers to transonic and supersonic, without substantial modifications of the solution procedures. (At high speed, we add limiting and use a simpler preconditioning of the Krylov solver.) Numerical examples include nearly incompressible constant-property flow past a backward-facing step with heat transfer, low-Mach variable-property channel flow of water at supercritical state, phase change and melt pool dynamics for laser spot welding and selective laser melting in additive manufacturing, and Mach 3 flow in a wind tunnel with a step.
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↗