A tridiagonal matrix construction by the quotient difference recursion formula in the case of multiple eigenvalues

DOI10.1186/s40736-014-0010-0zbMath1329.65080OpenAlexW2015416660WikidataQ59396835 ScholiaQ59396835MaRDI QIDQ890590

Kanae Akaiwa, Masashi Iwasaki, Koichi Kondo, Yoshimasa Nakamura

Publication date: 10 November 2015

Published in: Pacific Journal of Mathematics for Industry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s40736-014-0010-0

zbMATH Keywords

numerical examplesymbolic computationcharacteristic polynomialtridiagonal matrixinverse eigenvalue problemminimal polynomialmultiple eigenvaluesquotient difference algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Numerical solutions to inverse eigenvalue problems (65F18)

Related Items

A finite-step construction of totally nonnegative matrices with specified eigenvalues, Unnamed Item

Cites Work

• Bestimmung der Eigenwerte und Eigenvektoren einer Matrix mit Hilfe des Quotienten-Differenzen-Algorithmus
• From qd to LR, or, how were the qd and LR algorithms discovered?
• Finding zeros of a polynomial by the Q-D algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item