Cluster analysis is an unsupervised learning technique used for classification of data. Data elements are partitioned into groups called clusters that represent proximate ...

Permutations are basic elements in algebra. They have a natural non-commutative product (as matrices do as well), and hence can encode highly nontrivial structures in a ...

With <<, you can read files that contain Mathematica expressions given in input form. Sometimes, however, you may instead need to read files of data in other formats. For ...

Formatting lists as tables and matrices. Here is a list. Grid gives the list typeset in a tabular format.

TreePlot lays out the vertices of a graph in a tree of successive layers, or a collection of trees. If the graph g is not a tree, TreePlot lays out its vertices on the basis ...

For minimization problems for which the objective function is a sum of squares, it is often advantageous to use the special structure of the problem. Time and effort can be ...

The utility functions FindMinimumPlot and FindRootPlot show search data for FindMinimum and FindRoot for one- and two-dimensional functions. They work with essentially the ...

There are many variants of quasi-Newton methods. In all of them, the idea is to base the matrix B_k in the quadratic model on an approximation of the Hessian matrix built up ...

All the functions FindMinimum, FindMaximum, and FindRoot take variable specifications of the same form. The function FindFit uses the same form for its parameter ...

CUDAInformation[] queries information on all CUDA devices detected.CUDAInformation[dev] queries information on CUDA dev.CUDAInformation[dev, prop] queries prop on CUDA dev.