<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcq="http://purl.org/dc/terms/"><records count="1" morepages="false" start="1" end="1"><record rownumber="1"><dc:product_type>Journal Article</dc:product_type><dc:title>Efficient Variable Time-stepping Adaptive DLN Algorithms for the Allen-Cahn Equation</dc:title><dc:creator>Chen, Yiming; Luo, Dianlun; Pei, Wenlong; Xing, Yulong</dc:creator><dc:corporate_author/><dc:editor/><dc:description>&lt;title&gt;Abstract&lt;/title&gt; &lt;p&gt;We consider a family of variable time-stepping Dahlquist-Liniger-Nevanlinna (DLN) schemes, which is unconditionally non-linear stable and second order accurate, for the Allen-Cahn equation. The finite element methods are used for the spatial discretization. For the non-linear term, we combine the DLN scheme with two efficient temporal algorithms: partially implicit modified algorithm and scalar auxiliary variable algorithm. For both approaches, we prove the unconditional, long-term stability of the model energy under any arbitrary time step sequence. Moreover, we provide rigorous error analysis for the partially implicit modified algorithm with variable time-stepping. Efficient time-adaptive algorithms based on these schemes are also proposed. Several one- and two-dimensional numerical tests are presented to verify the properties of the proposed time-adaptive DLN methods.&lt;/p&gt;</dc:description><dc:publisher>Springer</dc:publisher><dc:date>2025-08-01</dc:date><dc:nsf_par_id>10633215</dc:nsf_par_id><dc:journal_name>Journal of Scientific Computing</dc:journal_name><dc:journal_volume>104</dc:journal_volume><dc:journal_issue>2</dc:journal_issue><dc:page_range_or_elocation/><dc:issn>0885-7474</dc:issn><dc:isbn/><dc:doi>https://doi.org/10.1007/s10915-025-02980-4</dc:doi><dcq:identifierAwardId>2309590</dcq:identifierAwardId><dc:subject/><dc:version_number/><dc:location/><dc:rights/><dc:institution/><dc:sponsoring_org>National Science Foundation</dc:sponsoring_org></record></records></rdf:RDF>