Computer Algebra Algorithms for Orthogonal Polynomials and Special Functions

نویسنده

  • Wolfram Koepf
چکیده

In this minicourse I would like to present computer algebra algorithms for the work with orthogonal polynomials and special functions. This includes • the computation of power series representations of hypergeometric type functions, given by “expressions”, like arcsin(x)/x , • the computation of holonomic differential equations for functions, given by expressions, • the computation of holonomic recurrence equations for sequences, given by expressions, like ( n k ) x k! , • the identification of hypergeometric functions, • the computation of antidifferences of hypergeometric terms (Gosper’s algorithm), • the computation of holonomic differential and recurrence equations for hypergeometric series, given the series summand, like

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithmic Work with Orthogonal Polynomials and Special Functions

In this article we present a method to implement orthogonal polynomials and many other special functions in Computer Algebra systems enabling the user to work with those functions appropriately, and in particular to verify different types of identities for those functions. Some of these identities like differential equations, power series representations, and hypergeometric representations can ...

متن کامل

Identities for Families of Orthogonal Polynomials and Special Functions

In this article we present new results for families of orthogonal polynomials and special functions, that are determined by algorithmical approaches. In the first section, we present new results, especially for discrete families of orthogonal polynomials, obtained by an application of the celebrated Zeilberger algorithm. Next, we present algorithms for holonomic families f(n, x) of special func...

متن کامل

Software for the Algorithmic Work with Orthogonal Polynomials and Special Functions

Modern computer algebra systems use heuristics and algorithms for the fast computation with mathematical formulas. General purpose computer algebra systems like Axiom [12], Derive [20], Macsyma [17], Maple [5], Mathematica [23] or Reduce [11] are for example great with integrals. Even a small system like Derive computes all explicitly given integrals of Bronshtein and Semedyayev’s integral tabl...

متن کامل

Buckling and vibration analysis of angle -ply symmetric laminated composite plates with fully elastic boundaries

The main focus of this paper is on efficiency analysis of two kinds of approximating functions (characteristic orthogonal polynomials and characteristic beam functions) that have been applied in the Rayleigh-Ritz method to determine the non-dimensional buckling and frequency parameters of an angle ply symmetric laminated composite plate with fully elastic boundaries. It has been observed that o...

متن کامل

Solving singular integral equations by using orthogonal polynomials

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

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002