Book•
Matrix Analysis for Scientists and Engineers
01 Dec 2004-
TL;DR: This book discusses vector spaces, linear transformations, eigenvalues and eigenvectors, and the singular value decomposition in the context of Kronecker products.
Abstract: Preface 1. Introduction and review 2. Vector spaces 3. Linear transformations 4. Introduction to the Moore-Penrose pseudoinverse 5. Introduction to the singular value decomposition 6. Linear equations 7. Projections, inner product spaces, and norms 8. Linear least squares problems 9. Eigenvalues and eigenvectors 10. Canonical forms 11. Linear differential and difference equations 12. Generalized eigenvalue problems 13. Kronecker products Bibliography Index.
Citations
More filters
TL;DR: An adaptive algorithm to estimate the mmWave channel parameters that exploits the poor scattering nature of the channel is developed and a new hybrid analog/digital precoding algorithm is proposed that overcomes the hardware constraints on the analog-only beamforming, and approaches the performance of digital solutions.
Abstract: Millimeter wave (mmWave) cellular systems will enable gigabit-per-second data rates thanks to the large bandwidth available at mmWave frequencies. To realize sufficient link margin, mmWave systems will employ directional beamforming with large antenna arrays at both the transmitter and receiver. Due to the high cost and power consumption of gigasample mixed-signal devices, mmWave precoding will likely be divided among the analog and digital domains. The large number of antennas and the presence of analog beamforming requires the development of mmWave-specific channel estimation and precoding algorithms. This paper develops an adaptive algorithm to estimate the mmWave channel parameters that exploits the poor scattering nature of the channel. To enable the efficient operation of this algorithm, a novel hierarchical multi-resolution codebook is designed to construct training beamforming vectors with different beamwidths. For single-path channels, an upper bound on the estimation error probability using the proposed algorithm is derived, and some insights into the efficient allocation of the training power among the adaptive stages of the algorithm are obtained. The adaptive channel estimation algorithm is then extended to the multi-path case relying on the sparse nature of the channel. Using the estimated channel, this paper proposes a new hybrid analog/digital precoding algorithm that overcomes the hardware constraints on the analog-only beamforming, and approaches the performance of digital solutions. Simulation results show that the proposed low-complexity channel estimation algorithm achieves comparable precoding gains compared to exhaustive channel training algorithms. The results illustrate that the proposed channel estimation and precoding algorithms can approach the coverage probability achieved by perfect channel knowledge even in the presence of interference.
2,424 citations
TL;DR: A survey of formation control of multi-agent systems focuses on the sensing capability and the interaction topology of agents, and categorizes the existing results into position-, displacement-, and distance-based control.
1,751 citations
25 Oct 2010
TL;DR: It is shown that accounting for cross-modal correlations and semantic abstraction both improve retrieval accuracy and are shown to outperform state-of-the-art image retrieval systems on a unimodal retrieval task.
Abstract: The problem of joint modeling the text and image components of multimedia documents is studied. The text component is represented as a sample from a hidden topic model, learned with latent Dirichlet allocation, and images are represented as bags of visual (SIFT) features. Two hypotheses are investigated: that 1) there is a benefit to explicitly modeling correlations between the two components, and 2) this modeling is more effective in feature spaces with higher levels of abstraction. Correlations between the two components are learned with canonical correlation analysis. Abstraction is achieved by representing text and images at a more general, semantic level. The two hypotheses are studied in the context of the task of cross-modal document retrieval. This includes retrieving the text that most closely matches a query image, or retrieving the images that most closely match a query text. It is shown that accounting for cross-modal correlations and semantic abstraction both improve retrieval accuracy. The cross-modal model is also shown to outperform state-of-the-art image retrieval systems on a unimodal retrieval task.
1,284 citations
Cites background from "Matrix Analysis for Scientists and ..."
...GEVs can be solved as efficiently as regular eigenvalue problems [15]....
[...]
TL;DR: An adaptive diffusion mechanism to optimize global cost functions in a distributed manner over a network of nodes, which endow networks with adaptation abilities that enable the individual nodes to continue learning even when the cost function changes with time.
Abstract: We propose an adaptive diffusion mechanism to optimize global cost functions in a distributed manner over a network of nodes. The cost function is assumed to consist of a collection of individual components. Diffusion adaptation allows the nodes to cooperate and diffuse information in real-time; it also helps alleviate the effects of stochastic gradient noise and measurement noise through a continuous learning process. We analyze the mean-square-error performance of the algorithm in some detail, including its transient and steady-state behavior. We also apply the diffusion algorithm to two problems: distributed estimation with sparse parameters and distributed localization. Compared to well-studied incremental methods, diffusion methods do not require the use of a cyclic path over the nodes and are robust to node and link failure. Diffusion methods also endow networks with adaptation abilities that enable the individual nodes to continue learning even when the cost function changes with time. Examples involving such dynamic cost functions with moving targets are common in the context of biological networks.
672 citations
TL;DR: A class of second order approximations, called the weighted and shifted Grunwald difference (WSGD) operators, are proposed for Riemann-Liouville fractional derivatives, with their effective applications to numerically solving space fractional diffusion equations in one and two dimensions.
Abstract: A class of second order approximations, called the weighted and shifted Grunwald difference (WSGD) operators, are proposed for Riemann-Liouville fractional derivatives, with their effective applications to numerically solving space fractional diffusion equations in one and two dimensions. The stability and convergence of our difference schemes for space fractional diffusion equations with constant coefficients in one and two dimensions are theoretically established. Several numerical examples are implemented to test the efficiency of the numerical schemes and confirm the convergence order, and the numerical results for variable coefficients problem are also presented.
546 citations