This comprehensive text and reference work on numerical weather prediction, first published in 2002, covers not only methods for numerical modeling, but also the important related areas of data assimilation and predictability. It incorporates all aspects of environmental computer modeling including an historical overview of the subject, equations of motion and their approximations, a modern and clear description of numerical methods, and the determination of initial conditions using weather observations (an important science known as data assimilation). Finally, this book provides a clear discussion of the problems of predictability and chaos in dynamical systems and how they can be applied to atmospheric and oceanic systems. Professors and students in meteorology, atmospheric science, oceanography, hydrology and environmental science will find much to interest them in this book, which can also form the basis of one or more graduate-level courses.

/pdf/atmospheric-modeling-data-assimilation-and-predictability-1qxqadvqdq.pdf

Atmospheric Modeling, Data Assimilation and Predictability

http://www.mathcs.emory.edu/%7Ebenzi/Web_papers/survey.pdf

Preconditioning techniques for large linear systems: a survey

BoomerAMG: a parallel algebraic multigrid solver and preconditioner

During the last decade, a big progress has been achieved in the analysis and numerical treatment of Initial Value Problems (IVPs) in Differential Algebraic Equations (DAEs) and Ordinary Differential Equations (ODEs). In spite of the rich variety of results available in the literature, there are still many specific problems that require special attention. Two of such, which are considered in this work, are the optimization of order of accuracy and reduction of cost of functional evaluations of Explicit Runge - Kutta (ERK) methods.

Traditionally, the maximum attainable order p of an s-stage ERK method for advancing the solution of an IVP is such that
p(s)
 4
 
In 1999, Goeken presented an s-stage ERK Method of order p(s)=s +1,s>2.
However, this work focuses on the design of a new approximation algorithm that reduces the cost of functional evaluations and yet increases the attainable order higher 
U n and Jonhson [94]; and the classical ERK methods. The order p of 
the new scheme called Multiderivative Explicit Runge-Kutta (MERK) Methods is such that p(s) 2. The stability, convergence and implementation for the optimization of IVPs in DAEs and ODEs systems are also considered.

Numerical solution of initial value problems in differential - algebraic equations

A review of algebraic multigrid

Algebraic multigrid (AMG) is currently undergoing a resurgence in popularity, due in part to the dramatic increase in the need to solve physical problems posed on very large, unstructured grids. While AMG has proved its usefulness on various problem types, it is not commonly understood how wide a range of applicability the method has. In this study, we demonstrate that range of applicability, while describing some of the recent advances in AMG technology. Moreover, in light of the imperatives of modern computer environments, we also examine AMG in terms of algorithmic scalability. Finally, we show some of the situations in which standard AMG does not work well and indicate the current directions taken by AMG researchers to alleviate these difficulties.

Robustness and Scalability of Algebraic Multigrid

Efficient numerical simulation of physical processes is constrained by our ability to solve the resulting linear systems, prompting substantial research into the development of multiscale iterative methods capable of solving these linear systems with an optimal amount of effort. Overcoming the limitations of geometric multigrid methods to simple geometries and differential equations, algebraic multigrid methods construct the multigrid hierarchy based only on the given matrix. While this allows for efficient black-box solution of the linear systems associated with discretizations of many elliptic differential equations, it also results in a lack of robustness due to unsatisfied assumptions made on the near null spaces of these matrices. This paper introduces an extension to algebraic multigrid methods that removes the need to make such assumptions by utilizing an adaptive process. Emphasis is on the principles that guide the adaptivity and their application to algebraic multigrid solution of certain symmetric positive-definite linear systems.

Adaptive Algebraic Multigrid

Substantial effort has been focused over the last two decades on developing multilevel iterative methods capable of solving the large linear systems encountered in engineering practice. These systems often arise from discretizing partial differential equations over unstructured meshes, and the particular parameters or geometry of the physical problem being discretized may be unavailable to the solver. Algebraic multigrid (AMG) and multilevel domain decomposition methods of algebraic type have been of particular interest in this context because of their promises of optimal performance without the need for explicit knowledge of the problem geometry. These methods construct a hierarchy of coarse problems based on the linear system itself and on certain assumptions about the smooth components of the error. For smoothed aggregation (SA) multigrid methods applied to discretizations of elliptic problems, these assumptions typically consist of knowledge of the near-kernel or near-nullspace of the weak form. This paper introduces an extension of the SA method in which good convergence properties are achieved in situations where explicit knowledge of the near-kernel components is unavailable. This extension is accomplished in an adaptive process that uses the method itself to determine near-kernel components and adjusts the coarsening processes accordingly.

Adaptive Smoothed Aggregation ($\alpha$SA) Multigrid

A multilevel adaptive aggregation method for calculating the stationary probability vector of an irreducible stochastic matrix is described. The method is a special case of the adaptive smoothed aggregation and adaptive algebraic multigrid methods for sparse linear systems and is also closely related to certain extensively studied iterative aggregation/disaggregation methods for Markov chains. In contrast to most existing approaches, our aggregation process does not employ any explicit advance knowledge of the topology of the Markov chain. Instead, adaptive agglomeration is proposed that is based on the strength of connection in a scaled problem matrix, in which the columns of the original problem matrix at each recursive fine level are scaled with the current probability vector iterate at that level. The strength of connection is determined as in the algebraic multigrid method, and the aggregation process is fully adaptive, with optimized aggregates chosen in each step of the iteration and at all recursive levels. The multilevel method is applied to a set of stochastic matrices that provide models for web page ranking. Numerical tests serve to illustrate for which types of stochastic matrices the multilevel adaptive method may provide significant speedup compared to standard iterative methods. The tests also provide more insight into why Google's PageRank model is a successful model for determining a ranking of web pages.

/pdf/multilevel-adaptive-aggregation-for-markov-chains-with-uptohfsvdz.pdf

Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking

A smoothed aggregation multigrid method is presented for the numerical calculation of the stationary probability vector of an irreducible sparse Markov chain. It is shown how smoothing the interpolation and restriction operators can dramatically increase the efficiency of aggregation multigrid methods for Markov chains that have been proposed in the literature. The proposed smoothing approach is inspired by smoothed aggregation multigrid for linear systems, supplemented with a new lumping technique that assures well-posedness of the coarse-level problems: the coarse-level operators are singular M-matrices on all levels, resulting in strictly positive coarse-level corrections on all levels. Numerical results show how these methods lead to nearly optimal multigrid efficiency for an extensive set of test problems, both when geometric and algebraic aggregation strategies are used.

/pdf/smoothed-aggregation-multigrid-for-markov-chains-3yifglj2fp.pdf

John W. Ruge

Papers

Robustness and Scalability of Algebraic Multigrid

Adaptive Algebraic Multigrid

Adaptive Smoothed Aggregation ($\alpha$SA) Multigrid

Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking

Smoothed Aggregation Multigrid for Markov Chains