Comparison of Iterative Methods for the Solution of Compressible-Fluid Reynolds Equation

2011 ◽  
Vol 133 (2) ◽  
Author(s):  
Nenzi Wang ◽  
Shih-Hung Chang ◽  
Hua-Chih Huang
Keyword(s):  
Iterative Method ◽  
Newton’S Method ◽  
Compressible Fluid ◽  
Newton's Method ◽  
Reynolds Equation ◽  
Multigrid Method ◽  
Iterative Solution ◽  
Sor Method ◽  
Solution Methods ◽  
Iterative Solution Methods

This study presents an efficacy comparison of iterative solution methods for solving the compressible-fluid Reynolds equation in modeling air- or gas-lubricated bearings. A direct fixed-point iterative (DFI) method and Newton’s method are employed to transform the Reynolds equation in a form that can be solved iteratively. The iterative solution methods examined are the Gauss–Seidel method, the successive over-relaxation (SOR) method, the preconditioned conjugate gradient (PCG) method, and the multigrid method. The overall solution time is affected by both the transformation method and the iterative method applied. In this study, Newton’s method shows its effectiveness over the straightforward DFI method when the same iterative method is used. It is demonstrated that the use of an optimal relaxation factor is of vital importance for the efficiency of the SOR method. The multigrid method is an order faster than the PCG and optimal SOR methods. Also, the multigrid and PCG methods involve an extended coding work and are less flexible in dealing with gridwork and boundary conditions. Consequently, a compromise has to be made in terms of ease of use as well as programming effort for the solution of the compressible-fluid Reynolds equation.

Efficiency of Solution Methods for Kepler’s Equation

2016 ◽  
Vol 851 ◽  
pp. 587-592
Author(s):  
João Francisco Nunes de Oliveira ◽  
Roberta Veloso Garcia ◽  
Hélio Koiti Kuga ◽  
Estaner Claro Romão
Keyword(s):  
Iterative Method ◽  
Newton’S Method ◽  
Newton's Method ◽  
Kepler's Equation ◽  
Eccentric Orbits ◽  
Kepler’S Equation ◽  
Solution Methods ◽  
Number Of Iterations

This article discusses, in the case of eccentric orbits, some solution methods for Kepler's equation, for instance: Newton's method, Halley method and the solution by Fourire-Bessel expansion. The efficiency of solution methods is evaluated according to the number of iterations that each method needs to lead to a solution within the specified tolerance. The solution using Fourier-Bessel series is not an iterative method, however, it was analyzed the number of terms required to achieve the accuracy of the prescribed solution.

An Efficient Sixth-Order Convergent Newton-Type Iterative Method for Nonlinear Equations

2012 ◽  
Vol 220-223 ◽  
pp. 2585-2588
Author(s):  
Zhong Yong Hu ◽  
Fang Liang ◽  
Lian Zhong Li ◽  
Rui Chen
Keyword(s):  
Iterative Method ◽  
Nonlinear Equations ◽  
Newton’S Method ◽  
Newton's Method ◽  
Efficiency Index ◽  
Sixth Order ◽  
Type Method ◽  
Second Derivatives ◽  
Better Than

In this paper, we present a modified sixth order convergent Newton-type method for solving nonlinear equations. It is free from second derivatives, and requires three evaluations of the functions and two evaluations of derivatives per iteration. Hence the efficiency index of the presented method is 1.43097 which is better than that of classical Newton’s method 1.41421. Several results are given to illustrate the advantage and efficiency the algorithm.

scholarly journals Efficient Preconditioners for Large Scale Binary Cahn-Hilliard Models

2012 ◽  
Vol 12 (1) ◽  
pp. 1-22 ◽  
Author(s):  
Petia Boyanova ◽  
Minh Do-Quang ◽  
Maya Neytcheva
Keyword(s):  
Large Scale ◽  
Iterative Solution ◽  
Flow Problems ◽  
Hilliard Equation ◽  
Finite Element Discretizations ◽  
Solution Methods ◽  
Iterative Solution Methods ◽  
Preconditioned Iterative ◽  
Cahn Hilliard Equation ◽  
Element Discretizations

AbstractIn this work we consider preconditioned iterative solution methods for numerical simulations of multiphase flow problems, modelled by the Cahn-Hilliard equation. We focus on diphasic flows and the construction and efficiency of a preconditioner for the algebraic systems arising from finite element discretizations in space and the θ-method in time. The preconditioner utilises to a full extent the algebraic structure of the underlying matrices and exhibits optimal convergence and computational complexity properties. Various numerical experiments, including large scale examples, are presented as well as performance comparisons with other solution methods.

An Accelerated Iterative Method with Third-Order Convergence

2012 ◽  
Vol 220-223 ◽  
pp. 2658-2661
Author(s):  
Zhong Yong Hu ◽  
Liang Fang ◽  
Lian Zhong Li
Keyword(s):  
Iterative Method ◽  
Fourth Order ◽  
Newton’S Method ◽  
Newton's Method ◽  
New Method ◽  
Order Convergence ◽  
Third Order ◽  
Numerical Examples ◽  
Modified Newton’S Method ◽  
Jarratt Method

We present a new modified Newton's method with third-order convergence and compare it with the Jarratt method, which is of fourth-order. Based on this new method, we obtain a family of Newton-type methods, which converge cubically. Numerical examples show that the presented method can compete with Newton's method and other known third-order modifications of Newton's method.

scholarly journals Superior properties of the PRESB preconditioner for operators on two-by-two block form with square blocks

2020 ◽  
Vol 146 (2) ◽  
pp. 335-368
Author(s):  
Owe Axelsson ◽  
János Karátson
Keyword(s):  
Optimal Control ◽  
Rate Of Convergence ◽  
Large Scale ◽  
Optimal Control Problems ◽  
Iterative Solution ◽  
Control Problems ◽  
Block Form ◽  
Solution Methods ◽  
Preconditioned Matrix ◽  
Iterative Solution Methods

Abstract Matrices or operators in two-by-two block form with square blocks arise in numerous important applications, such as in optimal control problems for PDEs. The problems are normally of very large scale so iterative solution methods must be used. Thereby the choice of an efficient and robust preconditioner is of crucial importance. Since some time a very efficient preconditioner, the preconditioned square block, PRESB method has been used by the authors and coauthors in various applications, in particular for optimal control problems for PDEs. It has been shown to have excellent properties, such as a very fast and robust rate of convergence that outperforms other methods. In this paper the fundamental and most important properties of the method are stressed and presented with new and extended proofs. Under certain conditions, the condition number of the preconditioned matrix is bounded by 2 or even smaller. Furthermore, under certain assumptions the rate of convergence is superlinear.

scholarly journals A fourth order method for finding a simple root of univariate function

2015 ◽  
Vol 34 (2) ◽  
pp. 197-211
Author(s):  
D. Sbibih ◽  
Abdelhafid Serghini ◽  
A. Tijini ◽  
A. Zidna
Keyword(s):  
Iterative Method ◽  
Fourth Order ◽  
Newton’S Method ◽  
Simple Root ◽  
Newton's Method ◽  
Order Method ◽  
Numerical Examples ◽  
Quadratic Interpolation ◽  
Univariate Function ◽  
Fourth Order Method

In this paper, we describe an iterative method for approximating asimple zero $z$ of a real defined function. This method is aessentially based on the idea to extend Newton's method to be theinverse quadratic interpolation. We prove that for a sufficientlysmooth function $f$ in a neighborhood of $z$ the order of theconvergence is quartic. Using Mathematica with its high precisioncompatibility, we present some numerical examples to confirm thetheoretical results and to compare our method with the others givenin the literature.

Sign in / Sign up

Export Citation Format

Share Document