计算机应用与软件2017，Vol.34Issue(9)：50-56,7.DOI:10.3969/j.issn.1000-386x.2017.09.011
二分搜索法求解悬链线问题
BINARY SEARCH METHOD FOR SOLVING CATENARY PROBLEM
摘要
Abstract
Catenary problem is one of the problems often encountered in modem engineering practice.In the two cases that two hanging points at the same height and different heights,the paper analyzes the conventional mathematical methods for solving the catenary coefficient,sag and the abscissa of the hanging points.Due to the large amount of calculation and the error is difficult to grasp,the paper proposes the binary search programming specific ideas to assist in solving,and offers three complete programs and data for different applications,compares and analyzes the mathematical methods and programming methods.Taking the boom erection project as an example,the paper provides a complete C program and the main function flowchart,and describes in more detail the procedures to solve the relevant parameters.The above method has been applied to practice many times,and it is simple and feasible.关键词
二分搜索法/悬链线/悬链系数/弛垂度/误差分析/C程序设计Key words
Binary search method/Catenary/Catenary coefficient/Sag/Error analysis/C programming分类
信息技术与安全科学引用本文复制引用
马旭,易俗..二分搜索法求解悬链线问题[J].计算机应用与软件,2017,34(9):50-56,7.基金项目
国家自然科学基金项目(11304135) （11304135）
辽宁省自然科学基金项目(201602345) （201602345）
沈阳市应用基础研究专项项目(F15-199-1-04). （F15-199-1-04）
