๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Fast Algorithm for Sorting and Counting Third-Order Intermodulation Products

โœ Scribed by Fortes, J.; Sampaio-Neto, R.


Book ID
117912953
Publisher
IEEE
Year
1986
Tongue
English
Weight
610 KB
Volume
34
Category
Article
ISSN
0090-6778

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A fast cluster counting algorithm for pe
โœ E. Stoll ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 343 KB

A fast counting algorithm is used to enumerate the clusters for determining their statistics, for investigation the percolation behavior of the largest cluster and for calculating the fractai dimensions D. The algorithm is suitable for parallel processing. It can be expanded for off-lattice systems,