[AN96] Adams, L. and J. L. Nazareth. (Eds.) Linear and Nonlinear Conjugate Gradient-Related Methods. SIAM, 1996. [Br02] Brent, R. P. Algorithms for Minimization without ...

A differential system can sometimes be solved by analytic means. The function DSolve implements many of the known algorithmic techniques. However, differential systems that ...

Contours is an option for contour plots that specifies the contours to draw.

This is a simple homogeneous DAE with constant coefficients. This finds the general solution. It has only one arbitrary constant because the second equation in the system ...

The shooting method works by considering the boundary conditions as a multivariate function of initial conditions at some point, reducing the boundary value problem to ...

For minimization problems for which the objective function is a sum of squares, it is often advantageous to use the special structure of the problem. Time and effort can be ...

WeierstrassZeta[u, {g_2, g_3}] gives the Weierstrass zeta function \[Zeta](u; g_2, g_3).

The solution given by DSolve can be verified using various methods. The easiest method involves substituting the solution back into the equation. If the result is True, the ...

When you ask for the square root s of a number a, you are effectively asking for the solution to the equation s^2a. This equation, however, in general has two different ...

To begin, consider an initial value problem for a linear first-order ODE. This is a linear first-order ODE. Notice that the general solution is a linear function of the ...