Relaxation techniques in the iterative '2 2' algorithm

DOI10.1016/S0045-7825(85)80004-9MaRDI QIDQ760163zbMATH OpenOpenAlexFDO

Authors R. M. Quick, M. C. Steenkamp, H. G. Miller

Publication date 1985

Published in Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0045-7825(85)80004-9

zbMATH Keywords

convergence ratedominant eigenstateHermitian matrixnumerical examplerelaxation

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cites work

• A method for calculating the extreme eigensolution of a real symmetric matrix of high order
• An iterative method for calculating low lying eigenvalues of an Hermitian operator
• Iterative eigenvalue algorithms based on convergent splittings
• Preconditioned iterative methods for the large sparse symmetric eigenvalue problem

Cited in

(2)

• A two-step iterative block Lanczos algorithm for a dominant eigenspan
• scientific article; zbMATH DE number 4016054 (Why is no real title available?)

Describes a project that uses

Uses Software

• NAG
• nag
• C05ADF

This page was built for publication: Relaxation techniques in the iterative '2\(\times 2'\) algorithm

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