Ulteriori informazioni
In his new undergraduate textbook, Harold M. Edwards proposes a radically new and thoroughly algorithmic approach to linear algebra. Originally inspired by the constructive philosophy of mathematics championed in the 19th century by Leopold Kronecker, the approach is well suited to students in the computer-dominated late 20th century.
Each proof is an algorithm described in English that can be translated into the computer language the class is using and put to work solving problems and generating new examples, making the study of linear algebra a truly interactive experience.
Designed for a one-semester course, this text adopts an algorithmic approach to linear algebra giving the student many examples to work through and copious exercises to test their skills and extend their knowledge of the subject. Students at all levels will find much interactive instruction in this text while teachers will find stimulating examples and methods of approach to the subject.
Info autore
Harold M. Edwards [1936-2020] was Professor Emeritus of Mathematics at New York University. His research interests lay in number theory, algebra, and the history and philosophy of mathematics. He authored numerous books, including Riemann's Zeta Function (1974, 2001) and Fermat's Last Theorem (1977), for which he received the Leroy P. Steele Prize for mathematical exposition in 1980.
David A. Cox (Contributing Author) is Professor Emeritus of Mathematics in the Department of Mathematics and Statistics of Amherst College. He received the Leroy P. Steele Prize for mathematical exposition in 2016 for his book Ideals, Varieties, and Algorithms, with John Little and Donal O'Shea.
