Numerical analysis presents different faces to the world. For mathematicians it is a bona fide mathematical theory with an applicable flavour. For scientists and engineers it is a practical, applied subject, part of the standard repertoire of modelling techniques. For computer scientists it is a theory on the interplay of computer architecture and algorithms for real-number calculations. The tension between these standpoints is the driving force of this book, which presents a rigorous account of the fundamentals of numerical analysis of both ordinary and partial differential equations. The exposition maintains a balance between theoretical, algorithmic and applied aspects. This second edition has been extensively updated, and includes new chapters on emerging subject areas: geometric numerical integration, spectral methods and conjugate gradients. Other topics covered include multistep and Runge-Kutta methods; finite difference and finite elements techniques for the Poisson equation; and a variety of algorithms to solve large, sparse algebraic systems.
Highly oscillatory phenomena range across numerous areas in science and engineering and their computation represents a difficult challenge. A case in point is integrals of rapidly oscillating functions in one or more variables. The quadrature of such integrals has been historically considered very demanding. Research in the past 15 years (in which the authors played a major role) resulted in a range of very effective and affordable algorithms for highly oscillatory quadrature. This is the only monograph bringing together the new body of ideas in this area in its entirety. The starting point is that approximations need to be analyzed using asymptotic methods rather than by more standard polynomial expansions. As often happens in computational mathematics, once a phenomenon is understood from a mathematical standpoint, effective algorithms follow. As reviewed in this monograph, we now have at our disposal a number of very effective quadrature methods for highly oscillatory integrals--Filon-type and Levin-type methods, methods based on steepest descent, and complex-valued Gaussian quadrature. Their understanding calls for a fairly varied mathematical toolbox--from classical numerical analysis, approximation theory, and theory of orthogonal polynomials all the way to asymptotic analysis--yet this understanding is the cornerstone of efficient algorithms.
This will help us customize your experience to showcase the most relevant content to your age group
Please select from below
Login
Not registered?
Sign up
Already registered?
Success – Your message will goes here
We'd love to hear from you!
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.