Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
From MaRDI portal
Publication:3326722
DOI10.2307/2007602zbMath0539.65013OpenAlexW4250281634MaRDI QIDQ3326722
Publication date: 1984
Full work available at URL: https://doi.org/10.2307/2007602
Numerical experimentsArnoldi methodsubspace iterationIterative algorithmsChebyshev accelerationChebyshev semi-iterationArnoldi-Chebyshev methodlage sparse nonsymmetric eigenvalue problems
Related Items
A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices ⋮ Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems ⋮ A generalized nonsymmetric Lanczos procedure ⋮ Numerical solution of large nonsymmetric eigenvalue problems ⋮ Shift-invert and Cayley transforms for detection of rightmost eigenvalues of nonsymmetric matrices ⋮ An implicit filter for rational Krylov using core transformations ⋮ A new technique for determining coupled modes of structure-acoustic systems ⋮ An Arnoldi-Inout algorithm for computing PageRank problems ⋮ Highly nonnormal eigenproblems in the aeronautical industry ⋮ Eigenvalues of the discretized Navier-Stokes equation with application to the detection of Hopf bifurcations ⋮ Leading hadronic contributions to the running of the electroweak coupling constants from lattice QCD ⋮ A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank ⋮ Numerical solutions for large sparse quadratic eigenvalue problems ⋮ Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems ⋮ Nonequivalence deflation for the solution of matrix latent value problems ⋮ A block incomplete orthogonalization method for large nonsymmetric eigenproblems ⋮ Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices ⋮ Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems ⋮ A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems ⋮ Finding leading modes of a viscous free surface flow: An asymmetric generalized eigenproblem ⋮ Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank ⋮ An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank ⋮ Computation of rovibrational eigenvalues of van der Waals molecules on a CRAY T3D ⋮ Computing the field of values and pseudospectra using the Lanczos method with continuation ⋮ Arnoldi-Riccati method for large eigenvalue problems ⋮ A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems ⋮ Methods and algorithms of solving spectral problems for polynomial and rational matrices ⋮ A new framework for implicit restarting of the Krylov-Schur algorithm ⋮ Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem ⋮ High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations ⋮ Hybrid eigensolvers for nuclear configuration interaction calculations ⋮ On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems ⋮ A mathematical biography of Danny C. Sorensen ⋮ A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices ⋮ Nonlinear acceleration of momentum and primal-dual algorithms ⋮ Numerical solution of linear eigenvalue problems ⋮ Practical acceleration for computing the HITS expertrank vectors ⋮ A Filtered-Davidson Method for Large Symmetric Eigenvalue Problems ⋮ On Chebyshev-Davidson method for symmetric generalized eigenvalue problems ⋮ On restarting the Arnoldi method for large nonsymmetric eigenvalue problems ⋮ A parallel subdomain by subdomain implementation of the implicitly restarted Arnoldi/Lanczos method ⋮ Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values ⋮ Eigenmode solution of 2-D and 3-D electromagnetic cavities containing absorbing materials using the Jacobi-Davidson algorithm ⋮ Chebyshev polynomials are not always optimal ⋮ Low-Rank Matrix Iteration Using Polynomial-Filtered Subspace Extraction ⋮ Augmented block Householder Arnoldi method ⋮ Quasi-kernel polynomials and their use in non-Hermitian matrix iterations ⋮ Evaluating non-analytic functions of matrices ⋮ A modified second-order Arnoldi method for solving the quadratic eigenvalue problems ⋮ Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn-Sham equation ⋮ On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems ⋮ Arnoldi-Chebyshev approach for convection-diffusion computations ⋮ Krylov subspace methods for eigenvalues with special properties and their analysis for normal matrices ⋮ A key to choose subspace size in implicitly restarted Arnoldi method ⋮ Lanczos maximal algorithm for unsymmetric eigenvalue problems ⋮ Computing eigenpairs of Hermitian matrices in augmented Krylov subspace produced by Rayleigh quotient iterations ⋮ Tchebychev acceleration technique for large scale nonsymmetric matrices ⋮ An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems ⋮ Rayleigh quotient minimization method for symmetric eigenvalue problems ⋮ An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations ⋮ A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems ⋮ Filtered Krylov-like sequence method for symmetric eigenvalue problems ⋮ A preprocessed multi-step splitting iteration for computing PageRank ⋮ Polynomial Preconditioned Arnoldi with Stability Control ⋮ Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian ⋮ A priori error bounds on invariant subspace approximations by block Krylov subspaces
Uses Software
