The goal of this paper is to motivate the application of the recent numerical scheme called Fast Explicit Diffusion (FED) to solve long-term parabolic problems. With the purpose of performing long integration times the FED method is a simple and fast explicit solver, which has been introduced in the field of image processing. We show that FED is at least as fast as standard implicit methods, often has comparable or even better accuracy and is much easier to implement.

1.
C.
Pozrikidis
,
Numerical computation in science and engineering
(
Oxford University Press
,
2008
).
2.
G. D.
Smith
,
Numerical Solution of Partial Differential Equations: Finite Difference Methods
(
Clarendon Press
, Oxford Applied Mathematics and Computing Science Series,
1985
).
3.
J.
Weickert
,
B. M. T. H.
Romeny
, and
M. A.
Viergever
, “Efficient and reliable schemes for nonlinear diffusion filtering,” in
IEEE Transactions on Image Processing
, Vol.
7
(
1998
), pp.
398
410
.
4.
S.
Grewenig
,
J.
Weickert
, and
A.
Bruhn
, “
From box filtering to fast explicit diffiusion
,” in
Proceedings of the 32Nd DAGM Conference on Pattern Recognition
(
Springer-Verlag
,
Berlin, Heidelberg
,
2010
), pp.
533
542
.
5.
J.
Weickert
,
S.
Grewenig
,
C.
Schroers
, and
A.
Bruhn
, “
Cyclic schemes for pde-based image analysis
,” in
International Journal of Computer Vision
, Vol.
118
(
2016
), pp.
275
299
.
6.
Y.
Saad
,
Iterative Methods For Sparse Linear Systems
(
Society for Industrial and Applied Mathematics
, 2nd Edition,
2003
).
This content is only available via PDF.
You do not currently have access to this content.