C++ Scientific Programming Computational Recipes at a Higher Level

Name: C++ Scientific Programming Computational Recipes at a Higher Level
Price: 37.48 USD
Availability: InStock
ISBN: 9780471412106

ISBN-10: 0471412104

ISBN-13: 9780471412106

Edition: 2001

Authors: John R. Berryhill

List price: $120.95

This item qualifies for FREE shipping.

30 day, 100% satisfaction guarantee!

Buy new: $95.59

Marketplace

3 new & used from $37.48

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

This text describes algorithms in C++ for the formulation & solution of scientific & technical problems. It shows that C++ is more convenient & efficient for the programmer than FORTRAN, which has been the computer language most commonly employed.

Book details

List price: $120.95
Copyright year: 2001
Publisher: John Wiley & Sons, Incorporated
Publication date: 10/3/2001
Binding: Hardcover
Pages: 258
Size: 6.44" wide x 9.43" long x 0.69" tall
Weight: 1.100
Language: English



Preface



Overview



Classes and Operators



Memory Dynamics



Applications



Summary and Conclusions



Vector and Matrix Basics



Vector Class



Matrix Class



Miscellaneous Observations



Summary and Conclusions



Sparse Matrix Basics



Structure Definition



Class Definition



Summary and Conclusions



Conjugate-Gradient Methods



Linear Independence and Orthogonality



Steepest Descent



Conjugate Gradient



Extension to General Matrices



Biconjugate Gradient



Least Squares



Summary and Conclusions



Triangular Matrices



Backward Solvers



Forward Solvers



Spline Interpolation



Row and Column Permutations



Summary and Conclusions



Householder Matrix Methods



QR Factorization



Rank Deficiency



Least-Squares Applications



Eigenstuff



Givens Transformation



Summary and Conclusions



Singular Value Decomposition



Jacobi Transformation



The Pseudoinverse



Application to Two-Dimensional Images



Indirect SVD Methods



Lanczos Method



Summary and Conclusions



Cholesky Decomposition



Positive Definiteness and Pivoting



Cholesky Solutions



Quasidefinite Matrices



Summary and Conclusions



Automatic Derivatives



Pointers to Functions



Abstract Base Class



The Chain Rule



Constants and Variables



C[superscript 1] Functions



Functions of Functions



Multidimensional Applications



Summary and Conclusions



Constrained Optimization



Linear Constraints



Linear Objective Function



Duality and Complementarity



Interior-Point Method



Solving LP Problems



LP Applications



Theoretical Addendum



Summary and Conclusions



Interior-Point Extensions



L[superscript 1] Regression as a Linear Programming Problem



L[superscript [infinity] Regression



Quadratic Programming



Successive Quadratic Programming



Summary and Conclusions



LU Factorization



Crout LU Algorithm



Dense Matrix Crout LU Subroutine



Sparse Matrix Crout Subroutine



Gauss LU Algorithm



Threshold Pivoting



Gauss LU Subroutine with Threshold Pivoting



Comparison and Contrast



Summary and Conclusions



Complex Arrays



Complex Array Templates



Specialization



Vector Sums and Differences



Complex Matrices



Quaternions



Summary and Conclusions



Fourier Transforms



Bit Reversal



FFT Implementations



Connecting with the Real World



FFT Member Functions



Time and Space



Summary and Conclusions


References


Index