نتایج جستجو برای: legendre polynomials

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

Journal: :Mathematical and Computer Modelling 2008
Shoujun Xu Heping Zhang

For a graph G we denote by dG(u, v) the distance between vertices u and v in G, by dG(u) the degree of vertex u. The Hosoya polynomial of G is H(G) = ∑ {u,v}⊆V (G) x dG (u,v). For any positive numbers m and n, the partial Hosoya polynomials of G are Hm(G) = ∑ {u, v} ⊆ V (G) dG (u) = dG (v) = m xdG (u,v), Hmn(G) = ∑ {u, v} ⊆ V (G) dG (u) = m, dG (v) = n xdG (u,v). It has been shown that H(G1) − ...

2017
P. A. Martin

A sound pulse is scattered by a sphere leading to an initial–boundary value problem for the wave equation. A method for solving this problem is developed using integral representations involving Legendre polynomials in a similarity variable and Volterra integral equations. The method is compared and contrasted with the classical method, which uses Laplace transforms in time combined with separa...

2009
Mohsen Razzaghi MOHSEN RAZZAGHI

A method for finding the solution of a linear time varying multidelay systems using a hybrid function is proposed. The properties of the hybrid functions which consists of block-pulse functions plus Legendre polynomials are presented. The method is based upon expanding various time functions in the system as their truncated hybrid functions. Operational matrices of integration, delay and produc...

Journal: :SIAM Journal on Optimization 2015
Tomás Bajbar Oliver Stein

Many interesting properties of polynomials are closely related to the geometry of their Newton polytopes. In this article we analyze the coercivity on Rn of multivariate polynomials f ∈ R[x] in terms of their Newton polytopes. In fact, we introduce the broad class of so-called gem regular polynomials and characterize their coercivity via conditions imposed on the vertex set of their Newton poly...

2013
Mohamed E. Hassani

The main purpose of the present paper is the heuristic study of the structure, properties and consequences of new class of potential functions results from the concept of pq-Radial functions which are fundamental family of solutions of second order pq-PDE. Keyword: Potential functions, Laplace equation, pq-Radial function, pq-PDE, Legendre polynomials

2018
Matthieu Barreau Frédéric Gouaisbaut Alexandre Seuret Rifat Sipahi

The input/output stability of an interconnected system composed of an ordinary differential equation and a damped string equation is studied. Issued from the literature on time-delay systems, an exact stability result is firstly derived using pole locations. Then, based on the Small-Gain theorem and on the Quadratic Separation framework, some robust stability criteria are provided. The latter f...

1993
Shalosh B. Ekhad

Weinstein’s[2] brilliant short proof of de Branges’[1] theorem can be made yet much shorter(modulo routine calculations), completely elementary (modulo Löwner theory), self contained(no need for the esoteric Legendre polynomials’ addition theorem), and motivated(ditto), as follows. Replace the text between p. 62, line 7 and p. 63, line 7, by Fact 1 below, and the text between the last line of p...

2003
Anish Biswas

Time series problems involve analysis of periodic functions for predicting the future. A flexible regression method should be able to dynamically select the appropriate model to fit the available data. In this paper, we present a function approximation scheme that can be used for modeling periodic functions using a series of orthogonal polynomials, named Chebychev polynomials. In our approach, ...

2013
Zhi-Hong Sun

Suppose that p is an odd prime and d is a positive integer. Let x and y be integers given by p = x2 + dy2 or 4p = x2 + dy2. In this paper we determine x (mod p) for many values of d. For example,

2008
Javier Cilleruelo Gang Yu

Newman polynomials are those with all coefficients in {0, 1}. We consider here the problem of finding Newman polynomials P such that all the coefficients of P 2 are so small as possible for deg P and P (1) given. A set A ⊂ [1, N ] is called a B2[g] sequence if every integer n has at most g distinct representations as n = a1 + a2 with a1, a2 ∈ A and a1 ≤ a2. Gang Yu [4] introduced a new idea to ...

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

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