Fermat’s Last Theorem is a famous theorem in number theory which is difficult to prove.However,it is known that the version of polynomials with one variable of Fermat’s Last Theorem over C can be proved very concisely...Fermat’s Last Theorem is a famous theorem in number theory which is difficult to prove.However,it is known that the version of polynomials with one variable of Fermat’s Last Theorem over C can be proved very concisely.The aim of this paper is to study the similar problems about Fermat’s Last Theorem for multivariate(skew)-polynomials with any characteristic.展开更多
Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity.This study delves into the integration of Galois Field(GF)multiplication tables,especially GF(2^(4))...Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity.This study delves into the integration of Galois Field(GF)multiplication tables,especially GF(2^(4)),and their interaction with distinct irreducible polynomials.The primary aim is to enhance watermarking techniques for achieving imperceptibility,robustness,and efficient execution time.The research employs scene selection and adaptive thresholding techniques to streamline the watermarking process.Scene selection is used strategically to embed watermarks in the most vital frames of the video,while adaptive thresholding methods ensure that the watermarking process adheres to imperceptibility criteria,maintaining the video's visual quality.Concurrently,careful consideration is given to execution time,crucial in real-world scenarios,to balance efficiency and efficacy.The Peak Signal-to-Noise Ratio(PSNR)serves as a pivotal metric to gauge the watermark's imperceptibility and video quality.The study explores various irreducible polynomials,navigating the trade-offs between computational efficiency and watermark imperceptibility.In parallel,the study pays careful attention to the execution time,a paramount consideration in real-world scenarios,to strike a balance between efficiency and efficacy.This comprehensive analysis provides valuable insights into the interplay of GF multiplication tables,diverse irreducible polynomials,scene selection,adaptive thresholding,imperceptibility,and execution time.The evaluation of the proposed algorithm's robustness was conducted using PSNR and NC metrics,and it was subjected to assessment under the impact of five distinct attack scenarios.These findings contribute to the development of watermarking strategies that balance imperceptibility,robustness,and processing efficiency,enhancing the field's practicality and effectiveness.展开更多
A certain variety of non-switched polynomials provides a uni-figure representation for a wide range of linear functional equations. This is properly adapted for the calculations. We reinterpret from this point of view...A certain variety of non-switched polynomials provides a uni-figure representation for a wide range of linear functional equations. This is properly adapted for the calculations. We reinterpret from this point of view a number of algorithms.展开更多
In this paper, we derive a simple and efficient matrix formulation using Laguerre polynomials to solve the singular integral equation with degenerate kernel. This method is based on replacement of the unknown function...In this paper, we derive a simple and efficient matrix formulation using Laguerre polynomials to solve the singular integral equation with degenerate kernel. This method is based on replacement of the unknown function by truncated series of well known Laguerre expansion of functions. This leads to a system of algebraic equations with Laguerre coefficients. Thus, by solving the matrix equation, the coefficients are obtained. Some numerical examples are included to demonstrate the validity and applicability of the proposed method.展开更多
In this article,we construct the generating functions for new families of special polynomials including two parametric kinds of Bell-based Bernoulli and Euler polynomials.Some fundamental properties of these functions...In this article,we construct the generating functions for new families of special polynomials including two parametric kinds of Bell-based Bernoulli and Euler polynomials.Some fundamental properties of these functions are given.By using these generating functions and some identities,relations among trigonometric functions and two parametric kinds of Bell-based Bernoulli and Euler polynomials,Stirling numbers are presented.Computational formulae for these polynomials are obtained.Applying a partial derivative operator to these generating functions,some derivative formulae and finite combinatorial sums involving the aforementioned polynomials and numbers are also obtained.In addition,some remarks and observations on these polynomials are given.展开更多
It is remarkable that studying degenerate versions of polynomials from algebraic point of view is not limited to only special polynomials but can also be extended to their hybrid polynomials.Indeed for the first time,...It is remarkable that studying degenerate versions of polynomials from algebraic point of view is not limited to only special polynomials but can also be extended to their hybrid polynomials.Indeed for the first time,a closed determinant expression for the degenerate Appell polynomials is derived.The determinant forms for the degenerate Bernoulli and Euler polynomials are also investigated.A new class of the degenerate Hermite-Appell polynomials is investigated and some novel identities for these polynomials are established.The degenerate Hermite-Bernoulli and degenerate Hermite-Euler polynomials are considered as special cases of the degenerate Hermite-Appell polynomials.Further,by using Mathematica,we draw graphs of degenerate Hermite-Bernoulli polynomials for different values of indices.The zeros of these polynomials are also explored and their distribution is presented.展开更多
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.展开更多
In this note, we first derive an exponential generating function of the alternating run polynomials. We then deduce an explicit formula of the alternating run polynomials in terms of the partial Bell polynomials.
Utilization of the shift operator to represent Euler polynomials as polynomials of Appell type leads directly to its algebraic properties, its relations with powers sums;may be all its relations with Bernoulli polynom...Utilization of the shift operator to represent Euler polynomials as polynomials of Appell type leads directly to its algebraic properties, its relations with powers sums;may be all its relations with Bernoulli polynomials, Bernoulli numbers;its recurrence formulae and a very simple formula for calculating simultaneously Euler numbers and Euler polynomials. The expansions of Euler polynomials into Fourier series are also obtained;the formulae for obtaining all π<sup>m</sup> as series on k<sup>-m</sup> and for expanding functions into series of Euler polynomials.展开更多
By looking at the situation when the coefficients Pj(z)(j=1,2,…,n-1)(or most of them) are exponential polynomials,we investigate the fact that all nontrivial solutions to higher order differential equations f((n))+Pn...By looking at the situation when the coefficients Pj(z)(j=1,2,…,n-1)(or most of them) are exponential polynomials,we investigate the fact that all nontrivial solutions to higher order differential equations f((n))+Pn-1(z)f((n-1))+…+P0(z)f=0 are of infinite order.An exponential polynomial coefficient plays a key role in these results.展开更多
In this manuscript,an algorithm for the computation of numerical solutions to some variable order fractional differential equations(FDEs)subject to the boundary and initial conditions is developed.We use shifted Legen...In this manuscript,an algorithm for the computation of numerical solutions to some variable order fractional differential equations(FDEs)subject to the boundary and initial conditions is developed.We use shifted Legendre polynomials for the required numerical algorithm to develop some operational matrices.Further,operational matrices are constructed using variable order differentiation and integration.We are finding the operationalmatrices of variable order differentiation and integration by omitting the discretization of data.With the help of aforesaid matrices,considered FDEs are converted to algebraic equations of Sylvester type.Finally,the algebraic equations we get are solved with the help of mathematical software like Matlab or Mathematica to compute numerical solutions.Some examples are given to check the proposed method’s accuracy and graphical representations.Exact and numerical solutions are also compared in the paper for some examples.The efficiency of the method can be enhanced further by increasing the scale level.展开更多
In this paper,suppose that a,c∈C{0},c_(j)∈C(j=1,2,···,n) are not all zeros and n≥2,and f (z) is a finite order transcendental entire function with Borel finite exceptional value or with infinitely ma...In this paper,suppose that a,c∈C{0},c_(j)∈C(j=1,2,···,n) are not all zeros and n≥2,and f (z) is a finite order transcendental entire function with Borel finite exceptional value or with infinitely many multiple zeros,the zero distribution of difference polynomials of f (z+c)-af^(n)(z) and f (z)f (z+c_1)···f (z+c_n) are investigated.A number of examples are also presented to show that our results are best possible in a certain sense.展开更多
In this article, I consider projection groups on function spaces, more specifically the space of polynomials P<sub>n</sub>[x]. I will show that a very similar construct of projection operators allows us to...In this article, I consider projection groups on function spaces, more specifically the space of polynomials P<sub>n</sub>[x]. I will show that a very similar construct of projection operators allows us to project into the subspaces of P<sub>n</sub>[x] where the function h ∈P<sub>n</sub>[x] represents the closets function to f ∈P<sub>n</sub>[x] in the least square sense. I also demonstrate that we can generalise projections by constructing operators i.e. in R<sup>n+1</sup> using the metric tensor on P<sub>n</sub>[x]. This allows one to project a polynomial function onto another by mapping it to its coefficient vector in R<sup>n+1</sup>. This can be also achieved with the Kronecker Product as detailed in this paper.展开更多
Sums of convergent series for any desired number of terms, which may be infinite, are estimated very accurately by establishing definite rational polynomials. For infinite number of terms the sum infinite is obtained ...Sums of convergent series for any desired number of terms, which may be infinite, are estimated very accurately by establishing definite rational polynomials. For infinite number of terms the sum infinite is obtained by taking the asymptotic limit of the rational polynomial. A rational function with second-degree polynomials both in the numerator and denominator is found to produce excellent results. Sums of series with different characteristics such as alternating signs are considered for testing the performance of the proposed approach.展开更多
Structural reliability is an important method to measure the safety performance of structures under the influence of uncertain factors.Traditional structural reliability analysis methods often convert the limit state ...Structural reliability is an important method to measure the safety performance of structures under the influence of uncertain factors.Traditional structural reliability analysis methods often convert the limit state function to the polynomial form to measure whether the structure is invalid.The uncertain parameters mainly exist in the form of intervals.This method requires a lot of calculation and is often difficult to achieve efficiently.In order to solve this problem,this paper proposes an interval variable multivariate polynomial algorithm based on Bernstein polynomials and evidence theory to solve the structural reliability problem with cognitive uncertainty.Based on the non-probabilistic reliability index method,the extreme value of the limit state function is obtained using the properties of Bernstein polynomials,thus avoiding the need for a lot of sampling to solve the reliability analysis problem.The method is applied to numerical examples and engineering applications such as experiments,and the results show that the method has higher computational efficiency and accuracy than the traditional linear approximation method,especially for some reliability problems with higher nonlinearity.Moreover,this method can effectively improve the reliability of results and reduce the cost of calculation in practical engineering problems.展开更多
Finite element method (FEM) is an efficient numerical tool for the solution of partial differential equations (PDEs). It is one of the most general methods when compared to other numerical techniques. PDEs posed in a ...Finite element method (FEM) is an efficient numerical tool for the solution of partial differential equations (PDEs). It is one of the most general methods when compared to other numerical techniques. PDEs posed in a variational form over a given space, say a Hilbert space, are better numerically handled with the FEM. The FEM algorithm is used in various applications which includes fluid flow, heat transfer, acoustics, structural mechanics and dynamics, electric and magnetic field, etc. Thus, in this paper, the Finite Element Orthogonal Collocation Approach (FEOCA) is established for the approximate solution of Time Fractional Telegraph Equation (TFTE) with Mamadu-Njoseh polynomials as grid points corresponding to new basis functions constructed in the finite element space. The FEOCA is an elegant mixture of the Finite Element Method (FEM) and the Orthogonal Collocation Method (OCM). Two numerical examples are experimented on to verify the accuracy and rate of convergence of the method as compared with the theoretical results, and other methods in literature.展开更多
The immense quest for proficient numerical schemes for the solution of mathematical models featuring nonlinear differential equations led to the realization of the Adomian decomposition method (ADM) in the 80<sup&g...The immense quest for proficient numerical schemes for the solution of mathematical models featuring nonlinear differential equations led to the realization of the Adomian decomposition method (ADM) in the 80<sup>th</sup>. Undoubtedly, the solution of nonlinear differential equations using ADM is presided over by the acquisition of Adomian polynomials, which are not always easy to find. Thus, the present study proposes easy-to-implement Maple programs for the computation of Adomian polynomials. In fact, the proposed algorithms performed remarkably on several test functions, consisting of one- and multi-variable nonlinearities. Moreover, the introduced programs are advantageous in terms of simplicity;coupled with the requirement of less computational time in comparison with what is known in the literature.展开更多
Modelling and simulation of projectile flight is at the core of ballistic computer software and is essential to the study of performance of rifles and projectiles in various engagement conditions.An effective and repr...Modelling and simulation of projectile flight is at the core of ballistic computer software and is essential to the study of performance of rifles and projectiles in various engagement conditions.An effective and representative numerical model of projectile flight requires a relatively good approximation of the aerodynamics.The aerodynamic coefficients of the projectile model should be described as a series of piecewise polynomial functions of the Mach number that ideally meet the following conditions:they are continuous,differentiable at least once,and have a relatively low degree.The paper provides the steps needed to generate such piecewise polynomial functions using readily available tools,and then compares Piecewise Cubic Hermite Interpolating Polynomial(PCHIP),cubic splines,and piecewise linear functions,and their variant,as potential curve fitting methods to approximate the aerodynamics of a generic small arms projectile.A key contribution of the paper is the application of PCHIP to the approximation of projectile aerodynamics,and its evaluation against a set of criteria.Finally,the paper provides a baseline assessment of the impact of the polynomial functions on flight trajectory predictions obtained with 6-degree-of-freedom simulations of a generic projectile.展开更多
This paper gives a new generalization of higher order Daehee and Bernoulli numbers and polynomials. We define the multiparameter higher order Daehee numbers and polynomials of the first and second kind. Moreover, we d...This paper gives a new generalization of higher order Daehee and Bernoulli numbers and polynomials. We define the multiparameter higher order Daehee numbers and polynomials of the first and second kind. Moreover, we derive some new results for these numbers and polynomials. The relations between these numbers and Stirling and Bernoulli numbers are obtained. Furthermore, some interesting special cases of the generalized higher order Daehee and Bernoulli numbers and polynomials are deduced.展开更多
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.展开更多
基金supported by the National Natural Science Foundation of China(12131015,12071422).
文摘Fermat’s Last Theorem is a famous theorem in number theory which is difficult to prove.However,it is known that the version of polynomials with one variable of Fermat’s Last Theorem over C can be proved very concisely.The aim of this paper is to study the similar problems about Fermat’s Last Theorem for multivariate(skew)-polynomials with any characteristic.
文摘Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity.This study delves into the integration of Galois Field(GF)multiplication tables,especially GF(2^(4)),and their interaction with distinct irreducible polynomials.The primary aim is to enhance watermarking techniques for achieving imperceptibility,robustness,and efficient execution time.The research employs scene selection and adaptive thresholding techniques to streamline the watermarking process.Scene selection is used strategically to embed watermarks in the most vital frames of the video,while adaptive thresholding methods ensure that the watermarking process adheres to imperceptibility criteria,maintaining the video's visual quality.Concurrently,careful consideration is given to execution time,crucial in real-world scenarios,to balance efficiency and efficacy.The Peak Signal-to-Noise Ratio(PSNR)serves as a pivotal metric to gauge the watermark's imperceptibility and video quality.The study explores various irreducible polynomials,navigating the trade-offs between computational efficiency and watermark imperceptibility.In parallel,the study pays careful attention to the execution time,a paramount consideration in real-world scenarios,to strike a balance between efficiency and efficacy.This comprehensive analysis provides valuable insights into the interplay of GF multiplication tables,diverse irreducible polynomials,scene selection,adaptive thresholding,imperceptibility,and execution time.The evaluation of the proposed algorithm's robustness was conducted using PSNR and NC metrics,and it was subjected to assessment under the impact of five distinct attack scenarios.These findings contribute to the development of watermarking strategies that balance imperceptibility,robustness,and processing efficiency,enhancing the field's practicality and effectiveness.
文摘A certain variety of non-switched polynomials provides a uni-figure representation for a wide range of linear functional equations. This is properly adapted for the calculations. We reinterpret from this point of view a number of algorithms.
文摘In this paper, we derive a simple and efficient matrix formulation using Laguerre polynomials to solve the singular integral equation with degenerate kernel. This method is based on replacement of the unknown function by truncated series of well known Laguerre expansion of functions. This leads to a system of algebraic equations with Laguerre coefficients. Thus, by solving the matrix equation, the coefficients are obtained. Some numerical examples are included to demonstrate the validity and applicability of the proposed method.
基金funded by Research Deanship at the University of Ha’il,Saudi Arabia,through Project No.RG-21144.
文摘In this article,we construct the generating functions for new families of special polynomials including two parametric kinds of Bell-based Bernoulli and Euler polynomials.Some fundamental properties of these functions are given.By using these generating functions and some identities,relations among trigonometric functions and two parametric kinds of Bell-based Bernoulli and Euler polynomials,Stirling numbers are presented.Computational formulae for these polynomials are obtained.Applying a partial derivative operator to these generating functions,some derivative formulae and finite combinatorial sums involving the aforementioned polynomials and numbers are also obtained.In addition,some remarks and observations on these polynomials are given.
文摘It is remarkable that studying degenerate versions of polynomials from algebraic point of view is not limited to only special polynomials but can also be extended to their hybrid polynomials.Indeed for the first time,a closed determinant expression for the degenerate Appell polynomials is derived.The determinant forms for the degenerate Bernoulli and Euler polynomials are also investigated.A new class of the degenerate Hermite-Appell polynomials is investigated and some novel identities for these polynomials are established.The degenerate Hermite-Bernoulli and degenerate Hermite-Euler polynomials are considered as special cases of the degenerate Hermite-Appell polynomials.Further,by using Mathematica,we draw graphs of degenerate Hermite-Bernoulli polynomials for different values of indices.The zeros of these polynomials are also explored and their distribution is presented.
文摘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.
文摘In this note, we first derive an exponential generating function of the alternating run polynomials. We then deduce an explicit formula of the alternating run polynomials in terms of the partial Bell polynomials.
文摘Utilization of the shift operator to represent Euler polynomials as polynomials of Appell type leads directly to its algebraic properties, its relations with powers sums;may be all its relations with Bernoulli polynomials, Bernoulli numbers;its recurrence formulae and a very simple formula for calculating simultaneously Euler numbers and Euler polynomials. The expansions of Euler polynomials into Fourier series are also obtained;the formulae for obtaining all π<sup>m</sup> as series on k<sup>-m</sup> and for expanding functions into series of Euler polynomials.
基金supported partly by the National Natural Science Foundation of China(12171050,11871260)National Science Foundation of Guangdong Province(2018A030313508)。
文摘By looking at the situation when the coefficients Pj(z)(j=1,2,…,n-1)(or most of them) are exponential polynomials,we investigate the fact that all nontrivial solutions to higher order differential equations f((n))+Pn-1(z)f((n-1))+…+P0(z)f=0 are of infinite order.An exponential polynomial coefficient plays a key role in these results.
基金Supporting Project No.(PNURSP2022R 14),Princess Nourah bint A bdurahman University,Riyadh,Saudi Arabia.
文摘In this manuscript,an algorithm for the computation of numerical solutions to some variable order fractional differential equations(FDEs)subject to the boundary and initial conditions is developed.We use shifted Legendre polynomials for the required numerical algorithm to develop some operational matrices.Further,operational matrices are constructed using variable order differentiation and integration.We are finding the operationalmatrices of variable order differentiation and integration by omitting the discretization of data.With the help of aforesaid matrices,considered FDEs are converted to algebraic equations of Sylvester type.Finally,the algebraic equations we get are solved with the help of mathematical software like Matlab or Mathematica to compute numerical solutions.Some examples are given to check the proposed method’s accuracy and graphical representations.Exact and numerical solutions are also compared in the paper for some examples.The efficiency of the method can be enhanced further by increasing the scale level.
基金Supported by the National Natural Science Foundation of China (11926201)Natural Science Foundation of Guangdong Province (2018A030313508)。
文摘In this paper,suppose that a,c∈C{0},c_(j)∈C(j=1,2,···,n) are not all zeros and n≥2,and f (z) is a finite order transcendental entire function with Borel finite exceptional value or with infinitely many multiple zeros,the zero distribution of difference polynomials of f (z+c)-af^(n)(z) and f (z)f (z+c_1)···f (z+c_n) are investigated.A number of examples are also presented to show that our results are best possible in a certain sense.
文摘In this article, I consider projection groups on function spaces, more specifically the space of polynomials P<sub>n</sub>[x]. I will show that a very similar construct of projection operators allows us to project into the subspaces of P<sub>n</sub>[x] where the function h ∈P<sub>n</sub>[x] represents the closets function to f ∈P<sub>n</sub>[x] in the least square sense. I also demonstrate that we can generalise projections by constructing operators i.e. in R<sup>n+1</sup> using the metric tensor on P<sub>n</sub>[x]. This allows one to project a polynomial function onto another by mapping it to its coefficient vector in R<sup>n+1</sup>. This can be also achieved with the Kronecker Product as detailed in this paper.
文摘Sums of convergent series for any desired number of terms, which may be infinite, are estimated very accurately by establishing definite rational polynomials. For infinite number of terms the sum infinite is obtained by taking the asymptotic limit of the rational polynomial. A rational function with second-degree polynomials both in the numerator and denominator is found to produce excellent results. Sums of series with different characteristics such as alternating signs are considered for testing the performance of the proposed approach.
文摘Structural reliability is an important method to measure the safety performance of structures under the influence of uncertain factors.Traditional structural reliability analysis methods often convert the limit state function to the polynomial form to measure whether the structure is invalid.The uncertain parameters mainly exist in the form of intervals.This method requires a lot of calculation and is often difficult to achieve efficiently.In order to solve this problem,this paper proposes an interval variable multivariate polynomial algorithm based on Bernstein polynomials and evidence theory to solve the structural reliability problem with cognitive uncertainty.Based on the non-probabilistic reliability index method,the extreme value of the limit state function is obtained using the properties of Bernstein polynomials,thus avoiding the need for a lot of sampling to solve the reliability analysis problem.The method is applied to numerical examples and engineering applications such as experiments,and the results show that the method has higher computational efficiency and accuracy than the traditional linear approximation method,especially for some reliability problems with higher nonlinearity.Moreover,this method can effectively improve the reliability of results and reduce the cost of calculation in practical engineering problems.
文摘Finite element method (FEM) is an efficient numerical tool for the solution of partial differential equations (PDEs). It is one of the most general methods when compared to other numerical techniques. PDEs posed in a variational form over a given space, say a Hilbert space, are better numerically handled with the FEM. The FEM algorithm is used in various applications which includes fluid flow, heat transfer, acoustics, structural mechanics and dynamics, electric and magnetic field, etc. Thus, in this paper, the Finite Element Orthogonal Collocation Approach (FEOCA) is established for the approximate solution of Time Fractional Telegraph Equation (TFTE) with Mamadu-Njoseh polynomials as grid points corresponding to new basis functions constructed in the finite element space. The FEOCA is an elegant mixture of the Finite Element Method (FEM) and the Orthogonal Collocation Method (OCM). Two numerical examples are experimented on to verify the accuracy and rate of convergence of the method as compared with the theoretical results, and other methods in literature.
文摘The immense quest for proficient numerical schemes for the solution of mathematical models featuring nonlinear differential equations led to the realization of the Adomian decomposition method (ADM) in the 80<sup>th</sup>. Undoubtedly, the solution of nonlinear differential equations using ADM is presided over by the acquisition of Adomian polynomials, which are not always easy to find. Thus, the present study proposes easy-to-implement Maple programs for the computation of Adomian polynomials. In fact, the proposed algorithms performed remarkably on several test functions, consisting of one- and multi-variable nonlinearities. Moreover, the introduced programs are advantageous in terms of simplicity;coupled with the requirement of less computational time in comparison with what is known in the literature.
文摘Modelling and simulation of projectile flight is at the core of ballistic computer software and is essential to the study of performance of rifles and projectiles in various engagement conditions.An effective and representative numerical model of projectile flight requires a relatively good approximation of the aerodynamics.The aerodynamic coefficients of the projectile model should be described as a series of piecewise polynomial functions of the Mach number that ideally meet the following conditions:they are continuous,differentiable at least once,and have a relatively low degree.The paper provides the steps needed to generate such piecewise polynomial functions using readily available tools,and then compares Piecewise Cubic Hermite Interpolating Polynomial(PCHIP),cubic splines,and piecewise linear functions,and their variant,as potential curve fitting methods to approximate the aerodynamics of a generic small arms projectile.A key contribution of the paper is the application of PCHIP to the approximation of projectile aerodynamics,and its evaluation against a set of criteria.Finally,the paper provides a baseline assessment of the impact of the polynomial functions on flight trajectory predictions obtained with 6-degree-of-freedom simulations of a generic projectile.
文摘This paper gives a new generalization of higher order Daehee and Bernoulli numbers and polynomials. We define the multiparameter higher order Daehee numbers and polynomials of the first and second kind. Moreover, we derive some new results for these numbers and polynomials. The relations between these numbers and Stirling and Bernoulli numbers are obtained. Furthermore, some interesting special cases of the generalized higher order Daehee and Bernoulli numbers and polynomials are deduced.
文摘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.