Scientific Computing: An Introductory SurveyMcGraw-Hill, 2002 - 563 pagine Scientific Computing, 2/e, presents a broad overview of numerical methods for solving all the major problems in scientific computing, including linear and nonlinearequations, least squares, eigenvalues, optimization, interpolation, integration, ordinary and partial differential equations, fast Fourier transforms, and random number generators. The treatment is comprehensive yet concise, software-oriented yet compatible with a variety of software packages and programming languages. The book features more than 160 examples, 500 review questions, 240 exercises, and 200 computer problems.Changes for the second edition include: expanded motivational discussions and examples; formal statements of all major algorithms; expanded discussions of existence, uniqueness, and conditioning for each type of problem so that students can recognize "good" and "bad" problem formulations and understand the corresponding quality of results produced; and expanded coverage of several topics, particularly eigenvalues and constrained optimization.The book contains a wealth of material and can be used in a variety of one- or two-term courses in computer science, mathematics, or engineering. Its comprehensiveness and modern perspective, as well as the software pointers provided, also make it a highly useful reference for practicing professionals who need to solve computational problems. |
Dall'interno del libro
Risultati 1-3 di 55
Pagina 26
... coefficients are very large or very small , then b2 or 4ac may overflow or underflow . The possibility of overflow can be avoided by rescaling the coefficients , such as dividing all three coefficients by the coefficient of largest ...
... coefficients are very large or very small , then b2 or 4ac may overflow or underflow . The possibility of overflow can be avoided by rescaling the coefficients , such as dividing all three coefficients by the coefficient of largest ...
Pagina 161
... coefficients of the polynomial ( with signs reversed ) in the last column , ones on the subdiagonal , and zeros elsewhere ; and thus the roots of P ( A ) are the eigenvalues of Cn . Note that the correspondence between polynomials and ...
... coefficients of the polynomial ( with signs reversed ) in the last column , ones on the subdiagonal , and zeros elsewhere ; and thus the roots of P ( A ) are the eigenvalues of Cn . Note that the correspondence between polynomials and ...
Pagina 314
... coefficients of the polynomial interpolating the data points ( ti , yi ) , i = 1 , ... , n , is given by the n x n linear system t2 -11-30-0- Ax = tn tn - 1 = = y . Yn A matrix of this form , whose columns are successive powers of some ...
... coefficients of the polynomial interpolating the data points ( ti , yi ) , i = 1 , ... , n , is given by the n x n linear system t2 -11-30-0- Ax = tn tn - 1 = = y . Yn A matrix of this form , whose columns are successive powers of some ...
Sommario
Scientific Computing | 1 |
Initial Value Problems for ODEs | 9 |
Systems of Linear Equations | 49 |
Copyright | |
15 sezioni non visualizzate
Altre edizioni - Visualizza tutto
Scientific Computing: An Introductory Survey, Revised Second Edition Michael T. Heath Anteprima limitata - 2018 |
Scientific Computing: An Introductory Survey, Revised Second Edition Michael T. Heath Anteprima limitata - 2018 |
Parole e frasi comuni
accuracy algorithm approximate solution basis functions Cholesky factorization coefficients column complex components condition number constraints convergence rate corresponding data points defined derivative determine differential digits dimension eigenvalues eigenvectors Euler's method evaluate Example finite difference floating-point number floating-point system function f function values Gaussian elimination given golden section search gradient hence Hessian matrix Householder transformation implementation initial input integral integrand interval inverse inverse iteration iterative method Lagrange least squares problem library routine linear equations linear least squares linear system LU factorization MATLAB method for solving minimizing multiple n x n Newton's method nodes nonlinear equations nonsingular nonzero norm objective function obtain one-dimensional optimization problem orthogonal parameters perturbations pivoting polynomial interpolation positive definite programming QR factorization QR iteration quadratic quadrature rule relative residual resulting root scalar secant method Section sequence singular value spline symmetric tion tridiagonal True or false upper triangular vector zero