Meiying Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Meiying Zhang has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Xianghai Zhou
School of Mathematics, Sichuan University 2 , Chengdu 610065
1 shared publication - Xiaodi Zhang
School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, China
1 shared publication
Latest Publications
- 1 February 2026
- Published by AIP Publishing in Physics of Fluids
- Vol. 38 (2)
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.
- 1 February 2026
- Published by AIP Publishing in Physics of Fluids
- Vol. 38 (2)
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.