Numerical Analysis of Fully Discretized Crank–Nicolson Scheme for Fractional-in-Space Allen–Cahn Equations

Numerical Analysis of Fully Discretized Crank–Nicolson Scheme for Fractional-in-Space... We consider numerical methods for solving the fractional-in-space Allen–Cahn equation which contains small perturbation parameters and strong nonlinearity. A standard fully discretized scheme for this equation is considered, namely, using the conventional second-order Crank–Nicolson scheme in time and the second-order central difference approach in space. For the resulting nonlinear scheme, we propose a nonlinear iteration algorithm, whose unique solvability and convergence can be proved. The nonlinear iteration can avoid inverting a dense matrix with only $$\mathcal {O}(N\log N)$$ O ( N log N ) computation complexity. One major contribution of this work is to show that the numerical solutions satisfy discrete maximum principle under reasonable time step constraint. Based on the maximum stability, the nonlinear energy stability for the fully discrete scheme is established, and the corresponding error estimates are investigated. Numerical experiments are performed to verify the theoretical results. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Scientific Computing Springer Journals

Numerical Analysis of Fully Discretized Crank–Nicolson Scheme for Fractional-in-Space Allen–Cahn Equations

Loading next page...
 
/lp/springer_journal/numerical-analysis-of-fully-discretized-crank-nicolson-scheme-for-Czl62S8O3I
Publisher
Springer US
Copyright
Copyright © 2017 by Springer Science+Business Media New York
Subject
Mathematics; Algorithms; Computational Mathematics and Numerical Analysis; Mathematical and Computational Engineering; Theoretical, Mathematical and Computational Physics
ISSN
0885-7474
eISSN
1573-7691
D.O.I.
10.1007/s10915-017-0396-9
Publisher site
See Article on Publisher Site

Abstract

We consider numerical methods for solving the fractional-in-space Allen–Cahn equation which contains small perturbation parameters and strong nonlinearity. A standard fully discretized scheme for this equation is considered, namely, using the conventional second-order Crank–Nicolson scheme in time and the second-order central difference approach in space. For the resulting nonlinear scheme, we propose a nonlinear iteration algorithm, whose unique solvability and convergence can be proved. The nonlinear iteration can avoid inverting a dense matrix with only $$\mathcal {O}(N\log N)$$ O ( N log N ) computation complexity. One major contribution of this work is to show that the numerical solutions satisfy discrete maximum principle under reasonable time step constraint. Based on the maximum stability, the nonlinear energy stability for the fully discrete scheme is established, and the corresponding error estimates are investigated. Numerical experiments are performed to verify the theoretical results.

Journal

Journal of Scientific ComputingSpringer Journals

Published: Feb 25, 2017

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off