Abstract
Finite difference algorithms offer a more direct approach to the numerical solution of partial differential equations than any other method. Finite difference algorithms are based on the replacement of each derivative by a difference quotient. Finite difference algorithms are simple to code, economic to compute, and easy to parallelize for the distributed computing environments. However, they also have disadvantages in terms of accuracy and imposing complex boundary conditions. For better understanding of the method, the solution of one-dimensional transient heat conduction is given as an example together with the source code in this section.
The original version of this chapter was revised. An erratum to this chapter can be found at DOI 10.1007/978-3-319-41196-5_9
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Biner, S.B. (2017). Solving Phase-Field Models with Finite Difference Algorithms. In: Programming Phase-Field Modeling. Springer, Cham. https://doi.org/10.1007/978-3-319-41196-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-41196-5_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-41194-1
Online ISBN: 978-3-319-41196-5
eBook Packages: Chemistry and Materials ScienceChemistry and Material Science (R0)