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.展开更多
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.展开更多
We raise and partly answer the question: whether there exists a Markov system with respectto which the zeros of the Chebyshev polynomials are dense, but the maximum length of a zerofree interval of the nth Chebyshev p...We raise and partly answer the question: whether there exists a Markov system with respectto which the zeros of the Chebyshev polynomials are dense, but the maximum length of a zerofree 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.展开更多
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.展开更多
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.展开更多
This paper presents a low sampling rate digital pre-distortion technique based on an improved Chebyshev polynomial for the non-linear distortion problem of amplifiers in 5G broadband communication systems.An improved ...This paper presents a low sampling rate digital pre-distortion technique based on an improved Chebyshev polynomial for the non-linear distortion problem of amplifiers in 5G broadband communication systems.An improved Chebyshev polynomial is used to construct the behavioural model of the broadband amplifier,and an undersampling technique is used to sample the output signal of the amplifier,reduce the sampling rate,and extract the pre-distortion parameters from the sampled signal through an indirect learning structure to finally correct the non-linearity of the amplifier system.This technique is able to improve the linearity and efficiency of the power amplifier and provides better flexibility.Experimental results show that by constructing the behavioural model of the amplifier using memory polynomials(MP),generalised polynomials(GMP)and modified Chebyshev polynomials respectively,the adjacent channel power ratio of the obtained system can be improved by more than 13.87d B,17.6dB and 19.98dB respectively compared to the output signal of the amplifier without digital pre-distortion.The Chebyshev polynomial improves the neighbourhood channel power ratio by 6.11dB and 2.38dB compared to the memory polynomial and generalised polynomial respectively,while the normalised mean square error is effectively improved and enhanced.This shows that the improved Chebyshev pre-distortion can guarantee the performance of the system and improve the non-linearity better.展开更多
A numerical method is proposed to calculate the eigenvalues of the Zakharov–Shabat system based on Chebyshev polynomials. A mapping in the form of tanh(ax) is constructed according to the asymptotic of the potential ...A numerical method is proposed to calculate the eigenvalues of the Zakharov–Shabat system based on Chebyshev polynomials. A mapping in the form of tanh(ax) is constructed according to the asymptotic of the potential function for the Zakharov–Shabat eigenvalue problem. The mapping can distribute Chebyshev nodes very well considering the gradient for the potential function. Using Chebyshev polynomials, tanh(ax) mapping, and Chebyshev nodes, the Zakharov–Shabat eigenvalue problem is transformed into a matrix eigenvalue problem. This method has good convergence for the Satsuma–Yajima potential and the convergence rate is faster than the Fourier collocation method. This method is not only suitable for simple potential functions but also converges quickly for a complex Y-shape potential. It can also be further extended to other linear eigenvalue problems.展开更多
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.展开更多
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 o...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.展开更多
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.展开更多
The Chebyshev polynomials are harnessed as functions of the one parameter of the nondimensionalized differential equation for trinomial homogeneous linear differential equations of arbitrary order n that have constant...The Chebyshev polynomials are harnessed as functions of the one parameter of the nondimensionalized differential equation for trinomial homogeneous linear differential equations of arbitrary order n that have constant coefficients and exhibit vibration. The use of the Chebyshev polynomials allows calculation of the analytic solutions for arbitrary n in terms of the orthogonal Chebyshev polynomials to provide a more stable solution form and natural sensitivity analysis in terms of one parameter and the initial conditions in 6n + 7 arithmetic operations and one square root.展开更多
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 Chebyshev finite spectral method on non-uniform meshes is proposed.An equidistribution scheme for two types of extended moving grids is used to generate grids. One type is designed to provide better resolution for t...A Chebyshev finite spectral method on non-uniform meshes is proposed.An equidistribution scheme for two types of extended moving grids is used to generate grids. One type is designed to provide better resolution for the wave surface, and the other type is for highly variable gradients. The method has high-order accuracy because of the use of the Chebyshev polynomial as the basis function. The polynomial is used to interpolate the values between the two non-uniform meshes from a previous time step to the current time step. To attain high accuracy in the time discretization, the fourth-order Adams-Bashforth-M oulton predictor and corrector scheme is used. To avoid numerical oscillations caused by the dispersion term in the Korteweg-de Vries (KdV) equation,a numerical technique on non-uniform meshes is introduced. The proposed numerical scheme is validated by the applications to the Burgers equation (nonlinear convection-diffusion problems) and the KdV equation (single solitary and 2-solitary wave problems),where analytical solutions are available for comparisons. Numerical results agree very well with the corresponding analytical solutions in all cases.展开更多
The new rationalα-polynomials are used to solve the Falkner-Skan equation.These polynomials are equipped with an auxiliary parameter.The approximated solution to the Falkner-Skan equation is obtained by the new ratio...The new rationalα-polynomials are used to solve the Falkner-Skan equation.These polynomials are equipped with an auxiliary parameter.The approximated solution to the Falkner-Skan equation is obtained by the new rational a-polynomials with unknown coefficients.To find the unknown coefficients and the auxiliary parameter contained in the polynomials,the collocation method with Chebyshev-Gauss points is used.The numerical examples show the efficiency of this method.展开更多
The magnetohydrodynamics (MHD) Falkner-Skan flow of the Maxwell fluid is studied. Suitable transform reduces the partial differential equation into a nonlinear three order boundary value problem over a semi-infinite i...The magnetohydrodynamics (MHD) Falkner-Skan flow of the Maxwell fluid is studied. Suitable transform reduces the partial differential equation into a nonlinear three order boundary value problem over a semi-infinite interval. An efficient approach based on the rational Chebyshev collocation method is performed to find the solution to the proposed boundary value problem. The rational Chebyshev collocation method is equipped with the orthogonal rational Chebyshev function which solves the problem on the semi-infinite domain without truncating it to a finite domain. The obtained results are presented through the illustrative graphs and tables which demonstrate the affectivity, stability, and convergence of the rational Chebyshev collocation method. To check the accuracy of the obtained results, a numerical method is applied for solving the problem. The variations of various embedded parameters into the problem are examined.展开更多
The lungs CT scan is used to visualize the spread of the disease across the lungs to obtain better knowledge of the state of the COVID-19 infection.Accurately diagnosing of COVID-19 disease is a complex challenge that...The lungs CT scan is used to visualize the spread of the disease across the lungs to obtain better knowledge of the state of the COVID-19 infection.Accurately diagnosing of COVID-19 disease is a complex challenge that medical system face during the pandemic time.To address this problem,this paper proposes a COVID-19 image enhancement based on Mittag-Leffler-Chebyshev polynomial as pre-processing step for COVID-19 detection and segmentation.The proposed approach comprises the MittagLeffler sum convoluted with Chebyshev polynomial.The idea for using the proposed image enhancement model is that it improves images with low graylevel changes by estimating the probability of each pixel.The proposed image enhancement technique is tested on a variety of lungs computed tomography(CT)scan dataset of varying quality to demonstrate that it is robust and can resist significant quality fluctuations.The blind/referenceless image spatial quality evaluator(BRISQUE),and the natural image quality evaluator(NIQE)measures for CT scans were 38.78,and 7.43 respectively.According to the findings,the proposed image enhancement model produces the best image quality ratings.Overall,this model considerably enhances the details of the given datasets,and it may be able to assist medical professionals in the diagnosing process.展开更多
In this paper,we investigate the interfacial behavior of a thin one-dimensional(1D)hexagonal quasicrystal(QC)film bonded on an elastic substrate subjected to a mismatch strain due to thermal variation.The contact inte...In this paper,we investigate the interfacial behavior of a thin one-dimensional(1D)hexagonal quasicrystal(QC)film bonded on an elastic substrate subjected to a mismatch strain due to thermal variation.The contact interface is assumed to be nonslipping,with both perfectly bonded and debonded boundary conditions.The Fourier transform technique is adopted to establish the integral equations in terms of interfacial shear stress,which are solved as a linear algebraic system by approximating the unknown phonon interfacial shear stress via the series expansion of the Chebyshev polynomials.The expressions are explicitly obtained for the phonon interfacial shear stress,internal normal stress,and stress intensity factors(SIFs).Finally,based on numerical calculations,we briefly discuss the effects of the material mismatch,the geometry of the QC film,and the debonded length and location on stresses and SIFs.展开更多
文摘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.
文摘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.
文摘We raise and partly answer the question: whether there exists a Markov system with respectto which the zeros of the Chebyshev polynomials are dense, but the maximum length of a zerofree 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.
文摘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.
文摘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.
文摘This paper presents a low sampling rate digital pre-distortion technique based on an improved Chebyshev polynomial for the non-linear distortion problem of amplifiers in 5G broadband communication systems.An improved Chebyshev polynomial is used to construct the behavioural model of the broadband amplifier,and an undersampling technique is used to sample the output signal of the amplifier,reduce the sampling rate,and extract the pre-distortion parameters from the sampled signal through an indirect learning structure to finally correct the non-linearity of the amplifier system.This technique is able to improve the linearity and efficiency of the power amplifier and provides better flexibility.Experimental results show that by constructing the behavioural model of the amplifier using memory polynomials(MP),generalised polynomials(GMP)and modified Chebyshev polynomials respectively,the adjacent channel power ratio of the obtained system can be improved by more than 13.87d B,17.6dB and 19.98dB respectively compared to the output signal of the amplifier without digital pre-distortion.The Chebyshev polynomial improves the neighbourhood channel power ratio by 6.11dB and 2.38dB compared to the memory polynomial and generalised polynomial respectively,while the normalised mean square error is effectively improved and enhanced.This shows that the improved Chebyshev pre-distortion can guarantee the performance of the system and improve the non-linearity better.
基金Project supported by the National Natural Science Foundation of China (Grant Nos.52171251,U2106225,and 52231011)Dalian Science and Technology Innovation Fund (Grant No.2022JJ12GX036)。
文摘A numerical method is proposed to calculate the eigenvalues of the Zakharov–Shabat system based on Chebyshev polynomials. A mapping in the form of tanh(ax) is constructed according to the asymptotic of the potential function for the Zakharov–Shabat eigenvalue problem. The mapping can distribute Chebyshev nodes very well considering the gradient for the potential function. Using Chebyshev polynomials, tanh(ax) mapping, and Chebyshev nodes, the Zakharov–Shabat eigenvalue problem is transformed into a matrix eigenvalue problem. This method has good convergence for the Satsuma–Yajima potential and the convergence rate is faster than the Fourier collocation method. This method is not only suitable for simple potential functions but also converges quickly for a complex Y-shape potential. It can also be further extended to other linear eigenvalue problems.
文摘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.
基金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.
文摘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.
文摘The Chebyshev polynomials are harnessed as functions of the one parameter of the nondimensionalized differential equation for trinomial homogeneous linear differential equations of arbitrary order n that have constant coefficients and exhibit vibration. The use of the Chebyshev polynomials allows calculation of the analytic solutions for arbitrary n in terms of the orthogonal Chebyshev polynomials to provide a more stable solution form and natural sensitivity analysis in terms of one parameter and the initial conditions in 6n + 7 arithmetic operations and one square root.
文摘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.
基金supported by the Research Grants Council of Hong Kong (No. 522007)the National Marine Public Welfare Research Projects of China (No. 201005002)
文摘A Chebyshev finite spectral method on non-uniform meshes is proposed.An equidistribution scheme for two types of extended moving grids is used to generate grids. One type is designed to provide better resolution for the wave surface, and the other type is for highly variable gradients. The method has high-order accuracy because of the use of the Chebyshev polynomial as the basis function. The polynomial is used to interpolate the values between the two non-uniform meshes from a previous time step to the current time step. To attain high accuracy in the time discretization, the fourth-order Adams-Bashforth-M oulton predictor and corrector scheme is used. To avoid numerical oscillations caused by the dispersion term in the Korteweg-de Vries (KdV) equation,a numerical technique on non-uniform meshes is introduced. The proposed numerical scheme is validated by the applications to the Burgers equation (nonlinear convection-diffusion problems) and the KdV equation (single solitary and 2-solitary wave problems),where analytical solutions are available for comparisons. Numerical results agree very well with the corresponding analytical solutions in all cases.
文摘The new rationalα-polynomials are used to solve the Falkner-Skan equation.These polynomials are equipped with an auxiliary parameter.The approximated solution to the Falkner-Skan equation is obtained by the new rational a-polynomials with unknown coefficients.To find the unknown coefficients and the auxiliary parameter contained in the polynomials,the collocation method with Chebyshev-Gauss points is used.The numerical examples show the efficiency of this method.
基金supported by the Imam Khomeini International University of Iran(No.751166-1392)the Deanship of Scientific Research(DSR)in King Abdulaziz University of Saudi Arabia
文摘The magnetohydrodynamics (MHD) Falkner-Skan flow of the Maxwell fluid is studied. Suitable transform reduces the partial differential equation into a nonlinear three order boundary value problem over a semi-infinite interval. An efficient approach based on the rational Chebyshev collocation method is performed to find the solution to the proposed boundary value problem. The rational Chebyshev collocation method is equipped with the orthogonal rational Chebyshev function which solves the problem on the semi-infinite domain without truncating it to a finite domain. The obtained results are presented through the illustrative graphs and tables which demonstrate the affectivity, stability, and convergence of the rational Chebyshev collocation method. To check the accuracy of the obtained results, a numerical method is applied for solving the problem. The variations of various embedded parameters into the problem are examined.
基金This research was supported by the Deanship of Scientific Research,Imam Mohammad Ibn Saud Islamic University(IMSIU),Saudi Arabia,Grant No.(21-13-18-056).
文摘The lungs CT scan is used to visualize the spread of the disease across the lungs to obtain better knowledge of the state of the COVID-19 infection.Accurately diagnosing of COVID-19 disease is a complex challenge that medical system face during the pandemic time.To address this problem,this paper proposes a COVID-19 image enhancement based on Mittag-Leffler-Chebyshev polynomial as pre-processing step for COVID-19 detection and segmentation.The proposed approach comprises the MittagLeffler sum convoluted with Chebyshev polynomial.The idea for using the proposed image enhancement model is that it improves images with low graylevel changes by estimating the probability of each pixel.The proposed image enhancement technique is tested on a variety of lungs computed tomography(CT)scan dataset of varying quality to demonstrate that it is robust and can resist significant quality fluctuations.The blind/referenceless image spatial quality evaluator(BRISQUE),and the natural image quality evaluator(NIQE)measures for CT scans were 38.78,and 7.43 respectively.According to the findings,the proposed image enhancement model produces the best image quality ratings.Overall,this model considerably enhances the details of the given datasets,and it may be able to assist medical professionals in the diagnosing process.
基金Project supported by the National Natural Science Foundation of China(Nos.11572289,1171407,11702252,and 11902293)the China Postdoctoral Science Foundation(No.2019M652563)。
文摘In this paper,we investigate the interfacial behavior of a thin one-dimensional(1D)hexagonal quasicrystal(QC)film bonded on an elastic substrate subjected to a mismatch strain due to thermal variation.The contact interface is assumed to be nonslipping,with both perfectly bonded and debonded boundary conditions.The Fourier transform technique is adopted to establish the integral equations in terms of interfacial shear stress,which are solved as a linear algebraic system by approximating the unknown phonon interfacial shear stress via the series expansion of the Chebyshev polynomials.The expressions are explicitly obtained for the phonon interfacial shear stress,internal normal stress,and stress intensity factors(SIFs).Finally,based on numerical calculations,we briefly discuss the effects of the material mismatch,the geometry of the QC film,and the debonded length and location on stresses and SIFs.
