scientific article
From MaRDI portal
Publication:3968381
zbMath0502.65022MaRDI QIDQ3968381
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items (17)
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 ⋮ Krylov--Schur-Type Restarts for the Two-Sided Arnoldi Method ⋮ Perron communicability and sensitivity of multilayer networks ⋮ Enhancing multiplex global efficiency ⋮ Network analysis with the aid of the path length matrix ⋮ Adjoint algorithms for the Navier-Stokes equations in the low Mach number limit ⋮ An efficient nonsymmetric Lanczos method on parallel vector computers ⋮ Compact Two-Sided Krylov Methods for Nonlinear Eigenvalue Problems ⋮ Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle ⋮ Solution of the partial eigenvalue problem for a regular matrix pencil ⋮ Communication in complex networks ⋮ Rational Krylov sequence methods for eigenvalue computation ⋮ Numerical aspects of Gram-Schmidt orthogonalization of vectors ⋮ Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian ⋮ Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
This page was built for publication:
