Skip to main content
Book cover

Exploiting Hidden Structure in Matrix Computations: Algorithms and Applications

Cetraro, Italy 2015

  • Book
  • © 2016

Overview

  • Provides a detailed treatment of the emerging field of hidden or approximate-structured matrix problems
  • Offers different theoretical and application perspectives in a thorough presentation by leading figures in this area
  • Gives rich pointers to the state-of-the-art literature on the subject
  • Includes supplementary material: sn.pub/extras

Part of the book series: Lecture Notes in Mathematics (LNM, volume 2173)

Part of the book sub series: C.I.M.E. Foundation Subseries (LNMCIME)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

Keywords

About this book

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.

Authors, Editors and Affiliations

  • Mathematics and Science Center, Emory University, Atlanta, USA

    Michele Benzi

  • Dipart. di Matematica, Università di Bologna, Bologna, Italy

    Valeria Simoncini

  • Mathematics and Science Center, Emory University , Atlanta, USA

    Michele Benzi

  • Università di Pisa , Pisa, Italy

    Dario Bini

  • École Polytechnique Fédérale de Lausanne , Lausanne, Switzerland

    Daniel Kressner

  • Department of Mathematics, University of Bergen , Bergen, Norway

    Hans Munthe-Kaas

  • Department of Computer Science, Cornell University , Ithaca, USA

    Charles Van Loan

Bibliographic Information

  • Book Title: Exploiting Hidden Structure in Matrix Computations: Algorithms and Applications

  • Book Subtitle: Cetraro, Italy 2015

  • Authors: Michele Benzi, Dario Bini, Daniel Kressner, Hans Munthe-Kaas, Charles Van Loan

  • Editors: Michele Benzi, Valeria Simoncini

  • Series Title: Lecture Notes in Mathematics

  • DOI: https://doi.org/10.1007/978-3-319-49887-4

  • Publisher: Springer Cham

  • eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)

  • Copyright Information: Springer International Publishing AG 2016

  • Softcover ISBN: 978-3-319-49886-7Published: 02 February 2017

  • eBook ISBN: 978-3-319-49887-4Published: 24 January 2017

  • Series ISSN: 0075-8434

  • Series E-ISSN: 1617-9692

  • Edition Number: 1

  • Number of Pages: IX, 406

  • Number of Illustrations: 11 b/w illustrations, 46 illustrations in colour

  • Topics: Numerical Analysis, Computational Science and Engineering

Publish with us