The calculation of Lame polynomials

DOI10.1093/COMJNL/8.3.273MaRDI QIDQ5508635zbMATH OpenOpenAlexFDO

Authors J. H. Wilkinson

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

zbMATH Keywords

numerical analysis

Cited in

(11)

• Computational methods of linear algebra
• On the convergence of the QR algorithm with multishifts
• Generalized \(qd\) algorithm for block band matrices
• Generation of orthogonal rational functions by procedures for structured matrices
• Global convergence of tridiagonal QR algorithm with origin shifts
• Solving \(p\)-adic polynomial systems via iterative eigenvector algorithms
• Matrix Bruhat decompositions with a remark on the QR(GR) algorithm
• Super-linear convergence in the p -adic QR-algorithm
• \(qd\) block algorithm
• The eigenvalue decomposition of normal matrices by the skew-symmetric part
• Commutators and companion matrices over rings of stable rank 1

This page was built for publication: The calculation of Lame polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5508635)