Methods for solving sparse linear systems of equations can be categorized under two broad classes - direct and iterative. Direct methods are methods based on gaussian elimination. This report discusses one such direct method namely Nested dissection. Nested Dissection, originally proposed by Alan George, is a technique for solving sparse linear systems efficiently. This report is a survey of some of the work in the area of nested dissection and attempts to put it together using a common framework
In this chapter we will present an overview of a number of related iterative methods for the solutio...
42 pages, available as LIP research report RR-2009-15Numerical linear algebra and combinatorial opti...
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm f...
SIGLEAvailable from British Library Document Supply Centre- DSC:8717.570(NOC-TR--197) / BLDSC - Brit...
Nested dissection method is an elimination method for a set of linear algebraic equations with minim...
Nested dissection orderings are known to be very effective for solving the sparse positive definite ...
SIGLEAvailable from British Library Document Supply Centre- DSC:8717.57(NOC-TR--203) / BLDSC - Briti...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...
Abstract. Numerical linear algebra and combinatorial optimization are vast subjects; as is their int...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
SIGLEAvailable from British Library Document Supply Centre- DSC:8717.57(NOC-TR--167) / BLDSC - Briti...
A multi-level method for the solution of sparse linear systems is introduced. The definition of the ...
The mathematical models of many practical problems lead to systems of linear algebraic equations wh...
AbstractAn algorithm is presented for the general solution of a set of linear equations Ax=b. The me...
We introduce a new approach for sparse decomposition, based on a geometrical interpretation of spars...
In this chapter we will present an overview of a number of related iterative methods for the solutio...
42 pages, available as LIP research report RR-2009-15Numerical linear algebra and combinatorial opti...
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm f...
SIGLEAvailable from British Library Document Supply Centre- DSC:8717.570(NOC-TR--197) / BLDSC - Brit...
Nested dissection method is an elimination method for a set of linear algebraic equations with minim...
Nested dissection orderings are known to be very effective for solving the sparse positive definite ...
SIGLEAvailable from British Library Document Supply Centre- DSC:8717.57(NOC-TR--203) / BLDSC - Briti...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...
Abstract. Numerical linear algebra and combinatorial optimization are vast subjects; as is their int...
This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving...
SIGLEAvailable from British Library Document Supply Centre- DSC:8717.57(NOC-TR--167) / BLDSC - Briti...
A multi-level method for the solution of sparse linear systems is introduced. The definition of the ...
The mathematical models of many practical problems lead to systems of linear algebraic equations wh...
AbstractAn algorithm is presented for the general solution of a set of linear equations Ax=b. The me...
We introduce a new approach for sparse decomposition, based on a geometrical interpretation of spars...
In this chapter we will present an overview of a number of related iterative methods for the solutio...
42 pages, available as LIP research report RR-2009-15Numerical linear algebra and combinatorial opti...
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm f...