Approximate linearization of fixed-point iterations. Error analysis of tangent and adjoint problems linearized about non-stationary points

DOI10.1007/S11075-022-01274-2OpenAlexW4220934972MaRDI QIDQ2674572FDOQ2674572

Authors: Emmett Padway, Dimitri Mavriplis 

Publication date: 14 September 2022

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.02826

zbMATH Keywords

optimizationcomputational fluid dynamicsgradientsdiscrete adjointfixed-point iterations

Mathematics Subject Classification ID

Numerical methods for partial differential equations, initial value and time-dependent initial-boundary value problems (65Mxx)

Cites Work

• Parallel iterative methods for sparse linear systems
• Title not available (Why is that?)
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Approximate Riemann solvers, parameter vectors, and difference schemes. (Reprint)
• Anisotropic grid adaptation for functional outputs: application to two-dimensional viscous flows.
• Sensitivity analysis of limit cycle oscillations
• Simultaneous single-step one-shot optimization with unsteady PDEs
• An implicit block ILU smoother for preconditioning of Newton-Krylov solvers with application in high-order stabilized finite-element methods
• Consistent treatment of incompletely converged iterative linear solvers in reverse-mode algorithmic differentiation

Cited In (2)

• Approximate Linearization of Fixed Point Iterations: Error Analysis of Tangent and Adjoint Problems Linearized about Non-Stationary Points
• A non‐iterative method for approximation of the exact solution to the point‐to‐plane variational problem for orthogonal transformations

Uses Software

• SNOPT

This page was built for publication: Approximate linearization of fixed-point iterations. Error analysis of tangent and adjoint problems linearized about non-stationary points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674572)