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
Posted Content
Optimal Sensor and Actuator Placement using Balanced Model Reduction.
TL;DR: This work exploits balanced model reduction and greedy optimization to efficiently determine sensor and actuator placements that optimize observability and controllability via greedy matrix QR pivoting on the dominant modes of the direct and adjoint balancing transformations.
Journal ArticleDOI
On the solution of the linear least squares problems and pseudo-inverses
TL;DR: A general analysis of the condition of the linear least squares problems and pseudo-inverses is presented using this assumption and Norms of relevant round-off error perturbations are estimated for two known methods of solution.
Journal ArticleDOI
A Numerical Method for Computing an SVD-like Decomposition
TL;DR: A numerical method for computing the SVD-like decomposition B = QDS-1, where Q is orthogonal, S is symplectic, and D is a permuted diagonal matrix, which can be applied directly to compute the canonical form of the Hamiltonian matrices of the form JBTB.
Deflated Shifted Block Krylov Subspace Methods for Hermitian Positive Definite Matrices
TL;DR: Methods are developed that, based on deflated block Lanczos-Type processes, exploit both features---shifts and multiple right-hand sides---at once and tackle well-known problems that several right- hand sides can bring along and can be superior as compared to applying other iterative methods in typical situations.
Proceedings ArticleDOI
Performance of random sampling for computing low-rank approximations of a dense matrix on GPUs
TL;DR: This paper compares the performance of random sampling with that of QRCP on an NVIDIA Kepler GPU and presents the parallel scaling of the random sampling over multiple GPUs on a single compute node, showing a speedup of 3.8x over three Kepler GPUs.
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.