|
||||||||||||
if(isset($title)){?> }?> if(isset($author)){?> }?> |
Paper's Title:
Scope of the Logarithmic Mean
Author(s):
Murali Rao and Agnish Dey
Department of Mathematics,
University of Florida,
1400 Stadium Road, Gainesville,
Florida 32611,
U. S. A.
E-mail: mrao@ufl.edu
URL: http://people.clas.ufl.edu/mrao
E-mail: agnish@ufl.edu
URL: http://people.clas.ufl.edu/agnish
Abstract:
A number a is between two numbers x and y if and only if a is a convex combination of x and y, in other words, it is a "weighted mean" of x and y. Geometric mean, arithmetic mean are well known examples of these "means". Of more recent vintage is the logarithmic mean which has been considered in many articles in the literature. In this note, we first discuss some of its properties. Then we shall introduce the L function and explore the inverse of this function and its connection with the Lambert's Omega function.
Paper's Title:
Some New Inequalities of Hermite-Hadamard and Fejér Type for Certain Functions with Higher Convexity
Author(s):
Steven G. From
Department of Mathematics,
University of Nebraska at Omaha,
Omaha, Nebraska 68182-0243,
U.S.A.
E-mail: sfrom@unomaha.edu
Abstract:
In this paper, we present some new inequalities of Hermite-Hadamard or Fejér
type for certain functions satisfying some higher convexity conditions on one or
more derivatives.
An open problem is given also.
Some applications to the logarithmic mean are given.
Paper's Title:
Convergence Speed of Some Random Implicit-Kirk-type Iterations for Contractive-type Random Operators
Author(s):
H. Akewe, K.S. Eke
Department of Mathematics,
Covenant University,
Canaanland, KM 10, Idiroko Road, P. M. B. 1023, Ota, Ogun State,
Nigeria.
E-mail: hudson.akewe@covenantuniversity.edu.ng,
kanayo.eke@covenantuniversity.edu.ng
Abstract:
The main aim of this paper is to introduce a stochastic version of multistep type iterative scheme called a modified random implicit-Kirk multistep iterative scheme and prove strong convergence and stability results for a class of generalized contractive-type random operators. The rate of convergence of the random iterative schemes are also examined through an example. The results show that our new random implicit kirk multistep scheme perform better than other implicit iterative schemes in terms of convergence and thus have good potentials for further applications in equilibrium problems in computer science, physics and economics.
Paper's Title:
Higher Order Accurate Compact Schemes for Time Dependent Linear and Nonlinear Convection-Diffusion Equations
Author(s):
S. Thomas, Gopika P.B. and S. K. Nadupuri
Department of Mathematics
National Institute of Technology Calicut
Kerala
673601
India.
E-mail:
sobinputhiyaveettil@gmail.com
pbgopika@gmail.com nsk@nitc.ac.in
Abstract:
The primary objective of this work is to study higher order compact finite difference schemes for finding the numerical solution of convection-diffusion equations which are widely used in engineering applications. The first part of this work is concerned with a higher order exponential scheme for solving unsteady one dimensional linear convection-diffusion equation. The scheme is set up with a fourth order compact exponential discretization for space and cubic $C^1$-spline collocation method for time. The scheme achieves fourth order accuracy in both temporal and spatial variables and is proved to be unconditionally stable. The second part explores the utility of a sixth order compact finite difference scheme in space and Huta's improved sixth order Runge-Kutta scheme in time combined to find the numerical solution of one dimensional nonlinear convection-diffusion equations. Numerical experiments are carried out with Burgers' equation to demonstrate the accuracy of the new scheme which is sixth order in both space and time. Also a sixth order in space predictor-corrector method is proposed. A comparative study is performed of the proposed schemes with existing predictor-corrector method. The investigation of computational order of convergence is presented.
Search and serve lasted 0 second(s).