pde1dm compared to pdepe

조회 수: 7 (최근 30일)
feynman feynman
feynman feynman 2024년 2월 2일
편집: feynman feynman 2024년 3월 5일
pde1dm is an extended version of pdepe and it can solve equations pdepe can't solve. I wonder about the differences between these two algorithms in the spatial discretization?
  댓글 수: 5
Torsten
Torsten 2024년 2월 8일
편집: Torsten 2024년 2월 8일
How should the finite element method produce a result converging to a senseful solution if you use e.g. (exaggerated, I admit), three mesh points for a distance of 100 km ? I can imagine that such a problem could produce Inf or an oscillating solution in the center point during time integration.
And there is no result I remember that says "the finite element method is stable per se". This can't be true because there is no such thing as "the" finite element method.
feynman feynman
feynman feynman 2024년 3월 5일
right, thank you!

댓글을 달려면 로그인하십시오.

채택된 답변

Bill Greene
Bill Greene 2024년 2월 2일
편집: Bill Greene 2024년 2월 2일
There are several differences in the pde1dm spatial discretization compared with pdepe.
For the m=0 case (Cartesian), both pde1dm and pdepe use the standard, linear shape functions. But, by default, pde1dm evaluates the residual using a two-point Gaussian integration rule while pdepe evaluates only at the center of the element. Often this doesn't significantly affect the solution but, for some problems, this allows pde1dm to obtain a converged solution when pdepe cannot.
Of course, by default, this makes pde1dm somewhat slower than pdepe but use of the "Vectorized" option with pde1dm dramatically reduces the computational time.
In evaluating the so-called mass terms (those arising from the c-coefficients), pdepe essentially uses what is often referred to as a "lumped" approach that results in a diagonal mass matrix. pde1dm evaluates these terms using exactly the same approach as the f and s terms ("consistent" approach).
For cylindrical (m=1) and spherical (m=2) geometries, pdepe uses special shape functions, as described in the Skeel and Berzins paper referenced in the pdepe documentation. According to the paper, this improves the convergence near the singular point (x=0). pde1dm does not use these special shape functions.
The above describes the current implementation of pde1dm but may change in the future. Also, pde1dm has some undocumented options that cause pde1dm to produce a discretization essentially the same as pdepe for the m=0 case. But these options may change or be eliminated in future versions; hence they are undocumented for now.
  댓글 수: 17
Torsten
Torsten 2024년 3월 4일
ode15i is an implicit ODE integrator and has a substantially different interface compared to the other solvers. It cannot be replaced by another integrator from the ode suite.
feynman feynman
feynman feynman 2024년 3월 5일
편집: feynman feynman 2024년 3월 5일
I saw there was an if statement about whether to use ode15i and the code requires that this statement be always true. I wonder if one could add functionality so that other ode solvers can be put into the else statement.

댓글을 달려면 로그인하십시오.

추가 답변 (1개)

Torsten
Torsten 2024년 2월 2일
이동: Torsten 2024년 2월 2일
I wonder about the differences between these two algorithms in the spatial discretization?
No difference. pde1dm has the option to add ordinary differential equations to the system of partial differential equations and in the boundary condition part, but this doesn't change the numerical kernel.
  댓글 수: 2
feynman feynman
feynman feynman 2024년 2월 2일
Thank you. However when the same equation is solved the two solvers give quantitative slightly different results, that's why I doubted. If no difference, how does pde1dm manage to be more flexible in incorporating ODEs?
Torsten
Torsten 2024년 2월 2일
You should contact the author of the code - Bill Greene.

댓글을 달려면 로그인하십시오.

카테고리

Help CenterFile Exchange에서 Ordinary Differential Equations에 대해 자세히 알아보기

태그

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by