I have always used this book as a textbook of the gas turbine course for mechanical engineers and I find it perfect for its clarity and completeness.

This is one of the best books available in the market today covering both the theory and applications of gas turbines. It is unique in that the treatment contains both theoretical and practical aspects of gas turbine engineering. As an engineer who has spent over 23 years working with gas turbines I have used earlier editions of this book and it has helped me immensely in getting a clear understanding of gas turbine operations and specifically of the components and matching of turbine and compressors. It is a well-written and organized book that has clearly stood the test of time- this being the 50th year of its publication. Unlike many other traditional gas turbine textbooks, Prof. Saravanamuttoo brings his vast practical and industrial experience into the text -a feature that many operating engineers will appreciate. This edition is noteworthy as it incorporates latest technologies relating to gas turbines (advanced gas turbine, low NOx combustors, new cycles etc.) while retaining it classic lucid writing style. Every engineer who operates a gas turbine can benefit from this book as it will provide a deeper understanding of different components and their interactions. I highly recommend this book!

This is the classic undergraduate textbook on gas turbines. Not much more needs to be said than that. Future editions need to be updated to include computer examples and more on cogeneration and combined cycles

This book is an excellent compilation of both the theory and pseudo-code for number theoretic algorithms. The author also takes the time to prove some of the major results as background to the algorithms, in addition to sets of exercises at the end of the book. The book is too large to do a chapter by chapter review, so instead I will list the algorithms in the book that I thought were particularly useful:

1. Most of the algorithms on elliptic curves. The author reminds the reader that number-theoretical experiments resulted in the famous Swinnerton-Dyer Conjecture and the Birch Conjecture. (a) the reduction algorithm, which for a given point in the upper half plane, gives the unique point in the half plane equivalent to this point under the action of the special linear group along with the matrix that maps these two points to each other. (b) The computation of the coefficient g2 and g3 of the Weierstrass equation of an elliptic curve. (c) The computation of the Weierstrass function and its derivative. (d) Determination of the periods of an elliptic curve over the real numbers. (e) The determination of the elliptic logarithm. (f) The reduction of a general cubic (f) The Shanks-Mestre algorithm for computing the order of an elliptic curve over a finite field F(p), where p is prime and greater than 457. (g) The reduction of an elliptic curve modulo p for p > 3. (h) The reduction of an elliptic curve modulo 2 or 3. (i) Reduction of an elliptic curve over the rational numbers. (j) Determination of the rational torsion points of an elliptic curve. (k) Computation of the Hilbert class polynomials and thus a determination of the j-function of an elliptic curve.

2. A few of the algorithms on factoring. (a) The Pollard algorithm for finding non-trivial factors of composites. (The author does not give the improved algorithm due to P. Montgomery, but does give references) (b) Shanks Square Form Factorization algorithm for finding a non-trivial factor of an odd integer. (c) Lenstra's Elliptic Curve test for compositeness.

3. Primality tests (a) The Jacobi Sum Primality Test for a positive integer. (b) Goldwasser-Killian elliptic curve test for a positive integer not equal to 1 and coprime to 6.

The author gives an overview of the computer packages used for number theory, including Pari, which was written by him and his collaborators. I have not used this package, but instead use Lydia and Mathematica for most of the number theoretic computations I need to do.

Cohen (the world renowned expert) starts with the most basic of algorithms (i.e. Euclid & Shanks). He moves seamlessly into Linear Algebra & Polynomials (bedrocks of most CAS). Although meant to be concise, he proves, or sketches a proof of the important results. Finally, the meat of the book, C.A.N.T. One important problem is finding the "class number" (has to do with unique factorization, which we are all accustomed to in Z). A detailed description of the continued fraction algorithm (for finding the fundamental unit), and others made it very enlightening. He then deals with primality testing and factoring, two very important problems, the latter because of RSA. First, a description of the algorithm, then the theory behind it. He covered everything, from Trial Division (Dark Ages) to Pollard Rho to NFS (cutting-edge). Also included are some useful tables.

Of course, CAS information from 1993, won't be that helpful (look in his newest, Advanced Topics in C.A.N.T.).

Excellent. Also try Knuth's "Semi-numerical Algorithms" for a more computer oriented approach.

A window on an aspect of American Jewish history not as familiar as the mass immigration from eastern Europe, Cohen's book is also an unexpected window on an even less frequently explored topic: the use of great wealth to do good in the world. Schiff did not establish a foundation, screen grants, or hire professional advisors to guide his good works - he simply used his money to right wrongs where he saw them. Like giving half a million dollars to Barnard College as a reward for it's refusal to countenance discrimination against Jews. Or arranging mega-buck loans for the Japanese government during the Russo-Japanese War as a way of sticking it to the anti-Semitic Russians (who lost that war.) Not all of his ideas worked out, but you have to admire a man who had the courage of his convictions, and the character to put his money where his mouth was.

i love this book... it is so rhythmical and sensual. i got it for my husband on our wedding day. it was perfect.

I'm a great fan of this series of books - each takes a poem and an artist, and blends the words of the poem with the images of the artist to create a harmonious, well-matched whole. Dance Me To The End Of Love is the most successful of the sequence, with Matisse's gliding, extravagantly curvaceous artwork and Leonard Cohen's beautiful song-poem floating around, in and out of each other, the words complementing the images complementing the words. It is a beautiful book to look at and to read, to savour and enjoy. Matisse was an artist whose images had all the flying poise and grace of the dancer, and is the only possible artist who could have complemented Leonard Cohen's song. I am delighted to possess this book, and can read it over and over again, admiring the beauty and vision of the person who set the typeface and layout of the pages. If you love beautiful things, and admire Matisse, this is a book you must have casually tossed onto your coffee table - see how many people lean forward and glance inside, and are riveted immediately.

This isn't a book of poetry, it is a book of one poem, beautifully matched with work by Matisse. I have now given it to two different couples for their weddings. Words and pictures to make your heart soar, Cohen and Matisse seemed to be talking to each other with their art.