𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices

DOI10.1090/S0025-5718-1974-0378378-XzbMath0304.65027MaRDI QIDQ4060262

Axel Ruhe

Publication date: 1974

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

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to systems of equations (65H10) Eigenvalues, singular values, and eigenvectors (15A18) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items

An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices, A survey of the advances in the exploitation of the sparsity in the solution of large problems, Methods and algorithms of solving spectral problems for polynomial and rational matrices, A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems, Computational methods of linear algebra, Preconditioned iterative methods for the large sparse symmetric eigenvalue problem, A subspace preconditioning algorithm for eigenvector/eigenvalue computation, Iterative eigenvalue algorithms based on convergent splittings, Two algorithms for treating \(Ax=\lambda Bx\), The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order, [https://portal.mardi4nfdi.de/wiki/Publication:3926873 Simultane Iterationsverfahren f�r gro�e allgemeine Eigenwertprobleme], On preconditionad iterative methods for solving (A-lambdaB)x=0, Preconditioning eigenvalues and some comparison of solvers, Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order
• Evaluation of eigensolutions of discrete space diffusion equation
• New iterative methods for solution of the eigenproblem
• The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices
• Gradient methods for finite-element eigenproblems.
• The Solution of Large Sparse Unsymmetric Systems of Linear Equations
• Use of Fast Direct Methods for the Efficient Numerical Solution of Nonseparable Elliptic Equations
• On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$
• Computational Variants of the Lanczos Method for the Eigenproblem
• A Symmetric Factorization Procedure for the Solution of Elliptic Boundary Value Problems