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

DOI10.1090/S0025-5718-1974-0378378-XzbMATH Open0304.65027MaRDI QIDQ4060262FDOQ4060262

Authors: Axel Ruhe 

Publication date: 1974

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$
• Computational Variants of the Lanczos Method for the Eigenproblem
• Title not available (Why is that?)
• Use of Fast Direct Methods for the Efficient Numerical Solution of Nonseparable Elliptic Equations
• The Solution of Large Sparse Unsymmetric Systems of Linear Equations
• 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
• The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order
• Title not available (Why is that?)
• Gradient methods for finite-element eigenproblems.
• A Symmetric Factorization Procedure for the Solution of Elliptic Boundary Value Problems
• Evaluation of eigensolutions of discrete space diffusion equation

Cited In (14)

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

This page was built for publication: 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices

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