Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/14723
Title: | Computing the complete orthogonal decomposition using a SIMD array processor | Authors: | Kontoghiorghes, Erricos John Clarke, M. R.B. |
metadata.dc.contributor.other: | Κοντογιώργης, Ερρίκος | Major Field of Science: | Social Sciences | Field Category: | Economics and Business | Keywords: | Linear transformations;Matrix algebra;Parallel processing systems;Orthogonal matrix;Rectangular matrix;Parallel architectures | Issue Date: | 1993 | Source: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Volume 694 LNCS, 1993, Pages 660-663 5th International Conference on Parallel Architectures and Languages Europe, PARLE 1993; Munich; Germany; 14 June 1993 through 17 June 1993; Code 114976 | Conference: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Abstract: | . In this paper we employ Householder transformations and compound Givens rotations to compute the Complete Orthogonal Decomposition of a rectangular matrix, using a SIMD array processor. Algorithms are proposed for the reconstruction of the orthogonal matrices involved in the decompositions and the estimated execution time of all parallel algorithms is obtained. | URI: | https://hdl.handle.net/20.500.14279/14723 | ISBN: | 9783540568919 | ISSN: | 2-s2.0-84919179657 03029743 https://api.elsevier.com/content/abstract/scopus_id/84919179657 |
Rights: | © Springer Nature 1993 | Type: | Conference Papers | Affiliation : | Queen Mary and Westfield College | Publication Type: | Peer Reviewed |
Appears in Collections: | Δημοσιεύσεις σε συνέδρια /Conference papers or poster or presentation |
CORE Recommender
SCOPUSTM
Citations
50
1
checked on Nov 6, 2023
Page view(s) 50
312
Last Week
0
0
Last month
3
3
checked on Nov 8, 2024
Google ScholarTM
Check
Altmetric
Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.