Spatial Updating Of Grand Canonical Monte Carlo Algorithms

Overview

Monte Carlo simulations have become more widely used recently due to their relatively inexpensive nature. This increase has allowed Monte Carlo simulations to be applied to many different disciplines. However, the basic simulation methods have remained largely unchanged. In general, Monte Carlo simulation methods are based on strict detailed balance. This condition was shown to be sufficient, but not necessary. The less strict local balance condition was shown to guarantee convergence and will provide the ...
See more details below
Paperback
$66.50
BN.com price
(Save 3%)$69.00 List Price
Other sellers (Paperback)
  • All (2) from $73.51   
  • New (2) from $73.51   
Sending request ...

More About This Book

Overview

Monte Carlo simulations have become more widely used recently due to their relatively inexpensive nature. This increase has allowed Monte Carlo simulations to be applied to many different disciplines. However, the basic simulation methods have remained largely unchanged. In general, Monte Carlo simulation methods are based on strict detailed balance. This condition was shown to be sufficient, but not necessary. The less strict local balance condition was shown to guarantee convergence and will provide the starting point for this work. Monte Carlo algorithms will be developed based on this local balance condition with the intention of finding more efficient, general simulation methods. These new methods will be proven to be mathematically valid and demonstrated for two different ensembles, the grand canonical and canonical ensembles. For the grand canonical ensemble, the spatial updating technique will be defined and demonstrated to provide a significant improvement over the standard methods at every system density tested, with the efficiency increasing by up to 40%. When this method is utilized in parallel, the efficiency can improve by up to 80%. The spatial method is then extended to binary systems in order to demonstrate its generality. Strong improvements in efficiency are again seen, with efficiencies improving by almost 70%. Finally, canonical systems will be investigated sequentially. The serial efficiencies are seen to be virtually identical to the random method, but a large improvement is demonstrated when the new sequential method is conducted in parallel, with systems demonstrating nearly ideal performance. Ideas for future work will then be provided, including directly applicable, practical uses for the algorithms derived in this work.
Read More Show Less

Product Details

  • ISBN-13: 9781243565839
  • Publisher: BiblioLabsII
  • Publication date: 9/3/2011
  • Pages: 146
  • Product dimensions: 7.44 (w) x 9.69 (h) x 0.31 (d)

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)