## Files in this item

FilesDescriptionFormat

application/pdf

(no description provided)PDF

## Description

 Title: Preconditioners for Generalized Saddle-Point Problems Author(s): Siefert, Chris M. Subject(s): computer science Abstract: Generalized saddle point problems arise in a number of applications, ranging from optimization and metal deformation to fluid flow and PDE-governed optimal control. We focus our discussion on the most general case, making no assumption of symmetry or definiteness in the matrix or its blocks. As these problems are often large and sparse, preconditioners play a critical role in speeding the convergence of Krylov methods for these problems. We first examine two types of preconditioners for these problems, one block-diagonal and one indefinite, and present analyses of the eigenvalue distributions of the preconditioned matrices. We also investigate the use of approximations for the Schur complement matrix in these preconditioners and develop eigenvalue analysis accordingly. Second, we examine new developments in probing methods, inspired by graph coloring methods for sparse Jacobians, for building approximations to Schur complement matrices. We then present an analysis of these techniques and their accuracy. In addition, we provide a mathematical justification for their use in approximating Schur complements and suggest the use of approximate factorization techniques to decrease the computational cost of applying the inverse of the probed matrix. Finally, we consider the effect of our preconditioners on four applications. Two of these applications come from the realm of fluid flow, one using a finite element discretization and the other using a spectral discretization. The third application involves the stress relaxation of aluminum strips at low stress levels. The final application involves mesh parameterization and flattening. For these applications, we present results illustrating the eigenvalue bounds on our preconditioners and demonstrating the theoretical justification of these methods. We also present convergence and timing results, showing the effectiveness of our methods in practice. Specifically the use of probing methods for approximating the Schur compliment matrices in our preconditioners is empirically justified. We also investigate the $h$-dependence of our preconditioners one model fluid problem, and demonstrate empirically that our methods do not suffer from a deterioration in convergence as the problem size increases. Issue Date: 2006-01 Genre: Technical Report Type: Text URI: http://hdl.handle.net/2142/11145 Other Identifier(s): UIUCDCS-R-2006-2671 Rights Information: You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s). Date Available in IDEALS: 2009-04-20
﻿