Searcharxiv⌕ Search

arXiv subjects

Mustafa Ağgül

Publications and source records attributed to Mustafa Ağgül.

2 recordsLinked to original sources

Accelerating the Improved Arrow--Hurwicz Iteration via the Anderson Algorithm for Steady-State Navier--Stokes Equations

We apply Anderson acceleration to the improved Arrow--Hurwicz (IAH) method for the finite element solution of the steady-state incompressible Navier--Stokes equations. The IAH scheme avoids saddle-point solves by decoupling the velocity and pressure updates, but can require prohibitively many iterations, particularly at high Reynolds numbers. To place the acceleration on a rigorous footing, we reformulate the IAH iteration as a nonlinear fixed-point operator $G$ for the grad-div augmented discrete formulation induced by the scheme and establish its well-definedness, Lipschitz continuity, and Fréchet differentiability, thereby verifying the required smoothness conditions locally near the fixed point. Numerical experiments on problems with known analytical solutions, lid-driven cavity flow up to $Re = 15{,}000$, and channel flow over a full step demonstrate that the resulting Anderson-accelerated improved Arrow--Hurwicz algorithm substantially reduces iteration counts and CPU time while retaining the reported manufactured-solution convergence rates and centerline-velocity agreement.

math.NA↗

New Time Integrators and Capabilities in SUNDIALS Versions 6.2.0-7.4.0

SUNDIALS is a well-established numerical library that provides robust and efficient time integrators and nonlinear solvers. This paper overviews several significant improvements and new features added over the last three years to support scientific simulations run on high-performance computing systems. Notably, three new classes of one-step methods have been implemented: low storage Runge-Kutta, symplectic partitioned Runge-Kutta, and operator splitting. In addition, we describe new time step adaptivity support for multirate methods, adjoint sensitivity analysis capabilities for explicit Runge-Kutta methods, additional options for Anderson acceleration in nonlinear solvers, and improved error handling and logging.

cs.MS↗