1958
DOI: 10.1145/320941.320947
|View full text |Cite
|
Sign up to set email alerts
|

Unitary Triangularization of a Nonsymmetric Matrix

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
231
0
4

Year Published

1965
1965
2014
2014

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 507 publications
(236 citation statements)
references
References 2 publications
1
231
0
4
Order By: Relevance
“…In [1], HOUSEHOLDER stressed the use of orthogonal transformations for solving linear least squares problems. In this paper, we shall exploit these transformations.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…In [1], HOUSEHOLDER stressed the use of orthogonal transformations for solving linear least squares problems. In this paper, we shall exploit these transformations.…”
mentioning
confidence: 99%
“…A very effective method to realize the decomposition (4) is via Householder transfor mations [1]. Let A = A (1) , and let A (2) , A (3) , ..., A…”
mentioning
confidence: 99%
“…The QR decomposition of a matrix always exists [18], even if the matrix does not have a full rank. To find the QR decomposition, the Householder transformation (called also Householder reflection) [19] can be used. This brings to the final relation: • n(N x +1)+(n+1) operations for the output calculation;…”
Section: B Modification Of the Mlmvn Learning Algorithm Using Complementioning
confidence: 99%
“…; 0Þ T and k Á k is the Euclidean norm. Transforming sequentially each column of A yields an upper triangular matrix R: Details for the Householder QR decomposition algorithm can be found in [14]. The robust fit quality measure is given by the 'FitQuality' function whose parameters are E; p; and scale:…”
Section: Iterative Reweighted Least Squares (Irls)mentioning
confidence: 99%