Package flanagan.complex

Examples of flanagan.complex.ComplexPoly

87
88
89
90
91
92
93
94
95
96
        this.tConst = 0.0;
        this.aConst = 0.0;
        this.bConst = 1.0;
        this.cConst = tGain;
        super.sPoles = Complex.oneDarray(1);
        super.setSnumer(new ComplexPoly(this.cConst));
        super.setSdenom(new ComplexPoly(this.bConst, this.aConst));
        super.setZtransformMethod(1);
        super.addDeadTimeExtras();
    }
View Full Code Here
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
            switch(this.integMethod){
                // Trapezium rule
                case 0: ncoef = Complex.oneDarray(2);
                        ncoef[0].reset(this.deltaT*this.cConst,0.0D);
                        ncoef[1].reset(this.deltaT*this.cConst,0.0D);
                        super.zNumer=new ComplexPoly(1);
                        super.zNumer.resetPoly(ncoef);
                        super.zNumerDeg=1;
                        dcoef = Complex.oneDarray(2);
                        dcoef[0].reset(this.bConst*this.deltaT - 2*this.aConst,0.0D);
                        dcoef[1].reset(this.bConst*this.deltaT + 2*this.aConst,0.0D);
                        super.zDenom=new ComplexPoly(1);
                        super.zDenom.resetPoly(dcoef);
                        super.zDenomDeg=1;
                        super.zZeros = Complex.oneDarray(1);
                        super.zZeros[0].reset(-1.0D, 0.0D);
                        super.zPoles = Complex.oneDarray(1);
                        super.zPoles[0].reset((2.0D*this.aConst-super.deltaT*this.bConst)/(2.0D*this.aConst+super.deltaT*this.bConst), 0.0D);
                        break;
                // Backward rectangulr rule
                case 1: ncoef = Complex.oneDarray(2);
                        ncoef[0].reset(0.0D,0.0D);
                        ncoef[1].reset(this.cConst*this.deltaT,0.0D);
                        super.zNumer=new ComplexPoly(1);
                        super.zNumer.resetPoly(ncoef);
                        super.zNumerDeg=1;
                        dcoef = Complex.oneDarray(2);
                        dcoef[0].reset(this.bConst*this.deltaT + this.aConst,0.0D);
                        dcoef[1].reset(this.aConst,0.0D);
                        super.zDenom=new ComplexPoly(1);
                        super.zDenom.resetPoly(dcoef);
                        super.zDenomDeg=1;
                        super.zZeros = Complex.oneDarray(1);
                        super.zZeros[0].reset(0.0D, 0.0D);
                        super.zPoles = Complex.oneDarray(1);
                        super.zPoles[0].reset(this.aConst/(super.deltaT*this.bConst+this.aConst), 0.0D);
                        break;
                // Foreward rectangular rule
                case 2: ncoef = Complex.oneDarray(1);
                        ncoef[0].reset(this.cConst*this.deltaT,0.0D);
                        super.zNumer=new ComplexPoly(0);
                        super.zNumer.resetPoly(ncoef);
                        super.zNumerDeg=0;
                        dcoef = Complex.oneDarray(2);
                        dcoef[0].reset(-this.aConst,0.0D);
                        dcoef[1].reset(this.bConst*this.deltaT - this.aConst,0.0D);
                        super.zDenom=new ComplexPoly(1);
                        super.zDenom.resetPoly(dcoef);
                        super.zDenomDeg=1;
                        super.zPoles = Complex.oneDarray(1);
                        super.zPoles[0].reset(this.aConst/(super.deltaT*this.bConst-this.aConst), 0.0D);
                        break;
View Full Code Here
807
808
809
810
811
812
813
814
            ComplexPoly cp = new ComplexPoly(this);
            return cp.roots(new Complex(estx, 0.0));
        }

        public Complex[] roots(Complex estx){
            ComplexPoly cp = new ComplexPoly(this);
            return cp.roots(estx);
        }
View Full Code Here
813
814
815
816
817
818
819
820
            return cp.roots(estx);
        }

        // Calculate the roots (real or complex) of a polynomial (real or complex)
        public Complex[] roots(boolean polish, double estx){
            ComplexPoly cp = new ComplexPoly(this);
            return cp.roots(new Complex(estx, 0.0));
        }
View Full Code Here
854
855
856
857
858
859
860
861
        // Finds all roots of a double polynomial by successive calls to laguerre
        // Following the procedure in Numerical Recipes for C [Reference above]
        // Initial estimates are all zero, polish=true
        public Complex[] laguerreAll(){
            ComplexPoly cp = new ComplexPoly(this);
            return cp.laguerreAll();
        }
View Full Code Here
860
861
862
863
864
865
866
867
            return cp.laguerreAll();
        }

        //  Initial estimates estx, polish=true
        public Complex[] laguerreAll(double estx){
            ComplexPoly cp = new ComplexPoly(this);
            return cp.laguerreAll(new Complex(estx, 0.0));
        }
View Full Code Here
865
866
867
868
869
870
871
872
            ComplexPoly cp = new ComplexPoly(this);
            return cp.laguerreAll(new Complex(estx, 0.0));
        }

        public Complex[] laguerreAll(Complex estx){
            ComplexPoly cp = new ComplexPoly(this);
            return cp.laguerreAll(estx);
        }
View Full Code Here
871
872
873
874
875
876
877
878
            return cp.laguerreAll(estx);
        }

        //  Initial estimates are all zero.
        public Complex[] laguerreAll(boolean polish){
            ComplexPoly cp = new ComplexPoly(this);
            return cp.laguerreAll(polish);
        }
View Full Code Here
878
879
880
881
882
883
884
885
        }

        // Finds all roots of a double polynomial by successive calls to laguerre
        //  Initial estimates are estx
        public Complex[] laguerreAll(boolean polish, double estx){
            ComplexPoly cp = new ComplexPoly(this);
            return cp.laguerreAll(polish, new Complex(estx, 0.0));
        }
View Full Code Here
883
884
885
886
887
888
889
890
            ComplexPoly cp = new ComplexPoly(this);
            return cp.laguerreAll(polish, new Complex(estx, 0.0));
        }

        public Complex[] laguerreAll(boolean polish, Complex estx){
            ComplexPoly cp = new ComplexPoly(this);
            return cp.laguerreAll(polish, estx);
        }
View Full Code Here
TOP

Related Classes of flanagan.complex.ComplexPoly

  • flanagan.control.ClosedLoop
  • flanagan.control.Compensator
  • flanagan.control.FirstOrder
  • flanagan.control.HighPassPassive
  • flanagan.control.LowPassPassive
  • flanagan.control.Prop
  • flanagan.control.PropDeriv
  • flanagan.control.PropInt
  • flanagan.control.PropIntDeriv
  • flanagan.control.SecondOrder
    • 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.