Abstract
Proposing a new method for parallel computations on algebraic numbers, we establish that computing the Jordan normal form of matrices over any commutative field F is in \(\mathcal{N}C_F\).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Borodin, S.A. Cook, and N. Pippenger. Parallel computation for well-endowed rings and space bounded probalistic machines. Information and Control, 58:113–136, 1983.
A. Borodin, J. von zur Gathen, and J. Hopcroft. Fast parallel matrix and gcd computations. Information and Control, 52:241–256, 1982.
S.A. Cook. A taxonomy of problems with fast parallel algorithms. Inf. Control, 64:2–22, 1985.
J. Della Dora, C. Dicrescenzo, and D. Duval. About a new method for computing in algebraic number fields. In Proc. EUROCAL'85, LNCS 204, Springer Verlag, pages 289–290, 1985.
C. Dicrescenzo and D. Duval. Algebraic extensions and algebraic closure in Scratchpad II. In Proc. ISSAC'88, LNCS 358, Springer Verlag, pages 440–446, 1988.
D. Duval. Diverses questions relatives au calcul formel avec des nombres algébriques. Thèse de Doctorat d'Etat, Université de Grenoble, France, 1987.
F.R. Gantmacher. Théorie des matrices. Dunod, Paris, France, 1966.
J. von zur Gathen. Parallel algorithms for algebraic problems. SIAM J. Comp., 13:802–824,1984.
J. von zur Gathen. Parallel arithmetic computations: a survey. In Proc. 12th Int. Symp. Math. Found. Comput. Sci., Bratislava, pages 93–112. LNCS 233, Springer Verlag, 1986.
M. Giesbrecht. Nearly optimal algorithms for canonical matrix forms. PhD thesis, Department of Computer Science, University of Toronto, 1993.
M. Giesbrecht. Nearly optimal algorithms for canonical matrix forms. S1AM Journal on Computing, 1994. To appear.
T. Gómez-DÃaz. Quelques applications de l'évaluation dynamique. PhD thesis, Université de Limoges, France, 1994.
E Kaltofen. Sparse Hensel lifting. In Proc. EUROCAL'85. vol. 2, pages 4–17. LNCS 204, Springer Verlag, 1985.
E. Kaltofen, M.S. Krishnamoorthy, and B.D. Saunders. Fast parallel computation of Hermite and Smith forms of polynomials matrices. SIAM J. Alg. Disc. Meth., 8 4, pp 683–690, 1987.
E. Kaltofen, M.S. Krishnamoorthy, and B.D. Saunders. Parallel algorithms for matrix normal forms. Linear Algebra and its Applications, 136:189–208, 1990.
H. Lüneburg. On rational form of endomorphims: a primer to constructive algebra. Wissenschaftsverlag, Mannheim, 1987.
C.C. MacDuffee. The theory of matrices. Chelsea, New-York, 1956.
K. Mulmuley. A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Combinatorica, 7(1): 101–104, 1987.
P. Ozello. Calcul exact des formes de Jordan et de Frobenius d'une matrice. PhD thesis, Université Scientifique et Médicale de Grenoble, France, 1987.
J.L. Roch and G. Villard. Fast parallel computation of the Jordan normal form of matrices. Parallel Processing Letters, 1994. To appear.
G. Villard. Fast parallel computation of the Smith normal form of polynomial matrices. In International Symposium on Symbolic and Algebraic Computation, Oxford, UK. ACM Press, July 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roch, J.L., Villard, G. (1994). Parallel computations with algebraic numbers a case study: Jordan normal form of matrices. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds) PARLE'94 Parallel Architectures and Languages Europe. PARLE 1994. Lecture Notes in Computer Science, vol 817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58184-7_142
Download citation
DOI: https://doi.org/10.1007/3-540-58184-7_142
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58184-0
Online ISBN: 978-3-540-48477-6
eBook Packages: Springer Book Archive