单木生长模型竞争指标的优化算法  

An Improvement to Competition Index Calculating Algorithm for an Individual Tree Model

作　　者：张守攻[1] 唐守正[2] 惠刚盈 

机构地区：[1]中国林业科学研究院林业研究所 [2]中国林业科学研究院资源信息研究所 副研究员 [3]北京 100091

出　　处：《林业科学研究》1993年第4期351-357,共7页Forest Research

摘　　要：以数据区检索方式为标准,竞争指标算法可分为4类。其中第二类为改进算法;竞争木索引扫描和动态分区扫描,是首次提出的两种算法。用独立的数据区建立索引,改善了系统的灵活性;优化算法显著提高了系统的运行速度,解决了微机上开发应用单木模型系统部分关键问题。同时给出了不同算法结构的内存额外开销量和计算工作量的估计公式。The algorithms of estimating competition index was divided into two groups according to its competition tree searching regimen, and one of them was improved. Then, two new searching algorithms were created, which operate well for stand with various spatial patterns. Introducing an independent index system makes a computer model restructured easily. With new and improved algorithm, a system can get a stand growth simulation done in a dramatically shorter time than it used to. One of the staggering problems, unendurable of implementing time, which had been an obstacle to the application of individual tree model, was overcome. The equations were provided to access extra RAM demand and calculate the implementing time.

关 键 词：单木生长模型 计算 指标 

分 类 号：S758.52[农业科学—森林经理学]