A boosted second-order convex splitting algorithm based on gradient flows
For researchers in numerical analysis and phase-field modeling, this work provides a more efficient and robust algorithm for solving gradient flow problems, though it is an incremental improvement over existing splitting methods.
This paper proposes a second-order convex splitting scheme for gradient flows in phase-field models, achieving global convergence under mild assumptions and improved computational efficiency over first-order methods, as demonstrated by numerical experiments.
This paper introduces a second-order convex splitting scheme for gradient flows arising in phase-field models, based on the backward differentiation formula (BDF2) for the implicit part and the Adams-Bashforth method for the nonlinear and explicit component. The method is formulated and analyzed in finite-dimensional spaces, where energy stability plays a central role in establishing rigorous convergence properties. By leveraging the Kurdyka-Łojasiewicz framework, we prove the global convergence of the discrete trajectories generated by the scheme, even in the presence of nonsmooth energy functionals, under mild assumptions on the time-step size. The Armijo line search strategy and the classical preconditioning strategies, such as symmetric Gauss-Seidel and Jacobi, are incorporated to improve its computational efficiency. Numerical experiments confirm that the proposed method achieves computational efficiency compared to existing first-order splitting approaches and other accelerated splitting algorithms, while maintaining robustness in both smooth and nonsmooth regimes.