 |
|
|
|
|
 |
|
|
Transforming Systems of PDEs for Efficient Numerical Solution
|
|
|
|
|
|
| Organization: | Linköping University |
| Department: | Department of Computer and Information Science |
| Organization: | Linköping University |
| Department: | Department of Computer and Information Science |
| Organization: | Linköping University |
| Department: | Department of Computer and Information Science |
|
|
|
|
|
|
1999 International Mathematica Symposium
|
|
|
|
|
|
A Mathematica package to deal with a system of partial differential equations (PDEs) is presented. This package uses explicit finite-difference schemes to handle equations in an arbitrary number of variables that are functions of one spatial variable and time. The code has the flexibility to incorporate any difference approximation specified by the user, and transforms the given system of PDEs into a system of difference equations that can be iteratively solved using the discretized forms of initial and boundary conditions. The iteration is made considerably faster by converting the Mathematica code into an optimized C++ code using the MathCode C++ compiler[1]. Examples are presented in which the generated C++ code runs about a thousand times faster than the Mathematica code.
|
|
|
|
|
|
|
|
|
|
|
|
PDE, partial differential equation, finite-difference, difference approximation, discrete initial conditions, discrete boundary conditions, MathCode C++
|
|
|
|
|
|
http://www.internationalmathematicasymposium.org/IMS99/ims99papers/ims99papers.html
|
|
For the newest resources, visit Wolfram Repositories and Archives »
