Numerical Methods in Scientific Computing: Volume 1SIAM, 1. 1. 2008 - Počet stran: 744 This new book from the authors of the classic book Numerical methods addresses the increasingly important role of numerical methods in science and engineering. More cohesive and comprehensive than any other modern textbook in the field, it combines traditional and well-developed topics with other material that is rarely found in numerical analysis texts, such as interval arithmetic, elementary functions, operator series, convergence acceleration, and continued fractions. Although this volume is self-contained, more comprehensive treatments of matrix computations will be given in a forthcoming volume. A supplementary Website contains three appendices: an introduction to matrix computations; a description of Mulprec, a MATLAB multiple precision package; and a guide to literature, algorithms, and software in numerical analysis. Review questions, problems, and computer exercises are also included. For use in an introductory graduate course in numerical analysis and for researchers who use numerical methods in science and engineering. |
Další vydání - Zobrazit všechny
Numerical Methods in Scientific Computing:: Volume 1 Germund Dahlquist,Ake Bjorck Omezený náhled - 2008 |
Numerical Methods in Scientific Computing: Volume 1 Germund Dahlquist,Åke Björck Náhled není k dispozici. - 2008 |
Běžně se vyskytující výrazy a sousloví
accuracy algorithm analysis analytic applied approximation arithmetic Assume becomes bound calculation called Chebyshev Cited close coefficients column complex computed Consider continuous convergence correct corresponding curve decimal defined definition derivatives determined difference differential digits elements equal equation error estimate evaluated exact example expansion expression factor Figure find first formula Fourier fraction function given gives Hence holds important integral interpolation interval iteration known less linear linear system mathematical matrix means method multiplication needed Newton’s nodes normal Note obtained operations orthogonal points polynomial positive possible power series precision problem Proof properties quadrature random recurrence relation remainder requires respectively result root rounding rule satisfies sequence Show shown simple solution solving space spline square standard step Suppose Theorem transformation unique values variable vector weights zero