Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems
نویسندگان
چکیده
منابع مشابه
Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems
IDR(s) is one of the most efficient methods for solving large sparse nonsymmetric linear systems of equations. We present two useful extensions of IDR(s), namely a flexible variant and a multi-shift variant. The algorithms exploit the underlying Hessenberg decomposition computed by IDR(s) to generate basis vectors for the Krylov subspace. The approximate solution vectors are computed using a Qu...
متن کاملScalable Parallel Algorithms for Solving Sparse Systems of Linear Equations∗
We have developed a highly parallel sparse Cholesky factorization algorithm that substantially improves the state of the art in parallel direct solution of sparse linear systems—both in terms of scalability and overall performance. It is a well known fact that dense matrix factorization scales well and can be implemented efficiently on parallel computers. However, it had been a challenge to dev...
متن کاملJunction tree algorithms for solving sparse linear systems
In this technical report we present a self-contained introduction to algorithms that solve sparse linear systems by message passing on a junction tree (a.k.a. clique tree). When solving the systemAx = b whereA is a sparse n×nmatrix, these methods require O(n · w3) time and O(n · w2) space, where w is the treewidth of A’s sparsity graph. These algorithms are useful for parallel or distributed so...
متن کاملReduction algorithms for solving large systems of logical equations
Large systems of logical equations are considered in this paper, each depending on a restricted number of variables. A method of reduction is suggested that reduces the number of roots in separate equations, which in its turn saves time spent for finding roots of the whole system. Three mechanisms of reduction are proposed, each looking for some prohibited combinations of variables in separate ...
متن کاملChallenges in Solving Large Sparse Linear Systems over Finite Fields∗
This talk outlines how very large, sparse linear systems arise in the solution of problems of interest in computational number theory and public-key cryptography, such as the integer factorization and discrete logarithm problems. The linear systems are over finite fields, often the field GF(2) of two elements. We describe some algorithms for solving large sparse linear systems over GF(2), and c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Linear Algebra with Applications
سال: 2014
ISSN: 1070-5325
DOI: 10.1002/nla.1935