Results 21 to 30 of about 131,872 (281)
Connection Coefficients of Orthogonal Polynomials
Canadian Mathematical Bulletin, 1992 Let be polynomials orthogonal with respect to different distributions. Conditions are given which imply that the coefficients in the expansion of Pn in terms of Q0, Q1,..., Qn are non-negative.
Ryszard Szwarc
core +3 more sources
Connection coefficients on an interval and wavelet solutions of Burgers equation
Journal of Computational and Applied Mathematics, 2001 A definition of connection coefficients is introduced and techniques of computation are presented. We use semi-implicit time difference scheme to solve Burgers equation by applying the evaluations of connection coefficients in calculating the integrals ...
E.B. Lin, Lin, E.B., X. Zhou, Zhou, X.
exaly +2 more sources
Recurrence relations for connection coefficients between two families of orthogonal polynomials
Journal of Computational and Applied Mathematics, 1995 We describe a simple approach in order to build recursively the connection coefficients between two families of orthogonal polynomial solutions of second- and fourth-order differential ...
A Ronveaux, A Zarzo, E Godoy
exaly +2 more sources
An alternative approach to compute wavelet connection coefficients
Applied Mathematics Letters, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fatih Bulut
exaly +2 more sources
Results in Engineering, 2023 Friction is a complex system affected by microscopical effects and multidisciplinary phenomena. Coulomb's simple friction model with a constant friction coefficient cannot account for all these tribological effects.
Dominik Hinse +4 more
doaj +2 more sources
Journal of Computational and Applied Mathematics, 1996 We give explicitly recurrence relations satisfied by the connection coefficients between two families of the classical orthogonal polynomials of a discrete variable (i.e., associated with the names of Charlier, Meixner, Krawtchouk and Hahn).
Stanisław Lewanowicz
exaly +2 more sources
On Stokes Matrices in terms of Connection Coefficients
Funkcialaj Ekvacioj, 2016 : The classical problem of computing a complete system of Stokes multipliers of a linear system of ODEs of rank one in terms of some connection coefficients of an associated hypergeometric system of ODEs, is solved with no genericness assumptions on the ...
Davide Guzzetti +2 more
core +4 more sources
Connection and linearization coefficients of the Askey–Wilson polynomials
Journal of Symbolic Computation, 2013 The linearization problem is the problem of finding the coefficients C"k(m,n) in the expansion of the product P"n(x)Q"m(x) of two polynomial systems in terms of a third sequence of polynomials R"k(x),P"n(x)Q"m(x)=@?k=0n+mC"k(m,n)R"k(x). The polynomials P"n, Q"m and R"k may belong to three different polynomial families.
M Foupouagnigni, W Koepf
exaly +2 more sources
Linearization and connection coefficients of polynomial sequences: A matrix approach
Linear Algebra and its Applications, 2023 For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$, called ...
Verde-Star, Luis
core +3 more sources
A recurrence relation for generalised connection coefficients
Journal of Computational DynamicsWe formulate and prove a general recurrence relation that applies to integrals involving orthogonal polynomials and similar functions. A special case are connection coefficients between two sets of orthonormal polynomials, another example is integrals of products of Legendre functions.
Arieh Iserles
exaly +3 more sources