• No results found

[PDF] Top 20 Computation Sequences for Series and Polynomials

Has 10000 "Computation Sequences for Series and Polynomials" found on our website. Below are the top 20 most common "Computation Sequences for Series and Polynomials".

Computation Sequences for Series and Polynomials

Computation Sequences for Series and Polynomials

... Note that the successful computation of pole locations in the multiple pole case depend on the number of higher order coefficients available. A more accurate estimations on the locations of the poles requires ... See full document

117

A series transformation formula and related polynomials

A series transformation formula and related polynomials

... power series into series of ...power series in a closed form; second, it transforms certain power series into asymptotic ...a series transfor- mation formula which appears in the works ... See full document

18

Two parameter Srivastava polynomials and several series identities

Two parameter Srivastava polynomials and several series identities

... Srivastava polynomials in one and more variables by inserting new ...These polynomials include the family of polynomials which were introduced and/or investigated in [–, , ] and ...various ... See full document

9

Sumudu Transformation or What Else Can Laplace Transformation Do

Sumudu Transformation or What Else Can Laplace Transformation Do

... given polynomials. As a rule, such truncated series are not introduced as Special functions with a special function symbol and, clearly, problems of their convergence also do not ...infinite series, ... See full document

32

Sums of finite products of Chebyshev polynomials of the second kind and of Fibonacci polynomials

Sums of finite products of Chebyshev polynomials of the second kind and of Fibonacci polynomials

... Chebyshev polynomials of the second kind and of Fibonacci polynomials and derive Fourier series expansions of functions asso- ciated with ...Fourier series expansions, we can express those ... See full document

14

Computing $\exp(-\tau A)b$ with Laguerre polynomials

Computing $\exp(-\tau A)b$ with Laguerre polynomials

... Chebyshev series, the region of good fit spreads around the target inter- ...Laguerre series, it is anchored at the origin and gradually grows toward the right as more terms are added to the ... See full document

19

Complex roots of polynomials and their computation with the help of Scientific Calculators

Complex roots of polynomials and their computation with the help of Scientific Calculators

... In this work, calculators of Casio fx-991/570 series (fx-991W/115W, fx-991W/115W, fx-991MS, fx- 991ES etc.) are under consideration [4,5]. These calculators offer help to tackle with complex number in different ... See full document

10

Descending Central Series of Free Pro-p-Groups

Descending Central Series of Free Pro-p-Groups

... In this thesis, we study the first three cohomology groups of the quotients of the descending central series of a free pro-p-group. We analyse the Lyndon-Hochschild- Serre spectral sequence up to degree three and ... See full document

79

On generalized heat polynomials

On generalized heat polynomials

... SERIES REPHESENTATION In this section we shall establish a series representation of the heat transform Fr,t in terms of Laguerre polynomials and confluent hypergeometric functions.. As m[r] ... See full document

8

Extraction of orthogonal polynomials from generating function for reciprocal of odd numbers

Extraction of orthogonal polynomials from generating function for reciprocal of odd numbers

... denominator polynomials of both even and odd order convergents of a regular C-fraction of a series with coefficient as reciprocal of odd numbers connected to Pade ap- ...four sequences of orthogonal ... See full document

9

Computation of Some Wonderful Results Involving Certain Polynomials

Computation of Some Wonderful Results Involving Certain Polynomials

... The special function is one of the central branches of Mathematical sciences initiated by L’Euler .But systematic study of the Hypergeometric functions were initiated by C.F Gauss, an imminent German Mathematician in ... See full document

10

Estimated Bounds for Zeros of Polynomials from Traces of Graeffe Matrices

Estimated Bounds for Zeros of Polynomials from Traces of Graeffe Matrices

... for polynomials is a classical problem that has been proven essential in various disciplines such as controling engineering problems, eigenvalue problems in mathematical physics, and digital audio signal ... See full document

7

A new generalization of convolved (p,q)−Fibonacci and (p,q)−Lucas polynomials

A new generalization of convolved (p,q)−Fibonacci and (p,q)−Lucas polynomials

... The multiple sum of Fibonacci numbers have been studied several papers in [8, 20, 21]. In this section, we consider the some mixed–multiple sums for (p, q)−Fibonacci and ( p, q)−Lucas polynomials by applying the ... See full document

11

A note on the higher order Frobenius Euler polynomials and Sheffer sequences

A note on the higher order Frobenius Euler polynomials and Sheffer sequences

... Kim et al Advances in Difference Equations 2013, 2013 41 http //www advancesindifferenceequations com/content/2013/1/41 R ES EA RCH Open Access A note on the higher order Frobenius Euler polynomials a[.] ... See full document

12

Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials

Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials

... The last matrix has column dimension equal to d + 1 and, provided that it has rank 1, every row gives the coefficients of the GCD with degree d = 1. However, there are cases where the iterative nature of the ERES method ... See full document

23

The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials

The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials

... the computation of the degree t of an approximate greatest common divisor d(y) of two Bernstein polynomials f (y) and g(y), which are of degrees m and n ... See full document

39

Parallelization of the optical flow computation in sequences from moving cameras

Parallelization of the optical flow computation in sequences from moving cameras

... light conditions are smaller due to the high frame rate, thus moving closer to meeting the constant illumination condition. In summary, a high frames-per-second rate allows simplifying the optical flow computation ... See full document

19

Homomorphic  Secret  Sharing:  Optimizations   and  Applications

Homomorphic Secret Sharing: Optimizations and Applications

... secure computation with them, which requires to invest a large computational effort to generate material that might never be actually ...a computation would exchange: two parties can jointly generate a ... See full document

58

Sequences and series involving the sequence of composite numbers

Sequences and series involving the sequence of composite numbers

... SEQUENCES AND SERIES INVOLVING THE SEQUENCE OF COMPOSITE NUMBERS PANAYIOTIS VLAMOS Received 17 April 2001 and in revised form 2 October 2001.. Denoting by pn and cn the nth prime number [r] ... See full document

6

Pythagorean identity for polyharmonic polynomials

Pythagorean identity for polyharmonic polynomials

... The Pythagorean identity for spherical harmonics is also a special case of the ad- dition formula for spherical harmonics [9, page 149] and [8, page 268]. This leads us to conjecture that the homogeneous polyharmonic ... See full document

5

Show all 10000 documents...