Results 31 to 40 of about 1,179,942 (315)
A 3D Parallel Algorithm for QR Decomposition [PDF]
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018 Interprocessor communication often dominates the runtime of large matrix computations. We present a parallel algorithm for computing QR decompositions whose bandwidth cost (communication volume) can be decreased at the cost of increasing its latency cost (number of messages).
Ballard, Grey +4 more
openaire +5 more sources
Virtual Systolic Array for QR Decomposition [PDF]
2013 IEEE 27th International Symposium on Parallel and Distributed Processing, 2013 Systolic arrays offer a very attractive, data-centric, execution model as an alternative to the von Neumann architecture. Hardware implementations of systolic arrays turned out not to be viable solutions in the past. This article shows how the systolic design principles can be applied to a software solution to deliver an algorithm with unprecedented ...
Jakub Kurzak +4 more
openaire +1 more source
PCA algorithm of QR accelerated SVD decomposition
, 2022 QRPCA is a package that uses singular value decomposition and QR decomposition to perform PCA dimensionality reduction. It takes the two-dimensional matrix data matrix as the input, trains the PCA dimensionality reduction matrix, and reduces the ...
Quanfeng
core +2 more sources
Scheduled QR-BP Detector with Interference Cancellation and Candidate Constraints for MIMO Systems
Sensors, 2021 In this paper, a QR-decomposition-based scheduled belief propagation (BP) detector with interference cancellation (IC) and candidate constraints is proposed for multiple-input multiple-output (MIMO) systems.
Sangjoon Park
doaj +1 more source
Applied Sciences, 2022 Digital images are transferred with ease through the network. Many users are using the images without the knowledge of the owners. Therefore, a novel watermarking scheme is proposed to ensure copyright protection and authentication of images using ...
Prasanth Vaidya Sanivarapu +3 more
doaj +1 more source
LU-Cholesky QR algorithms for thin QR decomposition in an oblique inner product
Parallel Computing, 2020 This paper concerns thin QR decomposition in an oblique inner product. Cholesky QR is known as a fast algorithm for thin QR decomposition. On the other hand, this algorithm is not applicable for ill-conditioned matrices.
Takeshi Terao, K. Ozaki, T. Ogita
semanticscholar +1 more source
A Quantile Regression Modelling Approach to Study Gender Wage Gap in India [PDF]
Statistika: Statistics and Economy JournalThe Indian labour market exhibits significant gender wage disparities, particularly among regular/salaried employees and casual workers. To study these disparities comprehensively, we present a dual-methodological approach by combining Quantile ...
Samapriya Trivedi, Shambhavi Mishra
doaj +1 more source
Structured Matrix Methods Computing the Greatest Common Divisor of Polynomials
Special Matrices, 2017 This paper revisits the Bézout, Sylvester, and power-basis matrix representations of the greatest common divisor (GCD) of sets of several polynomials. Furthermore, the present work introduces the application of the QR decomposition with column pivoting ...
Christou Dimitrios +2 more
doaj +1 more source
Parallel QR Decomposition in LTE-A systems [PDF]
2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2010 The QR Decomposition (QRD) of communication channel matrices is a fundamental prerequisite to several detection schemes in Multiple-Input Multiple-Output (MIMO) communication systems. Herein, the main feature of the QRD is to transform the non-causal system into a causal system, where consequently efficient detection algorithms based on the Successive ...
Sébastien Aubert +3 more
openaire +2 more sources
Methods for determing QR decomposition [PDF]
, 2018 U ovom radu najprije ćemo objasnit što je to QR dekompozicija matrice. Nakon toga ćemo navesti tri metode uz pomoću kojih možemo odrediti QR dekompoziciju dane matrice.
Per, Valentina
core