Brezplačna dostava za naročila nad 69.99 € na paketomatih Pošte Slovenije.

Preverjanje stanja naročila

Postanite del skupnosti ljubiteljev knjig z vsega sveta in uživajte v številnih ugodnostih. Ustvarite brezplačen račun

Brezplačna dostava Zásilkovna nad 69.99 €

Zbirna točka GLS 4.49 € Zbirna točka DPD 2.99 € Kurirska služba GLS 5.49 € Kurir DPD 3.49 € Kurirska služba 3.49 € Zbirno mesto Express One 3.49 € Zbirno mesto 3.49 € Dostava preko Pošte Slovenije 3.49 €

Kontakt

Kako nakupovati

Pomoč

Moj račun

▸ Prazna :-(

Brezplačna dostava za naročila nad 69.99 € na paketomatih Pošte Slovenije.

Exploiting Hidden Structure in Matrix Computations: Algorithms and Applications

Cetraro, Italy 2015

Jezik

Angleščina

Knjiga Mehka

Koda Libristo: 15195048

Založba Springer International Publishing AG, februar 2017

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

Koda Libristo: 15195048

216 b

89.28 €

Na zalogi pri dobavitelju Odposlali bomo v 10-18 dneh

Do 30 dni za vračilo

Drugi so kupili tudi

Vivre avec sa tête ou son coeur Lucien Auger

Mehka

11.04 €

Tomboy Celerier Battistella

Mehka

15.70 €

Manifeste anarcha-féministe Bottici

Mehka

12.46 €

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

Mehka

91.20 €

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.