A method for calculating the extreme eigensolution of a real symmetric matrix of high order

DOI10.1088/0305-4470/13/7/019zbMath0428.65016OpenAlexW2081260929MaRDI QIDQ3865367

T. Z. Kalamboukis

Publication date: 1980

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/0305-4470/13/7/019

zbMATH Keywords

high orderreal symmetric matrixextreme eigensolution

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (5)

Super-matrix methods ⋮ A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix ⋮ Davidson's method and preconditioning for generalized eigenvalue problems ⋮ Relaxation techniques in the iterative '2\(\times 2'\) algorithm ⋮ A Lanczos-type algorithm for the generalized eigenvalue problem Ax=lambdaBx

This page was built for publication: A method for calculating the extreme eigensolution of a real symmetric matrix of high order