New recurrence relations for Chebyshev method
نویسندگان
چکیده
منابع مشابه
Recurrence Relations for Chebyshev - Type Methods ∗
The convergence of new second-order iterative methods are analyzed in Banach spaces by introducing a system of recurrence relations. A system of a priori error bounds for that method is also provided. The methods are defined by using a constant bilinear operator A, instead of the second Fréchet derivative appearing in the defining formula of the Chebyshev method. Numerical evidence that the met...
متن کاملFourth Order Chebyshev Methods with Recurrence Relation
Abstract. In this paper, a new family of fourth order Chebyshev methods (also called stabilized methods) is constructed. These methods possess nearly optimal stability regions along the negative real axis and a three-term recurrence relation. The stability properties and the high order make them suitable for large stiff problems, often space discretization of parabolic PDEs. A new code ROCK4 is...
متن کاملNonstandard Braid Relations and Chebyshev Polynomials
A fundamental open problem in algebraic combinatorics is to find a positive combinatorial formula for Kronecker coefficients, which are multiplicities of the decomposition of the tensor product of two Sr-irreducibles into irreducibles. Mulmuley and Sohoni attempt to solve this problem using canonical basis theory, by first constructing a nonstandard Hecke algebra Br, which, though not a Hopf al...
متن کاملGeneralized Chebyshev Collocation Method
In this paper, we introduce a generalized Chebyshev collocation method (GCCM) based on the generalized Chebyshev polynomials for solving stiff systems. For employing a technique of the embedded Runge-Kutta method used in explicit schemes, the property of the generalized Chebyshev polynomials is used, in which the nodes for the higher degree polynomial are overlapped with those for the lower deg...
متن کامل( Probabilistic ) Recurrence Relations
The performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form T(x) = a(x)+T(H(x)), where a is a function and H(x) is a random variable. For instance, T(x) may describe the running time of such an algorithm on a problem of size x. Then T(x) is a random variable, whose distribution depends on the distribution of H(x). To give high proba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1997
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(97)00012-8