Search results for: shifted Chebyshev polynomials

Authors: Vandana N. Purav

Abstract:

Fibonacci and Lucas polynomials are special cases of Chebyshev polynomial. There are two types of Chebyshev polynomials, a Chebyshev polynomial of first kind and a Chebyshev polynomial of second kind. Chebyshev polynomial of second kind can be derived from the Chebyshev polynomial of first kind. Chebyshev polynomial is a polynomial of degree n and satisfies a second order homogenous differential equation. We consider the difference equations which are related with Chebyshev, Fibonacci and Lucas polynomias. Thus Chebyshev polynomial of second kind play an important role in finding the recurrence relations with Fibonacci and Lucas polynomials.

Keywords:

Procedia PDF Downloads 339

Authors: Bharti Gupta, V. K. Kukreja

Abstract:

A comprehensive numerical study is presented for the solution of time-dependent advection diffusion problems by using cubic B-spline collocation method. The linear combination of cubic B-spline basis, taken as approximating function, is evaluated using the zeros of shifted Chebyshev polynomials as collocation points in each element to obtain the best approximation. A comparison, on the basis of efficiency and accuracy, with the previous techniques is made which confirms the superiority of the proposed method. An asymptotic convergence analysis of technique is also discussed, and the method is found to be of order two. The theoretical analysis is supported with suitable examples to show second order convergence of technique. Different numerical examples are simulated using MATLAB in which the 3-D graphical presentation has taken at different time steps as well as different domain of interest.

Keywords: cubic B-spline basis, spectral norms, shifted Chebyshev polynomials, collocation points, error estimates

Procedia PDF Downloads 191

Authors: Koushlendra Kumar Singh, Manish Kumar Bajpai, Rajesh Kumar Pandey

Abstract:

A discrete time fractional orderdifferentiator has been modeled for estimating the fractional order derivatives of contaminated signal. The proposed approach is based on Chebyshev’s polynomials. We use the Riemann-Liouville fractional order derivative definition for designing the fractional order SG differentiator. In first step we calculate the window weight corresponding to the required fractional order. Then signal is convoluted with this calculated window’s weight for finding the fractional order derivatives of signals. Several signals are considered for evaluating the accuracy of the proposed method.

Keywords: fractional order derivative, chebyshev polynomials, signals, S-G differentiator

Procedia PDF Downloads 616

Authors: Shubham Jaiswal

Abstract:

In the present article, a drive is taken to compute the solution of spatial fractional order advection-dispersion equation having source/sink term with given initial and boundary conditions. The equation is converted to a system of ordinary differential equations using second-kind shifted Chebyshev polynomials, which have finally been solved using finite difference method. The striking feature of the article is the fast transportation of solute concentration as and when the system approaches fractional order from standard order for specified values of the parameters of the system.

Keywords: spatial fractional order advection-dispersion equation, second-kind shifted Chebyshev polynomial, collocation method, conservative system, non-conservative system

Procedia PDF Downloads 228

Authors: Rajeev, N. K. Raigar

Abstract:

In this study, one dimensional phase change problem (a Stefan problem) is considered and a numerical solution of this problem is discussed. First, we use similarity transformation to convert the governing equations into ordinary differential equations with its boundary conditions. The solutions of ordinary differential equation with the associated boundary conditions and interface condition (Stefan condition) are obtained by using a numerical approach based on operational matrix of differentiation of shifted second kind Chebyshev wavelets. The obtained results are compared with existing exact solution which is sufficiently accurate.

Keywords: operational matrix of differentiation, similarity transformation, shifted second kind chebyshev wavelets, stefan problem

Procedia PDF Downloads 379

Authors: Emanuel Guariglia

Abstract:

In this paper we deal with Chebyshev wavelets. We analyze their properties computing their Fourier transform. Moreover, we discuss the differential properties of Chebyshev wavelets due the connection coefficients. The differential properties of Chebyshev wavelets, expressed by the connection coefficients (also called refinable integrals), are given by finite series in terms of the Kronecker delta. Moreover, we treat the p-order derivative of Chebyshev wavelets and compute its Fourier transform. Finally, we expand the mother wavelet in Taylor series with an application both in fractional calculus and fractal geometry.

Keywords: Chebyshev wavelets, Fourier transform, connection coefficients, Taylor series, local fractional derivative, Cantor set

Procedia PDF Downloads 85

Authors: M. Tiachachat, M. Mihoubi

Abstract:

The Bell polynomials are special polynomials in combinatorial analysis that have a wide range of applications in mathematics. They have interested many authors. The exponential partial Bell polynomials have been well reduced to some special combinatorial sequences. Numerous researchers had already been interested in the above polynomials, as evidenced by many articles in the literature. Inspired by this work, in this work, we propose a family of special polynomials named after the 2-successive partial Bell polynomials. Using the combinatorial approach, we prove the properties of these numbers, derive several identities, and discuss some special cases. This family includes well-known numbers and polynomials such as Stirling numbers, Bell numbers and polynomials, and so on. We investigate their properties by employing generating functions

Keywords: 2-associated r-Stirling numbers, the exponential partial Bell polynomials, generating function, combinatorial interpretation

Procedia PDF Downloads 69

Authors: Laskri Yamina, Rehouma Abdel Hamid

Abstract:

In this paper we present a new class named polar of monic orthogonal polynomials with respect to the area measure supported on G, where G is a bounded simply-connected domain in the complex planeℂ. We analyze some open questions and discuss some ideas properties related to solving asymptotic behavior of polar Bergman polynomials over domains with corners and asymptotic behavior of modified Bergman polynomials by affine transforms in variable and polar modified Bergman polynomials by affine transforms in variable. We show that uniform asymptotic of Bergman polynomials over domains with corners and by Pritsker's theorem imply uniform asymptotic for all their derivatives.

Keywords: Bergman orthogonal polynomials, polar rthogonal polynomials, asymptotic behavior, Faber polynomials

Procedia PDF Downloads 406

Authors: Youngji Lee, Yonghyeon Jeon, Sunyoung Bu, Philsu Kim

Abstract:

The aim of this paper is to construct an algorithm of time step control for the error correction method most recently developed by one of the authors for solving stiff initial value problems. It is achieved with the generalized Chebyshev polynomial and the corresponding error correction method. The main idea of the proposed scheme is in the usage of the duplicated node points in the generalized Chebyshev polynomials of two different degrees by adding necessary sample points instead of re-sampling all points. At each integration step, the proposed method is comprised of two equations for the solution and the error, respectively. The constructed algorithm controls both the error and the time step size simultaneously and possesses a good performance in the computational cost compared to the original method. Two stiff problems are numerically solved to assess the effectiveness of the proposed scheme.

Keywords: stiff initial value problem, error correction method, generalized Chebyshev polynomial, node points

Procedia PDF Downloads 532

Authors: Ikram Slamani, Hicheme Ferdjani

Abstract:

This study focuses on analyzing a Griffith crack situated at the center of an infinite strip. The problem is reformulated as a hyper-singular integral equation and solved numerically using second-order Chebyshev polynomials. The primary objective is to calculate the stress intensity factor in mode 1, denoted as K1. The obtained results reveal the influence of the strip width and crack length on the stress intensity factor, assuming stress-free edges. Additionally, a comparison is made with relevant literature to validate the findings.

Keywords: center crack, Chebyshev polynomial, hyper singular integral equation, Griffith, infinite strip, stress intensity factor

Procedia PDF Downloads 101

Authors: Shubham Jaiswal

Abstract:

During modelling of many physical problems and engineering processes, fractional calculus plays an important role. Those are greatly described by fractional differential equations (FDEs). So a reliable and efficient technique to solve such types of FDEs is needed. In this article, a numerical solution of a class of fractional differential equations namely space fractional order reaction-advection dispersion equations subject to initial and boundary conditions is derived. In the proposed approach shifted Jacobi polynomials are used to approximate the solutions together with shifted Jacobi operational matrix of fractional order and spectral collocation method. The main advantage of this approach is that it converts such problems in the systems of algebraic equations which are easier to be solved. The proposed approach is effective to solve the linear as well as non-linear FDEs. To show the reliability, validity and high accuracy of proposed approach, the numerical results of some illustrative examples are reported, which are compared with the existing analytical results already reported in the literature. The error analysis for each case exhibited through graphs and tables confirms the exponential convergence rate of the proposed method.

Keywords: space fractional order linear/nonlinear reaction-advection diffusion equation, shifted Jacobi polynomials, operational matrix, collocation method, Caputo derivative

Procedia PDF Downloads 412

Authors: Shubham Jaiswal

Abstract:

In this study, the numerical solution of two-dimensional solute transport system in a homogeneous porous medium of finite-length is obtained. The considered transport system have the terms accounting for advection, dispersion and first-order decay with first-type boundary conditions. Initially, the aquifer is considered solute free and a constant input-concentration is considered at inlet boundary. The solution is describing the solute concentration in rectangular inflow-region of the homogeneous porous media. The numerical solution is derived using a powerful method viz., spectral collocation method. The numerical computation and graphical presentations exhibit that the method is effective and reliable during solution of the physical model with complicated boundary conditions even in the presence of reaction term.

Keywords: two-dimensional solute transport system, spectral collocation method, Chebyshev polynomials, Chebyshev differentiation matrix

Procedia PDF Downloads 201

Authors: Navdeep Goel, Salvador Gabarda

Abstract:

Digital images are widely used in computer applications. To store or transmit the uncompressed images requires considerable storage capacity and transmission bandwidth. Image compression is a means to perform transmission or storage of visual data in the most economical way. This paper explains about how images can be encoded to be transmitted in a multiplexing time-frequency domain channel. Multiplexing involves packing signals together whose representations are compact in the working domain. In order to optimize transmission resources each 4x4 pixel block of the image is transformed by a suitable polynomial approximation, into a minimal number of coefficients. Less than 4*4 coefficients in one block spares a significant amount of transmitted information, but some information is lost. Different approximations for image transformation have been evaluated as polynomial representation (Vandermonde matrix), least squares + gradient descent, 1-D Chebyshev polynomials, 2-D Chebyshev polynomials or singular value decomposition (SVD). Results have been compared in terms of nominal compression rate (NCR), compression ratio (CR) and peak signal-to-noise ratio (PSNR) in order to minimize the error function defined as the difference between the original pixel gray levels and the approximated polynomial output. Polynomial coefficients have been later encoded and handled for generating chirps in a target rate of about two chirps per 4*4 pixel block and then submitted to a transmission multiplexing operation in the time-frequency domain.

Keywords: chirp signals, image multiplexing, image transformation, linear canonical transform, polynomial approximation

Procedia PDF Downloads 389

Authors: Harendra Singh, Rajesh Pandey

Abstract:

The paper presents a numerical method based on operational matrix of integration and Ryleigh method for the solution of a class of non-linear fractional variational problems (NLFVPs). Chebyshev first kind polynomials are used for the construction of operational matrix. Using operational matrix and Ryleigh method the NLFVP is converted into a system of non-linear algebraic equations, and solving these equations we obtained approximate solution for NLFVPs. Convergence analysis of the proposed method is provided. Numerical experiment is done to show the applicability of the proposed numerical method. The obtained numerical results are compared with exact solution and solution obtained from Chebyshev third kind. Further the results are shown graphically for different fractional order involved in the problems.

Keywords: non-linear fractional variational problems, Rayleigh-Ritz method, convergence analysis, error analysis

Procedia PDF Downloads 267

Authors: K. Godazandeh, K. Sadeghy

Abstract:

In the present study, the effect of magnetic field on the hydrodynamic instability of Taylor-Couette flow between two concentric rotating cylinders has been numerically investigated. At the beginning the basic flow has been solved using continuity, Cauchy equations (with regards to Lorentz force) and the constitutive equations of a viscoelastic model called "Giesekus" model. Small perturbations, considered to be normal mode, have been superimposed to the basic flow and the unsteady perturbation equations have been derived consequently. Neglecting non-linear terms, the general eigenvalue problem obtained has been solved using pseudo spectral method (combination of Chebyshev polynomials). The objective of the calculations is to study the effect of magnetic fields on the onset of first mode of instability (axisymmetric mode) for different dimensionless parameters of the flow. The results show that the stability picture is highly influenced by the magnetic field. When magnetic field increases, it first has a destabilization effect which changes to stabilization effect due to more increase of magnetic fields. Therefor there is a critical magnetic number (Hartmann number) for instability of Taylor-Couette flow. Also, the effect of magnetic field is more dominant in large gaps. Also based on the results obtained, magnetic field shows a more considerable effect on the stability at higher Weissenberg numbers (at higher elasticity), while the "mobility factor" changes show no dominant role on the intense of suction and injection effect on the flow's instability.

Keywords: magnetic field, Taylor-Couette flow, Giesekus model, pseudo spectral method, Chebyshev polynomials, Hartmann number, Weissenberg number, mobility factor

Procedia PDF Downloads 360

Authors: Sanju Vaidya, Aihua Li

Abstract:

Vulnerability measures and topological indices are crucial in solving various problems such as the stability of the communication networks and development of mathematical models for chemical compounds. In 1947, Harry Wiener introduced a topological index related to molecular branching. Now there are more than 100 topological indices for graphs. For example, Hosoya polynomials (also called Wiener polynomials) were introduced to derive formulas for certain vulnerability measures and topological indices for various graphs. In this paper, we will find a relation between the Hosoya polynomials of any graph and its Mycielskian graph. Additionally, using this we will compute vulnerability measures, closeness and betweenness centrality, and extended Wiener indices. It is fascinating to see how Hosoya polynomials are useful in the two diverse fields, cybersecurity and chemistry.

Keywords: hosoya polynomial, mycielskian graph, graph vulnerability measure, topological index

Procedia PDF Downloads 35

Authors: Alexander Blokhin, Ekaterina Kruglova, Boris Semisalov

Abstract:

Mathematical model based on the mesoscopic theory of polymer dynamics is developed for numerical simulation of the flows of polymeric liquid between two coaxial cylinders. This model is a system of nonlinear partial differential equations written in the cylindrical coordinate system and coupled with the heat conduction equation including a specific dissipation term. The stationary flows similar to classical Poiseuille ones are considered, and the resolving equations for the velocity of flow and for the temperature are obtained. For solving them, a fast pseudospectral method is designed based on Chebyshev approximations, that enables one to simulate the flows through the channels with extremely small relative values of the radius of inner cylinder. The numerical analysis of the dependance of flow on this radius and on the values of dissipation constant is done.

Keywords: dynamics of polymeric liquid, heat dissipation, singularly perturbed problem, pseudospectral method, Chebyshev polynomials, stabilization technique

Procedia PDF Downloads 262

Authors: Yilmaz Simsek

Abstract:

In this paper, we study the Bernstein-type basis functions with their generating functions. We give various properties of these polynomials with the aid of their generating functions. These polynomials and generating functions have many valuable applications in mathematics, in probability, in statistics and also in mathematical physics. By using the Bernstein-Galerkin and the Bernstein-Petrov-Galerkin methods, we give some applications of the Bernstein-type polynomials for solving high even-order differential equations with their numerical computations. We also give Bezier-type curves related to the Bernstein-type basis functions. We investigate fundamental properties of these curves. These curves have many applications in mathematics, in computer geometric design and other related areas. Moreover, we simulate these polynomials with their plots for some selected numerical values.

Keywords: generating functions, Bernstein basis functions, Bernstein polynomials, Bezier curves, differential equations

Procedia PDF Downloads 236

Authors: Mohammad Moradi ‎

Abstract:

In this article, propagation of a laser beam through turbulent ‎atmosphere is evaluated. At first the laser beam is simulated and then ‎turbulent atmosphere will be simulated by using Zernike polynomials. ‎Some parameter like intensity, PSF will be measured for four ‎wavelengths in different Cn2.

Keywords: laser beam propagation, phase screen, turbulent atmosphere, Zernike ‎polynomials

Procedia PDF Downloads 481

Authors: Taweechai Nuntawisuttiwong, Natasha Dejdumrong

Abstract:

Newton-Lagrange Interpolations are widely used in numerical analysis. However, it requires a quadratic computational time for their constructions. In computer aided geometric design (CAGD), there are some polynomial curves: Wang-Ball, DP and Dejdumrong curves, which have linear time complexity algorithms. Thus, the computational time for Newton-Lagrange Interpolations can be reduced by applying the algorithms of Wang-Ball, DP and Dejdumrong curves. In order to use Wang-Ball, DP and Dejdumrong algorithms, first, it is necessary to convert Newton-Lagrange polynomials into Wang-Ball, DP or Dejdumrong polynomials. In this work, the algorithms for converting from both uniform and non-uniform Newton-Lagrange polynomials into Wang-Ball, DP and Dejdumrong polynomials are investigated. Thus, the computational time for representing Newton-Lagrange polynomials can be reduced into linear complexity. In addition, the other utilizations of using CAGD curves to modify the Newton-Lagrange curves can be taken.

Keywords: Lagrange interpolation, linear complexity, monomial matrix, Newton interpolation

Procedia PDF Downloads 197

Authors: Mohsen Zahraei

Abstract:

‎In this paper, ‎the notion of ‎rank-k numerical range of rectangular complex matrix polynomials‎ ‎are introduced. ‎Some algebraic and geometrical properties are investigated. ‎Moreover, ‎for ε>0 the notion of Birkhoff-James approximate orthogonality sets for ε-higher ‎rank numerical ranges of rectangular matrix polynomials is also introduced and studied. ‎The proposed definitions yield a natural generalization of the standard higher rank numerical ranges.

Keywords: ‎‎Rank-k numerical range‎, ‎isometry‎, ‎numerical range‎, ‎rectangular matrix polynomials

Procedia PDF Downloads 418

Authors: Nevena Jakovčević Stor, Ivan Slapničar

Abstract:

Any polynomial can be expressed as a characteristic polynomial of a complex symmetric arrowhead matrix. This expression is not unique. If the polynomial is real with only real distinct roots, the matrix can be chosen as real. By using accurate forward stable algorithm for computing eigen values of real symmetric arrowhead matrices we derive a forward stable algorithm for computation of roots of such polynomials in O(n^2 ) operations. The algorithm computes each root to almost full accuracy. In some cases, the algorithm invokes extended precision routines, but only in the non-iterative part. Our examples include numerically difficult problems, like the well-known Wilkinson’s polynomials. Our algorithm compares favorably to other method for polynomial root-finding, like MPSolve or Newton’s method.

Keywords: roots of polynomials, eigenvalue decomposition, arrowhead matrix, high relative accuracy

Procedia PDF Downloads 380

Authors: Hanwei Gao, Louis Jezequel, Eric Cabrol, Bernard Vitry

Abstract:

The chassis system is composed of complex elements that take up all the loads from the tire-ground contact area and thus it plays an important role in numerous specifications such as durability, comfort, crash, etc. During the development of new vehicle projects in Renault, durability validation is always the main focus while deployment of comfort comes later in the project. Therefore, sometimes design choices have to be reconsidered because of the natural incompatibility between these two specifications. Besides, robustness is also an important point of concern as it is related to manufacturing costs as well as the performance after the ageing of components like shock absorbers. In this paper an approach is proposed aiming to realize a multi-objective optimization between chassis endurance and comfort while taking the random factors into consideration. The adaptive-sparse polynomial chaos expansion method (PCE) with Chebyshev polynomial series has been applied to predict responses’ uncertainty intervals of a system according to its uncertain-but-bounded parameters. The approach can be divided into three steps. First an initial design of experiments is realized to build the response surfaces which represent statistically a black-box system. Secondly within several iterations an optimum set is proposed and validated which will form a Pareto front. At the same time the robustness of each response, served as additional objectives, is calculated from the pre-defined parameter intervals and the response surfaces obtained in the first step. Finally an inverse strategy is carried out to determine the parameters’ tolerance combination with a maximally acceptable degradation of the responses in terms of manufacturing costs. A quarter car model has been tested as an example by applying the road excitations from the actual road measurements for both endurance and comfort calculations. One indicator based on the Basquin’s law is defined to compare the global chassis durability of different parameter settings. Another indicator related to comfort is obtained from the vertical acceleration of the sprung mass. An optimum set with best robustness has been finally obtained and the reference tests prove a good robustness prediction of Chebyshev PCE method. This example demonstrates the effectiveness and reliability of the approach, in particular its ability to save computational costs for a complex system.

Keywords: chassis durability, Chebyshev polynomials, multi-objective optimization, polynomial chaos expansion, ride comfort, robust design

Procedia PDF Downloads 127

Authors: Hashem Sazegar

Abstract:

In 1937, Vinograd of Russian Mathematician proved that each odd large number can be shown by three primes. In 1973, Chen Jingrun proved that each odd number can be shown by one prime plus a number that has maximum two primes. In this article, we state one proof for Goldbach’conjecture. Introduction: Bertrand’s postulate state for every positive integer n, there is always at least one prime p, such that n < p < 2n. This was first proved by Chebyshev in 1850, which is why postulate is also called the Bertrand-Chebyshev theorem. Legendre’s conjecture states that there is a prime between n2 and (n+1)2 for every positive integer n, which is one of the four Landau’s problems. The rest of these four basic problems are; (i) Twin prime conjecture: There are infinitely many primes p such that p+2 is a prime. (ii) Goldbach’s conjecture: Every even integer n > 2 can be written asthe sum of two primes. (iii) Are there infinitely many primes p such that p−1 is a perfect square? Problems (i), (ii), and (iii) are open till date.

Keywords: Bertrand-Chebyshev theorem, Landau’s problems, twin prime, Legendre’s conjecture, Oppermann’s conjecture

Procedia PDF Downloads 359

Authors: Mojtaba Hakimi-Moghaddam

Abstract:

Routh-Hurwitz stability criterion is a powerful approach to determine stability of linear time invariant systems. On the other hand, applying this criterion to characteristic equation of a system, whose stability or marginal stability can be determined. Although the command roots (.) of MATLAB software can be easily used to determine the roots of a polynomial, the characteristic equation of closed loop system usually includes parameters, so software cannot handle it; however, Routh-Hurwitz stability criterion results the region of parameter changes where the stability is guaranteed. Moreover, this criterion has been extended to characterize the stability of interval polynomials as well as fractional-order polynomials. Furthermore, it can help us to design stable and minimum-phase controllers. In this paper, theory and application of this criterion will be reviewed. Also, several illustrative examples are given.

Keywords: Hurwitz polynomials, Routh-Hurwitz stability criterion, continued fraction expansion, pure imaginary roots

Procedia PDF Downloads 277

Authors: Koushlendra Kumar Singh, Manish Kumar Bajpai, Rajesh K. Pandey

Abstract:

The edges of low contrast images are not clearly distinguishable to the human eye. It is difficult to find the edges and boundaries in it. The present work encompasses a new approach for low contrast images. The Chebyshev polynomial based fractional order filter has been used for filtering operation on an image. The preprocessing has been performed by this filter on the input image. Laplacian of Gaussian method has been applied on preprocessed image for edge detection. The algorithm has been tested on two test images.

Keywords: low contrast image, fractional order differentiator, Laplacian of Gaussian (LoG) method, chebyshev polynomial

Procedia PDF Downloads 591

Authors: Soner Nandappa D., Ahmed Mohammed Naji

Abstract:

In a graph G = (V, E), the distance from a vertex v to a vertex u is the length of shortest v to u path. The eccentricity e(v) of v is the distance to a farthest vertex from v. The diameter diam(G) is the maximum eccentricity. The k-distance neighborhood of v, for 0 ≤ k ≤ e(v), is Nk(v) = {u ϵ V (G) : d(v, u) = k}. In this paper, we introduce a new distance degree based topological polynomial of a graph G is called a k- distance neighborhood polynomial, denoted Nk(G, x). It is a polynomial with the coefficient of the term k, for 0 ≤ k ≤ e(v), is the sum of the cardinalities of Nk(v) for every v ϵ V (G). Some properties of k- distance neighborhood polynomials are obtained. Exact formulas of the k- distance neighborhood polynomial for some well-known graphs, Cartesian product and join of graphs are presented.

Keywords: vertex degrees, distance in graphs, graph operation, Nk-polynomials

Procedia PDF Downloads 500

Authors: N. F. M. Mokhtar, N. Z. A. Hamid

Abstract:

This paper reports an analytical investigation of the stability and thermal convection in a horizontal anisotropic porous medium in the presence of Coriolis force and magnetic field. The Darcy model is used in the momentum equation and Boussinesq approximation is considered for the density variation of the porous medium. The upper and lower boundaries of the porous medium are assumed to be conducting to temperature perturbation and we used first order Chebyshev polynomial Tau method to solve the resulting eigenvalue problem. Analytical solution is obtained for the case of stationary convection. It is found that the porous layer system becomes unstable when the mechanical anisotropy parameter elevated and increasing the Coriolis force and magnetic field help to stabilize the anisotropy porous medium.

Keywords: anisotropic, Chebyshev tau method, Coriolis force, Magnetic field

Procedia PDF Downloads 181

Authors: Ivan Baravy

Abstract:

Interpolation problem, as it was initially posed in terms of polynomials, is well researched. However, further mathematical developments extended it significantly. Trigonometric interpolation is widely used in Fourier analysis, while its generalized representation as exponential interpolation is applicable to such problem of mathematical physics as modelling of Ziegler-Biersack-Littmark repulsive interatomic potentials. Formulated for finite fields, this problem arises in decoding Reed--Solomon codes. This paper shows the relation between different interpretations of the problem through the class of matrices of special structure - Hankel matrices.

Keywords: Berlekamp-Massey algorithm, exponential interpolation, finite fields, Hankel matrices, Hankel polynomials

Procedia PDF Downloads 481

Authors: Satyanarayana Engu, Ahmed Mohd, V. Murugan

Abstract:

We study the large time asymptotics of solutions to the Cauchy problem for a forced Burgers equation (FBE) with the initial data, which is continuous and summable on R. For which, we first derive explicit solutions of FBE assuming a different class of initial data in terms of Hermite polynomials. Later, by violating this assumption we prove the existence of a solution to the considered Cauchy problem. Finally, we give an asymptotic approximate solution and establish that the error will be of order O(t^(-1/2)) with respect to L^p -norm, where 1≤p≤∞, for large time.

Keywords: Burgers equation, Cole-Hopf transformation, Hermite polynomials, large time asymptotics

Procedia PDF Downloads 291