The Leading eBooks Store Online
for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry...
New to eBooks.com?Learn more
- Bestsellers - This Week
- Foreign Language Study
- Bestsellers - Last 6 months
- Graphic Books
- Health & Fitness
- Political Science
- Biography & Autobiography
- Psychology & Psychiatry
- Body Mind & Spirit
- House & Home
- Business & Economics
- Children's & Young Adult Fiction
- Juvenile Nonfiction
- Language Arts & Disciplines
- Crafts & Hobbies
- Science Fiction
- Current Events
- Literary Collections
- Literary Criticism
- Literary Fiction
- Social Science
- The Environment
- Sports & Recreation
- Family & Relationships
- Study Aids
- Folklore & Mythology
- Food and Wine
- Performing Arts
- True Crime
- Foreign Language Books
- De Gruyter 2012; US$ 629.00
This textbook presents a number of the most important numerical methods for finding eigenvalues and eigenvectors of matrices. The authors discuss the central ideas underlying the different algorithms and introduce the theoretical concepts required to analyze their behaviour. Several programming examples allow the reader to experience the... more...
- Springer London 2006; US$ 119.00
The first and only book to make this research available in the West Concise and accessible: proofs and other technical matters are kept to a minimum to help the non-specialist Each chapter is self-contained to make the book easy-to-use more...
- Oxford University Press 2005; US$ 169.99
Inverse eigenvalue problems arise in a remarkable variety of applications and associated with any inverse eigenvalue problem are two fundamental questions--the theoretical issue of solvability and the practical issue of computability. Both questions are difficult and challenging. In this text, the authors discuss the fundamental questions, some known... more...
- Elsevier Science 1986; US$ 72.95
Results of research into large scale eigenvalue problems are presented in this volume. The papers fall into four principal categories: novel algorithms for solving large eigenvalue problems, novel computer architectures, computationally-relevant theoretical analyses, and problems where large scale eigenelement computations have provided new insight.... more...
- Springer US 2007; US$ 169.00
List of Figures. List of Tables. Acknowledgments. 1. Introduction. 2. Preliminaries. 3. The Butterfly Form for Symplectic Matrices and Matrix Pencils. 4. Butterfly SR and SZ Algorithms. 5. The Symplectic Lanczos Algorithm. 6. Concluding Remarks. more...
- Birkhäuser Basel 2006; US$ 69.99
Problems linking the shape of a domain or the coefficients of an elliptic operator to the sequence of its eigenvalues are among the most fascinating of mathematical analysis. In this book, we focus on extremal problems. For instance, we look for a domain which minimizes or maximizes a given eigenvalue of the Laplace operator with various boundary... more...
- Springer Berlin Heidelberg 2006; US$ 159.00
The purpose of this book is to describe recent developments in solving eig- value problems, in particular with respect to the QR and QZ algorithms as well as structured matrices. Outline Mathematically speaking, the eigenvalues of a square matrix A are the roots of its characteristic polynomial det(A??I). An invariant subspace is a linear subspace... more...
- Elsevier Science 2003; US$ 235.00
This monograph provides a comprehensive treatment of expansion theorems for regular systems of first order differential equations and n -th order ordinary differential equations. In 10 chapters and one appendix, it provides a comprehensive treatment from abstract foundations to applications in physics and engineering. The focus is on non-self-adjoint... more...
- Springer 2010; US$ 69.95
This book studies the original results, and their extensions, of the Russian mathematician, S.A. Gergorin, who wrote a seminal paper in 1931, on how to easily obtain estimates of all n eigenvalues (characteristic values) of any given n-by-n complex matrix. Since the publication of this paper, there has been many newer results spawned by his paper,... more...