Pages that link to "Item:Q5565470"
From MaRDI portal
The following pages link to Some new bounds on perturbation of subspaces (Q5565470):
Displaying 31 items.
- Simultaneous multidiagonalization for the CS decomposition (Q398589) (← links)
- More power via graph-structured tests for differential expression of gene networks (Q439146) (← links)
- Schrieffer-Wolff transformation for quantum many-body systems (Q643674) (← links)
- On the angular metrics between linear subspaces (Q864565) (← links)
- Perturbations of invariant subspaces of operators with Hilbert-Schmidt Hermitian components (Q895804) (← links)
- Computing the complete CS decomposition (Q1014355) (← links)
- Perturbation of spectral subspaces and solution of linear operator equations (Q1053956) (← links)
- On the stability of some high-resolution beamforming methods (Q1061712) (← links)
- A perturbation bound for definite pencils (Q1208310) (← links)
- Relative perturbation results for eigenvalues and eigenvectors of diagonalisable matrices (Q1272876) (← links)
- A survey of Chandler Davis (Q1336391) (← links)
- History and generality of the CS decomposition (Q1336415) (← links)
- An overview of relative \(\sin\Theta\) theorems for invariant subspaces of complex matrices (Q1591179) (← links)
- Statistical inference for structured high-dimensional models. Abstracts from the workshop held March 11--17, 2018 (Q1731980) (← links)
- A note on unifying absolute and relative perturbation bounds (Q1855441) (← links)
- Absolute and relative perturbation bounds for invariant subspaces of matrices (Q1976907) (← links)
- Nonasymptotic upper bounds for the reconstruction error of PCA (Q2196210) (← links)
- Analysis of centrality measures under differential privacy models (Q2246027) (← links)
- The mathematics of Chandler Davis (Q2249485) (← links)
- Matrix completion with sparse measurement errors (Q2685993) (← links)
- Resolvents of operators on tensor products of Euclidean spaces (Q2805656) (← links)
- Krylov-subspace recycling via the POD-augmented conjugate-gradient method (Q2827063) (← links)
- Low-Rank Matrix Approximations Do Not Need a Singular Value Gap (Q3119542) (← links)
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863) (← links)
- A note on generating finer‐grain parallelism in a representation tree (Q4924936) (← links)
- The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Output (Q5146700) (← links)
- Accuracy of the Lanczos Process for the Eigenproblem and Solution of Equations (Q5203965) (← links)
- On the Cartan decomposition for classical random matrix ensembles (Q5883527) (← links)
- On Lipschitz analysis and Lipschitz synthesis for the phase retrieval problem (Q5965394) (← links)
- Fifty Three Matrix Factorizations: A Systematic Approach (Q6101119) (← links)
- Projective cluster-additive transformation for quantum lattice models (Q6596483) (← links)
