Spedizione gratuita per ordini superiori a 69,99 euro.

Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Spedizione gratuita con Packeta per un prezzo superiore a 69.99 €

Corriere Bartolini 4.49 € Punto Poste 5.49 € Punto Poste 5.49 € Punto Bartolini 3.49 € Corriere DHL 6.99 € Corriere GLS 5.99 € Punto GLS 4.49 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Spedizione gratuita per ordini superiori a 69,99 euro.

Exploiting Hidden Structure in Matrix Computations: Algorithms and Applications

Cetraro, Italy 2015

Lingua

Inglese

Libro In brossura

Codice Libristo: 15195048

Casa editrice Springer International Publishing AG, febbraio 2017

Focusing on special matrices and matrices which are in some sense `near' to structured matrices, thi... Descrizione completa

Codice Libristo: 15195048

206 b

84.09 €

Magazzino esterno Inviamo tra 5-8 giorni

Fino a 30 giorni per il reso

I clienti hanno acquistato anche

Elements de mineralogie et de lithologie Alexandre Leymerie

In brossura

25.09 €

Vivre avec sa tête ou son coeur Lucien Auger

In brossura

12.49 €

Tomboy Celerier Battistella

In brossura

17.69 €

Sokak Calgicisi

In brossura

13.69 €

Manifeste anarcha-féministe Bottici

In brossura

13.19 €

Nähe, Distanz und Anonymität - Untersuchungen zum sein-Modalpassiv und Gerundiv Igor Trost

In brossura

100.29 €

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.