Matrix enlarging methods and their application
 Fernando L. Alvarado
 … show all 1 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
This paper explores several methods for matrix enlarging, where an enlarged matrixÃ is constructed from a given matrixA. The methods explored include matrix primitization, stretching and node splitting. Graph interpretations of these methods are provided. Solving linear problems using enlarged matrices yields the answer to the originalAx=b problem.Ã can exhibit several desirable properties. For example,Ã can be constructed so that the valence of any row and/or column is smaller than some desired number (≥4). This is beneficial for algorithms that depend on the square of the number of entries of a row or column. Most particularly, matrix enlarging can results in a reduction of the fillin in theR matrix which occurs during orthogonal factorization as a result of dense rows. Numerical experiments support these conjectures.
 F. L. Alvarado,Experiments on assorted sparse prototyping and development environments, Presentation at the Linear Algebra Year Workshop, CERFACS, Toulouse, France, September 1995.
 F. L. Alvarado,Formation of Ynode using the primitive Ynode concept, IEEE Transaction on Power Apparatus and Systems, PAS101:12 (December, 1982), pp. 4563–4572.
 F. L. Alvarado,Symmetric matrix primitization, Technical Report ECE8919, The University of Wisconsin, Madison, November 1989.
 F. L. Alvarado,Manipulation and visualization of sparse matrices, ORSA (Operations Research Society of America) Journal on Computing, 2:2 (1990), pp. 186–207.
 F. L. Alvarado, M. K. Enns, and W. F. Tinney, Sparsity enhancement in mutually coupled networks, IEEE Transactions on Power Apparatus and Systems, PAS103 (June 1984), pp. 1502–1508.
 F. L. Alvarado, W. F. Tinney, and M. K. Enns,Sparsity in largescale network computation, in C. T. Leondes, ed., Advances in Electric Power and Energy Conversion System Dynamics and Control, volume 41 of Control and Dynamic Systems, Academic Press, 1991, pp. 207–272.
 F. L. Alvarado and Z. Wang,Direct sparse interval hull computations for thin nonm matrices, Interval Computations, March 1993, pp. 5–28.
 K. D. Andersen,A modified Schurcomplement methods for handling dense columns in interiorpoint methods for linear programming, ACM Transactions on Mathematical Software, 22:3 (1996), pp. 348–356. CrossRef
 Å. Björck,Numerical Methods for Least Squares Problems, SIAM, Philadelphia, PA, 1996.
 Å. Björck and M. Lundquist.Splitting rows in sparse least squares problems. Tech. Report, LiTHMATR 9717, Department of Mathematics, University of Linköping, 1997.
 L. Chua, C. Desoer, and E. Kuh,Linear and Nonlinear Circuits, McGrawHill, 1987.
 T. F. Coleman, A. Edenbrandt, and J. R. Gilbert,Predicting fill for sparse orthogonal factorization, Journal of the Association for Computing Machinery, 33:3 (1986), pp. 517–532.
 E. Cuthill and J. McKee,Reducing the bandwidth of sparse symmetric matrices, in Proceedings of the 24th National Conference of the Association for Computing Machinery, Brandon Press, NJ, 1969, pp. 157–172.
 C. DeBoor and H.O. Kreiss,On the condition number of the linear system associated with discretized VVPs of ODEs, SIAM Journal of Numerical Analysis, 23:5 (1986), pp. 936–939. CrossRef
 I. S. Duff, R. Grimes, and J. Lewis,Sparse matrix test problems, ACM Transactions on Mathematical Software, 15:1 (1989), pp. 1–14. CrossRef
 I. S. Duff and J. K. Reid,A comparison of some methods for the solution of overdetermined systems of linear equations, Journal of the Institute of Mathematics and its Applications, 17 (1976), pp. 267–280. CrossRef
 A. George and M. T. Heath,Solution of sparse linear least squares problems using givens rotations, Linear Algebra and its Applications, 34 (1980), pp. 69–83. CrossRef
 A. George and E. Ng,On row and column ordering for sparse least squares problems, SIAM Journal of Numerical Analysis, 20 (1983), pp. 326–344. CrossRef
 J. R. Gilbert and T. Peierls,Sparse partial pivoting in time proportional to arithmetic operations, SIAM Journal of Scientific and Statistical Computing, 9 (1988), pp. 862–874. CrossRef
 P. E. Gill and W. Murray.Nonlinear least squares and nonlinearly constrained optimization, in Proceedings of the Dundee Conference on Numerical Analysis 1975, SpringerVerlag, New York, Lecture Notes in Mathematics No. 506, 1976, pp. 201–212.
 P. E. Gill and W. Murray,The orthogonal factorization of a large sparse matrix, in Sparse Matrix Computations, J. R. Bunch and D. J. Rose, eds., SpringerVerlag, New York, 1976, pp. 201–212.
 G. H. Golub,Numerical methods for solving linear least squares problems, Numerical Mathematics, 7 (1965), pp. 206–216. CrossRef
 J. F. Grcar,Matrix stretching for linear equations, Technical Report SAND908723, Sandia National Laboratories, November 1990.
 M. T. Heath,Numerical methods for large sparse linear least squares problems, SIAM Journal on Scientific and Statistical Computing, 5 (1984), pp. 497–513. CrossRef
 Joseph W. H. Liu,Modification of the minimum degree algorithm by multiple elimination, ACM Transactions on Mathematical Software, 11 (1985), pp. 141–153. CrossRef
 P. Matstoms,Sparse QR factorization with applications to linear least squares problems, PhD thesis, Department of Mathematics, Linköping University, Sweden, 1994, Linköping Studies in Science and Technology Dissertations, No. 337.
 W. F. Tinney, W. L. Powell, and N. M. Peterson,Sparsityoriented network reduction, in Power Industry Computer Applications Conference, 1973, pp. 384–390.
 R. J. Vanderbei,Splitting dense columns in sparse linear systems, Linear Algebra and its Applications, 152 (1991), pp. 107–117. CrossRef
 N. Vempati, I. W. Slutsker, and W. F. Tinney,Enhancements to Givens rotations for power system state estimation, IEEE Transactions on Power Systems, 6:2 (1991), pp. 842–849. CrossRef
 Title
 Matrix enlarging methods and their application
 Journal

BIT Numerical Mathematics
Volume 37, Issue 3 , pp 473505
 Cover Date
 19970901
 DOI
 10.1007/BF02510237
 Print ISSN
 00063835
 Online ISSN
 15729125
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 65F20
 Sparse matrices
 node splitting
 orthogonal factorization
 least squares
 QR factorization
 matrix stretching
 matrix primitization
 Industry Sectors
 Authors

 Fernando L. Alvarado ^{(1)}
 Author Affiliations

 1. Department of Electrical and Computer Engineering, The University of Wisconsin, Madison