This book presents applications of Newton-like and other similar methods to solve abstract functional equations involving fractional derivatives. It focuses on Banach space-valued functions of a real domain - studied for the first time in the literature. Various issues related to the modeling and analysis of fractional order systems continue to grow in popularity, and the book provides a deeper and more formal analysis of selected issues that are relevant to many areas - including decision-making, complex processes, systems modeling and control - and deeply embedded in the fields of engineering, computer science, physics, economics, and the social and life sciences. The book offers a valuable resource for researchers and graduate students, and can also be used as a textbook for seminars on the above-mentioned subjects. All chapters are self-contained and can be read independently. Further, each chapter includes an extensive list of references.

Together with recent trends in local convergence, semilocal convergence analysis constitutes a natural framework for the theoretical study of iterative methods. This monograph is the first to adequately cover both basic theory and new results in the area. It treats iterative methods for solving nonlinear equations with particular emphasis on theoretical aspects of semilocal convergence of Newton-type methods. An ideal introduction to the field, the book primarily contains research results obtained by the author, extending classical theorems, such as convergence results under weaker hypothesis, enlargement of the radius of convergence, improvements of certain constants or bounds.

In this monograph the authors present Newton-type, Newton-like and other numerical methods, which involve fractional derivatives and fractional integral operators, for the first time studied in the literature. All for the purpose to solve numerically equations whose associated functions can be also non-differentiable in the ordinary sense. That is among others extending the classical Newton method theory which requires usual differentiability of function. Chapters are self-contained and can be read independently and several advanced courses can be taught out of this book. An extensive list of references is given per chapter. The book's results are expected to find applications in many areas of applied mathematics, stochastics, computer science and engineering. As such this monograph is suitable for researchers, graduate students, and seminars of the above subjects, also to be in all science and engineering libraries.

In this short monograph Newton-like and other similar numerical methods with applications to solving multivariate equations are developed, which involve Caputo type fractional mixed partial derivatives and multivariate fractional Riemann-Liouville integral operators. These are studied for the first time in the literature. The chapters are self-contained and can be read independently. An extensive list of references is given per chapter. The book's results are expected to find applications in many areas of applied mathematics, stochastics, computer science and engineering. As such this short monograph is suitable for researchers, graduate students, to be used in graduate classes and seminars of the above subjects, also to be in all science and engineering libraries.

The theory and applications of Iteration Methods is a very fast-developing field of numerical analysis and computer methods. The second edition is completely updated and continues to present the state-of-the-art contemporary theory of iteration methods with practical applications, exercises, case studies, and examples of where and how they can be used. The Theory and Applications of Iteration Methods, Second Edition includes newly developed iteration methods taking advantage of the most recent technology (computers, robots, machines). It extends the applicability of well-established methods by increasing the convergence domain and offers sharper error tolerance. New proofs and ideas for handling convergence are introduced along with a new variety of story problems picked from diverse disciplines. This new edition is for researchers, practitioners, and students in engineering, economics, and computational sciences.

This book introduces advanced numerical-functional analysis to beginning computer science researchers. The reader is assumed to have had basic courses in numerical analysis, computer programming, computational linear algebra, and an introduction to real, complex, and functional analysis. Although the book is of a theoretical nature, each chapter contains several new theoretical results and important applications in engineering, in dynamic economics systems, in input-output system, in the solution of nonlinear and linear differential equations, and optimization problem.

Polynomial operators are a natural generalization of linear operators. Equations in such operators are the linear space analog of ordinary polynomials in one or several variables over the fields of real or complex numbers. Such equations encompass a broad spectrum of applied problems including all linear equations. Often the polynomial nature of many nonlinear problems goes unrecognized by researchers. This is more likely due to the fact that polynomial operators - unlike polynomials in a single variable - have received little attention. Consequently, this comprehensive presentation is needed, benefiting those working in the field as well as those seeking information about specific results or techniques. Polynomial Operator Equations in Abstract Spaces and Applications - an outgrowth of fifteen years of the author's research work - presents new and traditional results about polynomial equations as well as analyzes current iterative methods for their numerical solution in various general space settings. Topics include: Special cases of nonlinear operator equations Solution of polynomial operator equations of positive integer degree n Results on global existence theorems not related with contractions Galois theory Polynomial integral and polynomial differential equations appearing in radiative transfer, heat transfer, neutron transport, electromechanical networks, elasticity, and other areas Results on the various Chandrasekhar equations Weierstrass theorem Matrix representations Lagrange and Hermite interpolation Bounds of polynomial equations in Banach space, Banach algebra, and Hilbert space The materials discussed can be used for the following studies Advanced numerical analysis Numerical functional analysis Functional analysis Approximation theory Integral and differential equation

Polynomial operators are a natural generalization of linear operators. Equations in such operators are the linear space analog of ordinary polynomials in one or several variables over the fields of real or complex numbers. Such equations encompass a broad spectrum of applied problems including all linear equations. Often the polynomial nature of many nonlinear problems goes unrecognized by researchers. This is more likely due to the fact that polynomial operators - unlike polynomials in a single variable - have received little attention. Consequently, this comprehensive presentation is needed, benefiting those working in the field as well as those seeking information about specific results or techniques.
Polynomial Operator Equations in Abstract Spaces and Applications - an outgrowth of fifteen years of the author's research work - presents new and traditional results about polynomial equations as well as analyzes current iterative methods for their numerical solution in various general space settings.
Topics include:
o Special cases of nonlinear operator equations
o Solution of polynomial operator equations of positive integer degree n
o Results on global existence theorems not related with contractions
o Galois theory
o Polynomial integral and polynomial differential equations appearing in radiative transfer, heat transfer, neutron transport, electromechanical networks, elasticity, and other areas
o Results on the various Chandrasekhar equations
o Weierstrass theorem
o Matrix representations
o Lagrange and Hermite interpolation
o Bounds of polynomial equations in Banach space, Banach algebra, and Hilbert space
The materials discussed can be used for the following studies
o Advanced numerical analysis
o Numerical functional analysis
o Functional analysis
o Approximation theory
o Integral and differential equations
Tables include
o Numerical solutions for Chandrasekhar's equation I to VI
o Error bounds comparison
o Accelerations schemes I and II for Newton's method
o Newton's method
o Secant method
The self-contained text thoroughly details results, adds exercises for each chapter, and includes several applications for the solution of integral and differential equations throughout every chapter.

In this monograph the authors present Newton-type, Newton-like and other numerical methods, which involve fractional derivatives and fractional integral operators, for the first time studied in the literature. All for the purpose to solve numerically equations whose associated functions can be also non-differentiable in the ordinary sense. That is among others extending the classical Newton method theory which requires usual differentiability of function. Chapters are self-contained and can be read independently and several advanced courses can be taught out of this book. An extensive list of references is given per chapter. The book's results are expected to find applications in many areas of applied mathematics, stochastics, computer science and engineering. As such this monograph is suitable for researchers, graduate students, and seminars of the above subjects, also to be in all science and engineering libraries.

In this short monograph Newton-like and other similar numerical methods with applications to solving multivariate equations are developed, which involve Caputo type fractional mixed partial derivatives and multivariate fractional Riemann-Liouville integral operators. These are studied for the first time in the literature. The chapters are self-contained and can be read independently. An extensive list of references is given per chapter. The book's results are expected to find applications in many areas of applied mathematics, stochastics, computer science and engineering. As such this short monograph is suitable for researchers, graduate students, to be used in graduate classes and seminars of the above subjects, also to be in all science and engineering libraries.

This monograph is devoted to a comprehensive treatment of iterative methods for solving nonlinear equations with particular emphasis on semi-local convergence analysis. Theoretical results are applied to engineering, dynamic economic systems, input-output systems, nonlinear and linear differential equations, and optimization problems. Accompanied by many exercises, some with solutions, the book may be used as a supplementary text in the classroom for an advanced course on numerical functional analysis.

Numerous problems from diverse disciplines can be converted using mathematical modelling to an equation defined on suitable abstract spaces usually involving the n-dimensional Euclidean space or Hilbert space or Banach Space or even more general spaces. The solution of these equations is sought in closed form. But this is possible only in special cases. That is why researchers and practitioners use algorithms which seems to be the only alternative. Due to the explosion of technology, scientific and parallel computing, faster and faster computers become available. This development simply means that new optimized algorithms should be developed to take advantage of these improvements. There is exactly where we come in with our book containing such algorithms with application especially in problems from Economics but also from other areas such as Mathematical: Biology, Chemistry, Physics, Scientific, Parallel Computing, and also Engineering. The book can be used by senior undergraduate students, graduate students, researchers and practitioners in the aforementioned area in the classroom or as a reference material. Readers should know the fundamentals of numerical functional analysis, economic theory, and Newtonian physics. Some knowledge of computers and contemporary programming shall be very helpful to the readers.

These books are intended for undergraduate, graduate researchers and practitioners in computational sciences, and as reference books for an advanced computational methods course. We have included new results for iterative procedures in abstract spaces general enough for handling inverse problems in various situations related to real life problems through mathematical modeling. These books contain a plethora of updated bibliography and provide comparison between various investigations made in recent years in the field of computational mathematics in the wide sense. Iterative processes are the tools used to generate sequences approximating solutions of equations describing the real life problems stated above and others originating from biosciences, engineering, mathematical economics, mathematical biology, mathematical chemistry, mathematical physics medicine, mathematical programming, and other disciplines. These books also provide, recent advancements on the study of iterative procedures, and can be used as a source from which one can obtain the proper method to use in order to solve a problem. The books require a fundamental background in mathematical statistics, linear algebra and numerical analysis. It may be used as a self-study reference or as a supplementary text for an advanced course in biosciences, engineering and computational sciences.

This book is intended for undergraduate and graduate researchers and practitioners in computational sciences and as a reference book for an advanced computational methods course. We have included new results for iterative procedures in abstract spaces general enough for handling inverse problems in various situations related to real-life problems through mathematical modeling. The book contains a plethora of updated bibliography and provides comparison between various investigations made in recent years in the field of computational mathematics in the wide sense. Iterative processes are the tools used to generate sequences approximating solutions of equations describing the real-life problems stated above and others originating from Biosciences, Engineering, Mathematical Economics, Mathematical Biology, Mathematical Chemistry, Mathematical Physics Medicine, Mathematical Programming, and other disciplines. The book also provides recent advancements on the study of iterative procedures and can be used as a source from which one can obtain the proper method to use in order to solve a problem. The book requires a fundamental background in Mathematical Statistics, Linear Algebra and Numerical Analysis. It may be used as a self-study reference or as a supplementary text for an advanced course in Biosciences, Engineering and Computational Sciences.

It is a well-known fact that iterative methods have been studied concerning problems where mathematicians cannot find a solution in a closed form. There exist methods with different behaviors when they are applied to different functions and methods with higher order of convergence, methods with great zones of convergence, methods which do not require the evaluation of any derivative, and optimal methods among others. It should come as no surprise, therefore, that researchers are developing new iterative methods frequently. Once these iterative methods appear, several researchers study them in different terms: convergence conditions, real dynamics, complex dynamics, optimal order of convergence, etc. These phenomena motivated the authors to study the most used and classical ones, for example Newton's method, Halleys method and/or its derivative-free alternatives. Related to the convergence of iterative methods, the most well-known conditions are the ones created by Kantorovich, who developed a theory which has allowed many researchers to continue and experiment with these conditions. Many authors in recent years have studied modifications of these conditions related, for example, to centered conditions, omega-conditions and even convergence in Hilbert spaces. In this monograph, the authors present their complete work done in the past decade in analysing convergence and dynamics of iterative methods. It is the natural outgrowth of their related publications in these areas. Chapters are self-contained and can be read independently. Moreover, an extensive list of references is given in each chapter in order to allow the reader to use the previous ideas. For these reasons, the authors think that several advanced courses can be taught using this book. The book's results are expected to help find applications in many areas of applied mathematics, engineering, computer science and real problems. As such, this monograph is suitable to researchers, graduate students and seminar instructors in the above subjects. The authors believe it would also make an excellent addition to all science and engineering libraries.

Numerous problems from diverse disciplines can be converted using mathematical modelling to an equation defined on suitable abstract spaces usually involving the n-dimensional Euclidean space or Hilbert space or Banach Space or even more general spaces. The solution of these equations is sought in closed form. But this is possible only in special cases. That is why researchers and practitioners use iterative algorithms, which seem to be the only alternative. Due to the explosion of technology, faster and faster computers become available. This development simply means that new optimised algorithms should be developed to take advantage of these improvements. That is exactly where we come in with our book containing such algorithms with applications in problems from numerical analysis and economics but also from other areas such as biology, chemistry, physics, parallel computing, and engineering. The book is an outgrowth of scientific research conducted over two years. This book can be used by senior undergraduate students, graduate students, researchers, and practitioners in the aforementioned areas in the classroom or as reference material. Readers should know the fundamentals of numerical-functional analysis, economic theory, and Newtonian physics. Some knowledge of computers and contemporary programming shall be very helpful to readers.

The exponential growth of technology forces all disciplines to adjust accordingly, so they can meet the demands of a very dynamic world that heavily depends upon it. Therefore, mathematics cannot be an exception. In fact, mathematics should be the first to adjust and in fact it is. In this volume, which is a continuation of the previous three under the same title, we present state-of-the-art iterative methods for solving equations related to concrete problems from diverse areas such as applied mathematics, mathematical: biology, chemistry, economics, physics and also engineering to mention a few. Most of these methods are new and a few are old but still very popular. One major problem with iterative methods is that the convergence domain is small in general. We have introduced a technique that finds a smaller set than before containing the iterates leading to tighter Lipschitz functions than before. This way and under the same computational effort, we derive: weaker sufficient convergence criteria (leading to a wider choice of initial points); tighter error bounds on the distances involved (i.e., fewer iterates are needed to obtain a desired predetermined accuracy), and a more precise information on the location of the solution. These advantages are considered major achievements in computational disciplines. The volume requires knowledge of linear algebra, numerical functional analysis and familiarity with contemporary computing programing. It can be used by researchers, practitioners, senior undergraduate and graduate students as a source material or as a required textbook in the classroom.

This book is dedicated to the approximation of solutions of nonlinear equations using iterative methods. The study about convergence matter of iterative methods is usually based on two categories: semi-local and local convergence analysis. The semi-local convergence category is, based on the information around an initial point, to provide criteria ensuring the convergence of the method; while the local one is, based on the information around a solution, to find estimates of the radii of the convergence balls. The book is divided into two volumes. The chapters in each volume are self-contained so they can be read independently. Each chapter contains semi-local and local convergence results for single, multi-step and multi-point old and new contemporary iterative methods involving Banach, Hilbert or Euclidean valued operators. These methods are used to generate a sequence defined on the aforementioned spaces that converges with a solution of a nonlinear equation, an inverse problem or an ill-posed problem. It is worth mentioning that most problems in computational and related disciplines can be brought in the form of an equation using mathematical modelling. The solutions of equations can be found in analytical form only in special cases. Hence, it is very important to study the convergence of iterative methods. The book is a valuable tool for researchers, practitioners, graduate students, and can also be used as a textbook for seminars in all computational and related disciplines.

This book is dedicated to the approximation of solutions of nonlinear equations using iterative methods. The study about convergence matter of iterative methods is usually based on two categories: semi-local and local convergence analysis. The semi-local convergence category is, based on the information around an initial point, to provide criteria ensuring the convergence of the method; while the local one is, based on the information around a solution, to find estimates of the radii of the convergence balls. The book is divided into two volumes. The chapters in each volume are self-contained so they can be read independently. Each chapter contains semi-local and local convergence results for single, multi-step and multi-point old and new contemporary iterative methods involving Banach, Hilbert or Euclidean valued operators. These methods are used to generate a sequence defined on the aforementioned spaces that converges with a solution of a nonlinear equation, an inverse problem or an ill-posed problem. It is worth mentioning that most problems in computational and related disciplines can be brought in the form of an equation using mathematical modelling. The solutions of equations can be found in analytical form only in special cases. Hence, it is very important to study the convergence of iterative methods. The book is a valuable tool for researchers, practitioners, graduate students, and can also be used as a textbook for seminars in all computational and related disciplines.

The most commonly used solutions methods are iterative, when starting from one or several initial approximations a sequence is constructed, which converges to a solution of the equation. Iteration methods are applied also for solving optimisation problems. In such cases the iteration sequences converge to an optimal solution of the problem at hand. Since all of these methods have the same recursive structure, they can be introduced and discussed in a general framework. This book examines new results that find applications in engineering, in dynamic economic systems, in input-output systems, in the solution of non-linear and linear differential equations and optimisation problems.

This self-contained treatment offers a contemporary and systematic development of the theory and application of Newton methods, which are undoubtedly the most effective tools for solving equations appearing in computational sciences. Its focal point resides in an exhaustive analysis of the convergence properties of several Newton variants used in connection to specific real life problems originated from astrophysics, engineering, mathematical economics and other applied areas. What distinguishes this book from others is the fact that the weak convergence conditions inaugurated here allow for a wider applicability of Newton methods; finer error bounds on the distances involved, and a more precise information on the location of the solution.These factors make this book ideal for researchers, practitioners and students.