Transcendental equations arise in every branch of science and engineering. While most of these equations are easy to solve, some are not, and that is where this book serves as the mathematical equivalent of a skydiver's reserve parachute--not always needed, but indispensible when it is. The author's goal is to teach the art of finding the root of a single algebraic equation or a pair of such equations.

Transcendental equations arise in every branch of science and engineering. While most of these equations are easy to solve, some are not, and that is where this book serves as the mathematical equivalent of a skydiver's reserve parachute?not always needed, but indispensable when it is. The author?s goal is to teach the art of finding the root of a single algebraic equation or a pair of such equations. Solving Transcendental Equations is unique in that it is the first book to describe the Chebyshev-proxy rootfinder, which is the most reliable way to find all zeros of a smooth function on the interval, and the very reliable spectrally enhanced Weyl bisection/marching triangles method for bivariate rootfinding, and it includes three chapters on analytical methods?explicit solutions, regular pertubation expansions, and singular perturbation series (including hyperasymptotics)?unlike other books that give only numerical algorithms for solving algebraic and transcendental equations. This book is written for specialists in numerical analysis and will also appeal to mathematicians in general. It can be used for introductory and advanced numerical analysis classes, and as a reference for engineers and others working with difficult equations.

Finding the roots of an equation F(x)=0 when F(x) involves transcendental functions and x is complex usually involves some kind of search method. The efficiency of a search method depends to a certain extent on knowledge of the roots--where they are likely to occur in the x plane, and how many there are. If a root is known to lie in a given region in the x plane, then a search routine can quickly find the root to the desired accuracy. But if no information about the location of the roots is available, a search over a wide area must be conducted, and this can be time consuming and expensive. Consequently, a method for locating the general area of the roots and determining the pattern of the roots is very valuable. The report describes a simple method for graphically displaying the pattern of roots in the complex plane. (Modified author abstract).

A simple, general method of solving transcendental equations is presented. Quantitative relations concerning the rate of convergence of the process are developed, and several examples are worked.

The aim of this book is to handle different application problems of science and engineering using expert Artificial Neural Network (ANN). As such, the book starts with basics of ANN along with different mathematical preliminaries with respect to algebraic equations. Then it addresses ANN based methods for solving different algebraic equations viz. polynomial equations, diophantine equations, transcendental equations, system of linear and nonlinear equations, eigenvalue problems etc. which are the basic equations to handle the application problems mentioned in the content of the book. Although there exist various methods to handle these problems, but sometimes those may be problem dependent and may fail to give a converge solution with particular discretization. Accordingly, ANN based methods have been addressed here to solve these problems. Detail ANN architecture with step by step procedure and algorithm have been included. Different example problems are solved with respect to various application and mathematical problems. Convergence plots and/or convergence tables of the solutions are depicted to show the efficacy of these methods. It is worth mentioning that various application problems viz. Bakery problem, Power electronics applications, Pole placement, Electrical Network Analysis, Structural engineering problem etc. have been solved using the ANN based methods.