Researchers are faced with the problem of solving a variety of equations in the course of their work in engineering, economics, physics, and the computational sciences. This book focuses on a new and improved local-semilocal and monotone convergence analysis of efficient numerical methods for computing approximate solutions of such equations, under weaker hypotheses than in other works. This particular feature is the main strength of the book when compared with others already in the literature.The explanations and applications in the book are detailed enough to capture the interest of curious readers and complete enough to provide the necessary background material to go further into the subject.

This work presents lines of investigation and scientific achievements of the Ukrainian school of optimization theory and adjacent disciplines. These include the development of approaches to mathematical theories, methodologies, methods, and application systems for the solution of applied problems in economy, finances, energy saving, agriculture, biology, genetics, environmental protection, hardware and software engineering, information protection, decision making, pattern recognition, self-adapting control of complicated objects, personnel training, etc. The methods developed include sequential analysis of variants, nondifferential optimization, stochastic optimization, discrete optimization, mathematical modeling, econometric modeling, solution of extremum problems on graphs, construction of discrete images and combinatorial recognition, etc. Some of these methods became well known in the world's mathematical community and are now known as classic methods.

This volume presents a unified approach to constructing iterative methods for solving irregular operator equations and provides rigorous theoretical analysis for several classes of these methods. The analysis of methods includes convergence theorems as well as necessary and sufficient conditions for their convergence at a given rate. The principal groups of methods studied in the book are iterative processes based on the technique of universal linear approximations, stable gradient-type processes, and methods of stable continuous approximations. Compared to existing monographs and textbooks on ill-posed problems, the main distinguishing feature of the presented approach is that it doesn’t require any structural conditions on equations under consideration, except for standard smoothness conditions. This allows to obtain in a uniform style stable iterative methods applicable to wide classes of nonlinear inverse problems. Practical efficiency of suggested algorithms is illustrated in application to inverse problems of potential theory and acoustic scattering. The volume can be read by anyone with a basic knowledge of functional analysis. The book will be of interest to applied mathematicians and specialists in mathematical modeling and inverse problems.

Many problems in science, technology and engineering are posed in the form of operator equations of the first kind, with the operator and RHS approximately known. But such problems often turn out to be ill-posed, having no solution, or a non-unique solution, and/or an unstable solution. Non-existence and non-uniqueness can usually be overcome by settling for `generalised' solutions, leading to the need to develop regularising algorithms. The theory of ill-posed problems has advanced greatly since A. N. Tikhonov laid its foundations, the Russian original of this book (1990) rapidly becoming a classical monograph on the topic. The present edition has been completely updated to consider linear ill-posed problems with or without a priori constraints (non-negativity, monotonicity, convexity, etc.). Besides the theoretical material, the book also contains a FORTRAN program library. Audience: Postgraduate students of physics, mathematics, chemistry, economics, engineering. Engineers and scientists interested in data processing and the theory of ill-posed problems.

The twin themes of computational complexity and information pervade this 1998 book. It starts with an introduction to the computational complexity of continuous mathematical models, that is, information-based complexity. This is then used to illustrate a variety of topics, including breaking the curse of dimensionality, complexity of path integration, solvability of ill-posed problems, the value of information in computation, assigning values to mathematical hypotheses, and new, improved methods for mathematical finance. The style is informal, and the goals are exposition, insight and motivation. A comprehensive bibliography is provided, to which readers are referred for precise statements of results and their proofs. As the first introductory book on the subject it will be invaluable as a guide to the area for the many students and researchers whose disciplines, ranging from physics to finance, are influenced by the computational complexity of continuous problems.

This collection of eleven papers covers a broad spectrum of topics in analysis, from the study of certain classes of analytic functions to the solvability of singular problems for differential and integral equations to computational schemes for the partial differential equations and singular integral equations.

This book considers problems of optimization arising in the design of electromagnetic radiators and receivers, presenting a systematic general theory applicable to a wide class of structures. The theory is illustrated with examples, and indications of how the results can be applied to more complicated structures. The final chapter introduces techniques from multicriteria optimization in antenna design. References to mathematics and engineering literature guide readers through the necessary mathematical background.