✦ LIBER ✦

A numerical approximation of the rotation number

✍ Scribed by R. Pavani

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 437 KB
Volume: 73
Category: Article
ISSN: 0096-3003
DOI: 10.1016/0096-3003(94)00249-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Poisson approximation for the number o

A Poisson approximation for the number of k-matches

✍ Patrick D. Burghardt; Anant P. Godbole; Amy B. Prengaman 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 558 KB

Diophantine approximation of a single ir

Diophantine approximation of a single irrational number

✍ Jingcheng Tong 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 193 KB

The flow past a spinning sphere in a slo

The flow past a spinning sphere in a slowly rotating fluid at small reynolds numbers—A numerical study

✍ C.V.Raghava Rao; T.V.S. Sekhar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 688 KB

A separable rotation approximation for t

A separable rotation approximation for the calculation of chemical reaction rates

✍ Steven L. Mielke; Gillian C. Lynch; Donald G. Truhlar; David W. Schwenke 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 423 KB

We present a simple, yet remarkably accurate, approximate formula for the calculation of cumulative reaction probabilities and chemical reaction rates based on a separable-rotation approximation. The method allows a calculation of the full rate constant based on results for a single value of the tot

Numerical approximation of the boundary

Numerical approximation of the boundary of numerical range of matrix polynomials

✍ P. Psarrakos; Ch. Tsitouras 📂 Article 📅 2005 🏛 John Wiley and Sons ⚖ 335 KB

The numerical range of an n × n matrix polynomial , and plays an important role in the study of matrix polynomials. In this paper, we describe a methodology for the illustration of its boundary, ∂W (P ), using recent theoretical results on numerical ranges and algebraic curves.

Approximating the Number of Zeroes of a

Approximating the Number of Zeroes of a GF[2] Polynomial

✍ M. Karpinski; M. Luby 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 325 KB

We develop a probabilistic polynomial time algorithm which on input a polynomial \(g\left(x_{1}, \ldots, x_{n}\right)\) over \(G F[2], \epsilon\) and \(\delta\), outputs an approximation to the number of zeroes of \(g\) with relative error at most \(\epsilon\) with probability at least \(1-\delta\).