Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Convergent”

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

Rainfall Morphology in Semi-Tropical Convergence Zones

Central Florida is the ideal test laboratory for studying convergence zone-induced convection. The region regularly experiences sea breeze fronts and rainfall-induced outflow boundaries. The focus of this study is the common yet poorly-studied convergence zone established by the interaction of the sea breeze front and an outflow boundary. Previous studies have investigated mechanisms primarily affecting storm initiation by such convergence zones. Few have focused on rainfall morphology yet these storms contribute a significant amount precipitation to the annual rainfall budget. Low-level convergence and mid-tropospheric moisture have both been shown to correlate with rainfall amounts in Florida. Using 2D and 3D numerical simulations, the roles of low-level convergence and mid-tropospheric moisture in rainfall evolution are examined. The results indicate that time-averaged, vertical moisture flux (VMF) at the sea breeze front/outflow convergence zone is directly and linearly proportional to initial condensation rates. This proportionality establishes a similar relationship between VMF and initial rainfall. Vertical moisture flux, which encompasses depth and magnitude of convergence, is better correlated to initial rainfall production than surface moisture convergence. This extends early observational studies which linked rainfall in Florida to surface moisture convergence. The amount and distribution of mid-tropospheric moisture determines how rainfall associated with secondary cells develop. Rainfall amount and efficiency varied significantly over an observable range of relative humidities in the 850- 500 mb layer even though rainfall evolution was similar during the initial or "first-cell" period. Rainfall variability was attributed to drier mid-tropospheric environments inhibiting secondary cell development through entrainment effects. Observationally, 850-500 mb moisture structure exhibits wider variability than lower level moisture, which is virtually always present in Florida. A likely consequence of the variability in 850-500 moisture is a stronger statistical correlation to rainfall, which observational studies have noted. The study indicates that vertical moisture flux forcing at convergence zones is critical in determining rainfall in the initial stage of development but plays a decreasing role in rainfall evolution as the system matures. The mid-tropospheric moisture (e.g. environment) plays an increasing role in rainfall evolution as the system matures. This suggests the need to improve measurements of magnitude/depth of convergence and mid-tropospheric moisture distribution. It also highlights the need for better parameterization of entrainment and vertical moisture distribution in larger-scale models.

Shepherd, J. Marshall↗

Convergence of Eigenvector Continuation

Eigenvector continuation is a computational method that finds the extremal eigenvalues and eigenvectors of a Hamiltonian matrix with one or more control parameters. It does this by projection onto a subspace of eigenvectors corresponding to selected training values of the control parameters. The method has proven to be very efficient and accurate for interpolating and extrapolating eigenvectors. However, almost nothing is known about how the method converges, and its rapid convergence properties have remained mysterious. In this Letter, we present the first study of the convergence of eigenvector continuation. In order to perform the mathematical analysis, we introduce a new variant of eigenvector continuation that we call vector continuation. We first prove that eigenvector continuation and vector continuation have identical convergence properties and then analyze the convergence of vector continuation. Our analysis shows that, in general, eigenvector continuation converges more rapidly than perturbation theory. The faster convergence is achieved by eliminating a phenomenon that we call differential folding, the interference between nonorthogonal vectors appearing at different orders in perturbation theory. From our analysis we can predict how eigenvector continuation converges both inside and outside the radius of convergence of perturbation theory. Further, while eigenvector continuation is a nonperturbative method, we show that its rate of convergence can be deduced from power series expansions of the eigenvectors. Our results also yield new insights into the nature of divergences in perturbation theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Convergence of Defect-Correction and Multigrid Iterations for Inviscid Flows

Convergence of multigrid and defect-correction iterations is comprehensively studied within different incompressible and compressible inviscid regimes on high-density grids. Good smoothing properties of the defect-correction relaxation have been shown using both a modified Fourier analysis and a more general idealized-coarse-grid analysis. Single-grid defect correction alone has some slowly converging iterations on grids of medium density. The convergence is especially slow for near-sonic flows and for very low compressible Mach numbers. Additionally, the fast asymptotic convergence seen on medium density grids deteriorates on high-density grids. Certain downstream-boundary modes are very slowly damped on high-density grids. Multigrid scheme accelerates convergence of the slow defect-correction iterations to the extent determined by the coarse-grid correction. The two-level asymptotic convergence rates are stable and significantly below one in most of the regions but slow convergence is noted for near-sonic and very low-Mach compressible flows. Multigrid solver has been applied to the NACA 0012 airfoil and to different flow regimes, such as near-tangency and stagnation. Certain convergence difficulties have been encountered within stagnation regions. Nonetheless, for the airfoil flow, with a sharp trailing-edge, residuals were fast converging for a subcritical flow on a sequence of grids. For supercritical flow, residuals converged slower on some intermediate grids than on the finest grid or the two coarsest grids.

Diskin, Boris↗

Chemical timescale effects on detonation convergence

Numerical simulations of detonation-containing flows have emerged as crucial tools for designing next- generation power and propulsion devices. As these tools mature, it is important for the combustion community to properly understand and isolate grid resolution effects when simulating detonations. To this end, the objective of this work is to provide a comprehensive analysis of the numerical convergence of unsteady detonation simulations, with focus on isolating the impacts of chemical timescale modifications on convergence characteristics in the context of operator splitting. With the aid of an AMReX-based adaptive mesh refinement flow solver-which enables resolutions up to ($\mathcal{O}$ (1000) cells-per-induction length-the convergence analysis is conducted using two kinetics configurations: (1) the simplified three-step Arrhenius-based model mechanism of Short and Quirk (1997), where chemical timescales in the detonation are modified by adjusting activation energies in the initiation and branching reactions, and (2) a detailed hydrogen- air mechanism, where the chemical timescales are adjusted by varying the ambient pressure. The convergence of unsteady self-sustained detonations in one-dimensional channels is then analyzed with reference to steady-state theoretical baseline solutions using these mechanisms. The goal of the analysis is to provide a detailed comparison of the effects of grid resolution on both macroscopic (peak pressures and wave speeds) and microscopic (wave structure) quantities of interest, drawing connections between the deviations from steady-state baselines and minimum chemical timescales. In particular, chemical timescale reductions were found to have minimal impact on the convergence of macroscopic properties. Furthermore, analyses of microscopic convergence trends, particularly in the reaction front location, revealed a key insight: maintaining the induction time while eliminating prohibitive chemical timescales through mechanism simplifications and combustion modeling can significantly enhance detonation convergence properties. Ultimately, this work uncovers resolution-dependent unsteady detonation convergence regimes and highlights the important role played by not only the chemical timescales, but also the ratio between the chemical timescale and induction time on the numerical convergence of the detonation wave structure.

Adaptive mesh refinement↗

Improving Time Step Convergence in an Atmosphere Model With Simplified Physics: The Impacts of Closure Assumption and Process Coupling

Convergence testing is a common practice in the development of dynamical cores of atmospheric models but is not as often exercised for the parameterization of sub-grid physics. An earlier study revealed that the stratiform cloud parameterizations in several predecessors of the Energy Exascale Earth System Model (E3SM) showed strong time-step sensitivity and slower-than-expected convergence when the model's time step was systematically refined. In this work, a simplified atmosphere model is configured that consists of the spectral-element dynamical core of the E3SM atmosphere model coupled with a large-scale condensation parameterization based on commonly used assumptions. This simplified model also resembles E3SM and its predecessors in the numerical implementation of process coupling and shows poor time-step convergence in short ensemble tests. We present a formal error analysis to reveal the expected time-step convergence rate and the conditions for obtaining such convergence. Numerical experiments are conducted to investigate the root causes of convergence problems. We show that revisions in the process coupling and closure assumption help to improve convergence in short simulations using the simplified model; the same revisions applied to a full atmosphere model lead to significant changes in the simulated long-term climate. This work demonstrates that causes of convergence issues in atmospheric simulations can be understood by combining analyses from physical and mathematical perspectives. Addressing convergence issues can help to obtain a discrete model that is more consistent with the intended representation of the physical phenomena.

54 ENVIRONMENTAL SCIENCES↗

Multi-Federate Co-Convergence with HELICS

In co-simulation studies, convergence refers to the ability of different simulation tools involved to achieve a consistent and stable solution. Convergence is a critical aspect of co-simulation as it determines the accuracy of the results obtained from the simulation. Convergence in co-simulation studies depends on several factors, this includes system complexity, the accuracy of the models used, and the numerical methods employed by the simulation tools. It is essential to ensure that the coupling interfaces between the different tools are designed to allow for data exchange in a consistent and accurate manner. Hierarchical Engine for Large-scale Infrastructure Co-Simulation (HELICS) is an open-source co-simulation framework developed for the energy domain. This paper explores the convergence performance of a set of co-simulation use cases. We further explore the use of a co-convergence helper federate to help with co-simulation convergence. The convergence efficacy of several algorithms (both gradient-based and gradient-free) is tested against these use cases. Finally, the sensitivity of these algorithms to several factors, such as system scaling and others, is tested and detailed in this paper. Our results show that for a subset of use cases, the co-convergence helper federate is able to improve co-simulation convergence significantly.

co-convergence↗

Multilevel Convergence Analysis of Multigrid-Reduction-in-Time

This study presents a multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles, with different relaxation schemes, by deriving the respective residual and error propagation operators. The residual and error operators are functions of the time-stepping operator, analyzed directly and bounded in the norm, both numerically and analytically. We present various upper bounds of different computational cost and varying sharpness. These upper bounds are complemented by proposing analytic formulae for the approximate convergence factor of V-cycle algorithms that take the number of fine grid time points, the temporal coarsening factors, and the eigenvalues of the time-stepping operator as parameters. The paper concludes with supporting numerical investigations of parabolic (anisotropic diffusion) and hyperbolic (wave equation) model problems. We assess the sharpness of the bounds and the quality of the approximate convergence factors. Observations from these numerical investigations demonstrate the value of the proposed multilevel convergence framework for estimating MGRIT convergence a priori and for the design of a convergent algorithm. We further highlight that observations in the literature are captured by the theory, including that two-level Parareal and multilevel MGRIT with F-relaxation do not yield scalable algorithms and the benefit of a stronger relaxation scheme. An important observation is that with increasing numbers of levels MGRIT convergence deteriorates for the hyperbolic model problem, while constant convergence factors can be achieved for the diffusion equation. The theory also indicates that L-stable Runge--Kutta schemes are more amendable to multilevel parallel-in-time integration with MGRIT than A-stable Runge--Kutta schemes.

97 MATHEMATICS AND COMPUTING↗

Convergence acceleration of implicit schemes in the presence of high aspect ratio grid cells

The performance of Navier-Stokes codes are influenced by several phenomena. For example, the robustness of the code may be compromised by the lack of grid resolution, by a need for more precise initial conditions or because all or part of the flowfield lies outside the flow regime in which the algorithm converges efficiently. A primary example of the latter effect is the presence of extended low Mach number and/or low Reynolds number regions which cause convergence deterioration of time marching algorithms. Recent research into this problem by several workers including the present authors has largely negated this difficulty through the introduction of time-derivative preconditioning. In the present paper, we employ the preconditioned algorithm to address convergence difficulties arising from sensitivity to grid stretching and high aspect ratio grid cells. Strong grid stretching is particularly characteristic of turbulent flow calculations where the grid must be refined very tightly in the dimension normal to the wall, without a similar refinement in the tangential direction. High aspect ratio grid cells also arise in problems that involve high aspect ratio domains such as combustor coolant channels. In both situations, the high aspect ratio cells can lead to extreme deterioration in convergence. It is the purpose of the present paper to address the reasons for this adverse response to grid stretching and to suggest methods for enhancing convergence under such circumstances. Numerical algorithms typically possess a maximum allowable or optimum value for the time step size, expressed in non-dimensional terms as a CFL number or vonNeumann number (VNN). In the presence of high aspect ratio cells, the smallest dimension of the grid cell controls the time step size causing it to be extremely small, which in turn results in the deterioration of convergence behavior. For explicit schemes, this time step limitation cannot be exceeded without violating stability restrictions of the scheme. On the other hand, for implicit schemes, which are typically unconditionally stable, there appears to be room for improvement through careful tailoring of the time step definition based on results of linear stability analyses. In the present paper, we focus on the central-differenced alternating direction implicit (ADI) scheme. The understanding garnered from this analyses can then be applied to other implicit schemes. In order to systematically study the effects of aspect ratio and the methods of mitigating the associated problems, we use a two pronged approach. We use stability analyses as a tool for predicting numerical convergence behavior and numerical experiments on simple model problems to verify predicted trends. Based on these analyses, we determine that efficient convergence may be obtained at all aspect ratios by getting a combination of things right. Primary among these are the proper definition of the time step size, proper selection of viscous preconditioner and the precise treatment of boundary conditions. These algorithmic improvements are then applied to a variety of test cases to demonstrate uniform convergence at all aspect ratios.

Buelow, B. E. O.↗

Convergence Analysis of Turbulent Flow Solutions

Data from the "Turbulence Modeling Resource" website for turbulent flow over an NACA-0012 airfoil is analyzed to determine the convergence behavior of three second-order CFD (Computational Fluid Dynamics) codes: CFL3D (Computational Fluids Lab 3 Dimensional flow solver), FUN3D (Fully Unstructured Navier-stokes flow solver), and TAU (German Aerospace Center (DLR) 2 dimensional code for unstructured hybrid grids solving the Reynolds-Averaged Navier-Stokes equations or the Euler equations). The convergence of both integrated properties and pointwise data are examined. Several different methods for estimating errors and computing convergence rates are compared. A high-order extension to the Richardson extrapolation is developed that improves the accuracy of the mesh limit values and provides a quantitative estimate of the threshold of the asymptotic regime. The coefficient of total drag exhibits second-order convergence for all three codes, and convergence is monotone over a sequence of 7 grids. Other force coefficients are not so well behaved. The convergence rates of the viscous component of drag on the three nest grids ranges from 3:0 for CFL3D to 1:0 for FUN3D. The three codes are converging to similar but not identical solutions. The largest differences between the codes are in the coefficient of lift for which the difference between CFL3D and FUN3D is greater than 10 (sup minus 4). The best agreement occurs in the viscous component of drag, which is the only force component for which all three codes are converging towards each other at a rate of second-order. The agreement between the two unstructured grid codes is good with all properties except lift converging towards common values at a rate of second-order. No one code was universally better than the other. The TAU code has the lowest error in total drag, FUN3D has the lowest error in lift, and CFL3D has the lowest error in the viscous component of drag.

Atkins, Harold L.↗

On nonlocal problems with Neumann boundary conditions: scaling and convergence for nonlocal operators and solutions

Formulations of Neumann-type boundary conditions for boundary value problems in the nonlocal framework are beset with difficulties, some related to the choice of a proper scaling. Here we identify a space-dependent scaling for a nonlocal Neumann operator, for which we prove linear in δ (δ being the radius for the support for the kernel) convergence of the Neumann operator and $\mathcal{O}$(δ 2 ) convergence of solutions to their classical counterparts. The pointwise-like convergence of the nonlocal normal operator is cast as a new type of two-scale operator-point convergence, which we call condensated convergence . The results hold for general integrable kernels, a setting which is favored in numerical simulations. We support this analysis with numerical convergence studies using a piecewise linear discontinuous Galerkin discretization and show an $\mathcal{O}$(δ 2 ) rate of convergence of solutions, also exhibiting an $\mathcal{O}$(h 2 ) convergence, where h is the mesh size.

97 MATHEMATICS AND COMPUTING↗

Surface convergence techniques and the prediction of lightning at Kennedy Space Center

This study compares two convergence techniques leading to the prediction of convective development and lightning: the area-averaged technique and a convergence cell approach. The area-averaged technique uses total area divergence across the network to identify the potential for new, local thunderstorm growth. A threshold of 75 x 10 to the -6th/s change in divergence is used to define a convergence event, and a separation of 30 minutes between flashes defines a lightning event. Convergence-lightning life cycles are found to be on the order of 1 hour from beginning convergence to first flash, and more than 2 hours from beginning convergence to the end of lightning. The convergence cell technique measures the strength of the convergence cell, which in turn leads to vertical development. Therefore, the likely lightning location and intensity can be ascertained in the larger network. Several cells can be monitored in the recently expanded Kennedy Space Center forecast network at the same time.

Watson, Andrew I.↗

Newton-Raphson AC Power Flow Convergence Based on Deep Learning Initialization and Homotopy Continuation

Power flow forms the basis of many power system studies. With the increased penetration of renewable energy, grid planners tend to perform multiple power flow simulations under various operating conditions and not just selected snapshots at peak or light load conditions. Getting a converged AC power flow (ACPF) case remains a significant challenge for grid planners especially in large power grid networks. This paper proposes a two-stage approach to improve Newton-Raphson ACPF convergence and was applied to a 6102 bus Electric Reliability Council of Texas (ERCOT) system. The first stage utilizes a deep learning-based initializer with data re-training. Here a deep neural network (DNN) initializer is developed to provide better initial voltage magnitude and angle guesses to aid in power flow convergence. This is because Newton-Raphson ACPF is quite sensitive to the initial conditions and bad initialization could lead to divergence. The DNN initializer includes a data re-training framework that improves the initializer's performance when faced with limited training data. The DNN initializer successfully solved 3,285 cases out of 3,899 non-converging dispatch and performed better than random forest and DC power flow initialization methods. ACPF cases not solved in this first stage are then passed through a hot-starting algorithm based on homotopy continuation with switched shunt control. The hot-starting algorithm successfully converged 416 cases out of the remaining 614 non-converging ACPF dispatch. In conclusion, the combined two-stage approach achieved a 94.9% success rate, by converging a total of 3,701 cases out of the initial 3,899 unsolved cases.

Deep learning↗

When band convergence is not beneficial for thermoelectrics

Abstract Band convergence is considered a clear benefit to thermoelectric performance because it increases the charge carrier concentration for a given Fermi level, which typically enhances charge conductivity while preserving the Seebeck coefficient. However, this advantage hinges on the assumption that interband scattering of carriers is weak or insignificant. With first-principles treatment of electron-phonon scattering in the CaMg 2 Sb 2 -CaZn 2 Sb 2 Zintl system and full Heusler Sr 2 SbAu, we demonstrate that the benefit of band convergence can be intrinsically negated by interband scattering depending on the manner in which bands converge. In the Zintl alloy, band convergence does not improve weighted mobility or the density-of-states effective mass. We trace the underlying reason to the fact that the bands converge at a one k-point, which induces strong interband scattering of both the deformation-potential and the polar-optical kinds. The case contrasts with band convergence at distant k-points (as in the full Heusler), which better preserves the single-band scattering behavior thereby successfully leading to improved performance. Therefore, we suggest that band convergence as thermoelectric design principle is best suited to cases in which it occurs at distant k-points.

42 ENGINEERING↗

The convergence of quadrupole rotational invariants from the nuclear shell model

Nuclei exhibit both single-particle and collective degrees of freedom, with the latter often subdivided into vibrational and rotational motions. Experimentally identifying the relative roles of these collective modes is extremely challenging, particularly in the face of possible shape coexistence. Model-independent, invariant quantities describing the deformation of a nucleus in the intrinsic frame have long been known but their determination potentially requires a large quantity of experimental data to achieve convergence. Through comparison with the nuclear shell model, the question of convergence is addressed. Shell-model calculations performed in the sd- and pf-shell model spaces are used to determine electric-quadrupole matrix elements for a multitude of low-lying states using the first 40 states of the relevant spins. Relative contributions to the rotationally invariant quantities from multiple states can therefore be determined. It is found that, on average, the inclusion of four intermediate states results in the leading-order invariant, $\langle\hat{Q^2}\rangle$, converging to within 10% of its true value and the triaxiality term, cos (3δ), converging to its true value, though some variance remains. Higher-order quantities relating to the softness of the nuclear shape are found to converge more slowly. The convergence of quadrupole rotationally invariant sum rules was quantified in the sd- and pf-shell model spaces and indicates the challenge inherent in a full determination of nuclear shape. The present study is limited to relatively small valence spaces. Finally, larger spaces, such as the rare-earth region, potentially offer faster convergence.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Reliability enhancement of Navier-Stokes codes through convergence acceleration

Methods for enhancing the reliability of Navier-Stokes computer codes through improving convergence characteristics are presented. The improving of these characteristics decreases the likelihood of code unreliability and user interventions in a design environment. The problem referred to as a 'stiffness' in the governing equations for propulsion-related flowfields is investigated, particularly in regard to common sources of equation stiffness that lead to convergence degradation of CFD algorithms. Von Neumann stability theory is employed as a tool to study the convergence difficulties involved. Based on the stability results, improved algorithms are devised to ensure efficient convergence in different situations. A number of test cases are considered to confirm a correlation between stability theory and numerical convergence. The examples of turbulent and reacting flow are presented, and a generalized form of the preconditioning matrix is derived to handle these problems, i.e., the problems involving additional differential equations for describing the transport of turbulent kinetic energy, dissipation rate and chemical species. Algorithms for unsteady computations are considered. The extension of the preconditioning techniques and algorithms derived for Navier-Stokes computations to three-dimensional flow problems is discussed. New methods to accelerate the convergence of iterative schemes for the numerical integration of systems of partial differential equtions are developed, with a special emphasis on the acceleration of convergence on highly clustered grids.

Merkle, Charles L.↗

Convergence Analysis of the Alternating Anderson–Picard Method for Nonlinear Fixed-Point Problems

Anderson acceleration (AA) has been widely used to solve nonlinear fixed-point problems due to its rapid convergence. This work focuses on a variant of AA in which multiple Picard iterations are performed between each AA step, referred to as the Alternating Anderson–Picard (AAP) method. Furthermore, despite introducing more “slow” Picard iterations, this method has been shown to be efficient and even more robust in both linear and nonlinear cases. However, there is a lack of theoretical analysis for AAP in the nonlinear case. In this paper, we address this gap by establishing the equivalence between AAP and a multisecant-GMRES method that uses GMRES to solve a multisecant linear system at each iteration. From this perspective, we show that AAP “converges” to the Newton-GMRES method. Specifically, as the residual approaches zero, the multisecant matrix, the approximate Jacobian inverse, the search direction, and the optimization gain of AAP converge to their counterparts in the Newton-GMRES method. These connections provide insights for analyzing the asymptotic convergence properties of AAP. Consequently, we show that AAP is locally 𝑞-linear convergent and provide an upper bound for the convergence factor of AAP. To validate the theoretical results, numerical examples are provided.

Anderson acceleration↗

Convergence Criteria for Multiphysics Simulations

The behavior of engineered systems is often influenced by multiple physical phenomena, such as mechanical deformation, heat transfer, and chemical species transport and reactions. There are often strong interactions between these phenomena, and there is increasing interest in applying coupled-physics models to improve understanding of physical behavior under complex environmental conditions. Multiple simulation frameworks that facilitate coupled-physics simulations are in widespread use, and these employ a variety of techniques to account for interactions between those physics. Many frameworks solve the physics models independently and transfer results between them. Alternatively, a single monolithic system of equations for every physics model can be formed and solved. Each of these approaches has its benefits and drawbacks, and the optimal approach varies depending on the nature of the problem. The open-source MOOSE framework was developed targeting solution of large-scale multiphysics problems. Although it provides options for all these coupling approaches, its standard approach for multiphysics solutions is to form and solve a single monolithic system of equations containing the unknowns for all physics models. MOOSE provides a streamlined approach for users to define the solution variables, the terms in the partial differential equations pertaining to each variable, and interactions between solution variables. One aspect of the monolithic solution approach that can be problematic, however, is defining appropriate convergence criteria for the nonlinear system. A standard approach is to determine convergence is to simply take a norm of the residual vector corresponding to the full vector of unknowns. However, if the residual vector contains variables for multiple physics models, the magnitudes of those variables can differ significantly, and the variables can converge at significantly different rates from each other. It is important to ensure that the variables for each of the physics are converged, and also ensure that the convergence criteria are not excessively stringent in cases when there is little change in the solution. This talk presents representative multiphysics problems to highlight these issues, and shows strategies for convergence criteria in MOOSE that are robust for multiphysics models under a variety of conditions.

97 - MATHEMATICS AND COMPUTING↗

On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control

Here, we study the convergence properties of an overlapping Schwarz decomposition algorithm for solving nonlinear optimal control problems (OCPs). The algorithm decomposes the time domain into a set of overlapping subdomains, and solves all subproblems defined over subdomains in parallel. The convergence is attained by updating primal-dual information at the boundaries of overlapping subdomains. We show that the algorithm exhibits local linear convergence, and that the convergence rate improves exponentially with the overlap size. We also establish global convergence results for a general quadratic programming, which enables the application of the Schwarz scheme inside second-order optimization algorithms (e.g., sequential quadratic programming). The theoretical foundation of our convergence analysis is a sensitivity result of nonlinear OCPs, which we call "exponential decay of sensitivity" (EDS). Intuitively, EDS states that the impact of perturbations at domain boundaries (i.e., initial and terminal time) on the solution decays exponentially as one moves into the domain. Here, we expand a previous analysis available in the literature by showing that EDS holds for both primal and dual solutions of nonlinear OCPs, under uniform second-order sufficient condition, controllability condition, and boundedness condition. We conduct experiments with a quadrotor motion planning problem and a partial differential equations (PDE) control problem to validate our theory, and show that the approach is significantly more efficient than alternating direction method of multipliers and as efficient as the centralized interior-point solver.

42 ENGINEERING↗