نتایج جستجو برای: chebyshev halley method

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

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...

  A method is presented to reduce the singular Lippmann-Schwinger integral equation to a simple matrix equation. This method is applied to calculate the matrix elements of the reaction and transition operators, respectively, on the real axis and on the complex plane. The phase shifts and the differential scattering amplitudes are computable as well as the differential cross sections if the R- a...

2016
Houjun Wang John P. Boyd Rashid A. Akmaev

Hough functions are the eigenfunctions of the Laplace tidal equation governing fluid motion on a rotating sphere with a resting basic state. Several numerical methods have been used in the past. In this paper, we compare two of those methods: normalized associated Legendre polynomial expansion and Chebyshev collocation. Both methods are not widely used, but both have some advantages over the co...

2008
Eric Butcher Brian Mann

This chapter provides a brief literature review together with detailed descriptions of the authors’ work on the stability and control of systems represented by linear time-periodic delay-differential equations using the Chebyshev and temporal finite element analysis (TFEA) techniques. Here, the theory and examples assume that there is a single fixed discrete delay which is equal to the principa...

2005
Ren-Cang Li

For n × n Vandermonde matrix Vn = (αi−1 j )1≤i j≤n with translated Chebyshev zero nodes, it is discovered that V T n admits an explicit QR decomposition with the R-factor consisting of the coefficients of the translated Chebyshev polynomials of degree less than n. This decomposition then leads to an exact expression for the condition number of its submatrix Vk,n = (αi−1 j )1≤i≤k,1≤j≤n (so-calle...

2014
Mohamed A. Ramadan Kamal R. Raslan Mahmoud A. Nassar

The purpose of this paper is to investigate the use of rational Chebyshev (RC) collocation method for solving high-order linear ordinary differential equations with variable coefficients. Using the rational Chebyshev collocation points, this method transforms the high-order linear ordinary differential equations and the given conditions to matrix equations with unknown rational Chebyshev coeffi...

In this paper, a special technique is studied by using the orthogonal Chebyshev polynomials to get approximate solutions for singular and hyper-singular integral equations of the first kind. A singular integral equation is converted to a system of algebraic equations based on using special properties of Chebyshev series. The error bounds are also stated for the regular part of approximate solut...

Journal: :Applied Mathematics and Computation 2005
Mei-Qin Chen Xiezhang Li

A new type ð2; 2Þ-step iterative method related to an optimal Chebyshev method is developed for solving real and nonsymmetric linear systems of the form Ax 1⁄4 b. It is an extension of the ð2; 2Þ-step iterative method introduced in [Numer. Linear Algebra Appl. 7 (2000) 169]. The superiority of the new type ð2; 2Þ-step iterative method over the optimal Chebyshev method is derived in the case whe...

‎It is commonly accepted that fractional differential equations play‎ ‎an important role in the explanation of many physical phenomena‎. ‎For‎ ‎this reason we need a reliable and efficient technique for the‎ ‎solution of fractional differential equations‎. ‎This paper deals with‎ ‎the numerical solution of a class of fractional differential‎ ‎equation‎. ‎The fractional derivatives are described...

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

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