专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US5537861A Method of balancing a bladed rotor 失效
标题翻译：叶片转子平衡方法
公开(公告)号：US5537861A
公开(公告)日：1996-07-23
申请号：US407358
申请日：1995-03-20
申请人： Leon H. Seitelman , Johan van Achterberg , Soter P. Slomski
发明人： Leon H. Seitelman , Johan van Achterberg , Soter P. Slomski
IPC分类号： F01D5/02 , F16F15/32 , G01M1/30 , G01M1/00
CPC分类号： G01M1/30 , F16F15/32
摘要： A method disclosed]for balancing the fan rotor (10) of a turbine engine having a hub (12) with blades (16) extending radially therefrom includes the steps of determining (30) a penalty associated with each possible unique blade arrangement in which a limited number of blades is relocated from their initially assigned locations on the hub to new target locations. A subset of these arrangements is selected (34), the subset members being the arrangements having the lowest penalties. For each member of the subset, the penalty determination (36) is made for each possible unique blade arrangement in which a limited number of blades is relocated from their initial locations in each subset member to new target locations. If these latter penalty determinations identify an arrangement having a penalty less than that of any arrangement in the subset, the subset selection (34) and penalty determination steps (36) are repeated until no further reduction in penalty is observed. Once a blade arrangement having the smallest penalty is identified, the imbalance associated with that arrangement is compared (42) to a predetermined imbalance limit. If the imbalance is no greater than the limit, the blades (16) are deployed (44) on the hub in accordance with that arrangement.
摘要翻译：一种用于平衡具有轮毂（12）的涡轮发动机的风扇转子（10）与其中径向延伸的叶片（16）的方法包括以下步骤：确定（30）与每个可能的独特叶片装置相关联的处罚，其中有限数量的刀片从其在集线器上的最初分配的位置重新定位到新的目标位置。选择这些布置的子集（34），子集成员是具有最低处罚的排列。对于子集的每个成员，针对每个可能的唯一的刀片布置进行罚款确定（36），其中有限数量的刀片从每个子组件中的初始位置重新定位到新的目标位置。如果这些后面的惩罚确定确定了具有小于子集中的任何布置的惩罚的排列的排列，则重复子集选择（34）和惩罚确定步骤（36），直到观察不到惩罚的进一步减少为止。一旦确定了具有最小处罚的叶片布置，则将与该布置相关联的不平衡与预定的不平衡极限进行比较（42）。如果不平衡度不大于极限，则根据该布置将叶片（16）展开（44）到轮毂上。

IPRDB

热门服务

关于我们

友情链接

联系方式