A convergent gradient method for matrix eigenvector-eigentuple problems
From MaRDI portal
Publication:1133284
DOI10.1007/BF01397878zbMath0421.65024MaRDI QIDQ1133284
Publication date: 1978
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132578
Related Items (9)
An iterative method for the numerical solution of two-parameter eigenvalue problems ⋮ Unnamed Item ⋮ A numerical algorithm for computing a basis for the root subspace at a nonderogatory eigenvalue of a multiparameter system ⋮ Numerical solution of eigentuple-eigenvector problems in Hilbert spaces by a gradient method ⋮ Computation of the eigenpairs of two-parameter Sturm-Liouville problems using the \textit{regularized sampling method} ⋮ Numerical methods for solving multiparameter eigenvalue problems ⋮ A low-rank inexact Newton-Krylov method for stochastic eigenvalue problems ⋮ Two complementary block Macaulay matrix algorithms to solve multiparameter eigenvalue problems ⋮ Methods for solving spectral problems for multiparameter matrix pencils
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical solution of eigentuple-eigenvector problems in Hilbert spaces by a gradient method
- Solution of eigenvalue problems in Hilbert spaces by a gradient method
- The completeness and expansion theorems associated with the multi- parameter eigenvalue problem in ordinary differential equations
- Mehrparametrige und nichtlineare Eigenwertaufgaben
- Multiparametric eigenvalue problems in inner-product spaces
- A gradient method for the matrix eigenvalue problem \(Ax = \lambda Bx\)
- Three‐Point Boundary Value Problems in Differential Equations
- Two-Parameter Eigenvalue Problems in Differential Equations
This page was built for publication: A convergent gradient method for matrix eigenvector-eigentuple problems
