Journal ArticleDOI
Linear least squares solutions by householder transformations
Peter A. Businger,Gene H. Golub +1 more
Reads0
Chats0
TLDR
In this paper, the euclidean norm is unitarily invariant and a vector x is determined such that x is parallel b-Ax parallel = \parallel c - QAx parallel where c denotes the first n components of c.Abstract:
Let A be a given m×n real matrix with m≧n and of rank n and b a given vector. We wish to determine a vector x such that
$$\parallel b - A\hat x\parallel = \min .$$
where ∥ … ∥ indicates the euclidean norm. Since the euclidean norm is unitarily invariant
$$\parallel b - Ax\parallel = \parallel c - QAx\parallel $$
where c=Q b and Q T Q = I. We choose Q so that
$$QA = R = {\left( {_{\dddot 0}^{\tilde R}} \right)_{\} (m - n) \times n}}$$
(1)
and R is an upper triangular matrix. Clearly,
$$\hat x = {\tilde R^{ - 1}}\tilde c$$
where c denotes the first n components of c.read more
Citations
More filters
Book ChapterDOI
A generalized SVD analysis of some weighting methods for equality constrained least squares
TL;DR: In this article, the generalized singular value decomposition (GSV decomposition) was used to derive error bounds for the weighting approach. But the analysis of the analysis is limited to linear equality constraints.
Journal ArticleDOI
A note on subset selection for matrices
F. R. de Hoog,R.M.M. Mattheij +1 more
TL;DR: In this article, the problem of selecting rows of a matrix so that the resulting matrix is as "non-singular" as possible was examined. But the proof of the key result in that paper is not constructive.
Journal ArticleDOI
Accuracy of Gram–Schmidt orthogonalization and Householder transformation for the solution of linear least squares problems
Journal ArticleDOI
Iterative schemes for the solution of system of equations arising from the DRM in multi domain approach, and a comparative analysis of the performance of two different radial basis functions used in the interpolation
M. Portapila,Henry Power +1 more
TL;DR: The efficiency and accuracy of the computed solutions obtained from the DRM-MD integral equation numerical approach applying various iterative algorithms are analysed.
Journal ArticleDOI
Improved Greedy Algorithms for Sparse Approximation of a Matrix in Terms of Another Matrix
Crystal Maung,Haim Schweitzer +1 more
TL;DR: This work considers simultaneously approximating all the columns of a data matrix in terms of few selected columns of another matrix that is sometimes called “the dictionary”, and proposes two new algorithms that can be used even when both the data matrix and the dictionary matrix are large.
References
More filters
Journal ArticleDOI
Unitary Triangularization of a Nonsymmetric Matrix
TL;DR: This note points out that the same result can be obtained with fewer arithmetic operations, and, in particular, for inverting a square matrix of order N, at most 2(N-1) square roots are required.