On restarting the Arnoldi method for large nonsymmetric eigenvalue problems

DOI10.1090/S0025-5718-96-00745-4zbMath0857.65041OpenAlexW1979655951MaRDI QIDQ4889928

Publication date: 9 March 1997

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-96-00745-4

zbMATH Keywords

Arnoldi method restart large nonsymmetric eigenvalue problems implicit QR-decomposition

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity, A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix, An implicit filter for rational Krylov using core transformations, FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A,B), A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems, An Arnoldi-Inout algorithm for computing PageRank problems, A modification on minimum restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix, A preconditioned Krylov technique for global hydrodynamic stability analysis of large-scale compressible flows, Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems, Harmonic projection methods for large non-symmetric eigenvalue problems, The implicit application of a rational filter in the RKS method, Global linear instability analysis of thermal convective flow using the linearized lattice Boltzmann method, A new restarting method in the Lanczos algorithm for generalized eigenvalue problem, Tensor-Krylov method for computing eigenvalues of parameter-dependent matrices, A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems, Preconditioning bandgap eigenvalue problems in three-dimensional photonic crystals simulations, A compact heart iteration for low-rank approximations of large matrices, Hybrid iterative refined restarted Lanczos bidiagonalization methods, A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line, A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices, Efficient Arnoldi-type algorithms for rational eigenvalue problems arising in fluid-solid systems, A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems, Bifurcation analysis of steady Rayleigh–Bénard convection in a cubical cavity with conducting sidewalls, Computing the smallest singular triplets of a large matrix, A new algorithm for computing eigenpairs of matrices, Alternative correction equations in the Jacobi-Davidson method, Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems, TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems, An inexact Krylov-Schur algorithm for the unitary eigenvalue problem, A numerical method for determining monotonicity and convergence rate in iterative learning control, On restarting the tensor infinite Arnoldi method, Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix, Augmented block Householder Arnoldi method, Deflated GMRES for systems with multiple shifts and multiple right-hand sides, Deflated block Krylov subspace methods for large scale eigenvalue problems, Restarted block-GMRES with deflation of eigenvalues, Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix, A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices, Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems, A hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix, Weighted FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A, B), Two-Grid and Multiple-Grid Arnoldi for Eigenvalues, A cross-product approach for low-rank approximations of large matrices, A key to choose subspace size in implicitly restarted Arnoldi method, Arnoldi method for large quaternion right eigenvalue problem, Thick-restart Lanczos method for electronic structure calculations, Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling, A new method for accelerating Arnoldi algorithms for large scale eigenproblems, Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix, Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm, A preprocessed multi-step splitting iteration for computing PageRank, Polynomial Preconditioned Arnoldi with Stability Control, The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action, Compact Rational Krylov Methods for Nonlinear Eigenvalue Problems, Computing interior eigenvalues of large sparse symmetric matrices

Uses Software

Cites Work