Exploiting Hidden Structure in Matrix Computations: Algorithms and Applications
Produs indisponibil momentan. Pentru comenzi va rugam trimiteti mail la adresa depozit2@prior.ro sau contactati-ne la numarul de telefon 021 210 89 28 Vedeti mai jos alte produse similare disponibile.
Disponibilitate: Acest produs nu este momentan in stoc
Editura: Springer
Limba: Engleza
Nr. pagini: 420
Coperta: Paperback
Dimensiuni: 15.5 x 2.5 x 23.5 cm
An aparitie: 2016
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.
Springer
An aparitie | 2016 |
Autor | Michele Benzi, Dario Bini, Daniel Kressner |
Dimensiuni | 15.5 x 2.5 x 23.5 cm |
Editura | Springer |
Format | Paperback |
ISBN | 9783319498867 |
Limba | Engleza |
Nr pag | 420 |
Clientii ebookshop.ro nu au adaugat inca opinii pentru acest produs. Fii primul care adauga o parere, folosind formularul de mai jos.