Two Conjugate-Gradient-Type Methods for Unsymmetric Linear Equations

This paper proposes an image fusion algorithm based on a sparse linear equation system, which uses local extreme of high resolution image and intensity of multi-spectral image to construct the system. Based on this sparse system, the multi-scale image decomposition algorithm can be implemented. This algorithm extracts the details of the high-resolution image and integrates with the multi-spectral information to derive the fused image.

During the past few years, algorithmic improvements alone have reduced the time required for the direct solution of unsymmetric sparse systems of linear equations by almost an order of magnitude. This paper compares the performance of some well-known software packages for solving general sparse systems. In particular, it demonstrates the consistently high level of performance achieved by WSMP---the most recent of such solvers. It compares the various algorithmic components of these solvers and discusses their impact on solver performance. Our experiments show that the algorithmic choices made in WSMP enable it to run more than twice as fast as the best among similar solvers and that WSMP can factor some of the largest sparse matrices available from real applications in only a few seconds on a 4-CPU workstation. Thus, the combination of advances in hardware and algorithms makes it possible to solve those general sparse linear systems quickly and easily that might have been considered too large until recently.

In recent years a number of solvers for the direct solution of large sparse symmetric linear systems of equations have been developed. These include solvers that are designed for the solution of positive definite systems as well as those that are principally intended for solving indefinite problems. In this study, we use performance profiles as a tool for evaluating and comparing the performance of serial sparse direct solvers on an extensive set of symmetric test problems taken from a range of practical applications.

Many of the fast methods for factoring integers and computing discrete logarithms require the solution of large sparse linear systems of equations over finite fields. This paper presents the results of implementations of several linear algebra algorithms. It shows that very large sparse systems can be solved efficiently by using combinations of structured Gaussian elimination and the conjugate gradient, Lanczos, and Wiedemann methods.

We propose a new algorithm to find a rational solution to a sparse system of linear equations over the integers. This algorithm is based on a p-adic lifting technique combined with the use of block matrices with structured blocks. It achieves a sub-cubic complexity in terms of machine operations subject to a conjecture on the effectiveness of certain sparse projections. A LinBox-based implementation of this algorithm is demonstrated, and emphasizes the practical benefits of this new method over the previous state of the art.

This paper presents numerical results for a preconditioning technique for the iterative solution of the indefinite linear system of equations obtained when a higher order H (curl) conforming finite element approximation is adopted for the vector wave equation. Numerical results are presented for a model problem that includes a singularity at the origin and dicretisations that include graded meshes and uniform p. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

We investigate the sparse underdetermined system of linear algebraic equations that arise in applications to the traffic in the network. We consider the technological and informational aspects of building a general and unique solution of the sparse linear systems in the Sensor Location Problem for the graph.

We discuss design features of a code which solves sparse unsymmetric systems of linear equations using a frontal method. We consider in particular the user interface, the internal data structures, the pivoting strategy, and the isolation of machine dependencies. We illustrate the performance of our code on a variety of test problems on both the IBM 3033 and the CRAY-1.

Solution of finite-horizon multivariate linear rational expectations models and sparse linear systems

A projection method for solving nonsymmetric linear systems on multiprocessors

It is known that the main computational costs in the FEM implementation are computing the global system of linear equations (material response computation and stiffness matrix ensemble) and its solution. With the aim of speeding up the total solving boundary value problem time with the help of the developed solver, algorithms of the parallel stiffness matrix ensemble and the system of linear equations solution were implemented. In this paper the results of using GPU to accelerate computations related to the solution of direct boundary value problems of crystal plasticity are present. The existing algorithms for solving the sparse systems of linear equations and parallel ensemble of the global stiffness matrix were implemented on both the CPU and GPU. As a result, a total acceleration of up to 10 times was obtained compared to the software implementation on the CPU.

The solutions of sparse eigenvalue problems and linear systems constitute one of the key computational kernels in the discretization of partial differential equations for the modeling of linear accelerators. The computational challenges faced by existing techniques for solving those sparse eigenvalue problems and linear systems call for continuing research to improve on the algorithms so that ever increasing problem size as required by the physics application can be tackled. Under the support of this award, the filter algorithm for solving large sparse eigenvalue problems was developed at Stanford to address the computational difficulties in the previous methods with the goal to enable accelerator simulations on then the world largest unclassified supercomputer at NERSC for this class of problems. Specifically, a new method, the Hemitian skew-Hemitian splitting method, was proposed and researched as an improved method for solving linear systems with non-Hermitian positive definite and semidefinite matrices.

In this paper, we consider the problem of solving a sparse nonsingular system of linear equations. We show that the structures of the triangular matrices obtained in the $LU$-decomposition of a sparse nonsingular matrix A using Gaussian elimination with partial pivoting are contained in those of the Cholesky factors of $A^T A$, provided that the diagonal elements of A are nonzero. Based on this result, a method for solving sparse linear systems is then described. The main advantage of this method is that the numerical computation can be carried out using a static data structure. Numerical experiments comparing this method with other implementations of Gaussian elimination for solving sparse linear systems are presented and the results indicate that the method proposed in this paper is quite competitive with other approaches.

During my visit to LLNL during the summer of 2010, I worked on algebraic multilevel solvers for large sparse systems of linear equations arising from discretizations of partial differential equations. The particular solver of interest is based on ILU decomposition. The setup phase for this AMG solve is just the single ILU decomposition, and its corresponding error matrix. Because the ILU uses a minimum degree or similar sparse matrix ordering, most of the fill-in, and hence most of the error, is concentrated in the lower right corner of the factored matrix. All of the major multigrid components - the smoother, the coarse level correction matrices, and the fine-to-coarse and coarse-to-fine rectangular transfer matrices, are defined in terms of various blocks of the ILU factorization. Although such a strategy is not likely to be optimal in terms of convergence properties, it has a relatively low setup cost, and therefore is useful in situations where setup costs for more traditional AMG approaches cannot be amortized over the solution of many linear systems using the same matrix. Such a situation arises in adaptive methods, where often just one linear system is solved at each step of an adaptive feedback loop, or in solving nonlinear equations by approximate Newton methods, where the approximate Jacobian might change substantially from iteration to iteration. In general terms, coarse levels are defined in terms of successively smaller lower right blocks of the matrix, typically decreasing geometrically in order. The most difficult issue was the coarse grid correction matrix. The preconditioner/smoother for a given level is just the corresponding lower right blocks of the ILU factorization. The coarse level matrix itself is just the Schur complement; this matrix is not known exactly using just the ILU decomposition in the setup phase. Thus we approximate this matrix using various combinations of the preconditioning matrix and the error matrix. During my visit, several approximations of this type were implemented and tested. While some improved the convergence rate of the overall method, these gains had to be balanced against the additional costs involved in creating and applying these matrices. By this more stringent criterion, none of the improved approximations could be characterized as an unqualified success.

The mixed variational formulation of elastic deformation of a material body leads to a constraint minimisation (or saddle‐point) problem. Using the PEERS finite element space to discretise the problem one gets an indefinite system of linear equations. To solve this system, preconditioners with similar saddle‐point patterns will be applied. The results of numerical tests with this preconditioning strategy show its efficiency for linear systems with up to more than half a million unknowns.