Computational methods for large eigenvalue problems
From MaRDI portal
Recommendations
- Numerical methods for large eigenvalue problems
- Numerical methods for large eigenvalue problems
- Numerical methods for large eigenvalue problems
- Large-scale complex eigenvalue problems
- A numerical method for computing eigenvectors of a large matrix
- An algorithm for solution of large eigenvalue problems
- Large-scale structured eigenvalue problems
- Applications of the numerical computation of the eigenvalues and eigenvectors of the matrices of large size
- Numerical solution of large nonsymmetric eigenvalue problems
- scientific article; zbMATH DE number 17720
Cited in
(56)- Parallelization of the rational Arnoldi algorithm
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- International workshop on eigenvalue problems: algorithms; software and applications, in petascale computing (EPASA2018)
- A refined Arnoldi type method for large scale eigenvalue problems
- Numerical Linear Algebra for Model Reduction in Control and Simulation
- Optimal quotients for solving large eigenvalue problems
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- A new subspace iteration algorithm for solving generalized eigenvalue problems in vibration analysis
- A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
- Refined and refined harmonic Jacobi-Davidson methods for computing several GSVD components of a large regular matrix pair
- scientific article; zbMATH DE number 1222715 (Why is no real title available?)
- A comparison of eigensolvers for large-scale 3D modal analysis using AMG-preconditioned iterative methods
- Theoretical and computable optimal subspace expansions for matrix eigenvalue problems
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
- scientific article; zbMATH DE number 4192950 (Why is no real title available?)
- Saving flops in LU based shift-and-invert strategy
- An analysis of the Rayleigh-Ritz and refined Rayleigh-Ritz methods for regular nonlinear eigenvalue problems
- Large-scale complex eigenvalue problems
- Book review of: Y. Saad, Numerical methods for large eigenvalue problems. Revised ed.
- Inverse, shifted inverse, and Rayleigh quotient iteration as Newton's method
- Numerical solution of linear eigenvalue problems
- Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems
- Eigenvalue computation in the 20th century
- On convergence of the inexact Rayleigh quotient iteration with MINRES
- On expansion of search subspaces for large non-Hermitian eigenproblems
- A refined Jacobi-Davidson method and its correction equation
- scientific article; zbMATH DE number 5049914 (Why is no real title available?)
- scientific article; zbMATH DE number 3992791 (Why is no real title available?)
- A method for computing a few eigenpairs of large generalized eigenvalue problems
- An algorithm for solution of large eigenvalue problems
- Proper use of Lanczos vectors for large eigenvalue problems
- Matrix algorithms. Vol. 2: Eigensystems
- Numerical methods for large eigenvalue problems
- Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method
- A fast multigrid-based electromagnetic eigensolver for curved metal boundaries on the Yee mesh
- Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
- Using cross-product matrices to compute the SVD
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
- Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair
- Numerical methods for large eigenvalue problems
- A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair
- Modern methods for the iterative computation of eigenpairs of matrices of high dimension
- An overview on the eigenvalue computation for matrices
- A new shift strategy for the implicitly restarted refined harmonic Lanczos method
- A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems
- On multiscale methods in Petrov-Galerkin formulation
- The Jacobi-Davidson method
- An Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation
- On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems
- Challenges in model order reduction for industrial problems
- Comparative study of two algorithms for the calculation of the extreme eigenvalues of large matrices
- The inner structure of sensitivities in nodal based shape optimisation
- On the correction equation of the Jacobi-Davidson method
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm
- A numerical method of determining eigenvalues of matrices of arbitrary large size
This page was built for publication: Computational methods for large eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776686)
