2019
DOI: 10.3390/computation7030048
|View full text |Cite
|
Sign up to set email alerts
|

Colebrook’s Flow Friction Explicit Approximations Based on Fixed-Point Iterative Cycles and Symbolic Regression

Abstract: The logarithmic Colebrook flow friction equation is implicitly given in respect to an unknown flow friction factor. Traditionally, an explicit approximation of the Colebrook equation requires evaluation of computationally demanding transcendental functions, such as logarithmic, exponential, non-integer power, Lambert W and Wright Ω functions. Conversely, we herein present several computationally cheap explicit approximations of the Colebrook equation that require only one logarithmic function in the initial st… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
5
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 41 publications
(71 reference statements)
0
5
0
Order By: Relevance
“…Moreover, the study and development of the approximation of the Colebrook-White equation are still going on today. Some of the latest studies on this can be seen in several kinds of literature [18][19][20][21][22][23].…”
Section: Introductionmentioning
confidence: 99%
“…Moreover, the study and development of the approximation of the Colebrook-White equation are still going on today. Some of the latest studies on this can be seen in several kinds of literature [18][19][20][21][22][23].…”
Section: Introductionmentioning
confidence: 99%
“…Friction losses in most cases are significant in the total pressure losses. Most flows in the systems are turbulent, and the friction losses correspond to the accurate but implicit Colebrook-White equation [1]:…”
Section: Introductionmentioning
confidence: 99%
“…At May 2020, the last entry corresponds to 2018 [12]. Dejan Brkić and Pavel Prax [1] obtained the most accurate modern approximations in 2019 by one and two steps of Padé approximation. It has 0.0259% of deviation, but it is too bulky.…”
Section: Introductionmentioning
confidence: 99%
“…Praks and Brkić [19] recently developed a one-log call iterative method, which uses only one computationally demanding function, and even then only in the first iteration (for all succeeding iterations, cheap Padé approximants are used [20,21]). Based on that approach, few very accurate and efficient explicit approximations suitable for coding and for engineering practice have been constructed [22]. In addition, the same authors developed few approximations of the Colebrook equation based on the Wright ω-function, which are among the most accurate to date [23][24][25].…”
Section: Introductionmentioning
confidence: 99%