Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
New edition extensively revised and updated, including many new problems
Features early treatment of sequences and series relates calculus to calculation and approximation
Offers explanations of all the important theorems to help students understand their meaning
This new edition of Lax, Burstein, and Lax's Calculus with Applications and Computing offers meaningful explanations of the important theorems of single variable calculus. Written with students in mathematics, the physical sciences, and engineering in mind, and revised with their help, it shows that the themes of calculation, approximation, and modeling are central to mathematics and the main ideas of single variable calculus. This edition brings the innovation of the first edition to a new generation of students. New sections in this book use simple, elementary examples to show that when applying calculus concepts to approximations of functions, uniform convergence is more natural and easier to use than point-wise convergence. As in the original, this edition includes material that is essential for students in science and engineering, including an elementary introduction to complex numbers and complex-valued functions, applications of calculus to modeling vibrations and population dynamics, and an introduction to probability and information theory.
Content Level »Lower undergraduate
Keywords »approximation of integrals - complex valued functions - convergence of Newton’s method - differentiability - discrete probability - least upper bound theorem