Skip to search formSkip to main contentSkip to account menu

QR decomposition

Known as: QR factorization, QRD, LQ decomposition 
In linear algebra, a QR decomposition (also called a QR factorization) of a matrix is a decomposition of a matrix A into a product A = QR of an… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
We analyze skip-gram with negative-sampling (SGNS), a word embedding method introduced by Mikolov et al., and show that it is… 
Highly Cited
2008
Highly Cited
2008
In this paper, we present incremental smoothing and mapping (iSAM), which is a novel approach to the simultaneous localization… 
Highly Cited
2006
Highly Cited
2006
  • T. Davis
  • 2006
  • Corpus ID: 60831637
Preface 1. Introduction 2. Basic algorithms 3. Solving triangular systems 4. Cholesky factorization 5. Orthogonal methods 6. LU… 
Highly Cited
2003
Highly Cited
2003
In rich-scattering environments, layered space-time architectures like the BLAST system may exploit the capacity advantage of… 
Review
2003
Review
2003
In this report we review the algorithms for the QR decomposition that are based on the Schmidt orthonormalization process and… 
Review
1999
Review
1999
Methods for voting classification algorithms, such as Bagging and AdaBoost, have been shown to be very successful in improving… 
Highly Cited
1992
Highly Cited
1992
Introduction.- The Helmholtz Equation.- Direct Acoustic Obstacle Scattering.- III-Posed Problems.- Inverse Acoustic Obstacle… 
Highly Cited
1992
Highly Cited
1992
T. Chan has noted that, even when the singular value decomposition of a matrix A is known, it is still not obvious how to find a… 
Highly Cited
1958
Highly Cited
1958
SummaryRespirometer experiments show that when a dry soil is moistened a characteristic pattern of decomposition occurs in which…