Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 41 min ago
Peer-reviewedCC BY 4.0Numerical Linear Algebra with Applications

Polynomial extrapolation techniques for accelerating Picard iterations with multigrid solvers for nonlinear problems in isogeometric analysis

Abstract

Vector extrapolation techniques can be highly effective when used to accelerate the convergence of fixed-point iterative methods, such as the Picard method. In this study, we investigate the numerical solution of nonlinear problems. Specifically, we address the nonlinear eigenvalue Bratu problem and the Monge--Ampère equation using a multigrid solver with isogeometric analysis within a Picard iterative framework, accelerated by vector extrapolation techniques. The novel theoretical contribution of this work is a second-order bound on the generalized residual generated by the reduced rank extrapolation (RRE) method in terms of the current error. This bound is established without the additional nondegeneracy condition required by the recalled quadratic-convergence result. However, it does not establish quadratic convergence of the extrapolated iterates. Finally, we conduct a comparative study of the standard Picard method, the Anderson-accelerated Picard method, and the Picard method accelerated by polynomial extrapolation techniques. Several numerical experiments demonstrate that the proposed approach efficiently solves these nonlinear problems.

Related

  1. Estimating the average treatment effect under limited overlap via Polynomial Approximation and Extrapolation
    Shunichiro Orihara, Sho Komukai, Fan Li
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. Visitation measures for non-linear iterations with random perturbations
    Andrey A. Dorogovtsev, Iryna Nishchenko
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
  3. Isogeometric analysis for the Helmholtz transmission eigenvalue problem
    Nizheng Liao, Guanghui Hu, Xucheng Meng
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  4. Efficient r-Adaptive Multipatch Isogeometric Method in Arbitrary Dimension
    Mustapha Bahari, Blaise Faugeras, Bernard Mourrain +1
    HALPreprintCC BY 4.0Full textNumerical analysis & scientific computingHAL
  5. Isogeometric multi-patch preconditioner for time-dependent electromagnetic problems
    Bernard Kapidani, Gabriele Loli, Giancarlo Sangalli +2
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
BibTeX
@article{mouhssine2026polynomial,
  title = {{Polynomial extrapolation techniques for accelerating Picard iterations with multigrid solvers for nonlinear problems in isogeometric analysis}},
  author = {Abdellatif Mouhssine and Ahmed Ratnani and Hassane Sadok},
  journal = {Numerical Linear Algebra with Applications},
  year = {2026},
  month = sep,
  doi = {10.1002/nla.70122},
  url = {https://hal.science/hal-05184430v3},
  note = {CC BY 4.0},
}
RIS
TY  - JOUR
TI  - Polynomial extrapolation techniques for accelerating Picard iterations with multigrid solvers for nonlinear problems in isogeometric analysis
AU  - Abdellatif Mouhssine
AU  - Ahmed Ratnani
AU  - Hassane Sadok
PY  - 2026
DA  - 2026/09/25
JO  - Numerical Linear Algebra with Applications
DO  - 10.1002/nla.70122
UR  - https://hal.science/hal-05184430v3
AB  - Vector extrapolation techniques can be highly effective when used to accelerate the convergence of fixed-point iterative methods, such as the Picard method. In this study, we investigate the numerical solution of nonlinear problems. Specifically, we address the nonlinear eigenvalue Bratu problem and the Monge--Ampère equation using a multigrid solver with isogeometric analysis within a Picard iterative framework, accelerated by vector extrapolation techniques. The novel theoretical contribution of this work is a second-order bound on the generalized residual generated by the reduced rank extrapolation (RRE) method in terms of the current error. This bound is established without the additional nondegeneracy condition required by the recalled quadratic-convergence result. However, it does not establish quadratic convergence of the extrapolated iterates. Finally, we conduct a comparative study of the standard Picard method, the Anderson-accelerated Picard method, and the Picard method accelerated by polynomial extrapolation techniques. Several numerical experiments demonstrate that the proposed approach efficiently solves these nonlinear problems.
SN  - 1070-5325
SN  - 1099-1506
ER  -