Searcharxiv⌕ Search

arXiv · 2610.14466

Memory-Augmented Phase-Field Modeling: Onsager Formulation, Internal-Variable Lifting, and Structure-Preserving Computation

Abstract

In this work, we develop a general memory-augmented phase-field (MAPF) framework based on Onsager's variational principle, in which memory effects are incorporated through a general relaxation kernel while preserving the thermodynamic consistency of the underlying system. Rather than treating fractional models as fundamental formulations, we show that they can be interpreted as reduced descriptions associated with specific power-law memory kernels. The proposed MAPF equations provide a unified modeling framework for non-Markovian phase-field dynamics. To facilitate analysis and computation, we further introduce an equivalent internal-variable representation that transforms the original nonlocal-in-time dynamics into an extended Markovian gradient system. This formulation preserves key structural properties, including energy dissipation and mass conservation, and enables the development of efficient structure-preserving numerical schemes. In particular, we construct an energy-stable scalar auxiliary variable approach combined with a fast rank-one implementation that exploits the relaxation-spectrum-induced coupling structure, resulting in a computationally efficient algorithm with reduced storage requirements. The proposed framework establishes a systematic connection between memory-dependent phase-field modeling, internal-variable thermodynamics, and structure-preserving numerical computation. Numerical experiments demonstrate the accuracy, stability, and efficiency of the proposed methods for phase-field dynamics with long-time memory effects.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peng Ding, Qingxia Liu, Zhiping Mao, Zhen Zhang. 2026-10-10. Memory-Augmented Phase-Field Modeling: Onsager Formulation, Internal-Variable Lifting, and Structure-Preserving Computation. https://arxiv.org/abs/2610.14466

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Symmetric two-level preconditioning for the method of reflections

We develop and analyze a symmetric two-level preconditioner for the method of reflections for Laplace problems in perforated domains. Using constant boundary modes, we define a coarse correction through a symmetric coercive dual formulation. Combining this coarse correction with parallel reflection corrections gives a symmetric positive definite preconditioner for solving the dual system by the conjugate gradient method. Under a geometric separation condition, we prove a condition number bound independent of the number and sizes of the holes and the diameter of the ambient domain. We also derive geometry-dependent convergence estimates for the one-level methods that explain the need for a coarse correction.

math.NA↗

Convergence of Least Squares Methods for PDEs on R^d with Shallow ReLU^k Networks

We establish inverse inequalities in Gaussian Sobolev norms for shallow $\mathrm{ReLU}^k$ trial spaces. The estimates identify the sharp regularity threshold and quantify the dependence on parameter separation and bias magnitude. Based on these estimates, we prove convergence of weighted least squares discretizations of linear PDEs on $\mathbb R^d$ using shallow networks with prescribed inner parameters and finitely many residual samples in an expanding ball. Under suitable stability and regularity assumptions, we obtain an error bound of order $h^{k+(d+1)/2-r}δ_\pm^{-(S-r)}$ in the Gaussian Sobolev norm of order $S$, up to logarithmic factors, where $r$ is the PDE order, $h$ is the parameter fill distance, and $δ_\pm$ is the antipodal separation. The convergence results cover deterministic and random sampling and extend to fixed bounded regions by restriction. We construct parameter sets with $δ_\pm\asymp h$, yielding a convergence rate in terms of the network width that matches a lower bound up to logarithmic factors. Numerical experiments support the theoretical results and provide practical guidance on balancing accuracy and stability.

math.NA↗

A new convergence proof for an iterative scheme for elliptic Cauchy problems based on alternating orthogonal projections

We consider an elliptic Cauchy problem for the Poisson equation in which both Dirichlet and Neumann boundary data are prescribed only on a portion of the boundary, while no boundary conditions are available on the remaining part of the boundary. Such problems are severely ill-posed. In this work, we study the convergence of an iterative method based on the alternating imposition of Dirichlet and Neumann boundary conditions. We formulate the scheme within a Hilbert space framework, where a yet another alternation becomes apparent: each iteration can now be interpreted as an orthogonal projection onto an appropriate closed subspace. This perspective provides a transparent geometric interpretation of the algorithm and yields a concise convergence proof based on von Neumann's classical result on alternating (orthogonal) projections. In addition to elucidating the convergence of the method, this alternating projections perspective also offers a general rate of convergence in terms of the Friedrichs angle (between two closed subspaces). We point out by means of an example that such convergence rate estimate degenerates for the elliptic Cauchy problem under consideration.

math.NA↗