BibSonomy now supports HTTPS. Switch to HTTPS.

- Basic textbook for linear algebra with worked examples, glossary, exercises, index. Web page: www.wellesleycambridge.com
- Author : Sergei Treil, Department of Mathematics, Brown University Publication Date : 2004 Excerpts from the Introduction: The title of the book sounds a bit mysterious. Why should anyone read this book if it presents the subject in a wrong way? What is particularly done "wrong" in the book? Before answering these questions, let me first describe the target audience of this text. This book appeared as lecture notes for the course "Honors Linear Algebra". It supposed to be a first linear algebra course for mathematically advanced students. It is intended for a student who, while not yet very familiar with abstract reasoning, is willing to study more rigorous mathematics that is presented in a "cookbook style" calculus type course. Besides being a first course in linear algebra it is also supposed to be a first course introducing a student to rigorous proof, formal definitions---in short, to the style of modern theoretical (abstract) mathematics. The target audience explains the very specific blend of elementary ideas and concrete examples, which are usually presented in introductory linear algebra texts with more abstract definitions and constructions typical for advanced books. Another specific of the book is that it is not written by or for an algebraist. So, I tried to emphasize the topics that are important for analysis, geometry, probability, etc., and did not include some traditional topics. For example, I am only considering vector spaces over the fields of real or complex numbers. Linear spaces over other fields are not considered at all, since I feel time required to introduce and explain abstract fields would be better spent on some more classical topics, which will be required in other disciplines. And later, when the students study general fields in an abstract algebra course they will understand that many of the constructions studied in this book will also work for general fields. Also, I treat only finite-dimensional spaces in this book and a basis always means a finite basis. The reason is that it is impossible to say something non-trivial about infinite-dimensional spaces without introducing convergence, norms, completeness etc., i.e. the basics of functional analysis. And this is definitely a subject for a separate course (text). So, I do not consider infinite Hamel bases here: they are not needed in most applications to analysis and geometry, and I feel they belong in an abstract algebra course.
- Author : Sergei Treil, Department of Mathematics, Brown University Publication Date : 2004 Excerpts from the Introduction: The title of the book sounds a bit mysterious. Why should anyone read this book if it presents the subject in a wrong way? What is particularly done "wrong" in the book? Before answering these questions, let me first describe the target audience of this text. This book appeared as lecture notes for the course "Honors Linear Algebra". It supposed to be a first linear algebra course for mathematically advanced students. It is intended for a student who, while not yet very familiar with abstract reasoning, is willing to study more rigorous mathematics that is presented in a "cookbook style" calculus type course. Besides being a first course in linear algebra it is also supposed to be a first course introducing a student to rigorous proof, formal definitions---in short, to the style of modern theoretical (abstract) mathematics. The target audience explains the very specific blend of elementary ideas and concrete examples, which are usually presented in introductory linear algebra texts with more abstract definitions and constructions typical for advanced books. Another specific of the book is that it is not written by or for an algebraist. So, I tried to emphasize the topics that are important for analysis, geometry, probability, etc., and did not include some traditional topics. For example, I am only considering vector spaces over the fields of real or complex numbers. Linear spaces over other fields are not considered at all, since I feel time required to introduce and explain abstract fields would be better spent on some more classical topics, which will be required in other disciplines. And later, when the students study general fields in an abstract algebra course they will understand that many of the constructions studied in this book will also work for general fields. Also, I treat only finite-dimensional spaces in this book and a basis always means a finite basis. The reason is that it is impossible to say something non-trivial about infinite-dimensional spaces without introducing convergence, norms, completeness etc., i.e. the basics of functional analysis. And this is definitely a subject for a separate course (text). So, I do not consider infinite Hamel bases here: they are not needed in most applications to analysis and geometry, and I feel they belong in an abstract algebra course.
- Basic textbook for linear algebra with worked examples, glossary, exercises, index. Web page: www.wellesleycambridge.com
- An introduction to linear algebra, based on lectures given by the author over 17 years, in the (now defunct) first year course MP103 at the University of Queensland. The style is somewhat formal and terse, in which you won't find any attempt of personification. Definitely a genuine textbook. Students are encouraged to try the problems, which range from the mechanical to the more subtle, the latter demanding a greater level of interaction from the student. The section on subspaces is meant to be a gentle introduction to the second course, where abstract vector spaces are met in detail. Things of substance are met here, including the rank of a matrix. The section on three dimensional geometry makes use of the earlier sections on linear equations, matrices and determinants and some of the proofs are more algebraic (even pedantic) than some readers would like. One criticism of the book has been its neglect of the computational side of the subject. This is partly a reflection of author's love of discrete things such as integers, rational numbers and finite fields and a distrust of floating point arithmetic. However, the author has written an exact arithmetic matrix program called CMAT, which performs exact calculations on matices whose elements are rational numbers, complex rational numbers or numbers from a finite field of p (prime) elements. CMAT takes the hard work out of calculating things such as the reduced row echelon form, the determinant and characteristic polynomial of a matrix.

- (
*2016*)*cite arxiv:1603.09133.* - (
*2015*)*cite arxiv:1505.07589Comment: 19 pages, 3 figures.* *WWW '09: Proceedings of the 18th international conference on World wide web,**page 331--340.**New York, NY, USA,**ACM,*(*2009*)*CIKM '02: Proceedings of the eleventh international conference on Information and knowledge management,**page 211--218.**New York, NY, USA,**ACM,*(*2002*)*SIGIR '07: Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval,**page 487--494.**New York, NY, USA,**ACM,*(*2007*)*EMCL '01: Proceedings of the 12th European Conference on Machine Learning,**page 491--502.**London, UK,**Springer-Verlag,*(*2001*)*CIKM '08: Proceeding of the 17th ACM conference on Information and knowledge mining,**page 709--718.**New York, NY, USA,**ACM,*(*2008*)*SIAM Rev.**46 (4): 647--666*(*2004*)*In IJCAI,**page 561--566.*(*2003*)*Proceedings of the Eleventh International World Wide Web Conference,**Honolulu, Hawaii,*(*May 2002*)*KDD '07: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining,**page 163--172.**New York, NY, USA,**ACM,*(*2007*)*JASIS**51 (7): 602-613*(*2000*)*UT-CS-94-270.*(*1994*)*Journal of Social Structure*(*2000*)- (
*2005*) *IJCAI,**page 903-910.**Morgan Kaufmann,*(*2001*)*ICCV,**page 975-982.*(*1999*)*SIAM Annual Meeting,*(*June 2003*)*Seventh Bay Area Scientific Computing Day,*(*March 2006*)*LAPACK Working Note,**165.**Netlib,*(*February 2005*)