Exploiting hidden structure in Matrix computations : algorithms and applications / [edited by] Michele Benzi and Valeria Simoncini.
Material type:
- 9783319498867 (alk. paper)
- 512.9434 23 C397
Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|
Books | ISI Library, Kolkata | 512.9434 C397 (Browse shelf(Opens below)) | Available | 137734 |
Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)
No cover image available | No cover image available | No cover image available | ||||||
512.9434 B967 Determinants | 512.9434 Bh575 Matrix analysis | 512.9434 C191 Recent applications of generalized inverses | 512.9434 C397 Exploiting hidden structure in Matrix computations : algorithms and applications / | 512.9434 C492 Eigenvalues of matrices | 512.9434 C518 Matrix preconditioning techniques and applications | 512.9434 C518 Matrix preconditioning techniques and applications |
Includes bibliographical references.
Structured Matrix Problems from Tensors / Loan, Charles F. --
Matrix Structures in Queuing Models / Bini, Dario A. --
Matrices with Hierarchical Low-Rank Structures / Ballani, Jonas & Kressner, Daniel --
Localization in Matrix Computations: Theory and Applications / Benzi, Michele --
Groups and Symmetries in Numerical Linear Algebra / Munthe-Kaas, Hans Z.
Focusing on special matrices and matrices which are in some sense 'near' to structured matrices, this volume covers a broad range of topics of current interest in numerical linear algebra. Exploitation of these less obvious structural properties can be of great importance in the design of efficient numerical methods, for example algorithms for matrices with low-rank block structure, matrices with decay, and structured tensor computations. Applications range from quantum chemistry to queuing theory. Structured matrices arise frequently in applications. Examples include banded and sparse matrices, Toeplitz-type matrices, and matrices with semi-separable or quasi-separable structure, as well as Hamiltonian and symplectic matrices. The associated literature is enormous, and many efficient algorithms have been developed for solving problems involving such matrices. The text arose from a C.I.M.E. course held in Cetraro (Italy) in June 2015 which aimed to present this fast growing field to young researchers, exploiting the expertise of five leading lecturers with different theoretical and application perspectives.
There are no comments on this title.