Java number cruncher : the Java programmer's guide to numerical computing
著者
書誌事項
Java number cruncher : the Java programmer's guide to numerical computing
Prentice Hall PTR, c2003
- : pbk
大学図書館所蔵 全3件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
This book introduces Java programmers to numerical computing. It contains clear, non-theoretical explanations of practical numerical algorithms, including safely summing numbers, finding roots of equations, interpolation and approximation, numerical integration and differentiation, and matrix operations, including solving sets of simultaneous equations. Many of the programs are applets that take advantage of Java's interactive graphics capabilities. These programs allow the user to interact with them as they dynamically demonstrate the computational algorithms in action. Java Number Cruncher devotes several chapters to searching for patterns in the prime numbers, generating random numbers, intriguing formulas for pi and e, arbitrarily long numbers and their relationship to data encryption, and algorithms for creating fractal images. Working Java programs demonstrate all the concepts from this book.
目次
Preface.
How to Download the Source Code.
I. WHY GOOD COMPUTATIONS GO BAD.
1. Floating-Point Numbers Are Not Real!
Roundoff Errors. Error Explosion. Real Numbers versus Floating-Point Numbers. Precision and Accuracy. Disobeying the Laws of Algebra. And What about Those Integers?
2. How Wholesome Are the Integers?
The Integer Types and Operations. Signed Magnitude versus Two's-Complement. Whole Numbers versus Integer Numbers. Wrapper Classes. Integer Division and Remainder. Integer Exponentiation.
3. The Floating-Point Standard.
The Floating-Point Formats. Denormalized Numbers. Decomposing Floating-Point Numbers. The Floating-Point Operations. 60, 6`, and NaN. No Exceptions! Another Look at Roundoff Errors. Strict or Nonstrict Floating-Point Arithmetic. The Machine Epsilon e. Error Analysis.
II. ITERATIVE COMPUTATIONS.
4. Summing Lists of Numbers.
A Summing Mystery-the Magnitude Problem. The Kahan Summation Algorithm. Summing Numbers in a Random Order. Summing Addends with Different Signs. Insightful Computing. Summation Summary.
5. Finding Roots.
Analytical versus Computer Solutions. The Functions. The Bisection Algorithm. The Regula Falsi Algorithm. The Improved Regula Falsi Algorithm. The Secant Algorithm. Newton's Algorithm. Fixed-Point Iteration. Double Trouble with Multiple Roots. Comparing the Root-Finder Algorithms.
6. Interpolation and Approximation.
The Power Form versus the Newton Form. Polynomial Interpolation Functions. Divided Differences. Constructing the Interpolation Function. Least-Squares Linear Regression. Constructing the Regression Line.
7. Numerical Integration.
Back to Basics. The Trapezoidal Algorithm. Simpson's Algorithm.
8. Solving Differential Equations Numerically.
Back to Basics. A Differential Equation Class. Euler's Algorithm. A Predictor-Corrector Algorithm. The Fourth-Order Runge-Kutta Algorithm.
III. A MATRIX PACKAGE.
9. Basic Matrix Operations.
Matrix. Square Matrix. Identity Matrix. Row Vector. Column Vector. Graphic Transformation Matrices. A Tumbling Cube in 3-D Space.
10. Solving Systems of Linear Equations.
The Gaussian Elimination Algorithm. Problems with Gaussian Elimination. Partial Pivoting. Scaling. LU Decomposition. Iterative Improvement. A Class for Solving Systems of Linear Equations. A Program to Test LU Decomposition. Polynomial Regression.
11. Matrix Inversion, Determinants, and Condition Numbers.
The Determinant. The Inverse. The Norm and the Condition Number. The Invertible Matrix Class. Hilbert Matrices. Comparing Solution Algorithms.
IV. THE JOYS OF COMPUTATION.
12. Big Numbers.
Big Integers. A Very Large Prime Number. Big Integers and Cryptography. Big Decimal Numbers. Big Decimal Functions.
13. Computing p.
Estimates of p and Ramanujan's Formulas. Arctangent Formulas That Generate p. Generating Billions of Digits.
14. Generating Random Numbers.
Pseudorandom Numbers. Uniformly Distributed Random Numbers. Normally Distributed Random Numbers. Exponentially Distributed Random Numbers. Monte Carlo, Buffon's Needle, and p.
15. Prime Numbers.
The Sieve of Eratosthenes and Factoring. Congruences and Modulo Arithmetic. The Lucas Test. The Miller-Rabin Test. A Combined Primality Tester. Generating Prime Numbers. Prime Number Patterns.
16. Fractals.
Fixed-Point Iteration and Orbits. Bifurcation and the Real Function f(x) 5 x2 1 c. Julia Sets and the Complex Function f(z) 5 z2 1 c. Newton's Algorithm in the Complex Plane. The Mandelbrot Set.
Index.
「Nielsen BookData」 より