Computing the norm as the Euclidean norm squared (i.e. - Java java.lang

Java examples for java.lang:Math Algorithm

  1. HOME
  2. Java
  3. java.lang
  4. Math Algorithm

Description

Computing the norm as the Euclidean norm squared (i.e.

Demo Code

/*//  w  ww .  ja v a  2s.c om
 *  Java Information Dynamics Toolkit (JIDT)
 *  Copyright (C) 2012, Joseph T. Lizier
 *  
 *  This program is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation, either version 3 of the License, or
 *  (at your option) any later version.
 *  
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *  
 *  You should have received a copy of the GNU General Public License
 *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
//package com.java2s;

public class Main {
    public static void main(String[] argv) throws Exception {
        double[] x1 = new double[] { 34.45, 35.45, 36.67, 37.78, 37.0000,
                37.1234, 67.2344, 68.34534, 69.87700 };
        double[] x2 = new double[] { 34.45, 35.45, 36.67, 37.78, 37.0000,
                37.1234, 67.2344, 68.34534, 69.87700 };
        System.out.println(euclideanNormSquared(x1, x2));
    }

    /**
     * Computing the norm as the Euclidean norm squared
     *  (i.e. avoids taking the square root).
     * 
     * @param x1
     * @param x2
     * @return
     */
    public static double euclideanNormSquared(double[] x1, double[] x2) {
        double distance = 0.0;
        for (int d = 0; d < x1.length; d++) {
            double difference = x1[d] - x2[d];
            distance += difference * difference;
        }
        return distance;
    }
}

Related Tutorials