Support-Graph Preconditioners
نویسندگان
چکیده
We present a preconditioning technique, called support-graph preconditioning, and use it to analyze two classes of preconditioners. The technique was first described in a talk by Pravin Vaidya, who did not formally publish his results. Vaidya used the technique to devise and analyze a class of novel preconditioners. The technique was later extended by Gremban and Miller, who used it in the development and analysis of yet another class of new preconditioners. This paper extends the technique further and uses it to analyze a class of existing preconditioners, modified incomplete-Cholesky. The paper also contains a presentation of Vaidya’s preconditioners, which was previously missing from the literature.
منابع مشابه
Condition number study of graph theory based preconditioners for isogeometric discretization of Poisson equation
We study the preconditioning of the stiffness matrix which arises from the discretization of the Poisson equation using IsoGeometric Method (IGM). A study of condition number of stiffness matrices, resulting from NURBS based IGM, suggests that novel preconditioning techniques are needed for fast and efficient iterative solvers for the resulting linear system. As a first step towards preconditio...
متن کاملSupport Graph Preconditioners for the Finite Element Method
Extended Abstract In this paper, we present a class of graph-based preconditioners for sparse linear systems arising from the finite element discretization of elliptic partial differential equations. A sparse matrix can be preconditioned by using a subgraph of its weighted adjacency matrix. The subgraph can be viewed as a " support graph " and the corresponding sparse matrix can be used as a pr...
متن کاملA Comparison of Preconditioners for Solving Linear Systems Arising from Graph Laplacians∗
We consider the solution of linear systems corresponding to the combinatorial and normalized graph Laplacians of large unstructured networks. We only consider undirected graphs, so the corresponding matrices are symmetric. A promising approach to solving these problems is to use a class of support graph preconditioners. We previously implemented such a preconditioner in Trilinos in serial using...
متن کاملSolving Symmetric Diagonally-Dominant Systems by Preconditioning
In this paper we design support-tree preconditioners for n × n matrices with m nonzeros that aresymmetric and diagonally-dominant with a nonnegative diagonal (SDD matrix). This reduces to de-signing such a preconditioner for a Laplacian matrix, A, which can be interpreted as an undirectednonnegatively-weighted graph, G with n vertices and m edges. Preconditioners accelerate the ...
متن کاملSupport Theory for Preconditioning
We present support theory, a set of techniques for bounding extreme eigenvalues and condition numbers for matrix pencils. Our intended application of support theory is to enable proving condition number bounds for preconditioners for symmetric, positive definite systems. One key feature sets our approach apart from most other works: We use support numbers instead of generalized eigenvalues. Alt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 27 شماره
صفحات -
تاریخ انتشار 2006