Computational Methods of Linear Algebra (Repost)

The book starts with basic definitions and results from linear algebra that are used as a foundation for later chapters. The following four chapters present and analyze direct and iterative methods for the solution of linear systems of equations, linear least-squares problems, linear eigenvalue problems, and linear programming problems. Next, a chapter is devoted to the fast Fourier transform, a topic not often covered by comparable texts. The final chapter features a practical introduction to writing computational linear algebra software to run on today's vector and parallel supercomputers.