scientific article; zbMATH DE number 3791531

MaRDI QIDQ3968381zbMATH OpenFDO

Authors Axel Ruhe

Publication date 1983

zbMATH Keywords

large sparse nonsymmetric matrixnumerical teststwo-sided Arnoldi algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50)

Cited in

(18)

• Numerical aspects of Gram-Schmidt orthogonalization of vectors
• An efficient nonsymmetric Lanczos method on parallel vector computers
• Solution of the partial eigenvalue problem for a regular matrix pencil
• Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
• The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
• A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
• Methods and algorithms of solving spectral problems for polynomial and rational matrices
• Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
• Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
• Communication in complex networks
• Perron communicability and sensitivity of multilayer networks
• Adjoint algorithms for the Navier-Stokes equations in the low Mach number limit
• Compact Two-Sided Krylov Methods for Nonlinear Eigenvalue Problems
• Krylov-Schur-type restarts for the two-sided Arnoldi method
• Enhancing multiplex global efficiency
• Network analysis with the aid of the path length matrix
• Edge importance in complex networks
• Rational Krylov sequence methods for eigenvalue computation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3968381)