检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《系统工程理论与实践》2006年第10期125-129,144,共6页Systems Engineering-Theory & Practice
基 金:陕西省教育厅专项基金资助项目(06JK258)
摘 要:针对当通风网络存在按需供风的分支时,Scott-Hensley方法无法对存在具有此特点的分支的回路的风量进行有效调节,回路风压归零误差全部集中在那些按需供风分支上,这给风量调节带来一定困难,提出了一种新的通风网络解算方法.该方法通过使所有独立回路分支风压代数和的平方和最小化的方法,将回路风压归零误差按需分散到所有回路或某些回路上,从而实现所有回路的调节,同时使不平衡误差最小化.该方法理论上考虑到了通风网络中存在按需供风分支的情况,用计算机进行求解不存在理论上的缺陷.风网解算时,只需选一次独立回路且同时对所有独立回路进行风量调节,即可获得正确的结果.由于任何通风网络均可转换成含按需供风分支的网络,因此该方法事实上不存在局限性.When there exist the branches whose ventilating volumes are supplied on demand in a ventilating network, the Scott- Hensley method cannot make reasonably adjustment to all branches contained in the circuits with fixed volume branches so that balance error of total ventilation pressure is concentrated wholly on these branches. Thus ventilating volume adjustment becomes very difficult. To solve this problem, a new optimization method based on improvement of the Scott - Hensley method is represented in which minimization of squared sum of algebraic sum of the ventilation pressure of all branches in a independent circuit about all independent circuits is taken as objective function, based on which balance error of circuits can be allocated into all or some of circuits on demand so as to realize all circuits adjustment and minimize balance error simultaneously. The method theoretically gives consideration of existence of branches with fixed volume in a ventilation network, and has no theoretical shortcomings for computer to solve. When solving, independent circuits are selected only one time and adjustment is made on all these circuits, correct results can be obtained. Because any ventilation system can be transformed into a system contained of fixed volume branches, the algorithm is actually no limits for application.
分 类 号:TD725[矿业工程—矿井通风与安全]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.235