Inverse Iterative Methods for Solving Nonlinear Equations
Journal Title: Mathematical and Software Engineering - Year 2015, Vol 1, Issue 1
Abstract
In his work we present an approach for obtaining new iterative methods for solving nonlinear equations. This approach can be applicable to arbitrary iterative process which is linearly or quadratically convergent. Analysis of convergence of the new methods demonstrates that the new method preserve the convergence conditions of primitive functions. Numerical examples are given to illustrate the efficiency and performance of presented methods.
Authors and Affiliations
Gyurhan Nedzhibov
Determination of Atmospheric Effective Earth Radius Factor (k-factor) Under Clear Air in Lagos, Nigeria
Due to it cost effectiveness and ease of accessibility, as well as adaptability, radio wave communication at microwave frequencies has earned enormous attention over time. Importantly, secondary radio variables remained...
Modelling and Forecasting of Residential Electricity Consumption in Nigeria Using Multiple Linear Regression Model and Quadratic Regression Model with Interactions
In this paper statistical analysis of residential electricity demand in Nigeria is presented. Multiple linear regression model and quadratic regression model with interactions are applied to estimate residential electric...
Investigation of the Performance of Site Diversity through Rain Gauge Measurements in South-South Nigeria
Site diversity is an effective technique to mitigate rain attenuation, especially in regions where rainfall rates are high. The South-South region of Nigeria is characterized by the tropical rain forest climate, exhibiti...
Parametric Analysis of Isolated Doubled Edged Hill Diffraction Loss Based on Rounded Edge Diffraction Loss Method and Different Radius of Curvature Methods
In this paper, parametric analysis of isolated doubled edged hill diffraction loss based on rounded edge diffraction loss method is presented. Particularly, the variation of the diffraction loss due to changes in frequen...
A note on reducing the computation time for minimum distance and equivalence check of binary linear codes
In this paper we show the usability of the Gray code with constant weight words for computing linear combinations of codewords. This can lead to a big improvement of the computation time for finding the minimum distance...