Problems With A Point

"Ever notice how people sometimes use math words inaccurately? Or how sometimes you instinctively know a math statement is false (or not known)? Each chapter of this book makes a point like those above and then illustrates the point by doing some real mathematics through step-by-step mathematical techniques. This book gives readers valuable information about how mathematics and theoretical computer science work, while teaching them some actual mathematics and computer science through examples and exercises. Much of the mathematics could be understood by a bright high school student. The points made can be understood by anyone with an interest in math, from the bright high school student to a Field's medal winner."--

Ever notice how people sometimes use math words inaccurately? Or how sometimes you instinctively know a math statement is false (or not known)?Each chapter of this book makes a point like those above and then illustrates the point by doing some real mathematics through step-by-step mathematical techniques.This book gives readers valuable information about how mathematics and theoretical computer science work, while teaching them some actual mathematics and computer science through examples and exercises. Much of the mathematics could be understood by a bright high school student. The points made can be understood by anyone with an interest in math, from the bright high school student to a Field's medal winner.

"Fixed-Point Algorithms for Inverse Problems in Science and Engineering" presents some of the most recent work from top-notch researchers studying projection and other first-order fixed-point algorithms in several areas of mathematics and the applied sciences. The material presented provides a survey of the state-of-the-art theory and practice in fixed-point algorithms, identifying emerging problems driven by applications, and discussing new approaches for solving these problems. This book incorporates diverse perspectives from broad-ranging areas of research including, variational analysis, numerical linear algebra, biotechnology, materials science, computational solid-state physics, and chemistry. Topics presented include: Theory of Fixed-point algorithms: convex analysis, convex optimization, subdifferential calculus, nonsmooth analysis, proximal point methods, projection methods, resolvent and related fixed-point theoretic methods, and monotone operator theory. Numerical analysis of fixed-point algorithms: choice of step lengths, of weights, of blocks for block-iterative and parallel methods, and of relaxation parameters; regularization of ill-posed problems; numerical comparison of various methods. Areas of Applications: engineering (image and signal reconstruction and decompression problems), computer tomography and radiation treatment planning (convex feasibility problems), astronomy (adaptive optics), crystallography (molecular structure reconstruction), computational chemistry (molecular structure simulation) and other areas. Because of the variety of applications presented, this book can easily serve as a basis for new and innovated research and collaboration.

The explosive development of information science and technology puts in new problems involving statistical data analysis. These problems result from higher re quirements concerning the reliability of statistical decisions, the accuracy of math ematical models and the quality of control in complex systems. A new aspect of statistical analysis has emerged, closely connected with one of the basic questions of cynergetics: how to "compress" large volumes of experimental data in order to extract the most valuable information from data observed. De tection of large "homogeneous" segments of data enables one to identify "hidden" regularities in an object's behavior, to create mathematical models for each seg ment of homogeneity, to choose an appropriate control, etc. Statistical methods dealing with the detection of changes in the characteristics of random processes can be of great use in all these problems. These methods have accompanied the rapid growth in data beginning from the middle of our century. According to a tradition of more than thirty years, we call this sphere of statistical analysis the "theory of change-point detection. " During the last fifteen years, we have witnessed many exciting developments in the theory of change-point detection. New promising directions of research have emerged, and traditional trends have flourished anew. Despite this, most of the results are widely scattered in the literature and few monographs exist. A real need has arisen for up-to-date books which present an account of important current research trends, one of which is the theory of non parametric change--point detection.

This book provides essential lecture notes on solving large linear saddle-point systems, which arise in a wide range of applications and often pose computational challenges in science and engineering. The focus is on discussing the particular properties of such linear systems, and a large selection of algebraic methods for solving them, with an emphasis on iterative methods and preconditioning. The theoretical results presented here are complemented by a case study on potential fluid flow problem in a real world-application. This book is mainly intended for students of applied mathematics and scientific computing, but also of interest for researchers and engineers working on various applications. It is assumed that the reader has completed a basic course on linear algebra and numerical mathematics.

Problems of Point Blast Theory covers all the main topics of modern theory with the exception of applications to nova and supernova outbursts. All the presently known theoretical results are given and problems which are still to be resolved are indicated. A special feature of the book is the sophisticated mathematical approach. Of interest to specialists and graduate students working in hydrodynamics, explosion theory, plasma physics, mathematical physics, and applied mathematics.

This book introduces the method of lower and upper solutions for ordinary differential equations. This method is known to be both easy and powerful to solve second order boundary value problems. Besides an extensive introduction to the method, the first half of the book describes some recent and more involved results on this subject. These concern the combined use of the method with degree theory, with variational methods and positive operators. The second half of the book concerns applications. This part exemplifies the method and provides the reader with a fairly large introduction to the problematic of boundary value problems. Although the book concerns mainly ordinary differential equations, some attention is given to other settings such as partial differential equations or functional differential equations. A detailed history of the problem is described in the introduction. · Presents the fundamental features of the method· Construction of lower and upper solutions in problems· Working applications and illustrated theorems by examples· Description of the history of the method and Bibliographical notes

For graduate students and research mathematicians interested in partial differential equations and who have a basic knowledge of functional analysis. Restricted to boundary value problems formed by differential operators, avoiding the use of pseudo- differential operators. Concentrates on fundamental results such as estimates for solutions in different function spaces, the Fredholm property of the problem's operator, regularity assertions, and asymptotic formulas for the solutions of near singular points. Considers the solutions in Sobolev spaces of both positive and negative orders. Annotation copyrighted by Book News, Inc., Portland, OR

Iterative methods for finding fixed points of non-expansive operators in Hilbert spaces have been described in many publications. In this monograph we try to present the methods in a consolidated way. We introduce several classes of operators, examine their properties, define iterative methods generated by operators from these classes and present general convergence theorems. On this basis we discuss the conditions under which particular methods converge. A large part of the results presented in this monograph can be found in various forms in the literature (although several results presented here are new). We have tried, however, to show that the convergence of a large class of iteration methods follows from general properties of some classes of operators and from some general convergence theorems.