The Kalman filter is actually a feedback approach to minimize the estimation error in terms of sum of square. This approach can be applied to general nonlinear optimization. This function shows a way using the extended Kalman filter to solve some unconstrained nonlinear optimization problems. Two examples are included: a general optimization problem and a problem to solve a set of nonlinear equations represented by a neural network model.
RANDBLOCK - randomize blocks of a matrix
R = RANDBLOCK(M,S) randomizes the matrix M by dividing M into non-overlapping blocks of the size specified by S, and shuffling these blocks. M can be a N-D matrix.
The number of...
The set of vectors is passed like column vectors of a matrix. This algorithm take advantage of the matrix form using sub matrix (more vectors at the same time). I've tested it with a random 1000x1000 matrix (so 1000 vectors 1000x1)...
Function colAUC calculates Area under ROC curve (AUC) for a vector or for each column of a matrix.
The main properties of this code: * Ability to work with multi-dimensional data. * Ability to work with multi-class...
This program displays the contents of a matrix in a newly-generated Matlab figure for easy viewing and printing. The figure size, font size, and cell size are all sized according to both screen size and matrix size. Includes options for displaying...
Set the elements of the Matrix Image which are in the interior of the ellipse E with the value 'color'. The ellipse E has center (y0, x0), the major axe = a, the minor axe = b, and teta is the angle macked by the major axe with the horizontal...
POPULATION = DETABULATE(TABLE), where the first column of the matrix TABLE contains values, and the second column contains respective frequency counts, returns the original population matrix (POPULATION). In this manner, its functionality is...
This function generates the 2D Walsh or Hadamard Transform of a matrix. Where the Walsh Transform uses the sequency ordered matrix and the Hadamard the natural/hadamard ordered matrix. The paley ordered transform is not yet...
This function calculates column-wise mode values of a matrix. If there are no modes in a column, it returns NaN. Column mode values are stored in a cell array. This is a modified version of "fastmode.m" by Harold Bien.
nancumsum: Cumulative sum of a matrix, with user-specified treatment of NaNs. Computes the cumulative sum of matrix A along dimension DIM, allowing the user to replace NaNs with zeros, to skip over them, or to reset on NaNs,...
nancumprod: Cumulative product of a matrix, with user-specified treatment of NaNs.
Computes the cumulative product of matrix A along dimension DIM, allowing the user to replace NaNs with ones, or to maintain NaNs as placeholders. ...
Up to now, to find the first non-zero element of a matrix along a column (for example) user might:
1. Use for-loop with FIND command for j=1:size(A,2) ... = find(A(:,j), 1, 'first'); end 2. Use other...
VMatrixLib is a little, handy, Java matrix library which implements a set of utility functions (such as calculus of the determinant of a matrix, calculus of the rank, inverse matrix, and many others..) that anyone who have to use matrices needs.
NMath Matrix is a matrix manipulation library that can be used for different types of matrix expressions. Users are allowed to calculate variety of sparse matrix problems like, symmetric, hermitian, symmetric banded etc and to transpose them. They...
ICP fit points in data to the points in model. Fit with respect to minimize the sum of square errors with the closest model points and data points.
Ordinary usage:
[R, T] = icp(model,data)
INPUT: ...
This function finds duplicate values along the first column of a matrix, averages the remaining rows, and removes the duplicate rows.
RotatorHeadz! is a simple logic game. Your task is to catch more than a half of the fields (one square of the matrix) in the 9 x 9 matrix. Put a horizontal or vertical red line (called rotator, use right-click to rotate, left-click to set) on the...
dftmat = DFT matrix of order N x N; N = Order of the matrix computes the DFT matrix of orer N x N; DFT matrix is a n x n matrix defined as Wn=[(Wn)^km] Wn=exp(-j*2*pi/n)
Reference: Multirate Systems and Filter...
The code implements the so called Faddeev-Leverrier algorithm to compute the coefficients of the characteristic polynomial of a given matrix and to get the inverse of the matrix without extra cost.
Calculate the linear indices for neighboring points in a matrix. You need to supply one or more linear indices for the point(s) of origin and the dimensions of the matrix. You will get a list will linear indices to all neighboring points. The... |