Archive | Java algorithms RSS feed for this section

Normalization

by teddy on 22. Apr, 2010 in Java algorithms

Normalization is any process that makes something more normal.

/**
* @param point1 first point
* @param point2 second point
* @return the normalization Euclidean distance of two points
*/
public [...]

Read full story • Comments { 0 }
Euclidean distance

Euclidean distance

by teddy on 20. Apr, 2010 in Java algorithms

In mathematics, the Euclidean distance or Euclidean metric is the “ordinary” distance between two points that one would measure with a ruler, and is given by the Pythagorean formula.
/**
* @param point1 first point
* @param point2 second [...]

Read full story • Comments { 0 }

Gaussian distribution

by teddy on 09. Apr, 2010 in Java algorithms

The normal distribution or Gaussian distribution is a continuous probability distribution that often gives a good description of data that cluster around the mean.

/**
* The aim of this static method is to implememnt the function of Gaussian distribution
* [...]

Read full story • Comments { 0 }

Gaussian elimination

by teddy on 30. Mar, 2010 in Java algorithms

In linear algebra, Gaussian elimination is an algorithm  for solving systems of linear equations, finding the rank of a matrix, and calculating the inverse of an invertible square matrix.
Gauss-Jordan Elimination is a variant of Gaussian Elimination.

package org.javaresources.math.matrix;
/**
* Created by IntelliJ IDEA.
* User: glen
* Date: 2010-3-29
* Time: 20:10:28
*
*/
public class MatrixUtil [...]

Read full story • Comments { 0 }