Numerical solution of eigentuple-eigenvector problems in Hilbert spaces by a gradient method

DOI10.1007/BF01397877zbMath0421.65025WikidataQ57605972 ScholiaQ57605972MaRDI QIDQ1133286

Edward K. Blum, P. B. Geltner

Publication date: 1978

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132577

zbMATH Keywords

computational resultscomplex arithmeticgeneral eigenproblemgradient technique

Mathematics Subject Classification ID

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

Related Items

A numerical algorithm for computing a basis for the root subspace at a nonderogatory eigenvalue of a multiparameter system ⋮ A convergent gradient method for matrix eigenvector-eigentuple problems ⋮ Modification of a method for solving the multiparameter eigenvalue problem for systems of loosely coupled ordinary differential equations ⋮ Numerical methods for solving multiparameter eigenvalue problems ⋮ Two complementary block Macaulay matrix algorithms to solve multiparameter eigenvalue problems

Cites Work

• A convergent gradient method for matrix eigenvector-eigentuple problems
• Solution of eigenvalue problems in Hilbert spaces by a gradient method
• Mehrparametrige und nichtlineare Eigenwertaufgaben
• Multiparametric eigenvalue problems in inner-product spaces
• A general approach to one-step iterative methods with application to eigenvalue problems
• $Ax = \lambda Bx$ and the Generalized Eigenproblem
• An Algorithm for Generalized Matrix Eigenvalue Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item