✦ LIBER ✦

The Gegenbauer Polynomial technique: the evaluation of a class of Feynman diagrams

✍ Scribed by A.V. Kotikov

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 593 KB
Volume: 375
Category: Article
ISSN: 0370-2693
DOI: 10.1016/0370-2693(96)00226-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A reduce approach to the calculation of

A reduce approach to the calculation of Feynman diagrams

✍ J. Calmet 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 540 KB

On the zeros of a class of polynomials i

On the zeros of a class of polynomials including the generalized Bessel polynomials

✍ E.K. Ifantis; P.D. Siafarikas 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 363 KB

Evaluation of the characteristic polynom

Evaluation of the characteristic polynomial of a graph

✍ Tomislav P Z̆ivković 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Two algorithms for the evaluation of the characteristic polynomial of a graph G are described. Both algorithms have the operation count of the order n3, where n is the number of the vertices in the graph G. These algorithms are stable, fast, and efficient. They are one order of magnitude faster tha

On the irreducibility of a class of poly

On the irreducibility of a class of polynomials, III

✍ K Györy 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 844 KB

On the zeros of a class of exponential p

On the zeros of a class of exponential polynomials

✍ Dorothy L Bernstein; Geraldine A Coon 📂 Article 📅 1965 🏛 Elsevier Science 🌐 English ⚖ 358 KB

On the evaluation of the characteristic

On the evaluation of the characteristic polynomial of a chemical graph

✍ Tomislav P. Živković 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 583 KB

## Abstract The evaluation of the characteristic polynomial of a chemical graph is considered. It is shown that the operation count of the Le Verrier–Faddeev–Frame method, which is presently considered to be the most efficient method for the calculation of the characteristic polynomial, is of the o