Taylor Polynomial

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 321 Experts worldwide ranked by ideXlab platform

Mehmet Sezer - One of the best experts on this subject based on the ideXlab platform.

  • integral kosullu hiperbolik tip kismi diferansiyel denklemlerin Taylor polinom cozumleri Taylor Polynomial solution of hyperbolic type partial differential equation with an integral condition
    Erciyes Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2016
    Co-Authors: Berna Bulbul, Mehmet Sezer
    Abstract:

    In this paper, the problem of solving the one-dimensional hyperbolic partial differential equation, subject to given initial and nonlocal boundary conditions, is considered. The proposed method converts the equation and conditions to matrix equation, which corresponds to system of linear algebraic equations with unknown Taylor coefficients. Thus by solving the matrix equation, Taylor coefficients and Polynomial approach are obtained. Also, the obtained results are compared by the known results; the accuracy of solutions and the error analysis are performed.   Bu makalede, bir boyutlu hiperbolik kismi diferansiyel denklemlerin verilen baslangic ve integral sinir kosullari altinda cozumu ele alinmistir. Onerilen yontem, verilen denklem ve kosullari matris denklemine donusturerek bilinmeyenleri Taylor katsayilari olan lineer cebirsel denklem sistemi elde eder. Bu matris denklemi cozulerek Taylor katsayilari ve polinom yaklasimi elde edilir. Ayrica elde edilen sonuclar bilinen degerlerle karsilastirilmis; yontemin dogrulugu ve hata analizi verismistir.

  • a Taylor Polynomial approach for solving the most general linear fredholm integro differential difference equations
    Mathematical Methods in The Applied Sciences, 2012
    Co-Authors: Aysegul Akyuzdascioglu, Mehmet Sezer
    Abstract:

    In this study, a matrix method is developed to solve approximately the most general higher order linear Fredholm integro-differential-difference equations with variable coefficients under the mixed conditions in terms of Taylor Polynomials. This technique reduces the problem into the linear algebraic system. The method is valid for any combination of differential, difference and integral equations. An initial value problem and a boundary value problem are also presented to illustrate the accuracy and efficiency of the method. Copyright © 2012 John Wiley & Sons, Ltd.

  • Taylor Polynomial solution of hyperbolic type partial differential equations with constant coefficients
    International Journal of Computer Mathematics, 2011
    Co-Authors: Berna Bulbul, Mehmet Sezer
    Abstract:

    The purpose of this study is to give a Taylor Polynomial approximation for the solution of hyperbolic type partial differential equations with constant coefficients. The technique used is an improved Taylor matrix method, which has been given for solving ordinary differential, integral and integro-differential equations [M. Gulsu and M. Sezer, A method for the approximate solution of the high-order linear difference equations in terms of Taylor Polynomials, Int. J. Comput. Math. 82(5) (2005), pp. 629-642; M. Gulsu and M. Sezer, On the solution of the Riccati equation by the Taylor matrix method, Appl. Math. Comput. 188 (2007), pp. 446-449; A. Karamete and M. Sezer, A Taylor collocation method for the solution of linear integro-differential equations, Int. J. Comput. Math. 79(9) (2002), pp. 987-1000; N. Kurt and M. Cevik, Polynomial solution of the single degree of freedom system by Taylor matrix method, Mech. Res. Commun. 35 (2008), pp. 530-536; N. Kurt and M. Sezer, Polynomial solution of high-order linear Fredholm integro-differential equations with constant coefficients, J. Franklin Inst. 345 (2008), pp. 839-850; S. Nas, S. Yalcinbas, and M. Sezer, A method for approximate solution of the high-order linear Fredholm integro-differential equations, Int. J. Math. Edu. Sci. Technol. 27(6) (1996), pp. 821-834; M. Sezer, Taylor Polynomial solution of Volterra integral equations, Int. J. Math. Edu. Sci. Technol. 25(5) (1994), pp. 625-633; M. Sezer, A method for approximate solution of the second order linear differential equations in terms of Taylor Polynomials, Int. J. Math. Edu. Sci. Technol. 27(6) (1996), pp. 821-834; M. Sezer, M. Gulsu, and B. Tanay, A matrix method for solving high-order linear difference equations with mixed argument using hybrid Legendre and Taylor Polynomials, J. Franklin Inst. 343 (2006), pp. 647-659; S. Yalcinbas, Taylor Polynomial solutions of nonlinear Volterra-Fredholm integral equation, Appl. Math. Comput. 127 (2002), pp. 196-206; S. Yalcinbas and M. Sezer, The approximate solution of high-order linear Volterra-Fredholm integro-differential equations in terms of Taylor Polynomials, Appl. Math. Comput. 112 (2000), pp. 291-308]. Some numerical examples, which consist of initial and boundary conditions, are given to illustrate the reliability and efficiency of the method. Also, the results obtained are compared by the known results; the error analysis is performed and the accuracy of the solution is shown.

  • a Taylor Polynomial approach for solving generalized pantograph equations with nonhomogenous term
    International Journal of Computer Mathematics, 2008
    Co-Authors: Mehmet Sezer, Salih Yalcinbas, Mustafa Gulsu
    Abstract:

    A numerical method for solving the generalized (retarded or advanced) pantograph equation with constant and variable coefficients under mixed conditions is presented. The method is based on the truncated Taylor Polynomials. The solution is obtained in terms of Taylor Polynomials. The method is illustrated by studying an initial value problem. IIIustrative examples are included to demonstrate the validity and applicability of the technique. The results obtained are compared to the known results.

  • a Taylor Polynomial approach for solving high order linear fredholm integro differential equations in the most general form
    International Journal of Computer Mathematics, 2007
    Co-Authors: Aysegul Akyuzdascioglu, Mehmet Sezer
    Abstract:

    A Taylor method is developed for finding the approximate solution of high-order linear Fredholm integro-differential equations in the most general form under the mixed conditions. The problem is defined on the interval [-1, 1] and the solution is obtained in terms of Taylor Polynomials about the origin. Transforming the interval [a, b] to the interval [-1, 1], a problem defined on [a, b] can also be solved using this method. Numerical examples are presented to illustrate the accuracy of the method.

Y Mahmoudi - One of the best experts on this subject based on the ideXlab platform.

Sumit Ganguly - One of the best experts on this subject based on the ideXlab platform.

  • Taylor Polynomial estimator for estimating frequency moments
    International Colloquium on Automata Languages and Programming, 2015
    Co-Authors: Sumit Ganguly
    Abstract:

    We present a randomized algorithm for estimating the pth moment \(F_p\) of the frequency vector of a data stream in the general update (turnstile) model to within a multiplicative factor of \(1 \pm \epsilon \), for \(p > 2\), with high constant confidence. For \(0 < \epsilon \le 1\), the algorithm uses space \(O( n^{1-2/p} \epsilon ^{-2} + n^{1-2/p} \epsilon ^{-4/p} \log (n))\) words. This improves over the current bound of \(O(n^{1-2/p} \epsilon ^{-2-4/p} \log (n))\) words by Andoni et. al. in [2]. Our space upper bound matches the lower bound of Li and Woodruff [17] for \(\epsilon = (\log (n))^{-\varOmega (1)}\) and the lower bound of Andoni et. al. [3] for \(\epsilon = \varOmega (1)\).

  • Taylor Polynomial estimator for estimating frequency moments
    arXiv: Data Structures and Algorithms, 2015
    Co-Authors: Sumit Ganguly
    Abstract:

    We present a randomized algorithm for estimating the $p$th moment $F_p$ of the frequency vector of a data stream in the general update (turnstile) model to within a multiplicative factor of $1 \pm \epsilon$, for $p > 2$, with high constant confidence. For $0 < \epsilon \le 1$, the algorithm uses space $O( n^{1-2/p} \epsilon^{-2} + n^{1-2/p} \epsilon^{-4/p} \log (n))$ words. This improves over the current bound of $O(n^{1-2/p} \epsilon^{-2-4/p} \log (n))$ words by Andoni et. al. in \cite{ako:arxiv10}. Our space upper bound matches the lower bound of Li and Woodruff \cite{liwood:random13} for $\epsilon = (\log (n))^{-\Omega(1)}$ and the lower bound of Andoni et. al. \cite{anpw:icalp13} for $\epsilon = \Omega(1)$.

Weiming Wang - One of the best experts on this subject based on the ideXlab platform.

Aysegul Akyuzdascioglu - One of the best experts on this subject based on the ideXlab platform.