A framework for symmetric band reduction
From MaRDI portal
Publication:4406294
DOI10.1145/365723.365735zbMath1365.65103OpenAlexW2058884681WikidataQ113309805 ScholiaQ113309805MaRDI QIDQ4406294
Christian H. Bischof, Bruno Lang, Xiaobai Sun
Publication date: 25 June 2003
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/365723.365735
Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Orthogonalization in numerical linear algebra (65F25)
Related Items (15)
A fixed-point method for approximate projection onto the positive semidefinite cone ⋮ A Householder-Based Algorithm for Hessenberg-Triangular Reduction ⋮ Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem ⋮ Fast Computation of Spectral Projectors of Banded Matrices ⋮ Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations ⋮ Parallel block tridiagonalization of real symmetric matrices ⋮ Efficient Reduction of Banded Hermitian Positive Definite Generalized Eigenvalue Problems to Banded Standard Eigenvalue Problems ⋮ Blocked algorithms for the reduction to Hessenberg-triangular form revisited ⋮ An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths ⋮ Parallel two-stage reduction to Hessenberg form using dynamic scheduling on shared-memory architectures ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ An Input/Output Efficient Algorithm for Hessenberg Reduction ⋮ Spectral approximation for quasiperiodic Jacobi operators ⋮ High-performance sampling of generic determinantal point processes ⋮ Fast Hessenberg Reduction of Some Rank Structured Matrices
Uses Software
This page was built for publication: A framework for symmetric band reduction
