Scientific Computing: Vol. II - Eigenvalues and Optimization

ISBN-13: 9783319691060 / Angielski / Twarda / 2018 / 600 str.

John A. Trangenstein

Opis

This is the second of three volumes providing a comprehensive presentation of the fundamentals of scientific computing. This volume discusses more advanced topics than volume one, and is largely not a prerequisite for volume three.

Spis treści

1. Eigenvalues and Eigenvectors.- 2. Iterative Linear Algebra.- 3. Nonlinear Systems.- 4. Constrained Optimization.- References.- Author Index

O autorze

John Trangenstein is Professor of Mathematics Emeritus at Duke University in Durham North Carolina. He was a professor at Duke from 1991 to 2011. Previously he was a Mathematician in the Applied Mathematics Group at Lawrence Livermore National Laboratory from 1986 to 1991, a Research Specialist at Exxon Production Laboratory in Houston from 1981 to 1986, a Mathematician at S Cubed in San Diego from 1979 to 1981, and an Assistant Professor of Mathematics at the University of California at San Diego from 1975 to 1979. He received his PhD in Applied Mathematics from Cornell University in 1975, and his SB degree from the University of Chicago in 1972. He has authored two other book, with Cambridge University Press, namely Numerical Solution of Hyperbolic Partial Differential Equations (2009) and Numerical Solution of Elliptic and Parabolic Partial Differential Equations (2013).

Blurb

This is the second of three volumes providing a comprehensive presentation of the fundamentals of scientific computing. This volume discusses more advanced topics than volume one, and is largely not a prerequisite for volume three. This book and its companions show how to determine the quality of computational results, and how to measure the relative efficiency of competing methods. Readers learn how to determine the maximum attainable accuracy of algorithms, and how to select the best method for computing problems. This book also discusses programming in several languages, including C++, Fortran and MATLAB. There are 49 examples, 110 exercises, 66 algorithms, 24 interactive JavaScript programs, 77 references to software programs and 1 case study.

Topics are introduced with goals, literature references and links to public software. There are descriptions of the current algorithms in LAPACK, GSLIB and MATLAB.

This book could be used for a second course in numerical methods, for either upper level undergraduates or first year graduate students. Parts of the text could be used for specialized courses, such as nonlinear optimization or iterative linear algebra.