Abstract
‘Hierarchical Semi-separable’ matrices (HSS matrices) form an important class of structured matrices for which matrix transformation algorithms that are linear in the number of equations (and a function of other structural parameters) can be given. In particular, a system of linear equations Ax = b can be solved with linear complexity in the size of the matrix, the overall complexity being linearly dependent on the defining data. Also, LU and ULV factorization can be executed ‘efficiently’, meaning with a complexity linear in the size of the matrix. This paper gives a survey of the main results, including a proof for the formulas for LU-factorization that were originally given in the thesis of Lyon [1], the derivation of an explicit algorithm for ULV factorization and related Moore-Penrose inversion, a complexity analysis and a short account of the connection between the HSS and the SSS (sequentially semi-separable) case. A direct consequence of the computational theory is that from a mathematical point of view the HSS structure is ‘closed’ for a number operations. The HSS complexity of a Moore-Penrose inverse equals the HSS complexity of the original, for a sum and a product of operators the HSS complexity is no more than the sum of the individual complexities.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
W. Lyons, “Fast algorithms with applications to pdes,” PHD thesis, June 2005.
I. Gohberg, T. Kailath, and I. Koltracht, “Linear complexity algorithms for semiseparable matrices,” Integral Equations and Operator Theory, vol. 8, pp. 780–804, 1985.
L. Greengard and V. Rokhlin, “A fast algorithm for particle simulations,” J. Comp. Phys., vol. 73, pp. 325–348, 1987.
V. Rokhlin, “Applications of volume integrals to the solution of pde’s,” J. Comp. Phys., vol. 86, pp. 414–439, 1990.
P. Dewilde and A.-J. van der Veen, Time-varying Systems and Computations. Kluwer, 1998.
A. van der Veen, “Time-varying lossless systems and the inversion of large structured matrices,” Archiv f. Elektronik u. Übertragungstechnik, vol. 49, no. 5/6, pp. 372–382, Sept. 1995.
Y. Eidelman and I. Gohberg, “On a new class of structured matrices,” Notes distributed at the 1999 AMS-IMS-SIAM Summer Research Conference, vol. Structured Matrices in Operator Theory, Numerical Analysis, Control, Signal and Image Processing, 1999.
S. Chandrasekaran, M. Gu, and T. Pals, “A fast and stable solver for smooth recursively semi-separable systems,” in SIAM Annual Conference, San Diego and SIAM Conference of Linear Algebra in Controls, Signals and Systems, Boston, 2001.
P. Dewilde and A.-J. van der Veen, “Inner-outer factorization and the inversion of locally finite systems of equations,” Linear Algebra and its Applications, vol. 313, pp. 53–100, 2000.
S. Chandrasekaran, M. Gu, and T. Pals, “Fast and stable algorithms for hierarchically semi-separable representations,” in Technical Report. University of California at Santa Barbara, April 2004.
W. Hackbusch, “A sparse arithmetic based on \( \mathcal{H} \)-matrices. part i: Introduction to \( \mathcal{H} \)-matrices,” Computing, vol. 64, pp. 21–47, 2000.
T. Pals, “Multipole for scattering computations: Spectral discretization, stabilization, fast solvers,” Ph.D. dissertation, Department of Electrical and Computer Engineering, University of California, Santa Barbara, 2004.
P. Dewilde, K. Diepold, and W. Bamberger, “A semi-separable approach to a tridiagonal hierarchy of matrices with application to image flow analysis,” in Proceedings MTNS, 2004.
S. Chandrasekaran, P. Dewilde, M. Gu, W. Lyons, and T. Pals, “A fast solver for hss representations via sparse matrices,” in Technical Report. Delft University of Technology, August 2005.
S. Chandrasekaran, Z. Sheng, P. Dewilde, M. Gu, and K. Doshi, “Hierarchically semi-separable representation and dataflow diagrams,” vol. Technical document, Nov 2005.
S. Chandrasekaran, P. Dewilde, W. Lyons, T. Pals, and A.-J. van der Veen, “Fast stable solver for sequentially semi-separable linear systems of equations,” October 2002.
S. Chandrasekaran, M. Gu, and T. Pals, “A fast ulv decomposition solver for hierachically semiseparable representations,” 2004.
P. Dewilde and S. Chandrasekaran, “A hierarchical semi-separable Moore-Penrose equation solver,” Operator Theory: Advances and Applications, vol. 167, pp. 69–85, Nov 2006, Birkhäuser Verlag.
S. Chandrasekaran, P. Dewilde, M. Gu, W. Lyons, T. Pals, A.-J. van der Veen, and J. Xia, “A fast backward stable solver for sequentially semi-separable matrices,” September 2005.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Birkhäuser Verlag Basel/Switzerland
About this chapter
Cite this chapter
Sheng, Z., Dewilde, P., Chandrasekaran, S. (2007). Algorithms to Solve Hierarchically Semi-separable Systems. In: Alpay, D., Vinnikov, V. (eds) System Theory, the Schur Algorithm and Multidimensional Analysis. Operator Theory: Advances and Applications, vol 176. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-8137-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-7643-8137-0_5
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-7643-8136-3
Online ISBN: 978-3-7643-8137-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)