Numerical algorithms for constrained nonlinear optimization can be broadly categorized into gradient-based methods and direct search methods. Gradient-based methods use first ...
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 ...
Exact global optimization problems can be solved exactly using Minimize and Maximize. This computes the radius of the circle, centered at the origin, circumscribed about the ...
InterpolateRoot[lhs == rhs, {x, x_0, x_1}] searches for a numerical solution to the equation lhs == rhs using x_0 and x_1 as the first two values of x.
Cashflow[{c_0, c_1, ..., c_n}] represents a series of cash flows occurring at unit time intervals.Cashflow[{c_0, c_1, ..., c_n}, q] represents cash flows occurring at time ...
Piecewise[{{val_1, cond_1}, {val_2, cond_2}, ...}] represents a piecewise function with values val_i in the regions defined by the conditions cond_i. Piecewise[{{val_1, ...
The main equations that Solve and related Mathematica functions deal with are polynomial equations. It is easy to solve a linear equation in x. One can also solve quadratic ...
Even more so than for other special functions, you need to be very careful about the arguments you give to elliptic integrals and elliptic functions. There are several ...
Bias
(Function Approximations Package Symbol) Bias is an option to RationalInterpolation, GeneralRationalInterpolation, MiniMaxApproximation, and GeneralMiniMaxApproximation that specifies the bias to apply when ...
Brake
(Function Approximations Package Symbol) Brake is an option to MiniMaxApproximation and GeneralMiniMaxApproximation that specifies how changes from one iteration to the next are to be restricted.