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}
}
  • R. Snay
  • Published 1976
  • Mathematics
  • Bulletin géodésique
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. 
An improved algorithm for profile minimisation of sparse systems of equations
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 itsExpand
A variant of Snay’s algorithm
TLDR
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
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 theExpand
A survey of direct methods for sparse linear systems
TLDR
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
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, manyExpand
The Bandwidths of a Matrix. A Survey of Algorithms
TLDR
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
TLDR
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
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 objectiveExpand
An Assessment of Reordering Algorithms to Speed Up the ICCG Method Applied to CFD Problems
TLDR
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
TLDR
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
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 13 REFERENCES
An algorithm for reducing the bandwidth and profile of a sparse matrix
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 andExpand
Algorithm for Matrix Bandwidth Reduction
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 theExpand
Reducing the bandwidth of sparse symmetric matrices
TLDR
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
A Compact Storage Scheme for the Solution of Symmetric Linear Simultaneous Equations
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 moreExpand
Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
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.
Stiffness matrices bandwidth minimization by automatic node relabeling in equilibrium problems of lumper-parameter systems
Matrix bandwidth minimization
  • Richard Rosen
  • 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 isExpand
Computer implementation of the finite element method
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 forExpand
Bandwidth reduction by automatic renumbering
...
1
2
...