Book Description
Approaching computational statistics through its theoretical aspects can be daunting. Often intimidated or distracted by the theory, researchers and students can lose sight of the actual goals and applications of the subject. What they need are its key concepts, an understanding of its methods, experience with its implementation, and practice with computational software. Focusing on the computational aspects of statistics rather than the theoretical, Computational Statistics Handbook with MATLAB uses a down-to-earth approach that makes statistics accessible to a wide range of users. The authors integrate the use of MATLAB throughout the book, allowing readers to see the actual implementation of algorithms, but also include step-by-step procedures to allow implementation with any suitable software. The book concentrates on the simulation/Monte Carlo point of view, and contains algorithms for exploratory data analysis, modeling, Monte Carlo simulation, pattern recognition, bootstrap, classification, cross-validation methods, probability density estimation, random number generation, and other computational statistics methods. Emphasis on the practical aspects of statistics, details of the latest techniques, and real implementation experience make the Computational Statistics Handbook with MATLAB more than just the first book to use MATLAB to solve computational problems in statistics. It also forms an outstanding, introduction to statistics for anyone in the many disciplines that involve data analysis.
Customer Reviews:
Great hands on hanbook.......2007-01-11
Up to the point - great to have on the shelf for quick consultations. It makes a great textbook to be complemented with specialized papers on the different topics. A must have for anyone doing computational Statistics in Matlab. "Exploratory Data Analysis with MATLAB" by Wendy L. Martinez, Angel R. Martinez is a great follow up volume to this book.
Good Book for me..........2004-06-18
There were a lot of negative comments for this book on Amazon so I sort of held off the purchase of this book. However, last week I ordered the book and quickly realised it is very useful. The book may lack detailed theory but excellent references are scattered throughout if you really want to follow it up. And the book is easy reading and well written with most statistical concepts defined before they are used.
The focus of this book primarily is to explain how to work on statistics using Matlab and it provides a taste of various areas with adequate explanations and code to get started. One advantage of this book is they do not define their own notation but use the notation which is currently in vogue in academia.
If you are starting out in Matlab, are not a statistician and do not have previous experience with other packages (like Splus or R) you should definetly think about getting a copy. If you are a Stats Guru you can just read the toolbox documentation. However note that these authors provide their additional stats toolbox FREE (which is also well written) on the website which contains most of Matlab statistical functions so you could save yourself some money on the Stats toolbox.
Disappointing.......2002-10-11
I think there would be a real interest in a book on "computational statistics" and related topics that showed details of analyses and algorithms using Matlab. This book is expensive and extremely disappointing.The explanations are sparse and very weak and the m.files are usually small add-ons to functions from the Stats Toolbox.
I think in any book on this topic there have to be detailed explanations of how methods work and what their limitations are.Otherwise the reader can find themselves in a lot of trouble very quickly. There is insufficient detail either for a student coming to the topics for the first time or for someone actually wanting to analyse data.
Other books that people might want to have a look at:
1)Statistical Pattern Recognition 2nd edition . Andrew Webb.This is not oriented to any particular language.Good introduction.
2)Netlab. Ian Nabney (this has excellent Matlab functions for neural networks)
3)Modern applied statistics with S 4th edition, Venables and Ripley. This uses a different language (but which will be relatively easy for Matlab users to learn), but learning S or R (free!) makes a huge number of tools available.
4)The recent data mining book by Hand et al. This offers clear and cogent explanations.It is good for someone who does not want overly mathematical descriptions.
I haven't looked properly at the recent Hastie,Friedman and Tibishirani book yet, but you can find reviews on the Amazon page for the book.
Not very useful.......2002-08-28
My major complain was that the authors, in general, did not present algorithms clearly. Limit selections of algorithms did not help either. As a result, you cannot use this book as a reference because it just does not contain enough material. You cannot learn much about computational statistics with this book becuase the statistic methods and algorithms are not adequately presented. you cannot even write codes for your own statistic analysis with the MATLAB examples shown in the book unless you have the Statistics Toolbox.
The only persons that might be benefit from this book are those who don't want to read the Statistics Toolbox manual on line. Given that the Mathworks no longer ship printed manuals, this book may be used a companion of the Statistics Toolbox.
sloppy writing.......2002-07-10
I ordered this book assuming to get something useful, but i got the impression while reading the book that it is like a collection of notes from other books, wrapped with some matlab code. More worrying to me was that the mathematics makes a sloppy impression. For me that means I cannot grab the book to lookup something and use the code without having to be concerned on the validity. The bottomline being I will not use it for applications and the book is a waste of money.
Average customer rating:
|
Handbook of Computational Statistics
J.E. Gentle , and
Wolfgang HSrdle
Manufacturer: Springer
ProductGroup: Book
Binding: Hardcover
General
| Algorithms
| Programming
| Computers & Internet
| Subjects
| Books
General
| Biology
| Biological Sciences
| Science
| Subjects
| Books
Bioinformatics
| Biological Sciences
| Science
| Subjects
| Books
General
| Science
| Subjects
| Books
General
| Mathematics
| Science
| Subjects
| Books
Probability & Statistics
| Applied
| Mathematics
| Science
| Subjects
| Books
General
| Biology
| Biological Sciences
| Professional Science
| Professional & Technical
| Subjects
| Books
Statistics
| Applied
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
All Amazon Upgrade
| Amazon Upgrade
| Stores
| Books
Computers & Internet
| Amazon Upgrade
| Stores
| Books
Professional & Technical
| Amazon Upgrade
| Stores
| Books
Science
| Amazon Upgrade
| Stores
| Books
All Titles
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Computers & Internet
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Professional
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Science
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Similar Items:
-
Random Number Generation and Monte Carlo Methods (Statistics and Computing)
-
Monte Carlo Statistical Methods (Springer Texts in Statistics)
-
Monte Carlo Strategies in Scientific Computing
ASIN: 3540404643 |
Book Description
The
Handbook of Computational Statistics - Concepts and Methods is divided into 4 parts. It begins with an overview of the field of Computational Statistics, how it emerged as a seperate discipline, how it developed along the development of hard- and software, including a discussion of current active research.
The second part presents several topics in the supporting field of statistical computing. Emphasis is placed on the need for fast and accurate numerical algorithms, and it discusses some of the basic methodologies for transformation, data base handling and graphics treatment.
The third part focuses on statistical methodology. Special attention is given to smoothing, iterative procedures, simulation and visualization of multivariate data.
Finally a set of selected applications like Bioinformatics, Medical Imaging, Finance and Network Intrusion Detection highlight the usefulness of computational statistics.
Book Description
The new volume of Computational Statistics represents a comprehensive overview of Partial Least Squares (PLS) methods with specific reference to their use in marketing and with a discussion of the directions of current research and perspectives.
The handbook covers the broad area of PLS methods -from regression to structural equation modeling applications, software and interpretation of results. It features papers on the use and the analysis of latent variables and indicators by means of the PLS path modeling approach from the design of the causal network to model assessment and improvement.
Within the PLS framework, the handbook also addresses advanced topics such as the analysis of multi-block, multi-group and multi-structured data, the use of categorical indicators, the study of interaction effects, the integration of classification issues, the validation aspects and the comparison between the PLS approach and covariance based structural equation modeling. Most chapters comprise a thorough discussion of applications to marketing and related areas, some tutorials focus on key aspects of PLS analysis with a didactic approach.
This handbook serves both as an introduction for those without prior knowledge of PLS and as a comprehensive reference for researchers and practitioners interested in the most recent advances in PLS methodology.
Book Description
The application of computational electromagnetics to real-world EMI/EMC engineering is an emerging technology. With the advancement in electronics, EMI/EMC issues have greatly increased in complexity. As a result, it is no longer possible to rely exclusively on traditional techniques and expect cost-effective solutions. The first edition of this book introduced computational electromagnetics to EMI/EMC engineering. This second edition continues the introduction of computational electromagnetics to EMI/EMC engineering, but also adds new modeling techniques, namely the Partial Element Equivalent Circuit method and the Transmission Line Matrix method, and updates to the science of EMI/EMC modeling that have occurred since the first edition was published.
This book combines the essential elements of electromagnetic theory, computational techniques, and EMI/EMC engineering as they apply to computational modeling for EMI/EMC applications. It is intended to provide an understanding for those interested in incorporating modeling techniques in their work. A variety of modeling techniques are needed for anyone interested in using computational modeling in the real world. This book includes an introduction of all the popular modeling techniques, such as the Finite-Difference Time-Domain method, the Method of Moments, the Finite Element Method, the Partial Element Equivalent Circuit method and the Transmission Line Matrix method.
EMI/EMC Computational Modeling Handbook, Second Edition will serve many different levels of readers. It will serve as a basic introduction to modeling as applied to EMI/EMC problems for the engineer interested in getting started, and it will help the person already using modeling as a tool to become more effective in using different modeling techniques. It will also be useful for the engineer who is familiar with computational techniques and wishes to apply them to EMI/EMC applications. This book can also be used as a text to help students of electromagnetic theory and application better understand real-world challenges facing engineers.
Customer Reviews:
expected more............2007-01-04
It did not impress me either with the technical contents or with the presentation style.
very useful book.......2002-09-01
this book can help engineers get started with modeling for EMC
it is not an EMC design book, and it needs to be used by
people with some amount of intelligence. it will not hold your hand, but it WILL give you the information needed to be an engineer.
the previous reviewer was obviously looking for a cookbook, and this is a very dangerous topic to use as a cook book. I, for one, am glad that the authors provided the information in a way that allows me to be the engineer, and not simply follow blindly.
I recommend this book to any ENGINEER who can think, and wants to know more about EMC modeling and simulation
This book is GREAT.......2002-09-01
this book is a great help to get started in using modeling tools. I find all the major techniques explained in one place, instead of needing to get 5 different books!
the help to get started in creating models from the complex products was especially helpful.
the explaination about validating the models without needing to do measurements for everything was useful and allowed me to get started right away!
this is a unique book, in my experience. I highly recommend it to anyone who wants to know about the various modeling techniques, and works in the real world
EMC Engineer's Review.......2001-01-10
This is the most useless book on the topic of EMC that I have ever read. This book merely informs the reader of the various analytical techniques and informs the reader of what techniques to use to solve various EMC problems. A great portion of the book is spent on convincing the reader on the benefits of the various computational techniques. However, the book does not show how to implement the techniques. It preaches to the quire, since only engineers that are already in the field would buy the book. It does not provide a single worked out example or even provide the theory on how to implement the computational techniques. I would highly discourage anyone from buying this book.
Average customer rating:
|
Handbook of Computational Geometry
Manufacturer: North Holland
ProductGroup: Book
Binding: Hardcover
Web Graphics
| Web Design
| Web Development
| Computers & Internet
| Subjects
| Books
General
| Graphics & Multimedia
| Programming
| Computers & Internet
| Subjects
| Books
General
| Graphic Design
| Computers & Internet
| Subjects
| Books
General
| Science
| Subjects
| Books
General
| Applied
| Mathematics
| Science
| Subjects
| Books
Discrete Mathematics
| Pure Mathematics
| Mathematics
| Science
| Subjects
| Books
General
| Mathematics
| Science
| Subjects
| Books
Differential Geometry
| Geometry & Topology
| Mathematics
| Science
| Subjects
| Books
General Geometry
| Geometry & Topology
| Mathematics
| Science
| Subjects
| Books
General
| Applied
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
Differential Geometry
| Geometry & Topology
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
General Geometry
| Geometry & Topology
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
Discrete Mathematics
| Pure Mathematics
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
All Titles
| Qualifying Textbooks - Fall 2007
| Stores
| Books
ASIN: 0444825371 |
Book Description
Computational Geometry is an area that provides solutions to geometric problems which arise in applications including Geographic Information Systems, Robotics and Computer Graphics. This Handbook provides an overview of key concepts and results in Computational Geometry. It may serve as a reference and study guide to the field. Not only the most advanced methods or solutions are described, but also many alternate ways of looking at problems and how to solve them.
Book Description
This comprehensive text provides upper-level undergraduates and graduate students with an accessible introduction to the implementation of quantum ideas in molecular modeling, exploring practical applications alongside theoretical explanations. Topics include the Hartree-Fock method; matrix SCF equations; implementation of the closed-shell case; introduction to molecular integrals; and much more. 1998 edition.
Customer Reviews:
Nice exposition on the inner workings of computational quantum chemistry........2007-01-10
David Cook's book, pun-fully referred to as the 'Cook-book', is a very easy to read exposition through the inner workings of computational chemistry. Cook covers all the major topics from general Hartree-Fock theory through more exotic methods such as Moeller-Plesset perturbation and coupled-cluster theories and their implementation in Fortran (some C). Next to the theoretical models, the Cook-book cooks up a rudementary integral evaluation program and offers tips and pseudo-code for integral storage and handling. If you are new to coding, this book also interjects appendices throughout detailing ways of housekeeping computer code and creating internal documentation on different subroutines with external open-source programs. Overall, this is a must-have for any computational chemist whether they code or not simply as a reference of the coding details of modern theoretical models. For the price, you couldn't hope to find a better reference.
My views on Computational Quantum Physics.......1999-06-29
I have much experence writing books, and I have found that all other subjects are boring, and computational quantum chemestry was intullectually stimulating. You will be entralled and involved in the book from the time that you pick it up. It is also a great resource for all of the colledge student planning to study this and are currently. I highly reccomend this book to anyone else who feels that their life just isn't complete.
Average customer rating:
|
Handbook of Computational Group Theory (Discrete Mathematics and Its Applications)
Derek F. Holt ,
Bettina Eick , and
Eamonn A. O'Brien
Manufacturer: Chapman & Hall/CRC
ProductGroup: Book
Binding: Hardcover
General
| Science
| Subjects
| Books
General
| Algebra
| Pure Mathematics
| Mathematics
| Science
| Subjects
| Books
Group Theory
| Pure Mathematics
| Mathematics
| Science
| Subjects
| Books
General
| Mathematics
| Science
| Subjects
| Books
Probability & Statistics
| Applied
| Mathematics
| Science
| Subjects
| Books
Statistics
| Applied
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
General
| Algebra
| Pure Mathematics
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
Group Theory
| Pure Mathematics
| Mathematics
| Professional Science
| Professional & Technical
| Subjects
| Books
General
| Computers & Internet
| Subjects
| Books
All Titles
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Computers & Internet
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Professional
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Science
| Qualifying Textbooks - Fall 2007
| Stores
| Books
ASIN: 1584883723 |
Book Description
The origins of computation group theory (CGT) date back to the late 19th and early 20th centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and today it remains a lively and active branch of mathematics. The Handbook of Computational Group Theory offers the first complete treatment of all the fundamental methods and algorithms in CGT presented at a level accessible even to advanced undergraduate students. It develops the theory of algorithms in full detail and highlights the connections between the different aspects of CGT and other areas of computer algebra. While acknowledging the importance of the complexity analysis of CGT algorithms, the authors' primary focus is on algorithms that perform well in practice rather than on those with the best theoretical complexity. Throughout the book, applications of all the key topics and algorithms to areas both within and outside of mathematics demonstrate how CGT fits into the wider world of mathematics and science. The authors include detailed pseudocode for all of the fundamental algorithms, and provide detailed worked examples that bring the theorems and algorithms to life.
Customer Reviews:
Important Text on CGT.......2005-05-12
Handbook of Computational Group Theory by Derek F. Holt (Discrete Mathematics and Its Applications: Chapman & Hall/CRC) is about computational group theory, which we shall frequently abbreviate to CGT. The origins of this lively and active branch of mathematics can he traced back to the nineteenth and early twentieth centuries, but it has been flourishing particularly during the past 30 to 40 years. The aim of this book is to provide as complete a treatment as possible of all of the fundamental methods and algorithms in CGT, without straying above a level suitable for a beginning postgraduate student.
The most basic algorithms in CGT tend to be representation specific; that is, there are separate methods for groups given as permutation or matrix groups, groups defined by means of polycyclic presentations, and groups that are defined using a general finite presentation. The author has devoted separate chapters to algorithms that apply to groups in these different types of repre¬sentations, but there are other chapters that cover important methods involving more than one type. For example, Chapter 6 is about finding presentations of permutation groups and the connections between coset enumeration and methods for finding the order of a finite permutation group.
There is also included a chapter (Chapter 11) on the increasing number of precomputed stored libraries and databases of groups, character tables, etc. that are now publicly available. They have been playing a major rôle in CGT in recent years, both as an invaluable resource for the general mathematical public, and as components for use in some advanced algorithms in CGT. The library of all finite groups of order up to 2000 (except for order 1024) has proved to be particularly popular with the wider community.
It is inevitable that our choice of topics and treatment of the individual topics will reflect the authors' personal expertise and preferences to some extent. On the positive side, the final two chapters of the book cover appli¬cations of string-rewriting techniques to CGT (which is, however, treated in much greater detail, and the application of finite state automata to the computation of automatic structures of finitely presented groups. On the other hand, there may be some topics for which our treatment is more superficial than it would ideally be.
One such area is the complexity analysis of the algorithms of CGT. During the 1980s and 1990s some, for the most part friendly and respectful, rivalry developed between those whose research in CGT was principally directed to-wards producing better performance of their code, and those who were more interested in proving theoretical results concerning the complexity of the al¬gorithms. This study of complexity began with the work of Eugene Luks, who established a connection in his 1982 article between permutation group algorithms and the problem of testing two finite graphs for isomorphism. Our emphasis in this book will be more geared towards algorithms that per-form well in practice, rather than those with the best theoretical complexity. Fortunately, Seress' book includes a very thorough treatment of com¬plexity issues, and so we can safely refer the interested reader there. In any case, as machines become faster, computer memories larger, and bigger and bigger groups come within the range of practical computation, it is becom¬ing more and more the case that those algorithms with the more favourable complexity will also run faster when implemented.
The important topic of computational group representation theory and computations with group characters is perhaps not treated as thoroughly as it might be in this book. Some of the basic material is covered in Chapter 7, but there is unfortunately no specialized book on this topic.
One of the most active areas of research in CGT at the present time, both from the viewpoint of complexity and of practical performance, is the development of effective methods for computing with large finite groups of matrices. Much of this material is beyond the scope of this book. It is, in any case, developing and changing too rapidly to make it sensible to attempt to cover it properly here. Some pointers to the literature will of course be provided, mainly in Section 7.8.
Yet another topic that is beyond the scope of this book, but which is of increasing importance in CGT, is computational Lie theory. This includes computations with Coxeter groups, reflection groups, and groups of Lie type and their representations. It also connects with computations in Lie algebras, which is an area of independent importance. The article by Cohen, Murray, and Taylor provides a possible starting point for the interested reader.
The author firmly believes that the correct way to present a mathematical algorithm is by means of pseudocode, since a textual description will generally lack precision, and will usually involve rather vague instructions like "carry on in a similar manner". So we have included pseudocode for all of the most basic algorithms, and it is only for the more advanced procedures that we have occasionally lapsed into sketchy summaries. We are very grateful to Thomas Cormen who has made his LATEX package `clrscode' for displaying algorithms publicly available. This was used by him and his coauthors in the well-known textbook on algorithms.
Although working through all but the most trivial examples with procedures that are intended to be run on a computer can be very tedious, the author attempted to include illustrative examples for as many algorithms as is practical.
At the end of each chapter, or sometimes section, the reader's attention directed to some applications of the techniques developed in that chapter either to other areas of mathematics or to other sciences. It is generally difficult to do this effectively. Although there are many important and interesting applications of CGT around, the most significant of them will typically use methods of CGT as only one of many components, and so it not possible to do them full justice without venturing a long way outside of the main topic of the book.
The author assumes that the reader is familiar with group theory up to an advanced undergraduate level, and has a basic knowledge of other topics in algebra, such as ring and field theory. Chapter 2 includes a more or less complete survey of the required background material in group theory, but we shall assume that at least most of the topics reviewed will be already familiar to readers. Chapter 7 assumes some basic knowledge of group representation theory, such as the equivalence between matrix representations of a group G over a field K and KG-modules, but it is interesting to note that many of the most fundamental algorithms in the area, such as the `Meataxe', use only rather basic linear algebra.
Book Description
This guide book to mathematics contains in handbook form the fundamental working knowledge of mathematics which is needed as an everyday guide for working scientists and engineers, as well as for students. Easy to understand, and convenient to use, this guide book gives concisely the information necessary to evaluate most problems which occur in concrete applications. For the 4th edition, the concept of the book has been completely re-arranged. The new emphasis is on those fields of mathematics that became more important for the formulation and modeling of technical and natural processes, namely Numerical Mathematics, Probability Theory and Statistics, as well as Information Processing.
Customer Reviews:
Excellent reference book.......2007-09-19
I highly recommend the Handbook of Mathematics. It is an excellent resource for every engineering student and professional engineer.
Great, but tough to use.......2007-04-25
This handbook contains more material than I find in any other single source that I happen to have. But I don't use it as frequently as I use the analogous CRC handbook, or MathWorld and Wikipedia on the Web, or the ancient NBS handbook. Why not? Because one uses a handbook, not as a textbook, but as a source for things one should know, but don't (or perhaps once knew but have forgotten). So one wants to find the thing one is looking for, refresh or extend one's memory, and then put the handbook aside and go back to the problem one is trying to solve. I have trouble locating what I'm looking for in Bronshtein and Semendayev, and when I find it, I often find that I have to look up things elsewhere in the volume to get all of whatever it is I was looking for. So I try my other sources first, and if they don't answer my question, I pick up this book, resignedly, and expect to spend hours rather than minutes getting whatever it is I want to know. There is nothing wrong with that; indeed, this book often supplies me with answers to questions I can't find answered elsewhere.
In case the reader of this review attributes my difficulties with this book to a lack of mathematical background, I'll remark that my academic training, very many years ago, was in math, so I find that I can follow the discussion in this book of any particular thing I look up; it's just a slow process for me. I'm not surprised that it's a favorite in Germany (and in Europe more generally); Europeans in their mathematical training are expected to deal with tough subjects by dogged persistence, and probably feel more comfortable with this style than I do, given my US background. So, overall, it's a book I couldn't do without, but hate having to spend time in.
Loaded with Content.......2005-02-25
This book is exactly what the title says it is; a handbook of mathematical techniques and formulas for scientists and engineers. It is more a handbook than a book on mathematics and assumes a prior knowledge on the subjects covered. Readers of this english version of the Bronshtein should take note that it is a "raw" translation of the german version and so some discussion may not do justice to the theory. This in no way takes away from the fact it is an exceptional book and you'd be hard pressed to find any other book with more mathematical content.
There are several Bronshteins.......2004-10-25
Bronstein's "Taschenbuch der Mathematik" is a longtime favorite among german science and engineering students. English language readers should be aware however, that there are numerous different editions of this book. Not only were the german editions constantly enlarged and reworked, but there were also two publishers of the same book, one in East Germany (Teubner Verlag), one in West Germany (Harri Deutsch Verlag). Today both of these publishers sell a "Taschenbuch der Mathematik" based on the original Bronstein, yet they are completely different books. The english edition by Springer Verlag advertised above is based on the current Harri Deutsch edition. An english translation of the Teubner edition is now available as the "Oxford Users' Guide to Mathematics" from Oxford University Press. It is mostly considered to be the better 'Bronstein' (even though Teubner and OUP have dropped his name because the new edition was completely rewritten by E. Zeidler).
Clasic.......2004-03-22
For me it was a remarkable fact, how few of the people in western countries have heard about this handbook. In the east this is probably the most popular mathematical handbook ever. I dont know any eastern european scientist in a field of mathematics, engineering and physics who don't have it. The main reason is it's extensivity and usefulness. In Croatian print it has about 1000 pages in very small format covering all possible parts of applied mathematics up to special functions/markov chains/complex integration/vector algebra. It's "allways in backpack book" and my hot recomandation to any technical scientist.
Book Description
While high-quality books and journals in this field continue to proliferate, none has yet come close to matching the Handbook of Discrete and Computational Geometry, which in its first edition, quickly became the definitive reference work in its field. But with the rapid growth of the discipline and the many advances made over the past seven years, it's time to bring this standard-setting reference up to date. Editors Jacob E. Goodman and Joseph O'Rourke reassembled their stellar panel of contributors, added manymore, and together thoroughly revised their work to make the most important results and methods, both classic and cutting-edge, accessible in one convenient volume. Now over more then 1500 pages, the Handbook of Discrete and Computational Geometry, Second Edition once again provides unparalleled, authoritative coverage of theory, methods, and applications. Highlights of the Second Edition: · Thirteen new chapters: Five on applications and others on collision detection, nearest neighbors in high-dimensional spaces, curve and surface reconstruction, embeddings of finite metric spaces, polygonal linkages, the discrepancy method, and geometric graph theory · Thorough revisions of all remaining chapters · Extended coverage of computational geometry software, now comprising two chapters: one on the LEDA and CGAL libraries, the other on additional software · Two indices: An Index of Defined Terms and an Index of Cited Authors · Greatly expanded bibliographies
Customer Reviews:
Very comprehensive overview of computational geometry.......2001-03-26
This book, written by many well-known experts in the field, is a fine compendium of articles on the most active areas of computational geometry. Each article is supplemented with a glossary of terms needed for understanding the relevant concepts and frequently contains a list of open problems. An overview of the convex hull of a collection of random points in Euclidean n-space is given in one of the articles on discrete aspects of stochastic geometry, where also a very interesting discussion of generalizations of the Buffon needle problem is given.
There are a few articles overviewing Voronoi diagrams, such as the one on Voronoi diagrams and triangulations. The applications of Voronoi diagrams are many, and include tumour cell diagnosis, biometry, galaxy distributions, and pattern recognition. This article is a little short considering the importance of the subject.
The article on shortest paths and networks is somewhat disappointing since there is no in-depth discussion on network routing algorithms.
The article on computational topology highlights some of the results in this very important area. Many problems in topology have been tackled recently using computers, particularly the work of the mathematician A.T. Fomenko. Computational topology is a relatively young field, having been in existence only since the early 1990's. The applications are enormous, ranging from meshing, morphing, feature extraction, data compression, and in many scientific areas such as computational medicine, chemistry, and astrophysics. It can also be used in computer security via graphical passwords. It is an immense help in visualizing complicated topological objects, such as Lens spaces, horned spheres, and thickened knots. The article does not touch on the use of Mayer-Vietoris sequences to design efficient divide-and-conquer schemes for computing the homology of higher-dimensional complexes. The interplay between topology and finding better algorithms in computational geometry is one that will flourish no doubt in years to come.
The last section of the book covers applications with the most interesting article being the one on sphere packing and coding theory. The algorithms in sphere packing have direct applicability to error correctiong codes over the field GF(q). The author of this article does touch briefly on general algebraic-geometric codes, which is good considering their importance in applications.
The last article appropriately discusses available software for computational geometry. Although the list of Web sites is quite extensive, there are many more available since this book was first printed.
A very fine addition to the literature on computational geometry and should be on everyone's shelf who is interested in this important area.
Average customer rating:
|
Handbook of Materials Modeling
Manufacturer: Springer
ProductGroup: Book
Binding: Hardcover
General
| Earth Sciences
| Science
| Subjects
| Books
General
| Science
| Subjects
| Books
General
| Physics
| Science
| Subjects
| Books
Mathematical Physics
| Physics
| Science
| Subjects
| Books
Nanotechnology
| Technology
| Science
| Subjects
| Books
General
| Physical & Theoretical
| Chemistry
| Science
| Subjects
| Books
General
| Materials Science
| Engineering
| Professional & Technical
| Subjects
| Books
Materials
| Chemical
| Engineering
| Professional & Technical
| Subjects
| Books
Physical & Theoretical
| Chemistry
| Professional Science
| Professional & Technical
| Subjects
| Books
General
| Physics
| Professional Science
| Professional & Technical
| Subjects
| Books
Mathematical Physics
| Physics
| Professional Science
| Professional & Technical
| Subjects
| Books
General
| Earth Sciences
| Professional Science
| Professional & Technical
| Subjects
| Books
All Titles
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Professional
| Qualifying Textbooks - Fall 2007
| Stores
| Books
Science
| Qualifying Textbooks - Fall 2007
| Stores
| Books
ASIN: 1402032870 |
Book Description
The first reference of its kind in the rapidly emerging field of computational approachs to materials research, this is a compendium of perspective-providing and topical articles written to inform students and non-specialists of the current status and capabilities of modelling and simulation. From the standpoint of methodology, the development follows a multiscale approach with emphasis on electronic-structure, atomistic, and mesoscale methods, as well as mathematical analysis and rate processes. Basic models are treated across traditional disciplines, not only in the discussion of methods but also in chapters on crystal defects, microstructure, fluids, polymers and soft matter. Written by authors who are actively participating in the current development, this collection of 150 articles has the breadth and depth to be a major contributor toward defining the field of computational materials. In addition, there are 40 commentaries by highly respected researchers, presenting various views that should interest the future generations of the community. Subject Editors: Martin Bazant, MIT; Bruce Boghosian, Tufts University; Richard Catlow, Royal Institution; Long-Qing Chen, Pennsylvania State University; William Curtin, Brown University; Tomas Diaz de la Rubia, Lawrence Livermore National Laboratory; Nicolas Hadjiconstantinou, MIT; Mark F. Horstemeyer, Mississippi State University; Efthimios Kaxiras, Harvard University; L. Mahadevan, Harvard University; Dimitrios Maroudas, University of Massachusetts; Nicola Marzari, MIT; Horia Metiu, University of California Santa Barbara; Gregory C. Rutledge, MIT; David J. Srolovitz, Princeton University; Bernhardt L. Trout, MIT; Dieter Wolf, Argonne National Laboratory.
Books:
- Discrete Mathematics with Applications
- Elliptic Curves: Number Theory and Cryptography (Discrete Mathematics and Its Applications)
- Encyclopedia Prehistorica: Sharks and Other Sea Monsters
- Essential Cell Biology, Second Edition
- Finite Math with Applications (9th Edition)
- Finite Mathematics and Calculus with Applications (7th Edition) (Lial/Greenwell/Ritchey Series)
- Finite Mathematics and Its Applications
- Finite Mathematics for the Managerial, Life, and Social Sciences (with CD-ROM and Printed Access Card iLrn Tutorial, vMentor 1-Semester)
- Flow Measurement Engineering Handbook
- Food of the Gods: The Search for the Original Tree of Knowledge A Radical History of Plants, Drugs, and Human Evolution
Books Index
Books Home
Recommended Books
- Ethics 101: What Every Leader Needs To Know
- A Thousand Names for Joy: Living in Harmony with the Way Things Are
- War Nurse {A True Story of a Woman Who Lived, Loved and Suffered on the Western Front}
- The Rise of Theodore Roosevelt
- The Very Hungry Caterpillar board book
- Advanced Mathematical Methods for Scientists and Engineers: Asymptotic
- Wingshooter's Guide to Idaho: Upland Birds and Waterfowl
- Lord of Arabia: An Intimate Study of a King
- The Treatment and Taxation of Foreign Investment Under International Law
- They Never Saw Me Then