**Data Assimilation: A Mathematical Introduction**

by K.J.H. Law, A.M. Stuart, K.C. Zygalakis

**Publisher**: arXiv.org 2015**ISBN-13**: 9783319203256**Number of pages**: 158

**Description**:

This book provides a systematic treatment of the mathematical underpinnings of work in data assimilation, covering both theoretical and computational approaches. Specifically the authors develop a unified mathematical framework in which a Bayesian formulation of the problem provides the bedrock for the derivation, development and analysis of algorithms; the many examples used in the text, together with the algorithms which are introduced and discussed, are all illustrated by the MATLAB software detailed in the book and made freely available online.

Download or read it online for free here:

**Download link**

(2.2MB, PDF)

## Similar books

**Optimization and Dynamical Systems**

by

**U. Helmke, J. B. Moore**-

**Springer**

Aimed at mathematics and engineering graduate students and researchers in the areas of optimization, dynamical systems, control systems, signal processing, and linear algebra. The problems solved are those of linear algebra and linear systems theory.

(

**10301**views)

**Applied Mathematical Programming Using Algebraic Systems**

by

**Bruce A. McCarl, Thomas H. Spreen**-

**Texas A&M University**

This book is intended to both serve as a reference guide and a text for a course on Applied Mathematical Programming. The text concentrates upon conceptual issues, problem formulation, computerized problem solution, and results interpretation.

(

**7568**views)

**Convex Optimization: Algorithms and Complexity**

by

**Sebastien Bubeck**-

**arXiv.org**

This text presents the main complexity theorems in convex optimization and their algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural and stochastic optimization.

(

**2149**views)

**Discrete Optimization**

by

**Guido Schaefer**-

**Utrecht University**

From the table of contents: Preliminaries (Optimization Problems); Minimum Spanning Trees; Matroids; Shortest Paths; Maximum Flows; Minimum Cost Flows; Matchings; Integrality of Polyhedra; Complexity Theory; Approximation Algorithms.

(

**4929**views)