Picard–Newton finite element iteration for the stationary incompressible magnetohydrodynamics equations

In this work, we propose a two-step finite element iteration for the stationary incompressible magnetohydrodynamics equations and provide a theoretical analysis. In finite element discretization, stable finite element pairs approximate the hydrodynamic unknowns, and continuous finite element is used to discretize the electromagnetic system. To efficiently solve the nonlinear discretized problem, our method involves initially applying the Picard iteration, followed by the Newton iteration. Theoretical proofs confirm that the Picard–Newton iteration is stable and achieves quadratic convergence, with a broader convergence basin than the usual Newton iteration, owing to its improved stability properties. Numerical experiments validate the theoretical conclusions and reveal that this method significantly outperforms standalone Picard or Newton iterations in several benchmark problems.

Authors

Institutions

Publication Details

Journal
Physics of Fluids
Published
2026-02-01
DOI
https://doi.org/10.1063/5.0309707
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Picard–Newton finite element iteration for the stationary incompressible magnetohydrodynamics equations

Meiying Zhang, Xianghai Zhou, Xiaodi Zhang
Physics of Fluids
Advanced Numerical Methods in Computational Mathematics
article

Picard–Newton finite element iteration for the stationary incompressible magnetohydrodynamics equations

Meiying Zhang, Xianghai Zhou, Xiaodi Zhang
article en

Abstract

In this work, we propose a two-step finite element iteration for the stationary incompressible magnetohydrodynamics equations and provide a theoretical analysis. In finite element discretization, stable finite element pairs approximate the hydrodynamic unknowns, and continuous finite element is used to discretize the electromagnetic system. To efficiently solve the nonlinear discretized problem, our method involves initially applying the Picard iteration, followed by the Newton iteration. Theoretical proofs confirm that the Picard–Newton iteration is stable and achieves quadratic convergence, with a broader convergence basin than the usual Newton iteration, owing to its improved stability properties. Numerical experiments validate the theoretical conclusions and reveal that this method significantly outperforms standalone Picard or Newton iterations in several benchmark problems.

Physics of FluidsVol. 38(2)
Sichuan University (CN), Zhengzhou University (CN), Chengdu University (CN)
Openalex Percentile: Top 48%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.