Computing eigenvalue bounds for iterative subspace matrix methods (Q709710): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cpc.2004.12.013
+Normal rank
@@ Property / OpenAlex ID @@
+W2167523522
@@ Property / OpenAlex ID: W2167523522 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4348515
@@ Property / cites work: Q4348515 / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix Algorithms
@@ Property / cites work: Matrix Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
+Normal rank
@@ Property / cites work @@
+The subspace projected approximate matrix (SPAM) modification of the Davidson method
+Normal rank
@@ Property / cites work @@
+A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
+Normal rank
@@ Property / cites work @@
+Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
+Normal rank
@@ Property / cites work @@
+The Rotation of Eigenvectors by a Perturbation. III
+Normal rank