851 - 860 of 1935 for ISearch Results
View search results from all Wolfram sites (14261 matches)
$ContextPath   (Built-in Mathematica Symbol)
$ContextPath is a global variable that gives a list of contexts, after $Context, to search in trying to find a symbol that has been entered.
Basic Objects   (Mathematica Tutorial)
Expressions are the main type of data in Mathematica. Expressions can be written in the form h[e_1,e_2,…]. The object h is known generically as the head of the expression. ...
Integrals That Can and Cannot Be Done   (Mathematica Tutorial)
Evaluating integrals is much more difficult than evaluating derivatives. For derivatives, there is a systematic procedure based on the chain rule that effectively allows any ...
Symbolic Calculations   (Mathematica Tutorial)
Mathematica's ability to deal with symbolic expressions, as well as numbers, allows you to use it for many kinds of mathematics. Calculus is one example. With Mathematica, ...
OpenCLFunctionLoad   (OpenCLLink Symbol)
OpenCLFunctionLoad[prog, fun, argtypes, blockdims] loads fun from source code prog, returning an OpenCLFunction object.OpenCLFunctionLoad[{progfile}, fun, argtypes, ...
CramerVonMisesTest   (Built-in Mathematica Symbol)
CramerVonMisesTest[data] tests whether data is normally distributed using the Cramér\[Dash]von Mises test.CramerVonMisesTest[data, dist] tests whether data is distributed ...
MatrixForm   (Built-in Mathematica Symbol)
MatrixForm[list] prints with the elements of list arranged in a regular array.
NIntegrate Integration Rules   (Mathematica Tutorial)
An integration rule computes an estimate of an integral over a region, typically using a weighted sum. In the context of NIntegrate usage, an integration rule object provides ...
AdjacencyGraph   (Built-in Mathematica Symbol)
AdjacencyGraph[amat] gives the graph with adjacency matrix amat.AdjacencyGraph[{v_1, v_2, ...}, amat] gives the graph with vertices v_i and adjacency matrix amat.
RandomGraph   (Built-in Mathematica Symbol)
RandomGraph[{n, m}] gives a pseudorandom graph with n vertices and m edges.RandomGraph[{n, m}, k] gives a list of k pseudorandom graphs.RandomGraph[gdist, ...] samples from ...
1 ... 83|84|85|86|87|88|89 ... 194 Previous Next

...