Computational Methods for Physicists [electronic resource] : Compendium for Students / by Simon Sirca, Martin Horvat.
By: Sirca, Simon [author.].
Contributor(s): Horvat, Martin [author.] | SpringerLink (Online service).
Material type:
BookSeries: Graduate Texts in Physics: Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012Description: XX, 715 p. 228 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642324789.Subject(s): Physics | Chemistry | Computer science -- Mathematics | Computer science | Engineering mathematics | Physics | Numerical and Computational Physics | Computational Mathematics and Numerical Analysis | Appl.Mathematics/Computational Methods of Engineering | Theoretical and Computational Chemistry | Computational Science and EngineeringDDC classification: 530.1 Online resources: Click here to access online Basics of numerical analysis -- Solution of nonlinear equations -- Matrix methods -- Transformations of functions and signals -- Statistical description and modeling of data -- Modeling and analysis of time series -- Initial-value problems for ordinary differential equations -- Boundary-value problems for ordinary differential equations -- Difference methods for one-dimensional partial differential equations -- Difference methods for partial differential equations in more than one dim -- Spectral methods for partial differential equations.
This book helps advanced undergraduate, graduate and postdoctoral students in their daily work by offering them a compendium of numerical methods. The choice of methods pays significant attention to error estimates, stability and convergence issues as well as to the ways to optimize program execution speeds. Many examples are given throughout the chapters, and each chapter is followed by at least a handful of more comprehensive problems which may be dealt with, for example, on a weekly basis in a one- or two-semester course. In these end-of-chapter problems the physics background is pronounced, and the main text preceding them is intended as an introduction or as a later reference. Less stress is given to the explanation of individual algorithms. It is tried to induce in the reader an own independent thinking and a certain amount of scepticism and scrutiny instead of blindly following readily available commercial tools.
There are no comments for this item.