نتایج جستجو برای: collocation method error estimates

تعداد نتایج: 1938482  

Journal: :J. Comput. Physics 2008
Jasmine Foo Xiaoliang Wan George E. Karniadakis

Stochastic spectral methods are numerical techniques for approximating solutions to partial differential equations with random parameters. In this work, we present and examine the multi-element probabilistic collocation method (ME-PCM), which is a generalized form of the probabilistic collocation method. In the ME-PCM, the parametric space is discretized and a collocation/cubature grid is presc...

Journal: :Journal of Computational and Applied Mathematics 1991

Journal: :Computer Methods in Applied Mechanics and Engineering 2021

The Scaled Boundary Finite Element Method (SBFEM) is a technique in which approximation spaces are constructed using semi-analytical approach. They based on partitions of the computational domain by polygonal/polyhedral subregions, where shape functions approximate local Dirichlet problems with piecewise polynomial trace data. Using this operator adaptation approach, and imposing starlike scali...

2013
A. Murat Aksoy Dursun Irk Idris Dağ

Taylor B-spline collocation method (TCM) is proposed to obtain the numerical solution of the nonlinear Schrödinger(NLS) equation with appropriate initial and boundary conditions. Time discretization is carried out with Taylor series expansion and resulting system of equation is fully-integrated using cubic B-spline collocation method. Test problems concerning single soliton motion, interaction ...

‎Semidiscrete finite element approximation of a hyperbolic type‎ ‎integro-differential equation is studied. The model problem is‎ ‎treated as the wave equation which is perturbed with a memory term.‎ ‎Stability estimates are obtained for a slightly more general problem.‎ ‎These, based on energy method, are used to prove optimal order‎ ‎a priori error estimates.‎

1994
Wai Sun

We study a new method in reducing the roundo error in computing derivatives using Chebyshev collocation methods. By using a grid mapping derived by Koslo and Tal-Ezer, and the proper choice of the parameter , the roundo error of the k-th derivative can be reduced from O(N2k) to O((N jln j)k), where is the machine precision and N is the number of collocation points. This drastic reduction of rou...

Journal: :SIAM J. Scientific Computing 1997
Wai-Sun Don Alex Solomonoff

We study a new method in reducing the roundo error in computing derivatives using Chebyshev collocation methods. By using a grid mapping derived by Koslo and Tal-Ezer, and the proper choice of the parameter , the roundo error of the k-th derivative can be reduced from O(N) to O((N jln j)k), where is the machine precision and N is the number of collocation points. This drastic reduction of round...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید