Climatology and meteorology have basically been a descriptive science until it became possible to use numerical models, but it is crucial to the success of the strategy that the model must be a good representation of the real climate system of the Earth. Models are required to reproduce not only the mean properties of climate, but also its variability and the strong spatial relations between climate variability in geographically diverse regions. Quantitative techniques were developed to explore the climate variability and its relations between different geographical locations. Methods were borrowed from descriptive statistics, where they were developed to analyze variance of related observations-variable pairs, or to identify unknown relations between variables.

A Guide to Empirical Orthogonal Functions for Climate Data Analysis uses a different approach, trying to introduce the reader to a practical application of the methods, including data sets from climate simulations and MATLAB codes for the algorithms. All pictures and examples used in the book may be reproduced by using the data sets and the routines available in the book .

Though the main thrust of the book is for climatological examples, the treatment is sufficiently general that the discussion is also useful for students and practitioners in other fields.

Supplementary datasets are available via http: //extra.springer.com

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.