Package org.apache.commons.math.complex

Examples of org.apache.commons.math.complex.Complex

129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
    /**
     * Test of solver for the quintic function using solveAll().
     */
    public void testQuinticFunction2() throws MathException {
        double initial = 0.0, tolerance;
        Complex expected, result[];

        // p(x) = x^5 + 4x^3 + x^2 + 4 = (x+1)(x^2-x+1)(x^2+4)
        double coefficients[] = { 4.0, 0.0, 1.0, 4.0, 0.0, 1.0 };
        LaguerreSolver solver = new LaguerreSolver();
        result = solver.solveAll(coefficients, initial);

        expected = new Complex(0.0, -2.0);
        tolerance = Math.max(solver.getAbsoluteAccuracy(),
                    Math.abs(expected.abs() * solver.getRelativeAccuracy()));
        TestUtils.assertContains(result, expected, tolerance);

        expected = new Complex(0.0, 2.0);
        tolerance = Math.max(solver.getAbsoluteAccuracy(),
                    Math.abs(expected.abs() * solver.getRelativeAccuracy()));
        TestUtils.assertContains(result, expected, tolerance);

        expected = new Complex(0.5, 0.5 * Math.sqrt(3.0));
        tolerance = Math.max(solver.getAbsoluteAccuracy(),
                    Math.abs(expected.abs() * solver.getRelativeAccuracy()));
        TestUtils.assertContains(result, expected, tolerance);

        expected = new Complex(-1.0, 0.0);
        tolerance = Math.max(solver.getAbsoluteAccuracy(),
                    Math.abs(expected.abs() * solver.getRelativeAccuracy()));
        TestUtils.assertContains(result, expected, tolerance);

        expected = new Complex(0.5, -0.5 * Math.sqrt(3.0));
        tolerance = Math.max(solver.getAbsoluteAccuracy(),
                    Math.abs(expected.abs() * solver.getRelativeAccuracy()));
        TestUtils.assertContains(result, expected, tolerance);
    }
View Full Code Here
450
451
452
453
454
455
456
457
458
 

  public static ComplexVector c(double... d){
    ComplexArrayVector.Builder builder = new ComplexArrayVector.Builder();
    for(double di : d){
        builder.add(new Complex(di,0));
    }
      return builder.build();
  }
View Full Code Here
456
457
458
459
460
461
462
    }
      return builder.build();
  }
 
  public static Complex complex(double x,double y){
    return new Complex(x,y);
  }
View Full Code Here
108
109
110
111
112
113
114
      throw new RuntimeException(e);
    }
  }

  protected Complex complex(double real) {
    return new Complex(real, 0);
  }
View Full Code Here
112
113
114
115
116
117
118
  protected Complex complex(double real) {
    return new Complex(real, 0);
  }

  protected Complex complex(double real, double imaginary) {
    return new Complex(real, imaginary);
  }
View Full Code Here
53
54
55
56
57
58
59
60
61
        real = realVector.getElementAsDouble(i % realVector.length());
      }
      if(imaginaryVector.length() > 0) {
        imaginary = imaginaryVector.getElementAsDouble(i % imaginaryVector.length());
      }
      result.add(new Complex(real, imaginary));
    }
    return result.build();
  }
View Full Code Here
73
74
75
76
77
78
79
  }
 
  @Builtin
  @DataParallel
  public static Complex Conj(Complex z){
    return new Complex(z.getReal(),-1*z.getImaginary());
  }
View Full Code Here
90
91
92
93
94
95
96
  @Override
  public Complex getElementAsComplex(int index) {
    if(IntVector.isNA(getElementAsRawLogical(index))) {
      return ComplexVector.NA;
    }
    return new Complex(getElementAsDouble(index), 0);
  }
View Full Code Here
185
186
187
188
189
190
191
      return set(size, value);
    }

    @Override
    public Builder add(Number value) {
      return add(new Complex(value.doubleValue(),0));
    }
View Full Code Here
211
212
213
214
215
216
217
218
219
220
221
    }

    public void ensureCapacity(int minCapacity) {
      int oldCapacity = values.length;
      if (minCapacity > oldCapacity) {
        Complex oldData[] = values;
        int newCapacity = (oldCapacity * 3)/2 + 1;
        if (newCapacity < minCapacity)
          newCapacity = minCapacity;
        // minCapacity is usually close to size, so this is a win:
        values = Arrays.copyOf(oldData, newCapacity);
View Full Code Here
TOP

Related Classes of org.apache.commons.math.complex.Complex

  • com.opengamma.analytics.math.util.wrapper.CommonsMathWrapper
  • com.opengamma.analytics.math.util.wrapper.CommonsMathWrapperTest
  • net.sourceforge.gpstools.TrackAnalyzer
  • org.apache.commons.math.analysis.LaguerreSolver
  • org.apache.commons.math.analysis.LaguerreSolverTest
  • org.apache.commons.math.analysis.solvers.LaguerreSolver
  • org.apache.commons.math.analysis.solvers.LaguerreSolverTest
  • org.apache.commons.math.transform.FastCosineTransformer
  • org.apache.commons.math.transform.FastFourierTransformer
  • org.apache.commons.math.transform.FastFourierTransformer$MultiDimensionalComplexMatrix
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.