CenterSpace.NMath.Core Namespace

Class AbstractRandomNumberStream may be used to construct a RandomNumberStream object which uses a user defined function for the generation of uniformly distributed random numbers in the interval (0, 1).

Class ActiveSetLineSearchSQP solves nonlinear programming problems using a Sequential Quadratic Programming (SQP) iterative algorithm.

Contains the options available to the ActiveSetLineSearchSQP Nonlinear Program Solver (NLP).

Class ActiveSetQPSolver solves convex quadratic programming (QP) problems.

No longer used. Please use NMathFunctions.

Class AnnealingHistory encapsulates all of the data generated during a series of steps through an annealing schedule.

Class AnnealingHistory.Step encapsulates all of the data associated with a step in an AnnealingHistory.

Class AnnealingMinimizer minimizes a multivariable function using the simulated annealing method.

Class AnnealingScheduleBase is the abstract base class for annealing schedules.

Class AnovaRegressionFactorParam provides information about a regression parameter associated with a specific level of an ANOVA factor.

Class AnovaRegressionInteractionParam provides information about a regression parameter associated with the interaction between the level of one ANOVA factor and the level of another ANOVA factor.

Class AnovaRegressionParameter provides information about a regression parameter used to perform an analysis of variance by class TwoWayAnova.

Class AnovaRegressionSubjectParam provides information about a regression parameter associated with a subject dummy regression variable.

Options for solving symmetric eigenvalue problems using the shift and invert spectral transformation.

Class contianing solution information for an Arnoldi iteration eigenvalue problem.

Solve the generalized eigenvalue problem Ax = Mx(lambda) Where A is sparse symmetric and M is sparse symmetric semi position definite. Solve is accomplished using a shift and invert spectral transformation and implicitly restarted Arnoldi iteration.

Class implementing Bairstows method finds roots for polynomials of degree greater than 3.

Class encapsulating information about the result of applying Bairstows method to a polynomial.

Class BetaDistribution represents the beta probability distribution.

Class BinomialDistribution represents the discrete probability distribution of obtaining exactly n successes in N trials where the probability of success on each trial is P.

Class MultiVariableFunctionFitter< M > fits a parameterized multivariable function to a set of points where the parameters have inequality constraints.

Class BoundedOneVariableFunctionFitter fits a parameterized one variable function to a set of points, where the functions parameters are constrained by upper and lower bounds.

Abstract class for representing a problem with bounded variables.

Class for computing the Box-Cox power tranformations defined for a set of data points, {yi}, and parameter value lambda by yi(lambda) = (yi^lambda - 1)/lambda. In addition methods for computing the corresponding log-likelihood function and the value of lambda which maximizes it are provided.

Class BoxCoxTransformation performs a Box-Cox power transformation, which can be used to make non-normal data resemble normally-distributed data.

Class Bracket searches in the downhill direction for two points that bracket a minimum of a univariate function.

Class BrentMinimizer uses Brent's Method to minimize a function within an interval known to contain a minimum.

Class CentralDifferenceHessianUpdater updates the Hessian of the Lagrangian while solving a nonlinear programming problem using a Sequential Quadratic Programming algorithm.

Class ChiSquareDistribution represents the chi-square probability distribution.

Class ClampedCubicSpline represents a function determined by tabulated values. Function values are calculated using clamped cubic spline interpolation.

Class ClosedInterval represents a numeric interval with inclusive lower and upper bounds.

Class ClosedOpenInterval represents a numeric interval with an inclusive lower bound and an exclusive upper bound.

Class ClusterAnalysis perform hierarchical cluster analysis.

Class ClusterSet represents a collection of objects assigned to a finite number of clusters.

Class CompressedSparseRow stores general sparse matrix data in compressed row format.

Class ConjugateGradientMinimizer minimizes a multivariable function using the Polak-Ribiere variant of the Fletcher-Reeves conjugate gradient method.

Class ConnectivityMatrix represents a symmetric matrix of double-precision floating point values.

Class ConstantSQPStepSize computes the step size for a Sequential Quadratic Programming solver. Simply returns a constant step size regardless of iteration values.

Class for solver constrained least squares problems.

Class that encapsulates a constrained least squares problem.

Base class for linear Microsoft Solver Foundation based linear solvers.

Base class for linear Google OR-Tools based linear solvers.

Class Constraint represents a constraint in a constrained optimization problem.

Abstract base class for all concrete convolution classes.

Class CORegressionCalculation computes linear regression parameters by the method of least squares using a complete orthogonal decomposition.

Abstract base class for all concrete correlation classes.

The base correlation filter which provides basic correlation services.

Class CublicSpline represents a function whose values are determined by cubic spline interpolation between tabulated values.

Class for aggregating data used in curve fitting. Contains x-values with their corresponding y-values along with with weights to be applied to the y-values during curve fitting.

Class CustomAnnealingSchedule encapsulates a series of iterations and temperatures.

Class DampedBFGSHessianUpdater updates the value of the Lagrangian Hessian based on iterate values using a quasi-Newton approximation.

Class DataFrame represents a two-dimensional data object consisting of a list of columns of the same length.

Class DBrentMinimizer minimizes a function using Brent's method as well as the first derivative.

Class DFBoolColumn represents a column of logical data in a data frame.

Abstract base class for data frame column types.

Class DFDataTimeColumn represents a column of DataTime data in a data frame.

Class DFGenericColumn represents a column of generic data in a data frame.

Class DFIntColumn represents a column of integer data in a data frame.

Class DFNumericColumn represents a column of numeric data in a data frame.

Class DFStringColumn represents a column of string data in a data frame.

Integrates discrete data for either unit-spaced or arbitrarily spaced data.

This abstract class represents all discrete wavelet transforms objects.

Class Distance provides functions for computing the distance between objects.

Class PowerDistance compute the power distance between two vectors.

Double1DConvolution represents a 1D convolution, with a specified kernel and data length.

Double1DCorrelation represents a 1D correlation, with a specified kernel and data length.

Class DoubleBandFact represents the factorization of a banded matrix of double-precision floating point numbers.

Class DoubleBandMatrix represents a banded matrix of double-precision floating point values. A banded matrix is a matrix that has all its non-zero entries near the diagonal.

Class DoubleBisquareWeightingFunction implements the bisquare weighting function for Iteratively Reweighted Least Squares (IRLS).

Class DoubleCholeskyLeastSq solves least square problems by using the Cholesky factorization to solve the normal equations.

DoubleComplex1DConvolution represents a 1D convolution, with a specified kernel and data length.

DoubleComplex1DCorrelation represents a 1D correlation, with a specified kernel and data length.

DoubleComplexBackward1DFFT represents the backward discrete fourier transform of a 1D complex signal vector.

DoubleComplexBackward2DFFT represents the backward discrete fourier transform of a 2D complex signal vector.

Class DoubleComplexBandFact represents the factorization of a banded matrix of complex double-precision floating point numbers.

Class DoubleComplexBandMatrix represents a banded matrix of double-precision complex numbers. A banded matrix is a matrix that has all its non-zero entries near the diagonal.

Class DoubleComplexCholeskyLeastSq solves least square problems by using the Cholesky factorization to solve the normal equations.

Class DoubleComplexCsrSparseMatrix stores a general sparse matrix using Compressed Row (CSR) Storage format.

The DoubleComplexDataBlock struct defines a contiguous subset of an array of DoubleComplex numbers. A DoubleComplexDataBlock instance contains a reference to an array and an offset into the array.

Class DoubleComplexEigDecomp computes the eigenvalues and left and right eigenvectors of a general matrix, with preliminary balancing.

Class DoubleComplexEigDecompServer creates eigenvalue decompositions. A server instance can be configured to perform preliminary balancing, and to compute left eigenvectors, right eigenvectors, both, or neither.

DoubleComplexForward1DFFT represents the forward discrete fourier transform of a 1D complex signal vector.

DoubleComplexForward2DFFT represents the forward discrete fourier transform of a 2D complex signal vector.

Class DoubleComplexGSVDecomp computes the generalized singular value decomposition (GSVD) of a pair of general rectangular matrices.

Class for serving up generalized singular value decompositions (GSVD) in the form of DoubleComplexGSVDecomp instances.

Class DoubleComplexLeastSquares computes the minimum-norm solution to a linear system Ax = y.

Class DoubleComplexLowerTriMatrix represents a lower triangular matrix of double-precision complex numbers. A lower triangular matrix is a square matrix with all elements above the main diagonal equal to zero.

Class DoubleComplexLUFact represents the LU factorization of a matrix of DoubleComplex numbers.

Class DoubleComplexMatrix represents a general mathematical matrix class of DoubleComplex numbers. Methods are provided for performing algebraic operations, data manipulation, and slicing.

Class DoubleComplexQRDecomp represents the QR decomposition of a general matrix.

Class DoubleComplexQRDecompServer allows control over how the pivoting is done in the creation of DoubleComplexQRDecomp objects.

Class DoubleComplexQRLeastSq solves least squares problems by using a QR decomposition.

Class DoubleComplexSchurDecomp represents the Schur decomposition of a general matrix.

Class DoubleComplexSparseFact performs general sparse matrix factorizations.

Class DoubleComplexSparseVector encapsulates a general sparse vector.

Class DoubleComplexSVDecomp represents the singular value decomposition (SVD) of a matrix.

Class DoubleComplexSVDecompServer constructs instances of the DoubleComplexSVDecomp class.

Class DoubleComplexSVDLeastSq solves least squares problems by using a singular value decomposition.

Class DoubleComplexTriDiagFact represents the LU factorization of a tridiagonal matrix of double-precision complex floating point numbers.

Class DoubleComplexTriDiagMatrix represents a tridiagonal matrix of double-precision complex numbers. A tridiagonal matrix is a matrix which has all its non-zero entries on the main diagonal, the super diagonal, and the subdiagonal.

Class DoubleComplexComplexUpperTriMatrix represents an upper triangular matrix of double-precision complex numbers. An upper triangular matrix is a square matrix with all elements below the main diagonal equal to zero.

Class DoubleComplexVector represents a mathematical vector of DoubleComplex numbers.

Class DoubleCOWeightedLeastSq solves weighted least squares problems by using a Complete Orthogonal (CO) decomposition technique.

Class DoubleCsrSparseMatrix stores a general sparse matrix using Compressed Row (CSR) storage format.

The DoubleDataBlock struct defines a contiguous subset of an array of double-precision floating point numbers. A DoubleDataBlock instance contains a reference to an array and an offset into the array.

This class represents a double precision discrete wavelet transform. It supports both single step forward and reverse DWT's and multilevel signal deconstruction and reconstruction. Details thresholding at any level and threshold calculations are also supported.

Class DoubleEigDecomp computes the eigenvalues and left and right eigenvectors of a general matrix, with preliminary balancing.

Class DoubleEigDecompServer creates eigenvalue decompositions. A server instance can be configured to perform preliminary balancing, and to compute left eigenvectors, right eigenvectors, both, or neither.

Class performs a factor analysis on a symmetric matrix of data, assumed to be either a correlation or covariance matrix, using specified factor extraction and rotation algorithms. The analysis consists of 2 steps: First, factors are extracted from the symmetric matrix data, second, the factors are rotated in order to maximize the relationship between the variables and some of the factors.

Class DoubleFairWeightingFunction implements the fair weighting function for Iteratively Reweighted Least Squares (IRLS).

DoubleForward1DFFT represents the forward discrete fourier transform of a 1D real signal vector.

DoubleForward2DFFT represents the forward discrete fourier transform of a 2D real signal vector.

Class DoubleFunctional represents a double precision functional.

Class DoubleFunctionalDelegate wraps a functional delegate specified by a delegate in a DoubleFunctional object.

General 1D FFT class assuming the behavior of the provided FFT configuration instance.

Class DoubleGSVDecomp computes the generalized singular value decomposition (GSVD) of a pair of general rectangular matrices.

Class for serving up generalized singular value decompositions (GSVD) in the form of DoubleGSVDecomp instances.

Class DoubleHermCsrSparseMatrix stores a general sparse Hermitian matrix using the Compressed Row (CSR) storage format.

Class DoubleHermitianBandMatrix represents an Hermitian banded matrix of double-precision floating point values. An Hermitian banded matrix is an Hermitian matrix that has all its non-zero entries near the diagonal.

Class DoubleHermitianEigDecomp computes the eigenvalues and eigenvectors of a symmetrix matrix.

Class DoubleHermitianEigDecompServer creates eigenvalue decompositions. A server instance can be configured to compute eigenvalues only, or both eigenvalues and eigenvectors. In addition, the server can be configured to compute only the eigenvalues in a given range. A tolerance for the convergence of the algorithm may also be specified.

Class DoubleHermitianFact represents the factorization of a Hermitian, matrix of complex double-precision floating point numbers.

Class DoubleHermitianMatrix represents a matrix of double-precision floating point complex values.

Class DoubleHermitianPDBandFact represents the factorization of a Hermitian, positive definite, banded matrix of complex double-precision floating point numbers.

Class DoubleHermitianPDFact represents the Cholesky factorization of a Hermitian, positive definite, matrix of double-precision complex floating point numbers. In a Cholesky factorization a Hermitian, positive definite matrix A is factored as A = UU' where U is upper triangular and U' is the conjugate transpose of U.

Class DoubleHermPDTriDiagFact represents the LDL' factorization of a Hermitian, positive definite, tridiagonal matrix of complex double-precision floating point numbers.

Class DoubleIterativelyReweightedLeastSq solves a least squares problems by iteratively applying a weighted least squares fit.

Class DoubleLeastSquares computes the minimum-norm solution to a linear system Ax = y.

Abstract base class for least squares weighting functions used in the Iteratively Reweighted Least Squares algorithm.

Class DoubleLowerTriMatrix represents a lower triangular matrix of double-precision floating point values. A lower triangular matrix is a square matrix with all elements above the main diagonal equal to zero.

Class DoubleLUFact represents the LU factorization of a matrix of double-precision floating point numbers.

Class DoubleMatrix represents a general mathematical matrix class of double-precision floating point numbers. Methods are provided for performing algebraic operations, data manipulation, and slicing.

Abstract class for representing a multi-variable function.

Class containing the results of a nonnegative least squares solve attempt. Double precision version.

Class DoubleNonnegativeLeastSquares computes the minimum-norm solution to a linear system Ax = y subject to the constraint that all the elements, x[i], are nonnegative.

Class which creates a DoubleParameterizedFunction instance from delegates.

Abstract class representing a parameterized function.

Abstract class representing a parameterized functional.

Class DoublePCA performs a principal component analysis on a given double-precision data matrix, or data frame.

Class DoubleQRDecomp represents the QR decomposition of a general matrix.

Class DoubleQRDecompServer allows control over how the pivoting is done in the creation of DoubleQRDecomp objects.

Class DoubleQRLeastSq solves least squares problems by using a QR decomposition.

Class DoubleRandomBetaDistribution generates random numbers from a beta distribution.

Class DoubleRandomCauchyDistribution generates random numbers from a Cauchy distribution.

Class DoubleRandomExponentialDistribution generates random numbers from an exponential distribution.

Class DoubleRandomGammaDistribution generates random numbers from a gamma distribution.

Class DoubleRandomGaussianDistribution generates random numbers from a Gaussian distribution.

Class DoubleRandomGumbelDistribution generates random numbers from a Gumbel distribution.

Class DoubleRandomLaplaceDistribution generates random numbers from a Laplace distribution.

Class DoubleRandomLogNormalDistribution generates random numbers from a lognormal distribution.

Class DoubleRandomRayleighDistribution generates random numbers from an Rayleigh distribution.

Class DoubleRandomUniformDistribution generates random numbers uniformly distributed over an interval.

Class DoubleRandomWeibullDistribution generates random numbers from a Weibull distribution.

Class DoubleSchurDecomp represents the Schur decomposition of a general matrix.

Class DoubleSparseFact performs general sparse matrix factorizations.

Class DoubleSparseHermFact performs Hermitian sparse matrix factorizations.

Class DoubleSparseHermPDFact performs sparse Hermitian Positive Definite matrix factorizations.

Class DoubleSparseSymFact performs sparse symmetric matrix factorizations.

Class DoubleSparseSymPDFact performs sparse positive definite symmetric matrix factorizations.

Class DoubleSparseVector encapsulates a general sparse vector.

Class DoubleSVDecomp represents the singular value decomposition (SVD) of a matrix.

Class DoubleSVDecompServer constructs instances of the DoubleSVDecomp class.

Class DoubleSVDLeastSq solves least squares problems by using a singular value decomposition.

The stationary wavelet transform (SWT) is an advanced development of the discrete wavelet transfrom (DWT). The DWT lacks signal translation-invariance. By using an up and down sampling strategy, often refered to by its french name of "algorithme à trous", the SWT gains translation-invariance.

Class DoubleSymBandMatrix represents a symmetric banded matrix of double-precision floating point values. A symmetric banded matrix is a symmetric matrix that has all its non-zero entries near the diagonal.

Class DoubleSymCsrSparseMatrix stores a sparse symmetric matrix using the CompreSsed Row (CSR) storage format.

Class DoubleSymEigDecomp computes the eigenvalues and eigenvectors of a symmetrix matrix.

Class DoubleSymEigDecompServer creates eigenvalue decompositions. A server instance can be configured to compute eigenvalues only, or both eigenvalues and eigenvectors. In addition, the server can be configured to compute only the eigenvalues in a given range. A tolerance for the convergence of the algorithm may also be specified.

Class DoubleSymFact represents the factorization of a symmetric, matrix of double-precision floating point numbers.

Provides symmetric complex conjugate signal unpacking services. Typically used for unpacking 2D FFT's of real signals.

DoubleSymmetricBackward1DFFT represents the backward discrete fourier transform of a 1D real signal vector, and inverses packed conjugate symmetric signals back to the real domain.

Class DoubleSymmetricMatrix represents a symmetric matrix of double-precision floating point values.

Provides symmetric complex conjugate signal unpacking services. Typically used for unpacking 1D FFT's of real signals.

Class DoubleSymPDBandFact represents the factorization of a symmetric, positive definite, banded matrix of double-precision floating point numbers.

Class DoubleSymPDFact represents the Cholesky factorization of a symmetric, positive definite, matrix of double-precision floating point numbers. In a Cholesky factorization a symmetric, positive definite matrix A is factored as A = UU' where U is upper triangular and U' is the transpose of U.

Class DoubleSymPDTriDiagFact represents the LDL' factorization of a symmetric, positive definite, tridiagonal matrix of double-precision floating point numbers.

Given a real symmetric, positive semidefinite matrix A, class DoubleSymSemiPDFact performs a Cholesky factorization with complete pivoting. In the following ' denotes matrix transposition. The form of the factorization is: P'AP = U'U if upper is specified, and P'AP = LL' if lower is specified. where P is a permutation matrix, and U and L are upper and lower triangular matrices, respectively. The algorithm does not attempt to check if the matrix A is positive semidefinite.

Class DoubleTriDiagFact represents the LU factorization of a tridiagonal matrix of double-precision floating point numbers.

Class DoubleTriDiagMatrix represents a tridiagonal matrix of double-precision floating point values. A tridiagonal matrix is a matrix which has all its non-zero entries on the main diagonal, the super diagonal, and the subdiagonal.

Class DoubleUpperTriMatrix represents an upper triangular matrix of double-precision floating point values. An upper triangular matrix is a square matrix with all elements below the main diagonal equal to zero.

Class DoubleVector represents a mathematical vector of double-precision floating point numbers.

Class DoubleVectorParameterizedDelegate creates a DoubleParameterizedFunctional instance from delegates.

This class represents a double precision wavelet. There are fives types of built in wavelets avaiable: Harr, Daubechies, Least Asymmetric, Best Localized, and Coiflet. User generated wavelets can be created by provided the low-pass decimation filter parameters in the constructor.

Class DownhillSimplexMinimizer minimizes a multivariable function using the downhill simplex method of Nelder and Mead.

Class DualSimplexSolver is a class for solving linear programming prolems using the dual simplex method.

Class DualSimplexSolverORTools is a class for solving linear programming prolems using the dual simplex method.

Dual simplex algorithm parameters.

Class representing an equality constrained Quadratic Programming problem. Minimize 0.5 * x'Hx + x'c Subject to Ax = b where x is a vector of unknows, H a symmetric matrix, and A matrix.

Class ExponentialDistribution represents the Exponential probability distribution.

Class Factor represents a categorical vector in which all elements are drawn from a finite number of factor levels.

Class FactorAnalysisCorrelation performs a factor analysis on a set of case data using the correlation matrix and specified factor extraction and rotation algorithms.

Class FactorAnalysisCovariance performs a factor analysis on a set of case data using the covariance matrix and specified factor extraction and rotation algorithms.

Class FDistribution represents the F probability distribution.

Abstract base class for all 2D discrete FFT transform classes. This class manages the setup and tear down of all discrete fourier resources.

Abstract base class for all 1D discrete FFT transform classes. This class manages the setup and tear down of all discrete fourier resources.

FFTConfiguration contains all of the FFT configuration state to efficiently compute a FFT. This class is typically used in conjunction with the GeneralxDFFT set of classes to configure FFT's with offset and strided signal data.

Exception thrown when MKL or CUDA returns an error condition when computing a FFT

Float1DConvolution represents a 1D convolution, with a specified kernel and data length.

Float1DCorrelation represents a 1D correlation, with a specified kernel and data length.

Class FloatBandFact represents the factorization of a banded matrix of single-precision floating point numbers.

Class FloatBandMatrix represents a banded matrix of single-precision floating point values. A banded matrix is a matrix that has all its non-zero entries near the diagonal.

Class FloatCholeskyLeastSq solves least square problems by using the Cholesky factorization to solve the normal equations.

FloatComplex1DConvolution represents a 1D convolution, with a specified kernel and data length.

FloatComplex1DCorrelation represents a 1D correlation, with a specified kernel and data length.

FloatComplexBackward1DFFT represents the backward discrete fourier transform of a 1D complex signal vector.

FloatComplexBackward2DFFT represents the backward discrete fourier transform of a 2D complex signal vector.

Class FloatComplexBandFact represents the factorization of a banded matrix of complex single-precision floating point numbers.

Class FloatComplexBandMatrix represents a banded matrix of single-precision complex numbers. A banded matrix is a matrix that has all its non-zero entries near the diagonal.

Class FloatComplexCholeskyLeastSq solves least square problems by using the Cholesky factorization to solve the normal equations.

Class FloatComplexCsrSparseMatrix stores a general sparse matrix using Compressed Row (CSR) Storage format.

The FloatComplexDataBlock struct defines a contiguous subset of an array of FloatComplex numbers. A FloatComplexDataBlock instance contains a reference to an array and an offset into the array.

Class FloatComplexEigDecomp computes the eigenvalues and left and right eigenvectors of a general matrix, with preliminary balancing.

Class FloatComplexEigDecompServer creates eigenvalue decompositions. A server instance can be configured to perform preliminary balancing, and to compute left eigenvectors, right eigenvectors, both, or neither.

FloatComplexForward1DFFT represents the forward discrete fourier transform of a 1D complex signal vector.

FloatComplexForward2DFFT represents the forward discrete fourier transform of a 2D complex signal vector.

Class FloatComplexGSVDecomp computes the generalized singular value decomposition (GSVD) of a pair of general rectangular matrices.

Class for serving up generalized singular value decompositions (GSVD) in the form of FloatComplexGSVDecomp instances.

Class FloatComplexLeastSquares computes the minimum-norm solution to a linear system Ax = y.

Class FloatComplexLowerTriMatrix represents a lower triangular matrix of single-precision complex numbers. A lower triangular matrix is a square matrix with all elements above the main diagonal equal to zero.

Class FloatComplexFact represents the LU factorization of a matrix of FloatComplex numbers.

Class FloatComplexMatrix represents a general mathematical matrix class of FloatComplex numbers. Methods are provided for performing algebraic operations, data manipulation, and slicing.

Class FloatComplexQRDecomp represents the QR decomposition of a general matrix.

Class FloatComplexQRDecompServer allows control over how the pivoting is done in the creation of FloatComplexQRDecomp objects.

Class FloatComplexQRLeastSq solves least squares problems by using a QR decomposition.

Class FloatComplexSchurDecomp represents the Schur decomposition of a general matrix.

Class FloatComplexSparseFact performs general sparse matrix factorizations.

Class FloatComplexSparseVector encapsulates a general sparse vector.

Class FloatComplexSVDecomp represents the singular value decomposition (SVD) of a matrix.

Class FloatComplexSVDecompServer constructs instances of the FloatComplexSVDecomp class.

Class FloatComplexSVDLeastSq solves least squares problems by using a singular value decomposition.

Class FloatComplexTriDiagFact represents the LU factorization of a tridiagonal matrix of single-precision complex floating point numbers.

Class FloatComplexTriDiagMatrix represents a tridiagonal matrix of single-precision complex numbers. A tridiagonal matrix is a matrix which has all its non-zero entries on the main diagonal, the super diagonal, and the subdiagonal.

Class FloatComplexUpperTriMatrix represents an upper triangular matrix of single-precision complex numbers. An upper triangular matrix is a square matrix with all elements below the main diagonal equal to zero.

Class FloatComplexVector represents a mathematical vector of FloatComplex numbers.

Class FloatCsrSparseMatrix stores a general sparse matrix using Compressed Row (CSR) storage format.

The FloatDataBlock struct defines a contiguous subset of an array of floating point numbers. A FloatDataBlock instance contains a reference to an array, and an offset into the array.

This class represents a single precision discrete wavelet transform. It supports both single step forward and reverse DWT's and multilevel signal deconstruction and reconstruction. Details thresholding at any level and threshold calculations are also supported.

Class FloatEigDecomp computes the eigenvalues and left and right eigenvectors of a general matrix, with preliminary balancing.

Class FloatEigDecompServer creates eigenvalue decompositions. A server instance can be configured to perform preliminary balancing, and to compute left eigenvectors, right eigenvectors, both, or neither.

FloatForward1DFFT represents the forward discrete fourier transform of a 1D real signal vector.

FloatForward2DFFT represents the forward discrete fourier transform of a 2D real signal vector.

General 1D FFT class assuming the behavior of the provided FFT configuration instance.

Class FloatGSVDecomp computes the generalized singular value decomposition (GSVD) of a pair of general rectangular matrices.

Class for serving up generalized singular value decompositions (GSVD) in the form of FloatGSVDecomp instances.

Class FloatHermCsrSparseMatrix stores a general sparse Hermitian matrix using the Compressed Row (CSR) storage format.

Class FloatHermitianBandMatrix represents an Hermitian banded matrix of double-precision floating point values. An Hermitian banded matrix is an Hermitian matrix that has all its non-zero entries near the diagonal.

Class FloatHermitianEigDecomp computes the eigenvalues and eigenvectors of a symmetrix matrix.

Class FloatHermitianEigDecompServer creates eigenvalue decompositions. A server instance can be configured to compute eigenvalues only, or both eigenvalues and eigenvectors. In addition, the server can be configured to compute only the eigenvalues in a given range. A tolerance for the convergence of the algorithm may also be specified.

Class FloatHermitianFact represents the factorization of a Hermitian, matrix of complex single-precision floating point numbers.

Class FloatHermitianMatrix represents a matrix of single-precision floating point complex values.

Class FloatHermitianPDBandFact represents the factorization of a Hermitian, positive definite, banded matrix of complex single-precision floating point numbers.

Class FloatHermitianPDFact represents the Cholesky factorization of a Hermitian, positive definite, matrix of single-precision complex floating point numbers. In a Cholesky factorization a Hermitian, positive definite matrix A is factored as A = UU' where U is upper triangular and U' is the conjugate transpose of U.

Class FloatHermPDTriDiagFact represents the LDL' factorization of a Hermitian, positive definite, tridiagonal matrix of complex single-precision floating point numbers.

Class FloatLeastSquares computes the minimum-norm solution to a linear system Ax = y.

Class FloatLowerTriMatrix represents a lower triangular matrix of single-precision floating point values. A lower triangular matrix is a square matrix with all elements above the main diagonal equal to zero.

Class FloatLUFact represents the LU factorization of a matrix of floating point numbers.

Class FloatMatrix represents a general mathematical matrix class of floating point numbers. Methods are provided for performing algebraic operations, data manipulation, and slicing.

Class containing the results of a nonnegative least squares solve attempt. Single precision version.

Class FloatNonnegativeLeastSquares computes the minimum-norm solution to a linear system Ax = y subject to the constraint that all the elements, x[i], are nonnegative.

Class FloatPCA performs a principal component analysis on a given single-precision data matrix.

Class FloatQRDecomp represents the QR decomposition of a general matrix.

Class FloatQRDecompServer allows control over how the pivoting is done in the creation of FloatQRDecomp objects.

Class FloatQRLeastSq solves least squares problems by using a QR decomposition.

Class FloatRandomBetaDistribution generates random numbers from a beta distribution.

Class FloatRandomCauchyDistribution generates random numbers from a Cauchy distribution.

Class FloatRandomExponentialDistribution generates random numbers from an exponential distribution.

Class FloatRandomGammaDistribution generates random numbers from a gamma distribution.

Class FloatRandomGaussianDistribution generates random numbers from a Gaussian distribution.

Class FloatRandomGumbelDistribution generates random numbers from a Gumbel distribution.

Class FloatRandomLaplaceDistribution generates random numbers from a Laplace distribution.

Class FloatRandomLogNormalDistribution generates random numbers from a lognormal distribution.

Class FloatRandomRayleighDistribution generates random numbers from an Rayleigh distribution.

Class DoubleRandomUniformDistribution generates random numbers uniformly distributed over an interval.

Class FloatRandomWeibullDistribution generates random numbers from a Weibull distribution.

Class FloatSchurDecomp represents the Schur decomposition of a general matrix.

Class FloatSparseFact performs general sparse matrix factorizations.

Class FloatSparseHermFact performs Hermitian sparse matrix factorizations.

Class FloatSparseHermPDFact performs sparse Hermitian Positive Definite matrix factorizations.

Class FloatSparseSymFact performs sparse symmetric matrix factorizations.

Class FloatSparseSymPDFact performs sparse positive definite symmetric matrix factorizations.

Class FloatSparseVector encapsulates a general sparse vector.

Class FloatSVDecomp represents the singular value decomposition (SVD) of a matrix.

Class FloatSVDecompServer constructs instances of the FloatSVDecomp class.

Class FloatSVDLeastSq solves least squares problems by using a singular value decomposition.

The stationary wavelet transform (SWT) is an advanced development of the discrete wavelet transfrom (DWT). The DWT lacks signal translation-invariance. By using an up and down sampling strategy, often refered to by its french name of "algorithme à trous", the SWT gains translation-invariance.

Class FloatSymBandMatrix represents a symmetric banded matrix of single-precision floating point values. A symmetric banded matrix is a symmetric matrix that has all its non-zero entries near the diagonal.

Class FloatSymCsrSparseMatrix stores a sparse symmetric matrix using the CompreSsed Row (CSR) storage format.

Class FloatSymEigDecomp computes the eigenvalues and eigenvectors of a symmetrix matrix.

Class FloatSymEigDecompServer creates eigenvalue decompositions. A server instance can be configured to compute eigenvalues only, or both eigenvalues and eigenvectors. In addition the server can be configured to compute only the eigenvalues in a given range. A tolerance for the convergence of the algorithm may also be specified.

Class FloatSymFact represents the factorization of a symmetric matrix of single-precision floating point numbers.

Provides symmetric complex conjugate signal unpacking services. Typically used for unpacking 2D FFT's of real signals.

FloatSymmetricBackward1DFFT represents the backward discrete fourier transform of a 1D real signal vector. This class and inverts packed conjugate symmetric signals in the freqency domain back to the real domain.

Class FloatSymmetricMatrix represents a symmetric matrix of float-precision floating point values.

Provides symmetric complex conjugate signal unpacking services. Typically used for unpacking 1D FFT's of real signals.

Class FloatSymPDBandFact represents the factorization of a symmetric, positive definite, banded matrix of single-precision floating point numbers.

Class FloatSymPDFact represents the Cholesky factorization of a symmetric, positive definite, matrix of single-precision floating point numbers. In a Cholesky factorization a symmetric, positive definite matrix A is factored as A = UU' where U is upper triangular and U' is the transpose of U.

Class FloatSymPDTriDiagFact represents the LDL' factorization of a symmetric, positive definite, tridiagonal matrix of single-precision floating point numbers.

Class FloatTriDiagFact represents the LU factorization of a tridiagonal matrix of single-precision floating point numbers.

Class FloatTriDiagMatrix represents a tridiagonal matrix of single-precision floating point values. A tridiagonal matrix is a matrix which has all its non-zero entries on the main diagonal, the super diagonal, and the subdiagonal.

Class FloatUpperTriMatrix represents an upper triangular matrix of single-precision floating point values. An upper triangular matrix is a square matrix with all elements below the main diagonal equal to zero.

Class FloatVector represents a mathematical vector of floating point numbers.

This class represents a single precision wavelet. There are fives types of built in wavelets avaiable: Harr, Daubechies, Least Asymmetric, Best Localized, and Coiflet. User generated wavelets can be created by provided the low-pass decimation filter parameters in the constructor.

FZero finds a zero of the function in the given interval. Repeated roots are not found, FZero can find only bracketed single roots.

Class GammaDistribution represents the gamma probability distribution.

Class GaussKronrod21Integrator calculates an approximation of the integral of a function over a finite interval using the Gauss 10-point and the Kronrod 21-point rule.

Class GaussKronrod43Integrator calculates an approximation of the integral of a function over a finite interval using the Gauss 21-point and the Kronrod 43-point rule.

Class GaussKronrod87Integrator calculates an approximation of the integral of a function over a finite interval using the Gauss 43-point and the Kronrod 87-point rule.

Class GaussKronrodIntegrator calculates an approximation of the integral of a function over a finite interval using Gauss-Kronrod rules.

Class GeometricDistribution represents the goemetric probability distribution.

Class GlobalCurveFitAnova computes ANOVA style statistics for the least squares model fit that result from a global curve fit. Available statistics include the residual standard error, the coefficient of determination (R2 and "adjusted" R2), the F-statistic and p-value for the overall model, and degrees of freedom.

Global fitting in involves fitting multiple datasets with the same fitting function. Parameters in the fitting function can optionally be shared amongst all datasets. If a parameter is shared, the fitting procedure will yield the same value for that parameter for all datasets. If a parameter is not shared, the fitting procedure will yield a unique value for that parameter for each dataset.

Contains information about a parameter in a global curve fit: name, description, shared or not shared. Only the sharing information is required.

Class for providing fit statistics about a global fit parameter after the fit has been performed.

Contains information about a parameter with fixed value(s) in a global curve fit: name, description, shared or not shared, and the fixed value(s). If the parameter is not shared, then its values may be fixed for specific datasets. In this case the fixed values must be specified in using an IDictionary parameter. For example if the dictionary contained entries { 1, 1.0 }, { 3, 1.2 } this would mean the parameter has a fixed value of 1.0 in second dataset (zero based indexing) and a fixed value of 1.2 in the fourth dataset. If the parameter info object is constructed with a dictionary of fixed values it is assumed to be non-shared. If it is constructed with a single fixed value it is assumed to be shared. If a GlobalFixedFitParameterInfo has multiple fixed values and its sharing property is set to ParameterSharing.Shared, The first entry in the dictionary will be taken as the shared fixed value.

Class GoldenMinimizer performs a golden section search for a minimium of a function within an interval known to contain a minimum.

Class GoodnessOfFit tests goodness of fit for least squares model-fitting classes, such as LinearRegression, PolynomialLeastSquares, and OneVariableFunctionFitter.

Class GoodnessOfFitParameter tests statistical hypotheses about estimated parameters in regression models.

Class Histogram constructs and maintains a histogram of input data. Input data is sorted into bins and a count is kept of how many data points fall into each bin.

Class IActiveSetQPSolver is an interface for classes that solver convex quadratic programming (QP) problems. In particular, classes that implement this abstract class may be used in the Active Set Sequential Quadratic Programming solver for general linear programming problems.

Base class for creating streams of independent random numbers. Deriving classes must construct the streams_ array.

Class IndexArray presents 0-based indexices to the user, but uses 1-based indices internally.

Exception thrown when an out of range index is passed to an NMath function.

Instances of the InputVariableCorrelator class are used to induce a desired rank correlation among input variables.

Class for sovling quadratic programming (QP) problems using an interior point algorithm.

Parameters controlling the behavior of the interior point quadratic programming algorithm in the InteriorPointQPSolver class.

Class Interval represents a numeric interval with inclusive or exclusive lower and upper bounds.

Class IntRandomBernoulliDistribution generates random numbers from a discrete binomial distribution.

Class IntRandomBinomialDistribution generates random numbers from a discrete binomial distribution.

Class IntRandomGeometricDistribution generates random numbers from a discrete geometric distribution.

Class IntRandomHypergeometricDistribution generates random numbers from a discrete hypergeometric distribution.

Class IntRandomNegativeBinomialDistribution generates random numbers from a discrete negative binomial distribution.

Class IntRandomPoissonDistribution generates random numbers from a discrete Poisson distribution.

Class IntRandomPoissonVaryingMeanDistribution generates random numbers from a discrete Poisson distribution with varying mean.

Class IntRandomUniformBitsDistribution generates integer values with uniform bit distribution.

Class IntRandomUniformDistribution generates random numbers uniformly distributed over an interval.

Exception thrown when an invalid argument is passed to an NMath function.

Exception thrown when a histogram operation results in invalid bin boundaries.

Interface for performing a Partial Least Squares (PLS) calculation.

Interface for performing a Partial Least Squares (PLS) calculation.

Class JohnsonDistribution represents the Johnson system of distributions.

Class KFoldsSubsets generates k-fold subsets for cross validation.

Class KMeansClustering performs k-means clustering on a set of data points.

Class KruskalWallisTable summarizes the information of Kruskal-Wallis rank sum test.

Class KruskalWallisTest performs a Kruskal-Wallis rank sum test.

Class L1MeritStepSize computes the step size for a Sequential Quadratic Programming solver based on sufficient decrease in the L1 merit function.

Class LagrangianFunction represents the Lagrangian function associated with a nonlinear programming problem.

Class LagrangianGradientFunction derives from DoubleMultiVariableFunction for evaluating the gradient of the Lagrangian functions.

Class LeapfrogRandomStreams creates several independent streams of random numbers using the method know as leapfrogging.

Class LeapfrogStream represents a single leapfrog stream.

Class LeaveOneOutSubsets generates the index subsets for a leave-one-out cross validations calculation.

Class for minimizing the L2 norm of a function using the Levenberg Marquardt algorithm.

Class LikelihoodRatioStatistic computes the Likelihood Ratio Statistic values for a logistic regression.

Class LinearAnnealingSchedule encapsulates the linear descent of a starting temperature to zero. Each step has a specified number of iterations.

Abstract class for representing an optimization problem with linear constraints.

Class LinearConstraint represents a linear constraint for a constrained optimization problem.

Class LinearProgrammingProblem encapsulates a Linear programming problem.

Class LinearRegression computes a multiple linear regression from an input matrix of independent variable values and vector of dependent variable values.

Class LinearRegressionAnova tests overall model significance for linear regressions computed by class LinearRegression.

Class LinearRegressionParameter tests statistical hypotheses about estimated parameters in linear regressions computed by class LinearRegression.

Class LinearSpline represents a function whose values are determined by linear interpolation between tabulated values.

Class Linkage provides functions for computing the distance between clusters of objects.

Class LogisticDistribution represents the logistic probability distribution with a specifed location (mean) and scale.

Class for performing a binomial logistic regression.

Class LogisticRegressionAuxiliaryStats computes pseudo R-squared metrics for a logistic regression, and odds ratios for the computed coefficients.

Class for for calculating "goodness of fit" statistics for a logistic regression model.

Class representing a group used in computing the Hosmer Lemeshow statistic for a logistic regression model.

Class containing the attributes of the Hosmer Lemeshow statistic for a logistic regression model.

Class containing the attributes of the Pearson chi-square statistic associated with a logistic regression model.

Class containing Pearson Residual attributes. The Pearson Residual is calculated for each covariate pattern.

Class LogisticRegressionParameter tests statistical hypotheses about estimated parameters in linear regressions computed by class LogisticRegression.

Class LognormalDistribution represents the lognormal probability distribution.

No longer used. Please use NMathFunctions.

Exception thrown when a matrix operation requiring a square matrix is presented with a non-square one.

Class MinimizerBase is the abstract base class for classes that perform function minimization.

Exception thrown when an operation is performed with operands whose sizes are incompatible with the operation.

Class MixedIntegerLinearProgrammingProblem encapsulates a Linear programming problem which may contain integral constraints.

Class MixedIntegerNonlinearProgrammingProblem represents a nonlinear programming problem.

Class for minimizing the L2 norm of a function using the a modified Levenberg Marquardt algorithm.

Class implementing data filtering by replacing data points f(i) with a linear combination of the data points immediately to the left and right of f(i). The user provides the coefficients to use in the linear combination. Static class methods are provided for generating coefficients to implement a moving average filter and a Savitzky-Golay smoothing filter.

Class for performing simulatenous fitting of multiple data sets with shared fitting parameters. As an example suppose we have two sets of data points- dataset 1 = { (x11,y11), (x12,y12),...,(x1n,y1n) } dataset 2 = { (x21,y21), (x22,y22),...,(x2n,y2m) } And suppose we have two parameterized functions f1(beta,x) = cos(2*pi*beta(0)*x)*exp(-x/beta(1)) f2(beta,x) = beta(3) + beta(2)*exp(-(x/beta(1))) where beta is a vector of four parameters. The MultiCurveFit class solves the problem of finding the parameter values beta that best fit, in the least squares sense, the function f1 to dataset 1 and the function f2 to dataset 2 with the parameter beta(1) being the same for both datasets.

Function for simulatenous fitting of multiple data sets with shared fitting parameters. MultipleCurveFit

Calculates the residuals of a MultipleCurveFitFunction with a given set of parameters and data sets.

Class for pairing a parameterized function with a data set for use in performing a simulatenous fitting of multiple data sets with shared fitting parameters. MultipleCurveFit

Class MultiVariableFunction represents multivariate functions.

Class MultiVariableFunctionFitter fits a generalized multivariable function to a set of points.

Residual function. This is the function that is minimized to produce the parameters for the best fit.

Class NaturalCubicSpline represents a function determined by tabulated values. Function values are calculated using natural cubic spline interpolation.

Class NegativeBinomialDistribution represents the discrete probability distribution of obtaining N successes in a series of x trials, where the probability of success on each trial is P.

Parameter calculation for a logistic regression model. The parameters are computed to maximize the log likelihood function for the model, using the Newton Raphson algorithm to compute the zeros of the first order partial derivaties of the log likelihood function.

Class NewtonRaphsonRootFinder finds roots of univariate functions using the Newton-Raphson algorithm.

Class NiederreiterQuasiRandomGenerator is a quasi-random number generator which can be used for generating sequences of quasi-random point in n-dimensional space.

Class NMathConfiguration provides properties for controlling the loading of the NMath kernel assembly and native library, and specifying license keys.

Base class for exceptions thrown by the NMath product suite.

Exception thrown when a method encounters a faulty text representation.

Class NMathFunctions provides standard mathematical functions for NMath types. Trigonometric functions, exponents, logarithms, powers, and square roots are provided for vector, matrix, and complex number types.

Computes the 5-parameter logistic (5PL) function, using the given vector of function parameters, at the specified point.

Computes the 4-parameter logistic (4PL) function, using the given vector of function parameters, at the specified point.

Evaluates the three parameter exponential function for the given parameter values at the given point.

Computes the three parameter sine function, using the given vector of function parameters, at the specified point.

Computes the asymptotic function, using the given vector of function parameters, at the specified point.

Class NMathSettings contains global settings for NMath classes.

Class NMFact performs non-negative matrix factorization.

Class NMFAlsUpdate encapsulates the Alternating Least Squares (ALS) update algorithm.

Class NMFClustering performs a Non-negative Matrix Factorization (NMF) of a given matrix.

Class NMFConsensusMatrix uses a non-negative matrix factorization to cluster samples.

Class NMFDivergenceUpdate encapulates an NMF update algorithm which minimizes a divergence functional.

Class NMFGdClsUpdate encapsulates the Gradient Descent - Constrained Least Squares (GDCLS) algorithm for Nonnegative Matrix Facotorization (NMF).

Class NMFMultiplicativeUpdate encapsulates a multiplicative update algorithm for Nonnegative Matrix Factorization (NMF).

Class NMFNonsmoothUpdate encapulates an NMF update algorithm which minimizes a cost functional designed to explicitly represent sparseness, in the form on nonsmoothness, which is controlled by a single parameter.

Class NoncentralTDistribution represents a generalized Student's t-distribution with the specified degrees of freedom and noncentrality parameter.

Class NonlinearConstraint represents a nonlinear constraint in an optimization problem.

Class NonlinearProgrammingProblem represents a nonlinear programming problem.

Exception thrown when an attempt is made to change the value of an element in a structured matrix that cannot be changed.

Class NormalDistribution represents the normal (Gaussian) probability distribution with a specifed mean and variance.

Used as a class type parameter value to factor analysis classes when no factor rotation is desired.

The class contains static methods for creating function objects suitable for use as "number of factors" functors used in the factor extraction step of a factor analysis. These functions take as parameters the eigenvalues and eigenvectors values computed during factor extraction and return the number of factors to "keep".

Base class for ODE solvers which use a Runge-Kutta order 5 algorithm. Includes enums and functions for incorporating mass matrices into ODE's.

When solving ODE's of the form y' = M*f(t,y) where M is a constant "mass" matrix, this class provides a function g(t,y) for the right hand side of the above equation which incorporates the mass matrix M.

When solving ODE's of the form y' = M(t,y)*f(t,y) where M is a time-state dependent "mass" matrix, this class provides a function g(t,y) for the right hand side of the above equation which incorporates the mass matrix function M(t,y).

Class OneSampleAndersonDarlingTest performs a Anderson-Darling test of the distribution of one sample.

Class OneSampleKSTest performs a Kolmogorov-Smirnov test of the distribution of one sample.

Class OneSampleTTest compares a single sample mean to an expected mean from a normal distribution with an unknown standard deviation.

Class OneSampleZTest compares a single sample mean to an expected mean from a normal distribution with known standard deviation.

Class OneVariableFunction represents functions of one variable.

Class OneVariableFunctionFitter fits a parameterized one variable function to a set of points.

Class representing the residual function for the curve fit.

Class OneWayAnova computes and summarizes a traditional one-way (single factor) Analysis of Variance (ANOVA).

Class OneWayAnovaTable summarizes the information of a traditional one-way Analysis of Variance (ANOVA) table.

Class OneWayRanova summarizes the information of a one-way repeated measures Analysis of Variance (RANOVA).

Class OneWayRanovaTable summarizes the information of a traditional one-way repeated measures Analysis of Variance (RANOVA) table.

Class OpenClosedInterval represents a numeric interval with an exclusive lower bound and an inclusive upper bound.

Class OpenInterval represents a numeric interval with exclusive lower and upper bounds.

Class OrderedConnectivityMatrix reorders the rows and columns of an connectivity matrix so that the most affiliated elements appear as clusters of higher values along the diagonal.

Abstract class representing multi-variable a parameterized function.

Class implementing the principle components (PC) algorithm for factor extraction when performing factor analysis. Used as a class type parameter for the factor analysis classes.

Abstract base class for all peak finding algorithms. The class is an enumerable collection of all found peaks.

Class PeakFinderRuleBased simply returns all of the peaks subject to rules about peak height and peak separation. A peak is defined as a point which is higher that both neighbors or infinity. Non-infinity end points are excluded as a peak.

Class PeakFinderSavitzkyGolay uses smooth Savitzky-Golay derivatives to find peaks in data and acts as a collection for the found peaks.

Class PearsonsChiSquareTest tests whether the frequency distribution of experimental outcomes are consistant with a particular theoretical distribution.

Class PLS1 performs a Partial Least Squares (PLS) regression calculation on a set of predictive and one-dimensional response values. The result is used to predict response variable values.

Class PLS1Anova performs a standard ANalysis Of VAriance (ANOVA) for a Partial Least Squares 1 (PLS1) regression model.

Class PLS1CrossValidation performs an evaluation of a PLS (Partial Least Squares) model.

Class PLS1CrossValidationData divides Partial Least Squares - one dimensional response variable,(PLS1), data into training and testing subsets.

Class PLS2CrossValidationResult performs a Partial Least Squares - one dimensional response variable, (PLS1), cross validation calculation.

Class PLS1NipalsAlgorithm encapsulates the Nonlinear Iterative PArtial Least Squares (NIPALS) algorithm for computing partial least squares regression components.

Class PLS2 performs a Partial Least Squares (PLS) regression calculation on a set of predictive and response values. The result is used to predict response variable values.

Class PLS2Anova performs a standard ANalysis Of VAriance (ANOVA) for a Partial Least Squares (PLS) regression model.

Class PLS2CrossValidation performs an evaluation of a PLS (Partial Least Squares) model.

Class PLS2CrossValidationData divides Partial Least Squares (PLS) data into training and testing subsets.

Class PLS2CrossValidationResult performs a Partial Least Squares (PLS) cross validation calculation.

Class PLS2CrossValidationWithJackknife performs an evaluation of a PLS (Partial Least Squares) model with model coefficient variance estimates and confidence intervals.

Class PLS2NipalsAlgorithm encapsulates the Nonlinear Iterative PArtial Least Squares (NIPALS) algorithm for computing partial least squares regression components.

Class PLS2SimplsAlgorithm encapsulates the Straightforward IMplementation of Partial Least Squares, or SIMPLS, algorithm (de Jong, 1993) for computing partial least squares regression components.

Class PoissonDistribution represents a poisson distribution with a specified lambda, which is both the mean and the variance of the distribution. The poisson distribution a discrete distribution representing the probability of obtaining exactly n successes in N trials.

Class Polynomial represents a polynomial function as a vector of coefficients.

Class PolynomialDifferentiator encapsulates exact differentiation of polynomials.

Class PolynomialIntegration encapsulates exact integration of polynomials.

Class PolynomialLeastSquares performs a least squares fit of a polynomial to the data.

Class PowellMinimizer minimizes a multivariable function using Powell's Method.

Class for computing the dominant eigenvalue and eigenvector of a square matrix using the iterative power method.

Class PrimalSimplexSolver is a class for solving linear programming prolems using the primal simplex method.

Class PrimalSimplexSolver is a class for solving linear programming prolems using the primal simplex method.

Primal simplex algorithm parameters.

Class ProbabilityDistribution is the abstract base class for classes that represent distributions of random variables.

Computes the process capability parameters Cp, Cpm, Cp for normally distributed data. If the data is not normal the Box-Cox transform can be used.

Computes process performance parameters Pp and Ppk for normally distributed data. If the data is not normal the Box-Cox transform can be used.

Class QRRegressionCalculation computes linear regression parameters by the method of least squares using a QR decomposition.

Class QuadraticProgrammingProblem encapsulates a quadratic programming (QP) problem.

Abstract base class for generating sequences of quasirandom points. A quasirandom sequence is a sequence of n-tuples that fills n-space more uniformly than uncorrelated random points.

Class RandGenBeta generates random numbers from a beta distribution.

Class RandGenBinomial generates random numbers from a binomial distribution.

Class RandGenExponential generates random numbers from an exponential distribution.

Class RandGenGamma generates random numbers from an gamma distribution.

Class RandGenGeometric generaties random numbers from a Geometric distribution.

Class RandGenJohnson generates random numbers from a Johnson distribution.

Class RandGenLogNormal generates random numbers from a lognormal distribution.

Class RandGenMTwist generates random numbers from a uniform distribution using the Mersenne Twister algorithm.

Class RandGenNormal generates random numbers from a normal distribution.

Class RandGenPareto generates random numbers from a Pareto distribution.

Class RandGenPoisson generates random numbers from an Poisson distribution.

Class RandGenTriangular generates random numbers from a triangular distribution.

Class RandGenUniform generates random numbers from a uniform distribution.

Class RandGenWeibull generates random numbers from a Weibull distribution.

Abstract base class for NMath random number generators.

Class RandomNumbers is an adapter for the RandomNumberStream class to give the same behavior as a scalar-type random number generator.

Class RandomNumberStream is a vectorized random number generator which yields a stream of random numbers from various probability distributions.

Class Range represents a collection of indices that can be used to view a subset of data from another data structure. A Range is defined by a starting index, an ending index or enumerated Position value, and a step increment called the stride.

Instances of the ReducedVarianceInputCorrelator class are used to induce a desired rank correlation among input variables.

Base class for linear and logistic regression.

Class implementing the interface for computing factor scores using the regression algorithm. The regression algorithm uses a least squares regression approach to predict factor scores. Specifically this method computes the solution X to the matrix equation RX = B, where R = covariance matrix, B = factor matrix, X = factor scores.

Class RidderDifferentiator encapsulates numerical differentiation of functions.

Class RiddersRootFinder finds roots of univariate functions using Ridders' Method.

Class RombergIntegrator approximates integrals of functions over a given interval using the Romberg method.

Abstract base class for classes that perform root finding on univariate functions.

Class RungeKutta45OdeSolver solves an initial value, Ordinary Differential Equation (ODE) using an explicit Runge-Kutta (4,5) formula known as the Dormand-Prince pair.

User settable options for RungeKutta45OdeSolver.

Data structor contiaing solution values an statistics for an ODE solve.

Class RungeKutta5OdeSolver solves an initial value, Ordinary Differential Equation (ODE) using a non-adaptive explicit Runge-Kutta formula of order 5.

User settable options for RungeKutta5OdeSolver.

Class generates the Savitzy-Golay filter coefficients for smoothing data or computing smoothed derivatives. Smoothed derivatives can be found up to the order of the fitting polynomial.

Class SavitzkyGolayFilter is a correlation filter specialized for filtering with Savitzky-Golay coefficients with additional boundary options for better edge continuity. The default boundary option ShiftFilterCenter provides data smoothing all the way boundary ends.

Class SecantRootFinder finds roots of univariate functions using the secant method.

Base class for sequential quadratic programming solvers.

Data structure containing various values for an iteration of a Sequential Quadratic Programming algorithm.

Class ShapiroWilkTest tests the null hypothesis that the sample comes from a normally distributed population.

Class SimplexSolverBase is an abstract base class for classes solving mixed integer linear programming prolems using variants of the simplex method.

Class SimplexSolverBase is an abstract base class for classes solving mixed integer linear programming prolems using variants of the simplex method.

Class containing parameters for simplex based mixed integer linear programming solvers.

Base class for simplex solver parameters.

Exception thrown when a matrix operation requiring a non-singular matrix is presented with a singular one.

Class for creating several independent streams of random numbers using the method know as skip-ahead, or block-splitting.

Class SkipAheadStream represents a single skip-ahead stream.

Class Slice represents a collection of indices that can be used to view a subset of data from another data structure. A slice is defined by a starting index, a total number of elements, and a step increment called the stride.

Class SmoothCubicSpline calculates smoothing splines.

Class SobolQuasiRandomGenerator is quasi-random number generator which can be used for generating sequences of quasi-random point in n-dimensional space.

Class implementing the ILinearConstraintCoefficients for sparse linear constraint coefficients. Only the non-zero coefficients are stored.

Class SparseMatrixBuilder{T} serves as the base class for the sparse matrix builder classes of specific types. This class implements the interface System.Collections.Generic.IDictionary{IntPair,T}, providing matrix-like row/column indexing for setting and retrieving values. Only nonzero values are stored.

Class SparseMatrixData stores general sparse matrix data.

Abstract base class for sparse matrix factorizations using the Parallel Direct Sparse Solver Interface (PARDISO).

Class SparsePls performs a Partial Least Squares (PLS) calculation for the model X ~ Y with variable selection. The LASSO penalization is used on the pairs of loading vectors. SparsePls allows matrices with missing values in them by using the NIPALS algorithm to estimate them. Missing values are represented as Double.NaN.

Class for performing Discriminant Analysis (DA) using sparse Partial Least Squares (sPLS). This is a classical sPLS regression, but where the response variable is catagorical. The response vector Y is qualitative and is recoded as a dummy block matrix where each of the response categories are coded via an indicator variable. PLS-DA is then run as if Y was a continuous matrix.

Class SparsePLSDACrossValidation performs an evaluation of a PLS (Partial Least Squares) model.

Class SparseVectorData stores sparse vector data.

This class contains a collection of special functions.

No longer used. Please use NMathFunctions.

Class StatsSettings contains global settings for NMath Stats classes.

Parameter class for the StochasticHillClimbingSolver class.

Nonlinear programming solver that uses a stocastic hill climbing algorithm. It starts from a random set of decision values, and repeatedly tries small random changes to the decision values. It keeps changes that make the answer better, and rejects changes that make it worse.

Class Subset represents a collection of indices that can be used to view a subset of data from another data structure.

Class SVDRegressionCalculation computes linear regression parameters by the method of least squares using a singular value decomposition.

Class TabulatedFunction is an abstract class representing a function determined by tabulated values.

Class TDistribution represents Student's t-distribution with the specified degrees of freedom.

Class TriangularDistribution represents the triangular probability distribution.

Class TrustRegionMinimizer solves both constrained and unconstrained nonlinear least squares problems using the Trust Region method.

Parameter calculation for a logistic regression model. The parameters are computed to maximize the log likelihood function for the model, using a trust region optimization algorithm to compute the zeros of the first order partial derivaties of the log likelihood function. The minimization is performed by an instance of the class CenterSpace.NMath.Core.TrustRegionMinimizer and algorithms parameters may be controlled through this object. It is accessible through the Minimizer class property, and a TrustRegionParameterCalc instace may be constructed with a give TrustRegionMinimizer object which has the desired properties. TrustRegionMinimizer

Class TwoSampleFTest tests if the variances of two populations are equal.

Class TwoSampleKSTest performs a two-sample Kolmogorov-Smirnov test to compare the distributions of values in two data sets.

Class TwoSamplePairedTTest tests if two paired sets of observed values differ from each other in a significant way.

Class TwoSampleUnpairedTTest tests the null hypothesis that the two population means corresponding to two random samples are equal.

Class TwoSampleUnpairedUnequalTTest tests the null hypothesis that the two population means corresponding to two random samples are equal.

Class TwoVariableIntegrator integrates functions of two variables.

Class TwoWayAnova performs a balanced two-way analysis of variance.

Base class for both balanced and unbalanced two way ANOVA.

Class TwoWayAnovaTable summarizes the information of a traditional two-way Analysis of Variance (ANOVA) table.

Class for performing a Type I ANOVA on unbalanced data. See the description of the base class TwoWayAnovaUnbalanced for a description of the notation. Type I, also called "sequential" sum of squares: SS(A) for factor A. SS(B | A) for factor B. SS(AB | B, A) for interaction AB. This tests the main effect of factor A, followed by the main effect of factor B after the main effect of A, followed by the interaction effect AB after the main effects.

Class for performing a Type II ANOVA on unbalanced data. See the description of the base class TwoWayAnovaUnbalanced for a description of the notation. SS(A | B) for factor A. SS(B | A) for factor B. SS(AB | A, B) for interaction. This type tests for each main effect after the other main effect. Note that no significant interaction is assumed and you should look look at the test for interaction first (SS(AB | A, B)) and only if interaction after the main effects AB is not significant continue with the analysis for main effects.

Class for performing a Type III ANOVA on unbalanced data. See the description of the base class TwoWayAnovaUnbalanced for a description of the notation. SS(A | B, AB) for factor A. SS(B | A, AB) for factor B. SS(AB | A, B) for interaction. This type tests for the presence of a main effect after the other main effect and interaction. This approach is therefore valid in the presence of significant interactions. However, it is often not interesting to interpret a main effect if interactions are present (generally speaking, if a significant interaction is present, the main effects should not be further analysed).

Class TwoWayAnovaUnbalanced is the base class for performing a two way ANOVA when the number of observations in each cell is not the same (an unbalanced design). In this case the main and interaction effects are interdependent, and we must obtain the marginal sum of squares associated with each factor after all the other factors have already been included in the model (the marginal sum of squares for each variable equals the incremental sum of squares for that variable when it is entered into the equation last). In terms of a regression approach to ANOVA, the marginal sum of squares due to a factor is the sum of squares for the set of dummy variables associated with that factor when those dummy variables are entered into the model last, after all other dummy variables. Classes deriving from TwoWayAnovaUnbalanced provide the ordering of dummy regression variables and use the base class to compute the resulting regressions and sums of squares.

Class containing the linear regression object computed from a particular ordering of factor and interaction parameters. Note that a factor parameter or interaction parameters may be absent depending on which type of sum of squares is being computed.

As long as the dummy regression parameters are the same, we may use the same regression matrix to compute the various marginal sums of squares. Since the dummy variables for a given factor, or the interaction parameters, will always be contiguous columns in the regression matrix, their location can be specified with slices. The ParameterSlices class specifies the slices where factor A, factor B, and interaction dummy variables are located in the regression matrix. The following terminology is used throughout: Regression matrix - the matrix of regression parameters include the intercept parameter, which is expressed as a leading column of 1's in the matrix. Predictor matrix - The matrix of regression parameters excluding the intercept parameter. Thus regression parameters start at column 1 in the regression matrix and column 0 in the predictor matrix.

Class TwoWayAnovaUnbalancedTable summarizes the information of a traditional two-way Analysis of Variance (ANOVA) table.

Class TwoWayRanova performs a balanced two-way analysis of variance with repeated measures on one factor.

Class TwoWayRanovaTable summarizes the information of a traditional two-way Analysis of Variance (RANOVA) table.

Class TwoWayRanovaTwo performs a balanced two-way analysis of variance with repeated measures on both factors.

Class TwoWayRanovaTwoTable summarizes the information of a traditional two-way Analysis of Variance, with repeated measures on both factors, table,

Class UniformDistribution represents the Uniform probability distribution.

Class specifying a variable ID, lower and upper bounds, and a tolerance used in testing bounds compliance.

Class VariableMetricMinimizer uses the Broyden-Fletcher-Goldfarb-Shanno variable metric algorithm to minimize multivariable functions.

Solver for stiff and non-stiff ordinary differential equations. The algorithm uses higher order methods and smaller step size when the solution varies rapidly.

Class containing available options for the VariableOrderOdeSolver.

Data structor contianing solution values and statistics for an ODE solve.

Class for computing the varimax rotation of the factor from a factor analysis. Rotates the coordinates to maximize the sum of the variances of the squared loadings. Kaiser normalization is optionally performed, and the default stopping tolerance (1e-12) is used.

This abstract class represents a wavelet. There are fives types of built in wavelets avaiable: Harr, Daubechies, Least Asymmetric, Best Localized, and Coiflet.

Class WeibullDistribution represents the Weibull probability distribution.

Distribution function.

Class for performing an Analysis Of Variance on a weighted linear least squares fit.

Class WilcoxonSignedRankTest tests if two paired sets of observed values differ from each other in a significant way.

Computes the ZBench for normally distributed data, percent defective, and the parts per million defective.

Represents one level of a DWT decomposition.

The DoubleComplex struct represents a complex number, consisting of a real part and an imaginary part.

Represents an imutable extrema of a function in two dimensions.

The FloatComplex struct represents a complex number, consisting of a real part and an imaginary part.

Class IntPair represents a pair of integers.

Eigenvalue Arnoldi solver shift invert operations.

Interface for nonlinear least squares minimizer where the solution is constrained by upper and lower bounds.

Interface for generating subsets of data to be used in a cross validation process.

Interface for data frame column types.

Interface for classes that perform differentiation of a function at a point.

Classes that implement the IDoubleComplexEnumerator interface behave like regular IEnumerator implementations except that they return a DoubleComplex instead of an object. They avoid casting and are therefore much faster.

Classes that implement the IDoubleEnumerator interface behave like regular IEnumerator implementations except that they return a double instead of an object. They avoid casting and are therefore much faster.

Interface for least squares weighting functions.

Interface for factor extration algorithms used in factor analysis.

Interface for factor analysis factor rotation algorithms. Factors are rotated in order to maximize the relationship between the variables and some of the factors.

Interface for factor score computation in a factor analysis.

Classes that implement the IFloatComplexEnumerator interface behave like regular IEnumerator implementations except that they return a FloatComplex instead of an object. They avoid casting and are therefore much faster.

Classes that implement the IFloatEnumerator interface behave like regular IEnumerator implementations except that they return a float instead of an object. They avoid casting and are therefore much faster.

Interface for classes that perform integration of a function over an interval.

Interface for the coefficients for a linear constraint in a non-linear optimization problem. The interface is an abstraction of a vector of real numbers representing the coefficients of a linear constraint and thus defines the indexer property [int index]. This interface allows for both sparse and dense implementations.

Interface class for calculating the parameters of a logistic regression model.

Interface for classes that perform minimization of multivariate functions using derivative information.

Interface for classes that perform minimization of multivariate functions.

Interface to be implemented by all Non-negative Matrix Factorization (NMF) update algorithms used by the NMFact class.

Interface for nonlinear least squares minimizer.

Interface for classes that perform minimization of univariate functions using derivative information.

Interface for classes that find roots of univariate functions using derivative information.

Interface for classes that perform minimization of univariate functions.

Interface for classes that find roots of univariate functions using only function evaluations.

Interface for random number distributions.

Interface implemented by probablility distributions.

Interface for classes used by class LinearRegression to calculate regression parameters.

Implement this interface to indicate support of range slicing in a vector.

Interface for general sparse matrix storage formats.

Interface for classes which provide a method for obtaining the updated value of the Hessian of the Lagrangian based on the current iteration data for a Sequentail Quadratic Programming algorithm.

Computes a step size alphak for performing the update xk+1 = xk + alphak*pk, where pk is the step direction vector.

Functor that takes two vectors and returns a measure of the distance (similarity) between them.

Tolerance met function delegate.

Functor that computes the linkage (similarity) between two groups.

Given an entry aij in the connectivity matrix A, this delegate must return the distance between the elements i and j to be used for performing the hierarchical cluster analysis.

Functor for generating uniform deviates between zero and one.

Enum for possible algorithm termination reasons.

Result of eigenvalue problem solve attempt using implicitly restarted Arnoldi iteration.

Status values indicating why iteration was terminated.

Enumeration for specifying balancing options in eigenvalue decompositions.

Enumeration for specifying a biased or unbiased estimator.

Enum specifying a particualr conjugate transpose option.

Enum whose value indicate the status of the solution.

Enum whose value indicate the status of the solution.

Enumeration for specifying constraint types possible for the Constraint class and other constrained optimization classes.>

Emum specifics types of control limits.

Options for handling the various convolution/correlation result boundaries.

Controls internal funtion of convolution class.

Options for handling the various convolution/correlation result boundaries.

Discrete data integration strategies.

Details thresholding methods.

Thresholding policy to apply to details thresholding.

The two types of wavelet coefficients.

Method for padding the signal edges for improved DWT accuracy near signal edges.

Enumeration specifying different methods of random number generation.

Enumeration specifying different methods of random number generation.

Enumeration specifying different methods of random number generation.

Enumeration specifying different methods of random number generation.

Enumeration specifying different methods of random number generation.

Enumeration specifying different methods of random number generation.

Enumeration specifying different methods of random number generation.

Enumeration specifying different methods of random number generation.

Possible values for the dual simplex solver costing parameter. These values specify the pivoting strategy used by the solver.

Direction of FFT. Used for building FFTConfiguration types.

Forward Domain of FFT. Used for building FFTConfiguration types.

Precision of FFT transform. Used for building FFTConfiguration types.

Enumeration specifying different methods of random number generation.

Enumeration specifying different methods of random number generation.

Enumeration specifying different methods of random number generation.

Enumeration specifying different methods of random number generation.

Enumeration specifying different methods of random number generation.

Enumeration specifying different methods of random number generation.

Enumeration specifying different methods of random number generation.

Enumeration specifying different methods of random number generation.

Enumeration for specifying the form of an alternative hypothesis in a hypothesis test.

Enum whose value indicate the status of the solution.

KKT form options for the interior point quadratic programming solver.

Presolve options for the interior point quadratic programming solver.

Options for symbolic ordering for the interior point quadratic programming solver.

An enumeration representing the possible interval types classified according to whether or not the endpoints are included in the interval.

Enumeration specifying different methods of random number generation.

Enumeration specifying different methods of random number generation.

Enumeration for specifying the type of transformation of a normal random variate in the Johnson system.

An enumeration representing methods used to choose the initial cluster centers.

Options for handling the boundaries in a moving window filter.

Enumeration of possible nonnegative least squares algorithm termination states.

Enumeration for specifying different types of norms.

Output functions are functions supplied by the user to derived ODE solvers. These functions are called by solver during 1. Initialization. Before the first integration step is performed. 2. After each integration step. 3. When the solver is complete. Output functions are called with an OutputFunctionFlag parameter indicating under which of the above conditions it is being invoked.

Enum for indicating whether a parameter is shared or not in a global curve fit calculation.

Enumeration for specifying sorting order.

Rules to filter peaks.

Enumeration for specifying different view positions of underlying data.

Costing algorithms supported by the primal simplex algorithm.

Enum for specifying transpose operations to be performed on the operands of a matrix-matrix multiply operation.

Enumeration for the various algorithms available for generating random numbers uniformly dstributed in the interval [0, 1]

Enum indicating the status of a random number stream.

Enumeration specifying Savitsky-Golay boundary options.

Enumeration of branching strategies used in the branch-and-bound algorithm.

Enumeration of options for search strategies for the mixed integer linear programming solver.

Enumeration for specifying different sorting types, such as ascending or descending order.

Enumeration for specifying possible return values for errors.

Enumeration for specifying the types of matrices that can be factored.

Partial Least Squares Mode.

Enumeration for specifying the storage scheme of a matrix.

Enumeration for specifying the storage scheme of a matrix.

Options for checking the arrays passed into the solver as input parameters. If an array contains any INF or NaN values an exception will be thrown.

Enumeration for specifying the stop criterion.

Enumeration indicating the factors and their order in a sum of squares computation.

Built-in wavelets organized by short name. The first letter abbreviates the wavelet family name, and number that follows, the wavelet length.