Deterministic complexity analysis of Hermitian eigenproblems
From MaRDI portal
Cites work
- N Roots of the Secular Equation in O(N) Operations
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- A framework for symmetric band reduction
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- A New Proof of Global Convergence for the Tridiagonal QL Algorithm
- A quasi-random approach to matrix spectral analysis
- A stable matrix version of the fast multipole method: stabilization strategies and examples
- A stable, polynomial-time algorithm for the eigenpair problem
- Accelerated Newton iteration for roots of black box polynomials
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- Accuracy and Stability of Numerical Algorithms
- Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications
- An O(N^2 ) Method for Computing the Eigensystem of N \times N Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
- Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
- Dimensionality reduction for k-means clustering and low rank approximation
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Eigenvalue computation in the 20th century
- Eigenvalues of a matrix in the streaming model
- Error Analysis of Update Methods for the Symmetric Eigenvalue Problem
- Fast linear algebra is stable
- Fast matrix multiplication is stable
- Fast monte-carlo algorithms for finding low-rank approximations
- Fast multiplication of large numbers
- Faster integer multiplication
- Global convergence of Hessenberg shifted QR. III: Approximate Ritz values via shifted inverse iteration
- Global convergence of tridiagonal QR algorithm with origin shifts
- Hermitian diagonalization in linear precision
- scientific article; zbMATH DE number 432841 (Why is no real title available?)
- scientific article; zbMATH DE number 3637287 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Integer multiplication in time \(O(n\log n)\)
- Jacobi’s Method is More Accurate than QR
- Low-rank approximation and regression in input sparsity time
- More asymmetry yields faster matrix multiplication
- Numerical methods for large eigenvalue problems
- On some algorithms for the solution of the complete eigenvalue problem
- Optimal CUR matrix decompositions
- Optimal eigenvalue approximation via sketching
- Optimal principal component analysis in distributed and streaming models
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- Perturbation Bounds for Matrix Eigenvalues
- Practical improvement of the divide-and-conquer eigenvalue algorithms
- Praktische Verfahren der Gleichungsauflösung. I, II.
- Principal component analysis.
- Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering
- Rapid solution of integral equations of classical potential theory
- Relative-Error CUR Matrix Decompositions
- Smoothing the Gap Between NP and ER
- Stability of the Lanczos method for matrix function approximation
- Stable and efficient spectral divide and conquer algorithms for the symmetric eigenvalue decomposition and the SVD
- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- Testing positive semidefiniteness using linear measurements
- The complexity of the matrix eigenproblem
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The shifted QR algorithm for Hermitian matrices
- Unitary Triangularization of a Nonsymmetric Matrix
- Unitäre Transformationen großer Matrizen
- Über ein leichtes Verfahren die in der Theorie der Säcularstörungen vorkommenden Gleichungen numerisch aufzulösen*).
This page was built for publication: Deterministic complexity analysis of Hermitian eigenproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397589)
