Hasil Pencarian  ::  Simpan CSV :: Kembali

"This monograph deals with aspects of the computer programming process that involve techniques derived from mathematical logic. The author focuses on proving that a given program produces the intended result whenever it halts, that a given program will eventually halt, that a given program is partially correct and terminates, and that a system of rewriting rules always halts. Also, the author describes the intermediate behavior of a given program, and discusses constructing a program to meet a given specification."

"The scope of the discussion is limited to certain types of general purpose computing systems whose characteristics involve multiprogramming, multiprocessors, communication lines serving many users, and on-line terminal systems. The goal is to gain a better understanding of computing systems through the techniques of measurement and performance evaluation."

"Mathematical Optimization and Economic Theory provides a self-contained introduction to and survey of mathematical programming and control techniques and their applications to static and dynamic problems in economics, respectively. It is distinctive in showing the unity of the various approaches to solving problems of constrained optimization that all stem back directly or indirectly to the method of Lagrange multipliers. In the 30 years since its initial publication, there have been many more applications of these mathematical techniques in economics, as well as some advances in the mathematics of programming and control. Nevertheless, the basic techniques remain the same today as when the book was originally published. Thus, it continues to be useful not only to its original audience of advanced undergraduate and graduate students in economics, but also to mathematicians and other researchers who are interested in learning about the applications of the mathematics of optimization to economics.The book is distinctive in that it covers in some depth both static programming problems and dynamic control problems of optimization and the techniques of their solution. It also clearly presents many applications of these techniques to economics, and it shows why optimization is important for economics. Many cchallenging problems for both students and researchers are included."

"A practical handbook for understanding and using fast adaptive composite grid (FAC) methods for discretization and solution of partial differential equations (PDEs). Contains fundamental concepts. These so-called FAC are characterized by their use of a composite grid, which is nominally the union of various uniform grids. FAC is capable of producing a composite grid with tailored resolution, and a corresponding solution with commensurate accuracy, at a cost proportional to the number of composite grid points. Moreover, special asynchronous versions of the fast adaptive composite grid methods (AFAC) studied here have seemingly optimal complexity in a parallel computing environment. Most of the methods treated in this book were discovered only within the last decade, and in many cases their development is still in its infancy. While this is not meant to be comprehensive, it does provide a theoretical and practical guide to multilevel adaptive methods and relevant discretization techniques. It also contains new material, which is included to fill in certain gaps and to expose new avenues of research. Also, because adaptive refinement seems to demand a lot of attention to philosophical issues, personal perspectives are often brought freely into the discussion."

"Multiple Decision Procedures: Theory and Methodology of Selecting and Ranking Populations provides an encyclopedic coverage of the literature in the area of ranking and selection procedures, summarizing and surveying in a unified manner a majority of more than 600 main references in the bibliography. It also deals with related problems, such as the estimation of unknown ordered parameters. A separate chapter is devoted to information about several tables available in the literature for carrying out various specific procedures. Examples are given in another chapter illustrating applications of these procedures in various practical contexts. Although several books have appeared to date in this area, many of them deal with specific aspects of the field and a limited number of topics. This book contains substantial material not discussed in other books."

"Lectures on a unified theory of and practical procedures for the numerical solution of very general classes of linear and nonlinear two point boundary-value problems."

"Developments in optimization theory, including emphasis on large problems and on interior-point methods for linear programming, have begun to appear in production software. Here is a reference tool that includes discussions of these areas and names software packages that incorporate the results of theoretical research. After an introduction to the major problem areas in optimization and an outline of the algorithms used to solve them, a data sheet is presented for each of the 75 software packages and libraries in the authors' survey. These include information on the capabilities of the packages, how to obtain them, and addresses for further information. Standard optimization paradigms are addressed -- linear, quadratic, and nonlinear programming; network optimization; unconstrained and bound-constrained optimization; least-squares problems; nonlinear equations; and integer programming. The most practical algorithms for the major fields of numerical optimization are outlined, and the software packages in which they are implemented are described. This format will aid current and potential users of optimization software in classifying the optimization problem to be solved, determining appropriate algorithms, and obtaining the software that implements those algorithms. Readers need only a basic knowledge of vector calculus and linear algebra to understand this book."

"Originally presented as lectures, the theme of this volume is that one studies orthogonal polynomials and special functions not for their own sake, but to be able to use them to solve problems. The author presents problems suggested by the isometric embedding of projective spaces in other projective spaces, by the desire to construct large classes of univalent functions, by applications to quadrature problems, and theorems on the location of zeros of trigonometric polynomials. There are also applications to combinatorial problems, statistics, and physical problems."

"This book presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretically and algorithmically. It focuses on clarity in algorithmic description and analysis rather than generality, and while it provides pointers to the literature for the most general theoretical results and robust software, the author thinks it is more important that readers have a complete understanding of special cases that convey essential ideas. A companion to Kelley book, Iterative Methods for Linear and Nonlinear Equations (SIAM, 1995), this book contains many exercises and examples and can be used as a text, a tutorial for self-study, or a reference. Iterative Methods for Optimization does more than cover traditional gradient-based optimization: it is the first book to treat sampling methods, including the Hookeeeves, implicit filtering, MDS, and Nelderead schemes in a unified way, and also the first book to make connections between sampling methods and the traditional gradient-methods. Each of the main algorithms in the text is described in pseudocode, and a collection of MATLAB codes is available. Thus, readers can experiment with the algorithms in an easy way as well as implement them in other languages."

"This volume reviews, in the context of partial differential equations, algorithm development that has been specifically aimed at computers that exhibit some form of parallelism. Emphasis is on the solution of PDEs because these are typically the problems that generate high computational demands. The authors discuss architectural features of these computers insomuch as they influence algorithm performance, and provide insight into algorithm characteristics that allow effective use of hardware."