Znalezione w sieci
Modern Computer Arithmetic
Data: 2011-09-22, Autor: Richard P. Brent, Paul Zimmermann - LORIA, 2009, Dział: Metody numeryczneThis book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics, researchers in discrete mathematics, computer algebra, number theory, cryptography, and developers of multiple-precision libraries.
WięcejComputational Geometry: Methods and Applications
Data: 2011-09-22, Autor: Jianer Chen, 1996, Dział: Metody numeryczne
In this book, we concentrate on four major directions in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems. Computational geometry is of practical importance because Euclidean space of two and three dimensions forms the arena in which real physical objects are arranged. A large number of applications areas such as pattern recognition, computer graphics, image processing, operations research, statistics, computer-aided design, robotics, etc., have been the incubation bed of the discipline since they provide inherently geo metric problems for which efficient algorithms have to be developed. A large number of manufacturing problems involve wire layout, facilities location, cutting-stock and related geometric optimization problems. Solving these efficiently on a high-speed computer requires the development of new geo metrical tools, as well as the application of fast-algorithm techniques, and is not simply a matter of translating well-known theorems into computer programs. From a theoretical standpoint, the complexity of geometric algo rithms is of interest because it sheds new light on the intrinsic difficulty of computation.
WięcejAlgorithms and Complexity
Data: 2011-09-22, Autor: Herbert S. Wilf - AK Peters, Ltd., 1994, Dział: Metody numeryczne
This is an introductory textbook, suitable for classroom use, on the design and analysis of algorithms, complexity, methods for solving problems on computers and the costs (usually in running time) of using those methods.
WięcejAlgorithms for Programmers: Ideas and Source Code
Data: 2011-09-22, Autor: Jeff Erickson - University of Illinois at Urbana-Champaign, 2009, Dział: Metody numeryczneThis course packet includes lecture notes, homework questions, and exam questions from algorithms courses the author taught at the University of Illinois at Urbana-Champaign. For the most part, these notes assume that the reader has mastered the material covered in the first two years of a typical undergraduate computer science curriculum.
WięcejAlgorithms for Programmers: Ideas and Source Code
Data: 2011-09-22, Autor: S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani - McGraw-Hill, 2006, Dział: Metody numeryczne
This book evolved over the past ten years from a set of lecture notes developed by the authors while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego. Instead of dwelling on formal proofs, this book distills in each case the crisp mathematical idea that makes the algorithm work. In other words, this book emphasizes rigor over formalism. Undergraduate students in Computer Science should be much more receptive to mathematical rigor of this form.
WięcejAlgorithmic Mathematics
Data: 2011-09-22, Autor: Leonard Soicher, Franco Vivaldi, 2004, Dział: Metody numeryczne
This text contains sufficient material for a one-semester course in mathematical algorithms, for second year mathematics students. The course requires some exposure to the basic concepts of discrete mathematics, but no computing experience. The aim of this course is twofold. Firstly, to introduce the basic algorithms for computing exactly with integers, polynomials and vector spaces. In doing so, the student is expected to learn how to think algorithmically and how to design and analyze algorithms. Secondly, to provide a constructive approach to abstract mathematics, algebra in particular. When introducing the elements of ring and field theory, algorithms offer concrete tools, constructive proofs, and a crisp environment where the benefits of rigour and abstraction become tangible. We shall write algorithms in a straightforward language, which incorporates freely standard mathematical notation. The specialized constructs are limited to the if-structure and the while-loop, which are universal.
Więcej