J. H. Wilkinson
- 1 L. FRANX WER~R, Computing eigenvalues of complex matrices by determinant evaluation and by methods of Danilewski and Wielaudt. Ramo-Woo}dridge Corporation Report, NN-90 (1958).Google Scholar
- 2 WALLACE GIVENS, Computation o~ plane unitary rotations transforming a general matrix to triangular form. J. Soc. Indus,. App,. Math. 6 (1958), ?h-50.Google Scholar
- 3 M. HYMAN, Eigenvalues and eigenvectors of general matrices. Presented at the meeting of the Association for Computing Machinery; June 11-13, 1957.Google Scholar
- 4 J. H. WrLXINSON, On the calculation of the eigenvectors of eodiagonal matrices. C~npurer J. 1 (1958), 90-96.Google Scholar
- 5 H. R. 8CHWARZ, Ein Verfahren zur Stabilit/itsfrage bei Matrizen-Eigenwertproblemen. Zeit. Angew. Math. u. Phys. 7 (1956), 473-500.Google Scholar
Index Terms
- Stability of the Reduction of a Matrix to Almost Triangular and Triangular Forms by Elementary Similarity Transformations
Recommendations
General triangular midpoint subdivision
Smoothness of general triangular midpoint surfaces for arbitrary control meshes. C 1 analysis tools for infinite classes of triangular subdivision schemes.New spectral properties of subdivision matrices.Smoothness analysis of Loop subdivision surfaces. ...
Progressive compression of arbitrary triangular meshes
VIS '99: Proceedings of the conference on Visualization '99: celebrating ten yearsIn this paper we present a mesh compression method based on a multiresolution decomposition whose detail coefficients have a compact representation and thus smaller entropy than the original mesh. Given an arbitrary triangular mesh with an irregular ...
Delaunay Triangular Meshes in Convex Polygons
An algorithm for producing a triangular mesh in a convex polygon is presented. It is used in a method for the finite element triangulation of a complex polygonal region of the plane in which the region is decomposed into convex polygons. The interior ...
Comments