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

DOI10.1090/S0025-5718-1974-0378378-XMaRDI QIDQ4060262zbMATH OpenFDO

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

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

Cited in

(14)

• An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
• Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
• Simultane Iterationsverfahren f�r gro�e allgemeine Eigenwertprobleme
• 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)