article

Free access

A framework for symmetric band reduction

Editor: Ronald F. Boisvert Authors:

Christian H. Bischof,

Bruno Lang,

Xiaobai SunAuthors Info & Claims

ACM Transactions on Mathematical Software (TOMS), Volume 26, Issue 4

Pages 581 - 601

https://doi.org/10.1145/365723.365735

Published: 01 December 2000 Publication History

PDF eReader

Abstract

We develop an algorithmic framework for reducing the bandwidth of symmetric matrices via orthogonal similarity transformations. This framework includes the reduction of full matrices to banded or tridiagonal form and the reduction of banded matrices to narrower banded or tridiagonal form, possibly in multiple steps. Our framework leads to algorithms that require fewer floating-point operations than do standard algorithms, if only the eigenvalues are required. In addition, it allows for space-time tradeoffs and enables or increases the use of blocked transformations.

References

[1]

AHO, A., HOPCROFT, J., AND ULLMAN, J. 1983. Data Structures and Algorithms. Addison-Wesley, Reading, MA.

Crossref

Google Scholar

[2]

ANDERSON, E., BAI, Z., BISCHOF, C., BLACKFORD,L.S.,DEMMEL, J., DONGARRA, J., DU CROZ, J., GREENBAUM, A., HAMMARLING, S., MCKENNEY, A., AND SORENSON, D. 1999. LAPACK User's Guide. 3rd ed. SIAM, Philadelphia, PA.

Crossref

Google Scholar

[3]

BISCHOF,CH.H.AND LACROUTE,PH. G. 1990. An adaptive blocking strategy for matrix factorizations. In Proceedings of the Joint International Conference on Vector and Parallel Processing (CONPAR 90 VAPP IV, Zurich, Switzerland, Sept. 10-13), H. Burkhart, Ed. Springer Lecture Notes in Computer Science. Springer-Verlag, New York, NY, 210-221.

Crossref

Google Scholar

[4]

BISCHOF,C.AND VAN LOAN, C. 1987. The WY representation for products of Householder matrices. SIAM J. Sci. Stat. Comput. 8, 1 (Jan.), s2s13.

Crossref

Google Scholar

[5]

BISCHOF, C., LANG, B., AND SUN, X. 1994. Parallel tridiagonalization through two-step band reduction. In Proceedings of the Conference on Scalable High-Performance Computing (Washington, D.C.). IEEE Press, Piscataway, NJ, 23-27.

Google Scholar

[6]

BISCHOF,C.H.,LANG, B., AND SUN, X. 2000. Algorithm 807: The SBR toolbox-Software for successive band reduction. ACM Trans. Math. Softw. 26, 4 (Dec.).

Crossref

Google Scholar

[7]

BOJANCZYK,A.AND BRENT, R. P. 1987. Tridiagonalization of a symmetric matrix on a square array of mesh-connected processors. J. Parallel Distrib. Comput. 8, 2-13.

Google Scholar

[8]

DONGARRA,J.J.,HAMMARLING,S.J.,AND SORENSEN, D. C. 1989. Block reduction of matrices to condensed forms for eigenvalue computations. J. Comput. Appl. Math. 27, 215-227.

Google Scholar

[9]

GARBOW,B.S.,BOYLE,J.M.,DONGARRA,J.J.,AND MOLER, C. B. 1977. Matrix Eigensystem Routines-EISPACK Guide Extension. Springer-Verlag, Berlin, Germany.

Google Scholar

[10]

GOLUB,G.H.AND VAN LOAN, C. F. 1996. Matrix Computations. 3rd ed. Johns Hopkins studies in the mathematical sciences. Johns Hopkins University Press, Baltimore, MD.

Crossref

Google Scholar

[11]

GRIMES,R.G.AND SIMON, H. D. 1988. Solution of large, dense symmetric generalized eigenvalue problems using secondary storage. ACM Trans. Math. Softw. 14, 3 (Sept.), 241-256.

Crossref

Google Scholar

[12]

IPSEN, I. 1984. Singular value decompositions with systolic arrays. In Proceedings of the Conference on SPIE. 13-21.

Google Scholar

[13]

KAGSTROM, B., LING, P., AND VAN LOAN, C. 1995. GEMM-based level 3 BLAS: Installation, tuning, and use of the model implementations and the performance evaluation benchmark. Tech. Rep. S-901.87. Department of Computing Science, Univ. of Ume~, Ume~, Sweden.

Google Scholar

[14]

KAUFMAN, L. 1984. Banded eigenvalue solvers on vector machines. ACM Trans. Math. Softw. 10, 1 (Mar.), 73-86.

Crossref

Google Scholar

[15]

KAUFMAN, L. 2000. Band reduction algorithms revisited. ACM Trans. Math. Softw. 26,4 (Dec.).

Crossref

Google Scholar

[16]

LANG, B. 1993. A parallel algorithm for reducing symmetric banded matrices to tridiagonal form. SIAM J. Sci. Comput. 14, 6 (Nov.), 1320-1338.

Crossref

Google Scholar

[17]

LANG, B. 1998. Using level 3 BLAS in rotation-based algorithms. SIAM J. Sci. Comput. 19,2, 626-634.

Crossref

Google Scholar

[18]

LEDERMAN, S., TSAO, A., AND TURNBULL, T. 1991. A parallelizable eigensolver for real diagonalizable matrices with real eigenvalues. Tech. Rep. TR-91-042. Supercomputing Research Center, Institute for Defense Analysis, Bowie, MD.

Google Scholar

[19]

MURATA,K.AND HORIKOSHI, K. 1975. A new method for the tridiagonalization of the symmetric band matrix. Inf. Proc. Jap. 15, 108-112.

Google Scholar

[20]

RUTISHAUSER, H. 1963. On Jacobi rotation patterns. In Proceedings of the Symposium on Applied Mathematics: Experimental Arithmetic, High Speed Computing and Mathematics. American Mathematical Society, Boston, MA, 219-239.

Google Scholar

[21]

SCHREIBER, R. 1990. Bidiagonalization and symmetric tridiagonalization by systolic arrays. J. VLSI Signal Process. 1, 279-285.

Google Scholar

[22]

SCHREIBER,R.AND VAN LOAN, C. 1989. A storage-efficient WY representation for products of Householder transformations. SIAM J. Sci. Stat. Comput. 10, 1 (Jan.), 53-57.

Crossref

Google Scholar

[23]

SCHWARZ, H. R. 1968. Tridiagonalization of a symmetric band matrix. Numer. Math. 12, 231-241.

Google Scholar

[24]

SMITH,B.T.,BOYLE,J.M.,DONGARRA,J.J.,GARBOW,B.S.,IKEBE, Y., KLEMA,V.C.,AND MOLER, C. B. 1976. Matrix Eigensystem Routines: EISPACK Guide. 2nd ed. Springer Lecture Notes in Computer Science, vol. 6. Springer-Verlag, New York, NY.

Google Scholar

[25]

WHALEY,R.C.AND DONGARRA, J. J. 1997. Automatically tuned linear algebra software. CS-97-366. Department of Computer Science, University of Tennessee, Knoxville, TN.

Crossref

Google Scholar

Cited By

View all

Zhang SShah ROotomo HYokota RWu PDehnavi MKulkarni MKrishnamoorthy S(2023)Fast Symmetric Eigenvalue Decomposition via WY Representation on Tensor CoreProceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3572848.3577516(301-312)Online publication date: 25-Feb-2023
https://dl.acm.org/doi/10.1145/3572848.3577516
Manin VLang B(2023)Efficient parallel reduction of bandwidth for symmetric matricesParallel Computing10.1016/j.parco.2023.102998115:COnline publication date: 1-Feb-2023
https://dl.acm.org/doi/10.1016/j.parco.2023.102998
Kobayashi MHirota YKudo SHoshi TYamamoto Y(2023)Automatic performance tuning using the ATMathCoreLib tool: Two experimental studies related to dense symmetric eigensolversConcurrency and Computation: Practice and Experience10.1002/cpe.784936:10Online publication date: 30-Jun-2023
https://doi.org/10.1002/cpe.7849
Show More Cited By

Index Terms

A framework for symmetric band reduction
1. Mathematics of computing
  1. Mathematical software
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types

Recommendations

Algorithm 807: The SBR Toolbox—software for successive band reduction

We present a software toolbox for symmetric band reduction via orthogonal transformations, together with a testing and timing program. The toolbox contains drivers and computational routines for the reduction of full symmetric matrices to banded form ...
Tridiagonal-Diagonal Reduction of Symmetric Indefinite Pairs

We consider the reduction of a symmetric indefinite matrix pair (A,B), with B nonsingular, to tridiagonal-diagonal form by congruence transformations. This is an important reduction in solving polynomial eigenvalue problems with symmetric coefficient ...
Comparison of eigensolvers for symmetric band matrices

We compare different algorithms for computing eigenvalues and eigenvectors of a symmetric band matrix across a wide range of synthetic test problems. Of particular interest is a comparison of state-of-the-art tridiagonalization-based methods as ...

Reviews

Reviewer: Timothy R. Hopkins

The main paper proposes an algorithmic framework for reducing the bandwidth of symmetric matrices using orthogonal similarity transformations. The framework generalizes the ideas underlying the Householder tridiagonalization of full matrices, along with the Rutishauser's and, Murata and Horikoshi/Lang algorithms for banded matrices. The general multistep method proposed consists of the repeated application of a one-step band reduction algorithm which "peels off" a predefined number of subdiagonals. Various instances of this algorithm are discussed which both minimize the number of flops required given different storage constraints and improve data locality. The effect of computing eigenvectors is also considered. The improved execution speeds of these new algorithms over codes currently available in LAPACK is discussed. The companion algorithm paper describes the implementation of a software toolbox for reducing full symmetric matrices to banded form, banded matrices to narrower banded or tridiagonal form (with optional accumulation of orthogonal transformations) along with codes for converting matrix data from conventional or banded storage to more efficient packed storage schemes. The Fortran software, provided as a part of the Collected Algorithms, allows users to experiment with different reduction schemes with the aim of producing tailored code for particular hardware and applications.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Mathematical Software

ACM Transactions on Mathematical Software Volume 26, Issue 4

Dec. 2000

155 pages

ISSN:0098-3500

EISSN:1557-7295

DOI:10.1145/365723

Editor:
Ronald F. Boisvert
National Institute of Standards, Gaithersburg, MD

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2000

Published in TOMS Volume 26, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

54
Total Citations
View Citations
827
Total Downloads

Downloads (Last 12 months)92
Downloads (Last 6 weeks)15

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhang SShah ROotomo HYokota RWu PDehnavi MKulkarni MKrishnamoorthy S(2023)Fast Symmetric Eigenvalue Decomposition via WY Representation on Tensor CoreProceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3572848.3577516(301-312)Online publication date: 25-Feb-2023
https://dl.acm.org/doi/10.1145/3572848.3577516
Manin VLang B(2023)Efficient parallel reduction of bandwidth for symmetric matricesParallel Computing10.1016/j.parco.2023.102998115:COnline publication date: 1-Feb-2023
https://dl.acm.org/doi/10.1016/j.parco.2023.102998
Kobayashi MHirota YKudo SHoshi TYamamoto Y(2023)Automatic performance tuning using the ATMathCoreLib tool: Two experimental studies related to dense symmetric eigensolversConcurrency and Computation: Practice and Experience10.1002/cpe.784936:10Online publication date: 30-Jun-2023
https://doi.org/10.1002/cpe.7849
Li SLiao XLu YRoman JYue X(2022)A parallel structured banded DC algorithm for symmetric eigenvalue problemsCCF Transactions on High Performance Computing10.1007/s42514-022-00117-95:2(116-128)Online publication date: 11-Aug-2022
https://doi.org/10.1007/s42514-022-00117-9
Saad Y(2022)Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problemNumerical Algorithms10.1007/s11075-022-01377-w92:1(917-944)Online publication date: 8-Aug-2022
https://dl.acm.org/doi/10.1007/s11075-022-01377-w
Kågström BKressner DQuintana-Ortí EQuintana-Ortí G(2022)Blocked algorithms for the reduction to Hessenberg-triangular form revisited BIT10.1007/s10543-008-0180-148:3(563-584)Online publication date: 11-Mar-2022
https://dl.acm.org/doi/10.1007/s10543-008-0180-1
Šušnjara AKressner D(2021)A fast spectral divide‐and‐conquer method for banded matricesNumerical Linear Algebra with Applications10.1002/nla.236528:4Online publication date: 8-Mar-2021
https://doi.org/10.1002/nla.2365
Poulson J(2020)High-performance sampling of generic determinantal point processesPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences10.1098/rsta.2019.0059378:2166(20190059)Online publication date: 20-Jan-2020
https://doi.org/10.1098/rsta.2019.0059
Kudo SImamura T(2019)Cache-efficient implementation and batching of tridiagonalization on manycore CPUsProceedings of the International Conference on High Performance Computing in Asia-Pacific Region10.1145/3293320.3293329(71-80)Online publication date: 14-Jan-2019
https://dl.acm.org/doi/10.1145/3293320.3293329
Mohanty SSajith G(2019)An Input/Output Efficient Algorithm for Hessenberg ReductionInternational Journal of Foundations of Computer Science10.1142/S012905411950026630:08(1279-1300)Online publication date: 12-Dec-2019
https://doi.org/10.1142/S0129054119500266
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Algorithm 807: The SBR Toolbox—software for successive band reduction

Tridiagonal-Diagonal Reduction of Symmetric Indefinite Pairs

Comparison of eigensolvers for symmetric band matrices

Reviews

Access critical reviews of Computing literature here

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations