141 - 150 of 2720 for IfSearch Results
View search results from all Wolfram sites (8114 matches)
Convergents   (Built-in Mathematica Symbol)
Convergents[list] gives a list of the convergents corresponding to the continued fraction terms list.Convergents[x, n] gives the first n convergents for a number ...
HermitianMatrixQ   (Built-in Mathematica Symbol)
HermitianMatrixQ[m] tests whether m is a Hermitian matrix.
ImageAdd   (Built-in Mathematica Symbol)
ImageAdd[image, x] adds an amount x to each channel value in image.ImageAdd[image_1, image_2] gives an image in which each pixel is the sum of the corresponding pixels in ...
ImageMultiply   (Built-in Mathematica Symbol)
ImageMultiply[image, x] multiplies each channel value in image by a factor x.ImageMultiply[image_1, image_2] gives an image in which each pixel is the product of the ...
Message   (Built-in Mathematica Symbol)
Message[symbol::tag] prints the message symbol::tag unless it has been switched off. Message[symbol::tag, e_1, e_2, ...] prints a message, inserting the values of the e_i as ...
Numerical Root Finding   (Mathematica Tutorial)
NSolve gives you a general way to find numerical approximations to the solutions of polynomial equations. Finding numerical solutions to more general equations, however, can ...
Operations on Scalars, Vectors, and ...   (Mathematica Tutorial)
Most mathematical functions in Mathematica are set up to apply themselves separately to each element in a list. This is true in particular of all functions that carry the ...
CCodeGenerate   (C Code Generator Package Symbol)
CCodeGenerate[cfun, name, opts] generates C code from the compiled function cfun using the name as the exported function name, and saves in the file ...
DeleteEdges   (Combinatorica Package Symbol)
DeleteEdges[g, edgeList] gives graph g minus the list of edges edgeList. If g is undirected, then the edges in edgeList are treated as undirected edges; otherwise they are ...
IncidenceMatrix   (Combinatorica Package Symbol)
IncidenceMatrix[g] returns the (0, 1)-matrix of graph g, which has a row for each vertex and a column for each edge and (v, e) = 1 if and only if vertex v is incident upon ...
1 ... 12|13|14|15|16|17|18 ... 272 Previous Next

...