# Reducing the profile of sparse symmetric matrices

@article{Snay1976ReducingTP, title={Reducing the profile of sparse symmetric matrices}, author={R. Snay}, journal={Bulletin g{\'e}od{\'e}sique}, year={1976}, volume={50}, pages={341-352} }

An algorithm for improving the profile of a sparse symmetric matrix is introduced. Tests on normal equation matrices encountered in adjustments of geodetic networks by least squares demonstrate that the algorithm produces significantly lower profiles than the widely used reverse Cuthill-McKee algorithm.

#### 51 Citations

An improved algorithm for profile minimisation of sparse systems of equations

- Mathematics
- 1990

Abstract Sparse storage technique used in surveying computation is reviewed. Main points and defects of Banker's algorithm are presented. An improved Banker's algorithm has been developed and its… Expand

A variant of Snay’s algorithm

- Computer Science
- 2018 37th International Conference of the Chilean Computer Science Society (SCCC)
- 2018

A variant of Snay’s algorithm for profile reduction of matrices shows better results when compared with the results of several reordering algorithms with regards to reducing the computational cost of the zero-fill incomplete Cholesky-preconditioned conjugate gradient method applied to small linear systems arising from a computational fluid dynamics problem. Expand

A comparative study of algorithms for reducing the fill-in during Cholesky factorization

- Mathematics
- 1992

In this paper several ordering algorithms for the unknowns in geodetic least squares systems are compared. The comparison is restricted to the case of the well known Cholesky factorization of the… Expand

A survey of direct methods for sparse linear systems

- Computer Science
- Acta Numerica
- 2016

The goal of this survey article is to impart a working knowledge of the underlying theory and practice of sparse direct methods for solving linear systems and least-squares problems, and to provide an overview of the algorithms, data structures, and software available to solve these problems. Expand

Near-minimal matrix profiles and wavefronts for testing nodal resequencing algorithms

- Mathematics
- 1985

The speeds of algorithms that are specifically designed to solve sparse matrix equations depend on the ordering of the unknowns. Because it is difficult to know what a good ordering is, many… Expand

The Bandwidths of a Matrix. A Survey of Algorithms

- Mathematics, Computer Science
- 2014

A comparative study of the bandwidth, average bandwidth, envelope, profile and antibandwidth of the matrices is made, using both approaches: matrix geometry and graph theory. Expand

A fill-in storage technique for geodetic normal equations

- Computer Science
- 1980

The conclusion is that the fill-in scheme is a viable method for geodetic networks and, in some cases, it needs less computer storage than the profile method. Expand

Relative Error Analysis of Geodetic Networks

- Mathematics
- 1985

Positional accuracy estimators for all the points in a primary control network are derived from the covariance matrix. Relative error ellipses in scale and in orientation are proposed as objective… Expand

An Assessment of Reordering Algorithms to Speed Up the ICCG Method Applied to CFD Problems

- Computer Science
- ICCSA
- 2018

The most promising heuristics are identified when reducing the zero-fill incomplete Cholesky-preconditioned conjugate gradient method when applied to matrices containing systems of linear equations arising from computational fluid dynamics problems. Expand

A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

- Computer Science
- J. Graph Theory
- 1999

This paper provides a survey of results on the exact bandwidth, edgesum, and pro le of graphs as an update of the original survey of solved bandwidth problems by Chinn, Chv atalov, Dewdney, and Gibbs in 1982. Expand

#### References

SHOWING 1-10 OF 13 REFERENCES

An algorithm for reducing the bandwidth and profile of a sparse matrix

- Mathematics
- 1976

A new algorithm for reducing the bandwidth and profile of a sparse matrix is described. Extensive testing on finite element matrices indicates that the algorithm typically produces bandwidth and… Expand

Algorithm for Matrix Bandwidth Reduction

- Mathematics
- 1972

A method for reducing the bandwidth of matrices is presented. The method was developed for symmetric matrices, but it is also applicable for asymmetric matrices. A detailed flowchart for the… Expand

Reducing the bandwidth of sparse symmetric matrices

- Computer Science, Mathematics
- ACM '69
- 1969

A direct method of obtaining an automatic nodal numbering scheme to ensure that the corresponding coefficient matrix will have a narrow bandwidth is presented. Expand

An automatic reordering scheme for simultaneous equations derived from network systems

- Computer Science
- 1970

A Compact Storage Scheme for the Solution of Symmetric Linear Simultaneous Equations

- Mathematics, Computer Science
- Comput. J.
- 1966

A method is presented for the computer solution of symmetric linear simultaneous equations which takes advantage of the presence of zero elements away from the leading diagonal but which is more… Expand

Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices

- Mathematics
- 1976

In this paper we examine the Cuthill–McKee algorithm for ordering the unknowns and equations in systems of linear equations, $A{\bf x} = {\bf b}$, where A is sparse, symmetric, and positive definite.… Expand

An automatic node-relabeling scheme for bandwidth minimization of stiffness matrices.

- Computer Science
- 1968

Stiffness matrices bandwidth minimization by automatic node relabeling in equilibrium problems of lumper-parameter systems

Matrix bandwidth minimization

- Computer Science, Mathematics
- ACM National Conference
- 1968

In the analysis of a structural problem by the finite element method, a large order stiffness matrix is created which describes mathematically the inter-connectivity of the system. The structure is… Expand

Computer implementation of the finite element method

- Mathematics
- 1971

Abstract : A detailed study of the implementation of finite element methods for solving two-dimensional elliptic partial differential equations is presented. Generation and storage schemes for… Expand