Balancing sparse matrices for computing eigenvalues
From MaRDI portal
Recommendations
- Balancing sparse Hamiltonian eigenproblems
- scientific article; zbMATH DE number 3874487
- scientific article; zbMATH DE number 3978276
- Computing interior eigenvalues of large sparse symmetric matrices
- scientific article; zbMATH DE number 6274888
- scientific article; zbMATH DE number 697753
- scientific article; zbMATH DE number 1985702
- Vector and parallel computing for matrix balancing
- The structure of the eigenvectors of sparse matrices
- scientific article; zbMATH DE number 4100479
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3544999 (Why is no real title available?)
- scientific article; zbMATH DE number 733664 (Why is no real title available?)
- scientific article; zbMATH DE number 781814 (Why is no real title available?)
- scientific article; zbMATH DE number 782058 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- A Comparative Study of Algorithms for Matrix Balancing
- An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
- Approximability by Weighted Norms of the Structured and VolumetricSingular Values of a Class of Nonnegative Matrices
- Balancing a matrix for calculation of eigenvalues and eigenvectors
- Concerning Diagonal Similarity of Irreducible Matrices
- Depth-First Search and Linear Graph Algorithms
- Line-sum-symmetric scalings of square nonnegative matrices
- Matrix balancing
- Max-Balancing Weighted Directed Graphs and Matrix Scaling
- Minimization of norms and logarithmic norms by diagonal similarities
- On Pre-Conditioning of Matrices
- Sparse matrix test problems
Cited in
(9)- Palindromic quadratization and structure-preserving algorithm for palindromic matrix polynomials of even degree
- Generalized self-concordant functions: a recipe for Newton-type methods
- Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
- Krylov-Schur-type restarts for the two-sided Arnoldi method
- Near-linear convergence of the random Osborne algorithm for matrix balancing
- A case where balancing is harmful
- A fast algorithm for matrix balancing
- Estimating the condition number of \(f(A)b\)
- Balancing sparse Hamiltonian eigenproblems
This page was built for publication: Balancing sparse matrices for computing eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1976919)