Numerical solution of eigentuple-eigenvector problems in Hilbert spaces by a gradient method
From MaRDI portal
Cites work
- Ax = \lambda Bx and the Generalized Eigenproblem
- A convergent gradient method for matrix eigenvector-eigentuple problems
- A general approach to one-step iterative methods with application to eigenvalue problems
- An Algorithm for Generalized Matrix Eigenvalue Problems
- scientific article; zbMATH DE number 3429996 (Why is no real title available?)
- scientific article; zbMATH DE number 3236302 (Why is no real title available?)
- scientific article; zbMATH DE number 3311329 (Why is no real title available?)
- scientific article; zbMATH DE number 3372503 (Why is no real title available?)
- Mehrparametrige und nichtlineare Eigenwertaufgaben
- Multiparametric eigenvalue problems in inner-product spaces
- Solution of eigenvalue problems in Hilbert spaces by a gradient method
Cited in
(6)- 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
- Two complementary block Macaulay matrix algorithms to solve multiparameter eigenvalue problems
- Numerical methods for solving multiparameter eigenvalue problems
- Modification of a method for solving the multiparameter eigenvalue problem for systems of loosely coupled ordinary differential equations
- On the two-parameter matrix pencil problem
This page was built for publication: Numerical solution of eigentuple-eigenvector problems in Hilbert spaces by a gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1133286)
