The calculation of Lame polynomials
From MaRDI portal
Publication:5508635
DOI10.1093/comjnl/8.3.273zbMath0135.37602OpenAlexW1974990950MaRDI QIDQ5508635
Publication date: 1965
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/8.3.273
Related Items (10)
Solving p-adic polynomial systems via iterative eigenvector algorithms ⋮ On the convergence of the \(QR\) algorithm with multishifts ⋮ \(qd\) block algorithm ⋮ Super-linear convergence in the p -adic QR-algorithm ⋮ Computational methods of linear algebra ⋮ Generalized \(qd\) algorithm for block band matrices ⋮ Matrix Bruhat decompositions with a remark on the QR(GR) algorithm ⋮ Commutators and companion matrices over rings of stable rank 1 ⋮ Generation of orthogonal rational functions by procedures for structured matrices ⋮ Global convergence of tridiagonal QR algorithm with origin shifts
This page was built for publication: The calculation of Lame polynomials
