When you give a list of equations to Solve, it assumes that you want all the equations to be satisfied simultaneously. It is also possible to give Solve more complicated ...

Mathematica does operations like numerical integration very differently from the way it does their symbolic counterparts. When you do a symbolic integral, Mathematica takes ...

CUDA is a general C-like programming developed by NVIDIA to program Graphical Processing Units (GPUs). CUDALink provides an easy interface to program the GPU by removing many ...

A delay differential equation is a differential equation where the time derivatives at the current time depend on the solution and possibly its derivatives at previous times: ...

BooleanTable[bf] gives a list of truth values for all possible combinations of variable values supplied to the Boolean function bf.BooleanTable[expr, {a_1, a_2, ...}] gives a ...

Roots[lhs == rhs, var] yields a disjunction of equations which represent the roots of a polynomial equation.

The leading term of a polynomial can be chosen in many different ways. For multivariate polynomials, sorting by the total degree of the monomials is often useful. Different ...

An important subset of optimization problems is constrained nonlinear optimization, where the function is not linear and the parameter values are constrained to certain ...

AppellF1[a, b_1, b_2, c, x, y] is the Appell hypergeometric function of two variables F_1 (a; b_1, b_2; c; x, y).

BesselJ[n, z] gives the Bessel function of the first kind J_n (z).