Matrix Analysis and Applied Linear Algebra

By Carl Dean Meyer. 2000

5,654 citations recorded by the source corpus.

Subfields: Applied Mathematics, Computational Theory and Mathematics, Geometry and Topology

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Applied Mathematics

In Computational Theory and Mathematics

In Geometry and Topology

Citations in the corpus

Training Networks in Null Space of Feature Covariance for Continual Learning (2021, methodology): “X − Thus we can get the parameter update ∆ w lt,s lying in the null space of ¯ lt 1 by with U l 2 ( U l 2 ) (cid:62) as projection operator [35, Eqn.”
Unsupervised Learning Methods for Molecular Simulation Data (2021, background): “Under these conditions, the time-covariance matrix C 0 τ is symmetric (for T → ∞ ), 311 and as a consequence, the eigenvalues in eq 44 are real valued.”
PageRank beyond the Web (2014, background): “Because P is stochastic, it’s eigenvalues on the unit circle are all semi-simple [Meyer, 2000, page 696].”
Axioms for Centrality (2013, background): “This is also true under the much more general condition that the dominant eigenvalue of A is semisimple [37], but in that case the limit is a specific dominant eigenvector that depends on the preference vector v.”
Blind Channel Estimation for MIMO-OFDM Systems (2007, methodology): “N ] ⊗ IMr)H )= rank(H(w i)) = Mt ≤ rank(H) ≤ Mt [ 65 ], which means that H has a full column rank.”
Monge's Optimal Transport Distance for Image Classification (2016, neutral): “In this case, by the rank-nullity theorem [21], we know that kernel of this system is just a single vector and so the solution is orthogonal to just this single vector.”
The successive projections algorithm (2013, neutral): “, [84] for a demonstration).”
Optimal sensor placement and motion coordination for target tracking (2006, background): “Recall the notion and properties of circulant matrices from [8].”