arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2511.09012math.NAcs.NA
收藏

多项式加速的向量问题固定点迭代法

A polynomially accelerated fixed-point iteration for vector problems

Technical office, SolarSud T.R.E.(SolarSud T.R.E. 技术办公室)

Francesco Alemanno

AI总结:

TPA通过多项式加速技术,无需存储历史或求解密集最小二乘问题,有效解决固定点迭代中雅可比矩阵特征值接近1导致的收敛停滞问题。

摘要:

固定点求解器在非线性偏微分方程中无处不在,但当解处的雅可比矩阵具有任意接近1的特征值时,其进展会停滞。我们问是否可以不存储长时间历史或求解密集最小二乘问题来消除这种停滞。在两个假设下——(A1)线性化误差e_n主要由一个乘数m主导,且|m|<1;(A2)残差单调递减——我们构造了一个二次混合的三个迭代项,其误差多项式在m处有一个双重根。这种三点多项式加速器(TPA)可以消除顽固模式,直到o(‖e_n‖),在一维情况下退化为Aitken的Δ²过程,在正则化消失时与双混合安德森步骤匹配,但保持了皮卡德的记忆足迹。唯一的额外成分是一个基于残差的w=(1-m)⁻¹估计,该估计来自一个闭合形式的正则化最小二乘拟合,即使当两个残差几乎相同时也能保持稳定。在具有聚类谱的线性系统、320维的非线性tanh固定点以及50×50泊松离散化问题上的数值实验表明,TPA在32、36和244次映射评估中达到10⁻⁸残差容限。在同一设置下,SOR需要663次迭代,安德森加速(深度m=5)消耗52、38和955次评估。因此,TPA在单个收缩因子限制收敛时提供了一个无参数、常记忆的直接加速器。

英文摘要:

Fixed-point solvers are ubiquitous in nonlinear PDEs, yet their progress collapses whenever the Jacobian at the solution carries an eigenvalue arbitrarily close to one. We ask whether such stagnation can be removed without storing long histories or solving dense least squares. Under two assumptions -- (A1) the linearised error $e_n$ is dominated by a multiplier $m$ with $|m|<1$ and (A2) residuals shrink monotonically -- we construct a quadratic blend of three iterates whose error polynomial has a double root at $m$. This three-point polynomial accelerator (TPA) cancels the stubborn mode up to $o(\|e_n\|)$, reduces to Aitken's $Δ^2$ process in one dimension, and matches a doubly blended Anderson step with depth $m=2$ when the regularisation vanishes, yet it keeps the Picard memory footprint. The only extra ingredient is a residual-based estimate of $w=(1-m)^{-1}$ obtained from a closed-form regularised least-squares fit that remains stable even when two residuals nearly coincide. Numerical experiments on linear systems with clustered spectra, a $320$-dimensional nonlinear $\tanh$ fixed point, and a $50\times 50$ Poisson discretisation show that TPA reaches the $10^{-8}$ residual tolerance in $32$, $36$, and $244$ map evaluations (respectively). In the same settings SOR requires $663$ steps and Anderson acceleration with depth $m=5$ consumes $52$, $38$, and $955$ evaluations. TPA therefore supplies a parameter-free, constant-memory drop-in accelerator whenever a single contraction factor throttles convergence.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑