851 - 860 of 2720 for IfSearch Results
View search results from all Wolfram sites (8114 matches)
JordanDecomposition   (Built-in Mathematica Symbol)
JordanDecomposition[m] yields the Jordan decomposition of a square matrix m. The result is a list {s, j} where s is a similarity matrix and j is the Jordan canonical form of ...
Equations in One Variable   (Mathematica Tutorial)
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 ...
Options for Cells   (Mathematica Tutorial)
Mathematica provides a large number of options for cells. All of these options can be accessed through the Option Inspector menu item in the front end. They can be set either ...
Introduction   (Library Link Tutorial)
Most modern computer systems provide ways to collect code into libraries. These libraries are said to be dynamic if they can be loaded into an application at runtime rather ...
ArrayPlot   (Built-in Mathematica Symbol)
ArrayPlot[array] generates a plot in which the values in an array are shown in a discrete array of squares.
DifferenceDelta   (Built-in Mathematica Symbol)
DifferenceDelta[f, i] gives the discrete difference \[DifferenceDelta]_i f = f(i + 1) - f(i).DifferenceDelta[f, {i, n}] gives the multiple difference DifferenceDelta[f, {i, ...
Random Number Generation   (Mathematica Tutorial)
The ability to generate pseudorandom numbers is important for simulating events, estimating probabilities and other quantities, making randomized assignments or selections, ...
Code Generation   (Compiled Function Tools Tutorial)
Code generation from Mathematica involves converting programs written in the Mathematica language into other languages and then supporting them so that they can be executed. ...
MaximalBipartiteMatching   (Graph Utilities Package Symbol)
MaximalBipartiteMatching[g] gives the maximal matching of the bipartite graph g.
MaximalIndependentVertexSet   (Graph Utilities Package Symbol)
MaximalIndependentVertexSet[g] gives a maximal independent vertex set of an undirected graph g.MaximalIndependentVertexSet[g, w] gives a maximal independent vertex set of g ...
1 ... 83|84|85|86|87|88|89 ... 272 Previous Next

...