Search arXivSearch

arXiv · 2605.02237

A Structure-Preserving Stagewise Rescaling Algorithm for a Two-Dimensional Nonlocal MEMS Equation in an Asymptotically Constant-Feedback Regime

Abstract

Nonlocal MEMS equations exhibit finite-time quenching, or touchdown, which is difficult to capture numerically. We study a stagewise rescaling algorithm for a two-dimensional nonlocal MEMS equation in an asymptotically constant-feedback touchdown regime. The equation is not exactly invariant under the $A^{3/2}$--$A^3$ scaling used here; the scaling is justified when the reciprocal-integral feedback $K(t)=1+\int_Ω(1-u)^{-1}dx$ remains bounded and converges to a finite positive limit, as in the single-point touchdown profiles of Duong--Zaag. In this regime the leading-order core dynamics reduce to a local MEMS equation with an asymptotically constant coefficient. Using a fixed-stage scaling of the deficit variable, we obtain a gradient flow for a rescaled energy at frozen amplitude and prove an exact energy dissipation identity within each stage. We introduce a minimizing-movement stage solver and derive a discrete energy inequality. Since strict monotonicity need not hold across stage transitions, we separate the switch and outer-update defects and prove an exact defect balance. Under a uniform switch-defect estimate, this yields quantitative almost monotonicity and a defect-aware criterion for nonexistence of a global admissible continuation. The numerical section is organized around reproducible two-dimensional reference computations: a full-domain stagewise run showing trigger detection, fixed-stage energy decay, and geometric accumulation of physical time, and a direct fixed-domain energy check. These tests are not used as proof of the bounded-window criterion; instead, they report finite-feedback diagnostics and identify the ideal-transfer switch-energy diagnostics required for a posteriori verification.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Takiko Sasaki, Tetsuji Tokihiro. 2026-05-04. A Structure-Preserving Stagewise Rescaling Algorithm for a Two-Dimensional Nonlocal MEMS Equation in an Asymptotically Constant-Feedback Regime. https://arxiv.org/abs/2605.02237

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

KEEP EXPLORING

Related papers

The Stability of Block Eliminations and Additive Modifications

The block elimination with additive modifications (BEAM) method was recently proposed as a alternative to LU with partial pivoting requiring less communication. Because of the novelty of BEAM, the existing theoretical analysis is lacking. To that end, we analyze both the numerical stability of the underlying block LU factorization and the effects of additive modifications. For the block LU factorization, we are able to improve the previous results of Demmel et al. from being cubic in the element growth to merely quadratic. Furthermore, we propose an alternative measure of element growth that is better aligned with block LU; this new measure of growth allows our analysis to apply to matrices that cannot be factored with pointwise LU. In the second part, we analyzed the modifications produced by BEAM and the effect they have on the condition number and growth factor. Finally, we show that BEAM will not apply any modifications in some cases that regular block LU can safely factor.

math.NA

Efficient Rigorous Continuation via Chebyshev Series Expansion I

We study the global continuation of solution manifolds arising in dynamical systems. We present a rigorous continuation method based on a Chebyshev series expansion of the solution manifold. The branch is first approximated by a high-order Chebyshev interpolation polynomial, and an explicit error bound is then obtained by verifying the contraction of a quasi-Newton operator near this approximation. The contraction is formulated on a weighted $\ell^1$ space, giving a finer control than the typical $C^0$-error bound obtained from the uniform contraction theorem. In fact, the latter follows directly from our contraction operator. Furthermore, we discuss how our strategy applies naturally to pseudo-arclength continuation, where the continuation parameter fails to provide a valid local coordinate, and extends to multi-parameter continuation. Lastly, we detail two applications in which we compute a two-parameter family of steady-states for the Cahn--Hilliard equation, and a one-parameter family of steady-states undergoing saddle-node bifurcations for the Shigesada--Kawasaki--Teramoto system.

math.NA

Efficient iterative techniques for solving tensor problems with the T-product

This paper develops two efficient iterative methods for solving tensor equations under the T-product framework. For T-symmetric positive definite tensor equations of the form $\mathcal{C} \star \mathcal{X} = \mathcal{D}$, we propose a conjugate-gradient-type algorithm that generates orthogonal residual and $\mathcal{C}$-orthogonal direction sequences, ensuring convergence within a finite number of steps. For general consistent tensor equations, we extend the method using a normal-equation transformation, and further adapt it to handle inconsistent systems by solving a least-squares minimization problem. Key advantages include direct tensor-based computations without explicit matrix expansion, rigorous finite-step convergence proofs, and the ability to obtain minimal Frobenius norm solutions. Numerical experiments on synthetic data, benchmark images, and video sequences demonstrate that the proposed algorithms achieve high precision with low computational time, confirming their practicality for large-scale multidimensional problems.

math.NA