An Algorithm for the Banded Symmetric Generalized Matrix
From MaRDI portal
Publication:5286280
DOI10.1137/0614026zbMATH Open0774.65018OpenAlexW99016522MaRDI QIDQ5286280FDOQ5286280
Authors: Linda Kaufman
Publication date: 29 June 1993
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0614026
Recommendations
Cited In (16)
- Decompositions and coalescing eigenvalues of symmetric definite pencils depending on parameters
- Generalized \(qd\) algorithm for block band matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- The retraction algorithm for factoring banded symmetric matrices
- Evolution on a smooth landscape
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast algorithms using orthogonal polynomials
- On symmetrizing the ultraspherical spectral method for self-adjoint problems
- Learning and complexity in genetic auto-adaptive systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient reduction of banded Hermitian positive definite generalized eigenvalue problems to banded standard eigenvalue problems
- An algorithm for the generalized symmetric tridiagonal eigenvalue problem
- Simultaneous band reduction of two symmetric matrices
Uses Software
This page was built for publication: An Algorithm for the Banded Symmetric Generalized Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286280)