✦ LIBER ✦

Prediction of sunspot numbers for the ascending part of cycle 21

✍ Scribed by Wang Jia-long; Fan Yue-hua; Lin Bai-sen; Xue Hui-fang

Publisher: Elsevier Science
Year: 1979
Weight: 271 KB
Volume: 3
Category: Article
ISSN: 0146-6364
DOI: 10.1016/0146-6364(79)90011-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fractal dimension and prediction of the

Fractal dimension and prediction of the sunspot number

✍ Shen Mei; Yang Cai-pei 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Prediction of maximum and minimum sunspo

Prediction of maximum and minimum sunspot numbers of solar cycles: AAnS 34/1 (1993) 107–112

✍ Zhao Ai-di 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 89 KB

Use of orthogonal polynomials for correl

Use of orthogonal polynomials for correlating F-region parameters with sunspot numbers for prediction purposes

✍ U.C. Upreti; S. Aggarwal; M.M. Gupta; B.M. Reddy 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 671 KB

Tilts and polarity separation in the sun

Tilts and polarity separation in the sunspot groups and active regions at the ascending and descending phases of the cycle 23

✍ V.V. Zharkova; S.I. Zharkov 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 784 KB

Search for relationship between duration

Search for relationship between duration of the extended solar cycles and amplitude of sunspot cycle

✍ A.G. Tlatov 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB 👁 1 views

## Abstract Duration of the extended solar cycles is taken into the consideration. The beginning of cycles is counted from the moment of polarity reversal of large‐scale magnetic field in high latitudes, occurring in the sunspot cycle n till the minimum of the cycle __n__ + 2. The connection betwee

The Ramsey numbers for disjoint unions o

The Ramsey numbers for disjoint unions of cycles

✍ Tristan Denley 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 671 KB

As usual, for simple graphs G and H, let the Ramsey number r(G,H) be defined as the least number n such that for any graph K of order n, either G is a subgraph of K or H is a subgraph of/(. We shall establish the values of r(aC~,bCs) and r(aCv, bC7) almost precisely (where nG is the graph consisting