Two new analytical formulae expressing explicitly the derivatives of Chebyshev polynomials of the third and fourth kinds of any degree and of any order in terms of Chebyshev polynomials of the third and fourth kinds t...Two new analytical formulae expressing explicitly the derivatives of Chebyshev polynomials of the third and fourth kinds of any degree and of any order in terms of Chebyshev polynomials of the third and fourth kinds themselves are proved. Two other explicit formulae which express the third and fourth kinds Chebyshev expansion coefficients of a general-order derivative of an infinitely differentiable function in terms of their original expansion coefficients are also given. Two new reduction formulae for summing some terminating hypergeometric functions of unit argument are deduced. As an application of how to use Chebyshev polynomials of the third and fourth kinds for solving high-order boundary value problems, two spectral Galerkin numerical solutions of a special linear twelfth-order boundary value problem are given.展开更多
A dedicated key server cannot be instituted to manage keys for MANETs since they are dynamic and unstable. The Lagrange's polynomial and curve fitting are being used to implement hierarchical key management for Mo...A dedicated key server cannot be instituted to manage keys for MANETs since they are dynamic and unstable. The Lagrange's polynomial and curve fitting are being used to implement hierarchical key management for Mobile Ad hoc Networks(MANETs). The polynomial interpolation by Lagrange and curve fitting requires high computational efforts for higher order polynomials and moreover they are susceptible to Runge's phenomenon. The Chebyshev polynomials are secure, accurate, and stable and there is no limit to the degree of the polynomials. The distributed key management is a big challenge in these time varying networks. In this work, the Chebyshev polynomials are used to perform key management and tested in various conditions. The secret key shares generation, symmetric key construction and key distribution by using Chebyshev polynomials are the main elements of this projected work. The significance property of Chebyshev polynomials is its recursive nature. The mobile nodes usually have less computational power and less memory, the key management by using Chebyshev polynomials reduces the burden of mobile nodes to implement the overall system.展开更多
In this paper, we investigate the coefficient estimate and Fekete-Szego inequality of a subclass of analytic and bi-univalent functions defined by Chebyshev polynomials and q- differential operator. The results presen...In this paper, we investigate the coefficient estimate and Fekete-Szego inequality of a subclass of analytic and bi-univalent functions defined by Chebyshev polynomials and q- differential operator. The results presented in this paper improve or generalize the recent works of other authors.展开更多
We raise and partly answer the question: whether there exists a Markov system with respect to which the zeros of the Chebyshev polynomials are dense, but the maximum length of a zero free interval of the nth Chebyshev...We raise and partly answer the question: whether there exists a Markov system with respect to which the zeros of the Chebyshev polynomials are dense, but the maximum length of a zero free interval of the nth Chebyshev polynomial does not tends to zero. We also draw the conclu- tion that a Markov system, under an additional assumption, is dense if and only if the maxi- mum length of a zero free interval of the nth associated Chebyshev polynomial tends to zero.展开更多
In expansions of arbitrary functions in Bessel functions or Spherical Bessel functions, a dual partner set of polynomials play a role. For the Bessel functions, these are the Chebyshev polynomials of first kind and fo...In expansions of arbitrary functions in Bessel functions or Spherical Bessel functions, a dual partner set of polynomials play a role. For the Bessel functions, these are the Chebyshev polynomials of first kind and for the Spherical Bessel functions the Legendre polynomials. These two sets of functions appear in many formulas of the expansion and in the completeness and (bi)-orthogonality relations. The analogy to expansions of functions in Taylor series and in moment series and to expansions in Hermite functions is elaborated. Besides other special expansion, we find the expansion of Bessel functions in Spherical Bessel functions and their inversion and of Chebyshev polynomials of first kind in Legendre polynomials and their inversion. For the operators which generate the Spherical Bessel functions from a basic Spherical Bessel function, the normally ordered (or disentangled) form is found.展开更多
This work shows that each kind of Chebyshev polynomials may be calculated from a symbolic formula similar to the Lucas formula for Bernoulli polynomials. It exposes also a new approach for obtaining generating functio...This work shows that each kind of Chebyshev polynomials may be calculated from a symbolic formula similar to the Lucas formula for Bernoulli polynomials. It exposes also a new approach for obtaining generating functions of them by operator calculus built from the derivative and the positional operators.展开更多
The main purpose of this paper is in using the generating function of generalized Fibonacci polynomials and its partial derivative to study the convolution evaluation of the second-kind Chebyshev polynomials, and give...The main purpose of this paper is in using the generating function of generalized Fibonacci polynomials and its partial derivative to study the convolution evaluation of the second-kind Chebyshev polynomials, and give an interesting formula.展开更多
In this paper,an adaptive observer for robust control of robotic manipulators is proposed.The lumped uncertainty is estimated using Chebyshev polynomials.Usually,the uncertainty upper bound is required in designing ob...In this paper,an adaptive observer for robust control of robotic manipulators is proposed.The lumped uncertainty is estimated using Chebyshev polynomials.Usually,the uncertainty upper bound is required in designing observer-controller structures.However,obtaining this bound is a challenging task.To solve this problem,many uncertainty estimation techniques have been proposed in the literature based on neuro-fuzzy systems.As an alternative,in this paper,Chebyshev polynomials have been applied to uncertainty estimation due to their simpler structure and less computational load.Based on strictly-positive-rea Lyapunov theory,the stability of the closed-loop system can be verified.The Chebyshev coefficients are tuned based on the adaptation rules obtained in the stability analysis.Also,to compensate the truncation error of the Chebyshev polynomials,a continuous robust control term is designed while in previous related works,usually a discontinuous term is used.An SCARA manipulator actuated by permanent magnet DC motors is used for computer simulations.Simulation results reveal the superiority of the designed method.展开更多
This paper discusses the issues of computational efforts and the accuracy of solutions of differential equations using multilayer perceptron and Chebyshev polynomials-based functional link artificial neural networks.S...This paper discusses the issues of computational efforts and the accuracy of solutions of differential equations using multilayer perceptron and Chebyshev polynomials-based functional link artificial neural networks.Some ordinary and partial differential equations have been solved by both these techniques and pros and cons of both these type of feedforward networks have been discussed in detail.Apart from that,various factors that affect the accuracy of the solution have also been analyzed.展开更多
In this paper,we propose efficient algorithms for approximating particular solutions of second and fourth order elliptic equations.The approximation of the particular solution by a truncated series of Chebyshev polyno...In this paper,we propose efficient algorithms for approximating particular solutions of second and fourth order elliptic equations.The approximation of the particular solution by a truncated series of Chebyshev polynomials and the satisfaction of the differential equation lead to upper triangular block systems,each block being an upper triangular system.These systems can be solved efficiently by standard techniques.Several numerical examples are presented for each case.展开更多
The computation of Chebyshev polynomial over finite field is a dominating operation for a public key cryptosystem.Two generic algorithms with running time of have been presented for this computation：the matrix algori...The computation of Chebyshev polynomial over finite field is a dominating operation for a public key cryptosystem.Two generic algorithms with running time of have been presented for this computation：the matrix algorithm and the characteristic polynomial algorithm,which are feasible but not optimized.In this paper,these two algorithms are modified in procedure to get faster execution speed.The complexity of modified algorithms is still,but the number of required operations is reduced,so the execution speed is improved.Besides,a new algorithm relevant with eigenvalues of matrix in representation of Chebyshev polynomials is also presented,which can further reduce the running time of that computation if certain conditions are satisfied.Software implementations of these algorithms are realized,and the running time comparison is given.Finally an efficient scheme for the computation of Chebyshev polynomial over finite field is presented.展开更多
This paper is confined to analyzing and implementing new spectral solutions of the fractional Riccati differential equation based on the application of the spectral tau method.A new explicit formula for approximating ...This paper is confined to analyzing and implementing new spectral solutions of the fractional Riccati differential equation based on the application of the spectral tau method.A new explicit formula for approximating the fractional derivatives of shifted Chebyshev polynomials of the second kind in terms of their original polynomials is established.This formula is expressed in terms of a certain terminating hypergeometric function of the type_(4)F_(3)(1).This hypergeometric function is reduced in case of the integer case into a certain terminating hypergeometric function of the type 3 F 2(1)which can be summed with the aid of Watson’s identity.Six illustrative examples are presented to ensure the applicability and accuracy of the proposed algorithm.展开更多
Matrix methods, now-a-days, are playing an important role in solving the real life problems governed by ODEs and/or by PDEs. Many differential models of sciences and engineers for which the existing methodologies do n...Matrix methods, now-a-days, are playing an important role in solving the real life problems governed by ODEs and/or by PDEs. Many differential models of sciences and engineers for which the existing methodologies do not give reliable results, these methods are solving them competitively. In this work, a matrix methods is presented for approximate solution of the second-order singularly-perturbed delay differential equations. The main characteristic of this technique is that it reduces these problems to those of solving a system of algebraic equations, thus greatly simplifying the problem. The error analysis and convergence for the proposed method is introduced. Finally some experiments and their numerical solutions are given.展开更多
A new finite difference-Chebyshev-Tau method for the solution of the two-dimensional Poisson equation is presented. Some of the numerical results are also presented which indicate that the method is satisfactory and c...A new finite difference-Chebyshev-Tau method for the solution of the two-dimensional Poisson equation is presented. Some of the numerical results are also presented which indicate that the method is satisfactory and compatible to other methods.展开更多
The aim of this work is to construct a new quadrature formula for Fourier Chebyshev coef ficients based on the divided differences of the integrand at points 1, 1 and the zeros of the n th Chebyshev polynomial o...The aim of this work is to construct a new quadrature formula for Fourier Chebyshev coef ficients based on the divided differences of the integrand at points 1, 1 and the zeros of the n th Chebyshev polynomial of the second kind. The interesting thing is that this quadrature rule is closely related to the well known Gauss Turn quadrature formula and similar to a recent result of Micchelli and Sharma, extending a particular case due to Micchelli and Rivlin.展开更多
In this paper, we study an efficient higher order numerical method to timefractional partial differential equations with temporal Caputo derivative. A collocation method based on shifted generalized Jacobi functions i...In this paper, we study an efficient higher order numerical method to timefractional partial differential equations with temporal Caputo derivative. A collocation method based on shifted generalized Jacobi functions is taken for approximating the solution of the given time-fractional partial differential equation in time and a shifted Chebyshev collocation method based on operational matrix in space. The derived numerical solution can approximate the non-smooth solution in time of given equations well. Some numerical examples are presented to illustrate the efficiency and accuracy of the proposed method.展开更多
In asteroid rendezvous missions, the dynamical environment near an asteroid’s surface should be made clear prior to launch of the mission. However, most asteroids have irregular shapes,which lower the efficiency of c...In asteroid rendezvous missions, the dynamical environment near an asteroid’s surface should be made clear prior to launch of the mission. However, most asteroids have irregular shapes,which lower the efficiency of calculating their gravitational field by adopting the traditional polyhedral method. In this work, we propose a method to partition the space near an asteroid adaptively along three spherical coordinates and use Chebyshev polynomial interpolation to represent the gravitational acceleration in each cell. Moreover, we compare four different interpolation schemes to obtain the best precision with identical initial parameters. An error-adaptive octree division is combined to improve the interpolation precision near the surface. As an example, we take the typical irregularly-shaped nearEarth asteroid 4179 Toutatis to demonstrate the advantage of this method; as a result, we show that the efficiency can be increased by hundreds to thousands of times with our method. Our results indicate that this method can be applicable to other irregularly-shaped asteroids and can greatly improve the evaluation efficiency.展开更多
In this paper,the mechanical response of a one-dimensional(1D)hexagonal piezoelectric quasicrystal(PQC)thin film is analyzed under electric and temperature loads.Based on the Euler-Bernoulli beam theory,a theoretical ...In this paper,the mechanical response of a one-dimensional(1D)hexagonal piezoelectric quasicrystal(PQC)thin film is analyzed under electric and temperature loads.Based on the Euler-Bernoulli beam theory,a theoretical model is proposed,resulting in coupled governing integral equations that account for interfacial normal and shear stresses.To numerically solve these integral equations,an expansion method using orthogonal Chebyshev polynomials is employed.The results provide insights into the interfacial stresses,axial force,as well as axial and vertical deformations of the PQC film.Additionally,fracture criteria,including stress intensity factors,mode angles,and the J-integral,are evaluated.The solution is compared with the membrane theory,neglecting the normal stress and bending deformation.Finally,the effects of stiffness and aspect ratio on the PQC film are thoroughly discussed.This study serves as a valuable guide for controlling the mechanical response and conducting safety assessments of PQC film systems.展开更多
Starting from general Jacobi polynomials we derive for the Ul-traspherical polynomials as their special case a set of related polynomials which can be extended to an orthogonal set of functions with interesting proper...Starting from general Jacobi polynomials we derive for the Ul-traspherical polynomials as their special case a set of related polynomials which can be extended to an orthogonal set of functions with interesting properties. It leads to an alternative definition of the Ultraspherical polynomials by a fixed integral operator in application to powers of the variable u in an analogous way as it is possible for Hermite polynomials. From this follows a generating function which is apparently known only for the Legendre and Chebyshev polynomials as their special case. Furthermore, we show that the Ultraspherical polynomials form a realization of the SU(1,1) Lie algebra with lowering and raising operators which we explicitly determine. By reordering of multiplication and differentiation operators we derive new operator identities for the whole set of Jacobi polynomials which may be applied to arbitrary functions and provide then function identities. In this way we derive a new “convolution identity” for Jacobi polynomials and compare it with a known convolution identity of different structure for Gegenbauer polynomials. In short form we establish the connection of Jacobi polynomials and their related orthonormalized functions to the eigensolution of the Schrödinger equation to Pöschl-Teller potentials.展开更多
In this paper, we construct Chebyshev biorthogonal multiwavelets, and use this multiwavelets to approximate signals (functions). The convergence rate for signal approximation is derived. The fast signal decomposition ...In this paper, we construct Chebyshev biorthogonal multiwavelets, and use this multiwavelets to approximate signals (functions). The convergence rate for signal approximation is derived. The fast signal decomposition and reconstruction algorithms are presented. The numerical examples validate the theoretical analysis.展开更多
文摘Two new analytical formulae expressing explicitly the derivatives of Chebyshev polynomials of the third and fourth kinds of any degree and of any order in terms of Chebyshev polynomials of the third and fourth kinds themselves are proved. Two other explicit formulae which express the third and fourth kinds Chebyshev expansion coefficients of a general-order derivative of an infinitely differentiable function in terms of their original expansion coefficients are also given. Two new reduction formulae for summing some terminating hypergeometric functions of unit argument are deduced. As an application of how to use Chebyshev polynomials of the third and fourth kinds for solving high-order boundary value problems, two spectral Galerkin numerical solutions of a special linear twelfth-order boundary value problem are given.
文摘A dedicated key server cannot be instituted to manage keys for MANETs since they are dynamic and unstable. The Lagrange's polynomial and curve fitting are being used to implement hierarchical key management for Mobile Ad hoc Networks(MANETs). The polynomial interpolation by Lagrange and curve fitting requires high computational efforts for higher order polynomials and moreover they are susceptible to Runge's phenomenon. The Chebyshev polynomials are secure, accurate, and stable and there is no limit to the degree of the polynomials. The distributed key management is a big challenge in these time varying networks. In this work, the Chebyshev polynomials are used to perform key management and tested in various conditions. The secret key shares generation, symmetric key construction and key distribution by using Chebyshev polynomials are the main elements of this projected work. The significance property of Chebyshev polynomials is its recursive nature. The mobile nodes usually have less computational power and less memory, the key management by using Chebyshev polynomials reduces the burden of mobile nodes to implement the overall system.
基金Supported by the National Natural Science Foundation of China(Grant Nos.11561001,11271045)the Program for Young Talents of Science and Technology in Universities of Inner Mongolia Autonomous Region(Grant No.NJYT-18-A14)+3 种基金the Nature Science Foundation of Inner Mongolia of China(Grant No.2018MS01026)the Higher School Foundation of Inner Mongolia of China(Grant No.NJZY19211)the Natural Science Foundation of Anhui Provincial Department of Education(Grant Nos.KJ2018A0833,KJ2018A0839)Provincial Quality Engineering Project of Anhui Colleges and Universities(Grant Nos.2018mooc608)
文摘In this paper, we investigate the coefficient estimate and Fekete-Szego inequality of a subclass of analytic and bi-univalent functions defined by Chebyshev polynomials and q- differential operator. The results presented in this paper improve or generalize the recent works of other authors.
文摘We raise and partly answer the question: whether there exists a Markov system with respect to which the zeros of the Chebyshev polynomials are dense, but the maximum length of a zero free interval of the nth Chebyshev polynomial does not tends to zero. We also draw the conclu- tion that a Markov system, under an additional assumption, is dense if and only if the maxi- mum length of a zero free interval of the nth associated Chebyshev polynomial tends to zero.
文摘In expansions of arbitrary functions in Bessel functions or Spherical Bessel functions, a dual partner set of polynomials play a role. For the Bessel functions, these are the Chebyshev polynomials of first kind and for the Spherical Bessel functions the Legendre polynomials. These two sets of functions appear in many formulas of the expansion and in the completeness and (bi)-orthogonality relations. The analogy to expansions of functions in Taylor series and in moment series and to expansions in Hermite functions is elaborated. Besides other special expansion, we find the expansion of Bessel functions in Spherical Bessel functions and their inversion and of Chebyshev polynomials of first kind in Legendre polynomials and their inversion. For the operators which generate the Spherical Bessel functions from a basic Spherical Bessel function, the normally ordered (or disentangled) form is found.
文摘This work shows that each kind of Chebyshev polynomials may be calculated from a symbolic formula similar to the Lucas formula for Bernoulli polynomials. It exposes also a new approach for obtaining generating functions of them by operator calculus built from the derivative and the positional operators.
文摘The main purpose of this paper is in using the generating function of generalized Fibonacci polynomials and its partial derivative to study the convolution evaluation of the second-kind Chebyshev polynomials, and give an interesting formula.
文摘In this paper,an adaptive observer for robust control of robotic manipulators is proposed.The lumped uncertainty is estimated using Chebyshev polynomials.Usually,the uncertainty upper bound is required in designing observer-controller structures.However,obtaining this bound is a challenging task.To solve this problem,many uncertainty estimation techniques have been proposed in the literature based on neuro-fuzzy systems.As an alternative,in this paper,Chebyshev polynomials have been applied to uncertainty estimation due to their simpler structure and less computational load.Based on strictly-positive-rea Lyapunov theory,the stability of the closed-loop system can be verified.The Chebyshev coefficients are tuned based on the adaptation rules obtained in the stability analysis.Also,to compensate the truncation error of the Chebyshev polynomials,a continuous robust control term is designed while in previous related works,usually a discontinuous term is used.An SCARA manipulator actuated by permanent magnet DC motors is used for computer simulations.Simulation results reveal the superiority of the designed method.
基金The second author of this article is grateful to the National Board for Higher Mathematics(NBHM)Mumbai,Department of Atomic Energy,Government of India for providing financial support through its project,sanction order number:2/48(1)2016/NBHM(R.P.)R&D-11/13847.
文摘This paper discusses the issues of computational efforts and the accuracy of solutions of differential equations using multilayer perceptron and Chebyshev polynomials-based functional link artificial neural networks.Some ordinary and partial differential equations have been solved by both these techniques and pros and cons of both these type of feedforward networks have been discussed in detail.Apart from that,various factors that affect the accuracy of the solution have also been analyzed.
文摘In this paper,we propose efficient algorithms for approximating particular solutions of second and fourth order elliptic equations.The approximation of the particular solution by a truncated series of Chebyshev polynomials and the satisfaction of the differential equation lead to upper triangular block systems,each block being an upper triangular system.These systems can be solved efficiently by standard techniques.Several numerical examples are presented for each case.
基金supported by the National Basic Research Program of China (2009CB320505)the National Natural Science Foundation of China (61002011)
文摘The computation of Chebyshev polynomial over finite field is a dominating operation for a public key cryptosystem.Two generic algorithms with running time of have been presented for this computation：the matrix algorithm and the characteristic polynomial algorithm,which are feasible but not optimized.In this paper,these two algorithms are modified in procedure to get faster execution speed.The complexity of modified algorithms is still,but the number of required operations is reduced,so the execution speed is improved.Besides,a new algorithm relevant with eigenvalues of matrix in representation of Chebyshev polynomials is also presented,which can further reduce the running time of that computation if certain conditions are satisfied.Software implementations of these algorithms are realized,and the running time comparison is given.Finally an efficient scheme for the computation of Chebyshev polynomial over finite field is presented.
文摘This paper is confined to analyzing and implementing new spectral solutions of the fractional Riccati differential equation based on the application of the spectral tau method.A new explicit formula for approximating the fractional derivatives of shifted Chebyshev polynomials of the second kind in terms of their original polynomials is established.This formula is expressed in terms of a certain terminating hypergeometric function of the type_(4)F_(3)(1).This hypergeometric function is reduced in case of the integer case into a certain terminating hypergeometric function of the type 3 F 2(1)which can be summed with the aid of Watson’s identity.Six illustrative examples are presented to ensure the applicability and accuracy of the proposed algorithm.
文摘Matrix methods, now-a-days, are playing an important role in solving the real life problems governed by ODEs and/or by PDEs. Many differential models of sciences and engineers for which the existing methodologies do not give reliable results, these methods are solving them competitively. In this work, a matrix methods is presented for approximate solution of the second-order singularly-perturbed delay differential equations. The main characteristic of this technique is that it reduces these problems to those of solving a system of algebraic equations, thus greatly simplifying the problem. The error analysis and convergence for the proposed method is introduced. Finally some experiments and their numerical solutions are given.
文摘A new finite difference-Chebyshev-Tau method for the solution of the two-dimensional Poisson equation is presented. Some of the numerical results are also presented which indicate that the method is satisfactory and compatible to other methods.
文摘The aim of this work is to construct a new quadrature formula for Fourier Chebyshev coef ficients based on the divided differences of the integrand at points 1, 1 and the zeros of the n th Chebyshev polynomial of the second kind. The interesting thing is that this quadrature rule is closely related to the well known Gauss Turn quadrature formula and similar to a recent result of Micchelli and Sharma, extending a particular case due to Micchelli and Rivlin.
基金Supported by the National Natural Science Foundation of China(Grant Nos.1140138011671166)
文摘In this paper, we study an efficient higher order numerical method to timefractional partial differential equations with temporal Caputo derivative. A collocation method based on shifted generalized Jacobi functions is taken for approximating the solution of the given time-fractional partial differential equation in time and a shifted Chebyshev collocation method based on operational matrix in space. The derived numerical solution can approximate the non-smooth solution in time of given equations well. Some numerical examples are presented to illustrate the efficiency and accuracy of the proposed method.
基金financially supported by the National Natural Science Foundation of China(Grant Nos.11473073,11503091,11661161013 and 11633009)Foundation of Minor Planets of the Purple Mountain Observatory
文摘In asteroid rendezvous missions, the dynamical environment near an asteroid’s surface should be made clear prior to launch of the mission. However, most asteroids have irregular shapes,which lower the efficiency of calculating their gravitational field by adopting the traditional polyhedral method. In this work, we propose a method to partition the space near an asteroid adaptively along three spherical coordinates and use Chebyshev polynomial interpolation to represent the gravitational acceleration in each cell. Moreover, we compare four different interpolation schemes to obtain the best precision with identical initial parameters. An error-adaptive octree division is combined to improve the interpolation precision near the surface. As an example, we take the typical irregularly-shaped nearEarth asteroid 4179 Toutatis to demonstrate the advantage of this method; as a result, we show that the efficiency can be increased by hundreds to thousands of times with our method. Our results indicate that this method can be applicable to other irregularly-shaped asteroids and can greatly improve the evaluation efficiency.
基金Supported by the National Natural Science Foundation of China (Nos. 11902293 and 12272353)。
文摘In this paper,the mechanical response of a one-dimensional(1D)hexagonal piezoelectric quasicrystal(PQC)thin film is analyzed under electric and temperature loads.Based on the Euler-Bernoulli beam theory,a theoretical model is proposed,resulting in coupled governing integral equations that account for interfacial normal and shear stresses.To numerically solve these integral equations,an expansion method using orthogonal Chebyshev polynomials is employed.The results provide insights into the interfacial stresses,axial force,as well as axial and vertical deformations of the PQC film.Additionally,fracture criteria,including stress intensity factors,mode angles,and the J-integral,are evaluated.The solution is compared with the membrane theory,neglecting the normal stress and bending deformation.Finally,the effects of stiffness and aspect ratio on the PQC film are thoroughly discussed.This study serves as a valuable guide for controlling the mechanical response and conducting safety assessments of PQC film systems.
文摘Starting from general Jacobi polynomials we derive for the Ul-traspherical polynomials as their special case a set of related polynomials which can be extended to an orthogonal set of functions with interesting properties. It leads to an alternative definition of the Ultraspherical polynomials by a fixed integral operator in application to powers of the variable u in an analogous way as it is possible for Hermite polynomials. From this follows a generating function which is apparently known only for the Legendre and Chebyshev polynomials as their special case. Furthermore, we show that the Ultraspherical polynomials form a realization of the SU(1,1) Lie algebra with lowering and raising operators which we explicitly determine. By reordering of multiplication and differentiation operators we derive new operator identities for the whole set of Jacobi polynomials which may be applied to arbitrary functions and provide then function identities. In this way we derive a new “convolution identity” for Jacobi polynomials and compare it with a known convolution identity of different structure for Gegenbauer polynomials. In short form we establish the connection of Jacobi polynomials and their related orthonormalized functions to the eigensolution of the Schrödinger equation to Pöschl-Teller potentials.
文摘In this paper, we construct Chebyshev biorthogonal multiwavelets, and use this multiwavelets to approximate signals (functions). The convergence rate for signal approximation is derived. The fast signal decomposition and reconstruction algorithms are presented. The numerical examples validate the theoretical analysis.
