|
|
||
|
|
| Built-in Mathematica Symbol | Tutorials »|See Also »|More About » |
| NDSolve[eqns, y, {x, xmin, xmax}] finds a numerical solution to the ordinary differential equations eqns for the function y with the independent variable x in the range xmin to xmax. |
| NDSolve[eqns, y, {x, xmin, xmax}, {t, tmin, tmax}] finds a numerical solution to the partial differential equations eqns. |
| NDSolve[eqns, {y1, y2, ...}, {x, xmin, xmax}] finds numerical solutions for the functions yi. |
| AccuracyGoal | Automatic | digits of absolute accuracy sought | |
| DependentVariables | Automatic | the list of all dependent variables | |
| EvaluationMonitor | None | expression to evaluate whenever the function is evaluated | |
| InterpolationOrder | Automatic | the continuity degree of the final output | |
| MaxStepFraction | 1/10 | maximum fraction of range to cover in each step | |
| MaxSteps | 10000 | maximum number of steps to take | |
| MaxStepSize | Automatic | maximum size of each step | |
| Method | Automatic | method to use | |
| NormFunction | Automatic | the norm to use for error estimation | |
| PrecisionGoal | Automatic | digits of precision sought | |
| StartingStepSize | Automatic | initial step size used | |
| StepMonitor | None | expression to evaluate when a step is taken | |
| WorkingPrecision | MachinePrecision | precision to use in internal computations |
| "Adams" | predictor-corrector Adams method with orders 1 through 12 | |
| "BDF" | implicit backward differentiation formulas with orders 1 through 5 | |
| "ExplicitRungeKutta" | adaptive embedded pairs of 2(1) through 9(8) Runge-Kutta methods | |
| "ImplicitRungeKutta" | families of arbitrary-order implicit Runge-Kutta methods | |
"SymplecticPartitionedRungeKutta" | ||
| interleaved Runge-Kutta methods for separable Hamiltonian systems | ||
| "Composition" | compose a list of submethods | |
| "DoubleStep" | adapt step size by the double-step method | |
| "EventLocator" | respond to specified events | |
| "Extrapolation" | adapt order and step size using polynomial extrapolation | |
| "FixedStep" | use a constant step size | |
| "OrthogonalProjection" | project solutions to fulfill orthogonal constraints | |
| "Projection" | project solutions to fulfill general constraints | |
| "Splitting" | split equations and use different submethods | |
| "StiffnessSwitching" | switch from explicit to implicit methods if stiffness is detected |
| "ExplicitEuler" | forward Euler method | |
| "ExplicitMidpoint" | midpoint rule method | |
| "ExplicitModifiedMidpoint" | midpoint rule method with Gragg smoothing | |
| "LinearlyImplicitEuler" | linearly implicit Euler method | |
| "LinearlyImplicitMidpoint" | linearly implicit midpoint rule method | |
"LinearlyImplicitModifiedMidpoint" | ||
| linearly implicit Bader-smoothed midpoint rule method | ||
| "LocallyExact" | numerical approximation to locally exact symbolic solution | |
Solve a first-order ordinary differential equation:
Use the solution in a plot:
Use the function and its derivative in a plot:
Find specific values:
Second-order nonlinear ordinary differential equation:
Plot the function and its first two derivatives:
System of ordinary differential equations:
This solves the heat equation in 1 dimension:
Alternative form of equation:
|
| © 2008 Wolfram Research, Inc. |