Iterative method to solving the Colebrook-White equation

  • Context: Archived 
  • Thread starter Thread starter theBEAST
  • Start date Start date
  • Tags Tags
    Iterative Method
Click For Summary
SUMMARY

The discussion focuses on the iterative method for solving the Colebrook-White equation to determine the Darcy friction factor, f. The method involves successive substitutions, where an initial guess is refined through iterations using the formula $$x^{n+1}=f(x^n)$$. Convergence of this method is guaranteed when the absolute value of the derivative of the function, $$|f'(x)|$$, is less than 1. This mathematical condition ensures that the changes in the values of x decrease with each iteration, leading to a solution.

PREREQUISITES
  • Understanding of the Colebrook-White equation
  • Familiarity with iterative methods in numerical analysis
  • Knowledge of Taylor series expansion
  • Basic calculus, specifically derivatives
NEXT STEPS
  • Study the Colebrook-White equation in detail
  • Learn about convergence criteria for iterative methods
  • Explore numerical methods for solving nonlinear equations
  • Investigate the application of Taylor series in numerical analysis
USEFUL FOR

Students and professionals in fluid mechanics, engineers working with hydraulic systems, and anyone interested in numerical methods for solving equations in engineering contexts.

theBEAST
Messages
361
Reaction score
0

Homework Statement


In our fluid mechanics class we were taught that we could use the following equation to solve for the Darcy friction factor f:

86e8e7da627a4be30b61a4130a2a05eb.png

To do this by hand:
1. Guess a value for 1/sqrt(F), guess 3
2. Get the right hand side result of the equation using 3
3. Use that result for the next value of 1/sqrt(F)
4. Continue using the result for the next value.
5. To find F, just divide one by that value squared.

This iterative approach works but I am not too sure why. Can anyone explain why it works? I'm guessing it requires some knowledge of mathematical proofs?
 
Physics news on Phys.org
You are trying to solve an equation of the form x = f(x) using successive substitution. The successive substitution scheme is $$x^{n+1}=f(x^n)$$ where n signifies the n'th iteration. If we also consider the previous iteration, we have $$x^n=f(x^{n-1})$$. If we subtract the two equations, we have:
$$x^{n+1}-x^n=f(x^n)-f(x^{n-1})$$
If we expand the rhs in a taylor series about xn, we obtain:
$$x^{n+1}-x^n=f'(x^n)(x^n-x^{n-1})$$
In order for the scheme to converge, the magnitude of the changes in x from one iteration to the next must be getting smaller. If x is in the close vicinity of the solution, this means the, in order for the scheme to converge, $$|f'(x)|<1$$
That is, the absolute value of the derivative of the function f must be less than 1 for the scheme to converge.
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 16 ·
Replies
16
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 22 ·
Replies
22
Views
3K
Replies
2
Views
2K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 21 ·
Replies
21
Views
2K