On Kublanovskaya’s Approach to the Solution of the Generalized Latent Value Problem for Functional $\lambda $-Matrices
From MaRDI portal
Publication:3308960
DOI10.1137/0720075zbMath0528.65019OpenAlexW2003983929MaRDI QIDQ3308960
Narendra Kumar Jain, Kishore Singhal
Publication date: 1983
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0720075
Newton-Raphson methodnonlinear eigenvalue problemquadratic rate of convergencelambda matricesLU decompositionsnormalized QR decomposition
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Matrices over function rings in one or more variables (15A54)
Related Items (11)
Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method ⋮ Methods and algorithms of solving spectral problems for polynomial and rational matrices ⋮ Convergence factors of Newton methods for nonlinear eigenvalue problems ⋮ A novel numerical method to determine the algebraic multiplicity of nonlinear eigenvalues ⋮ Stability analysis of time-delay systems using a contour integral method ⋮ Modified successive approximation methods for the nonlinear eigenvalue problems ⋮ Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods ⋮ A Modified Newton Method for Nonlinear Eigenvalue Problems ⋮ Sensitivity analysis of the largest dependent eigenvalue functions of eigensystems ⋮ Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian ⋮ A Nonlinear QR Algorithm for Banded Nonlinear Eigenvalue Problems
This page was built for publication: On Kublanovskaya’s Approach to the Solution of the Generalized Latent Value Problem for Functional $\lambda $-Matrices
