You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@commons.apache.org by "Luc Maisonobe (JIRA)" <ji...@apache.org> on 2013/03/13 13:22:13 UTC

[jira] [Resolved] (MATH-628) use only SparseIterator, on RealVectors, that implement SpareRealVectors

     [ https://issues.apache.org/jira/browse/MATH-628?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Luc Maisonobe resolved MATH-628.
--------------------------------

    Resolution: Won't Fix

Sparse linear algebra implementation in Apache Commons Math needs a complete rewrite. As per issue MATH-870, it was decided to remove the corresponding classes for 4.0. The classes and interfaces have already been deprecated as of 3.1.1.
                
> use only SparseIterator, on RealVectors, that implement SpareRealVectors 
> -------------------------------------------------------------------------
>
>                 Key: MATH-628
>                 URL: https://issues.apache.org/jira/browse/MATH-628
>             Project: Commons Math
>          Issue Type: Improvement
>            Reporter: Arne Plöse
>            Priority: Minor
>             Fix For: 3.2
>
>         Attachments: ArrayRealVector.diff
>
>
> the performance suffers badly if one tries to use SparseIterator when there is no sparse backing.
> Currently there is only a check for ArrayRealvector, all other is supposed to be a SparseRealvector.
> If one creates a new implementation of RealVector ... bang.
> here is a performance test case:
> {code}
> package org.apache.commons.math.linear;
> import java.util.Iterator;
> import org.junit.Test;
> /**
>  *
>  * @author aploese
>  */
> public class PerformanceTest {
>     final static int ITER = 100;
>     final static int VECTOR_SIZE = 2048;
>     final static double SPARSE_FILL_STATE = 0.8;
>     @Test
>     public void performanceSparseVectorOpenMap() {
>         System.out.println("performanceSparseVectorOpenMap");
>         RealVector v = new OpenMapRealVector(VECTOR_SIZE);
>         for (int i = 0; i < v.getDimension() * SPARSE_FILL_STATE; i++) {
>             v.setEntry(i, i);
>         }
>         for (int j = 0; j < ITER; j++) {
>             long t1 = System.nanoTime();
>             double a = 0;
>             Iterator<RealVector.Entry> it = v.sparseIterator();
>             RealVector.Entry e;
>             while (it.hasNext() && (e = it.next()) != null) {
>                 a += e.getValue();
>             }
>             long t2 = System.nanoTime();
>             for (int i = 0; i < v.getDimension(); i++) {
>                 a += v.getEntry(i);
>             }
>             long t3 = System.nanoTime();
>             System.out.println(String.format("OpenMap: %d\t%s\t| %s", j, Long.toString(t2 - t1), Long.toString(t3 - t2)));
>         }
>     }
>     @Test
>     public void performanceSparseVectorArray() {
>         System.out.println("performanceSparseVectorArray");
>         RealVector v = new ArrayRealVector(VECTOR_SIZE);
>         for (int i = 0; i < v.getDimension() * SPARSE_FILL_STATE; i++) {
>             v.setEntry(i, i);
>         }
>         for (int j = 0; j < ITER; j++) {
>             long t1 = System.nanoTime();
>             double a = 0;
>             Iterator<RealVector.Entry> it = v.sparseIterator();
>             RealVector.Entry e;
>             while (it.hasNext() && (e = it.next()) != null) {
>                 a += e.getValue();
>             }
>             long t2 = System.nanoTime();
>             for (int i = 0; i < v.getDimension(); i++) {
>                 a += v.getEntry(i);
>             }
>             long t3 = System.nanoTime();
>             System.out.println(String.format("Array: %d\t%s\t| %s", j, Long.toString(t2 - t1), Long.toString(t3 - t2)));
>         }
>     }
> {code}
> Patch will follow.

--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira