scientific article; zbMATH DE number 1138094
From MaRDI portal
DOI<425::AID-NLA117>3.0.CO;2-G 10.1002/(SICI)1099-1506(199709/10)4:5<425::AID-NLA117>3.0.CO;2-GzbMath0889.65038MaRDI QIDQ4383439
No author found.
Publication date: 1 April 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
eigenvectornumerical experimentslarge sparse matrixinexact inverse iteration methodsmallest modulus eigenvalue
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items
Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem, Inexact inverse subspace iteration for generalized eigenvalue problems, Iterative computation of the smallest singular value and the corresponding singular vectors of a matrix., A Filtered-Davidson Method for Large Symmetric Eigenvalue Problems, Computing the smallest singular triplets of a large matrix, On expansion of search subspaces for large non-Hermitian eigenproblems, Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations, Convergence and preconditioning of inexact inverse subspace iteration for generalized eigenvalue problems, Solving large nonlinear generalized eigenvalue problems from density functional theory calculations in parallel, Fast inexact subspace iteration for generalized eigenvalue problems with spectral transformation, Fixed-point methods for a semiconductor quantum dot model, Saving flops in LU based shift-and-invert strategy, Low-Rank Solution Methods for Stochastic Eigenvalue Problems, Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization, Unnamed Item, The effects of inexact solvers in algorithms for symmetric eigenvalue problems, The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action, Inexact inverse subspace iteration with preconditioning applied to quadratic matrix polynomials, A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix
Uses Software
Cites Work
