Rational Approximation for Solving an Implicitly Given Colebrook Flow Friction Equation
نویسندگان
چکیده
منابع مشابه
Recognizing implicitly given rational canal surfaces
It is still a challenging task of today to recognize the type of a given algebraic surface which is described only by its implicit representation. In this paper we will investigate in more detail the case of canal surfaces that are often used in geometric modelling, Computer-Aided Design and technical practice (e.g. as blending surfaces smoothly joining two parts with circular ends). It is know...
متن کاملSolution of the Implicit Colebrook Equation for Flow Friction Using Excel
Empirical Colebrook equation implicit in unknown flow friction factor (λ) is an accepted standard for calculation of hydraulic resistance in hydraulically smooth and rough pipes. The Colebrook equation gives friction factor (λ) implicitly as a function of the Reynolds number (Re) and relative roughness (ε/D) of inner pipe surface; i.e. λ0=f(λ0, Re, ε/D). The paper presents a problem that requir...
متن کاملRational Approximation for a Quasilinear Parabolic Equation
Approximation theorems, analogous to known results for linear elliptic equations, are obtained for solutions of the heat equation. Via the Cole-Hopf transformation, this gives rise to approximation theorems for a nonlinear parabolic equation, Burgers’ equation.
متن کاملAn exponential spline for solving the fractional riccati differential equation
In this Article, proposes an approximation for the solution of the Riccati equation based on the use of exponential spline functions. Then the exponential spline equations are obtained and the differential equation of the fractional Riccati is discretized. The effect of performing this mathematical operation is obtained from an algebraic system of equations. To illustrate the benefits of the me...
متن کاملSolving Burgers' Equation Using Optimal Rational Approximations
Abstra t. We solve vis ous Burger's equation using a fast and a urate algorithm referred to here as the redu tion algorithm for omputing near optimal rational approximations. Given a proper rational fun tion with n poles, the redu tion algorithm omputes (for a desired L ∞ -approximation error) a rational approximation of the same form, but with a (near) optimally small number m ≪ n of poles. Al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2019
ISSN: 2227-7390
DOI: 10.3390/math8010026