WeightedAdjacencyGraph[wmat] gives the graph with weighted adjacency matrix wmat.WeightedAdjacencyGraph[{v_1, v_2, ...}, wmat] gives the graph with vertices v_i and weighted ...

WheelGraph[n] gives the wheel graph with n vertices W_n.

Numerical algorithms for constrained nonlinear optimization can be broadly categorized into gradient-based methods and direct search methods. Gradient search methods use ...

Some integer functions. The remainder on dividing 17 by 3. The integer part of 17/3.

This loads packages containing some test problems and utility functions. One of the first and simplest methods for solving initial value problems was proposed by Euler: ...

When numerically solving Hamiltonian dynamical systems it is advantageous if the numerical method yields a symplectic map. If the Hamiltonian can be written in separable ...

Many differential equations exhibit some form of stiffness, which restricts the step size and hence effectiveness of explicit solution methods. A number of implicit methods ...

The standard way in which Mathematica works is to take any expression you give as input, evaluate the expression completely, and then return the result. When you are trying ...

A method like "Newton's" method chooses a step, but the validity of that step only goes as far as the Newton quadratic model for the function really reflects the function. ...

One significant advantage Mathematica provides is that it can symbolically compute derivatives. This means that when you specify Method->"Newton" and the function is ...