Skip to main navigation Skip to search Skip to main content

The algorithm for graphic method of rain-flow counting in programming

  • Beihang University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2   Link opens in a new tab Scopus citations

Abstract

In this article, a new algorithm for rain-flow counting method in computer program is introduced. In the whole counting process, this algorithm entirely follows the principle of graphic method of rain-flow counting method, and so it can embodies the mechanical basis of extracting load cycle in rain-flow counting method; during the processing of counting, the information of every load cycle can be accurately recorded, such as starting and ending time, the time of peak or valley, the value of starting point and peak (or valley), mean value and amplitude. Besides, the counting result is in full accordance with the result from graphic method. Compared to four peak-valley method, this algorithm has shorter execution time and higher efficiency.

Original languageEnglish
Title of host publicationAdvanced Research on Automation, Communication, Architectonics and Materials
Pages1157-1161
Number of pages5
DOIs
StatePublished - 2011
Event2011 International Conference on Automation, Communication, Architectonics and Materials, ACAM2011 - Wuhan, China
Duration: 18 Jun 2011 → 19 Jun 2011

Publication series

NameAdvanced Materials Research
Volume225-226
ISSN (Print)1022-6680

Conference

Conference2011 International Conference on Automation, Communication, Architectonics and Materials, ACAM2011
Country/TerritoryChina
CityWuhan
Period18/06/11 → 19/06/11

Keywords

  • Fatigue damage
  • Four peak-valley method
  • Graphic method
  • Load cycle
  • Rain-flow counting method

Access to Document

Other files and links

Fingerprint

Dive into the research topics of 'The algorithm for graphic method of rain-flow counting in programming'. Together they form a unique fingerprint.
View full fingerprint

Cite this