The Rotation of Eigenvectors by a Perturbation. III
From MaRDI portal
(Redirected from Publication:5595481)
Cited in
(only showing first 100 items - show all)- Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time
- Desingularization of bounded-rank matrix sets
- Closing the gap in a subspace perturbation bound
- An algorithm for rank estimation and subspace tracking
- A Schatten-q low-rank matrix perturbation analysis via perturbation projection error bound
- High-resolution signal recovery via generalized sampling and functional principal component analysis
- Solving jigsaw puzzles by the graph connection Laplacian
- Dynamic angular synchronization under smoothness constraints
- Robust dimension reduction using sliced inverse median regression
- Matrix pencils: Theory, applications, and numerical methods
- A note on unifying absolute and relative perturbation bounds
- Operator norm consistent estimation of large-dimensional sparse covariance matrices
- Perturbation of the SVD in the presence of small singular values
- A Sharp Unitarily Invariant Norm Bound for the Off-Diagonal Block Perturbation of a Hermitian Matrix
- Fast computation of error bounds for all eigenpairs of a Hermitian and all singular pairs of a rectangular matrix with emphasis on eigen- and singular value clusters
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
- Approximation of the eigenvectors of a positive compact operator and estimate of the error
- On the Householder Fox algorithm for decomposing a projection
- A refined shifted block inverse-free Krylov subspace method for symmetric generalized eigenvalue problems
- scientific article; zbMATH DE number 7626779 (Why is no real title available?)
- The numerically stable reconstruction of Jacobi matrices from spectral data
- Phase retrieval from local measurements: improved robustness via eigenvector-based angular synchronization
- Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer
- An efficient rank detection procedure for modifying the ULV decomposition
- A generalization of the Bott-Duffin inverse and its applications
- High order approximations of the operator Lyapunov equation have low rank
- Rotations of occupied invariant subspaces in self-consistent field calculations
- Item response theory -- a statistical framework for educational and psychological measurement
- Regression based thresholds in principal loading analysis
- Spectral clustering on aggregated multilayer networks with covariates
- Perturbation bounds for the definite generalized eigenvalue problem
- Universally consistent vertex classification for latent positions graphs
- On changepoint detection in functional data using empirical energy distance
- Relative perturbation results for eigenvalues and eigenvectors of diagonalisable matrices
- On the almost rank deficient case of the least squares problem
- Operator shifting for noisy elliptic systems
- A pointwise criterion for controller robustness
- Sparsification of the regularized magnetic Laplacian with multi-type spanning forests
- History and generality of the CS decomposition
- Large covariance estimation by thresholding principal orthogonal complements. With discussion and authors' reply
- Private low-rank approximation for covariance matrices, Dyson Brownian motion, and eigenvalue-gap bounds for Gaussian perturbations
- Some new bounds on perturbation of subspaces
- High dimensional change point estimation via sparse projection
- Absolute Variation of Ritz Values, Principal Angles, and Spectral Spread
- Error analysis of the Gram low-rank approximation (and why it is not as unstable as one may think)
- On the Bures-Wasserstein distance between positive definite matrices
- Rayleigh-Ritz majorization error bounds of mixed type
- Locally unitarily invariantizable NEPv and convergence analysis of SCF
- On an Eigenvector-Dependent Nonlinear Eigenvalue Problem
- Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues
- Optimal Network Membership Estimation under Severe Degree Heterogeneity
- Absolute and relative perturbation bounds for invariant subspaces of matrices
- Some new perturbation bounds of generalized polar decomposition
- Angles, triangle inequalities, correlation matrices and metric-preserving and subadditive functions
- Computing the CS and the generalized singular value decompositions
- An algorithm for computing the spectral structure of a singular linear matrix pencil
- Perturbation of invariant subspaces
- On boundary detection
- Spectral condition numbers for defective elements of linear operators in hilbert spaces
- Asymptotic limits of spiked eigenvalues and eigenvectors of signal-plus-noise matrices with weak signals and heteroskedastic noise
- Uniform error bound for PCA matrix denoising
- Clustering a mixture of Gaussians with unknown covariance
- An algorithm for computing Jordan chains and inverting analytic matrix functions
- An overview of relative \(\sin\Theta\) theorems for invariant subspaces of complex matrices
- The rotation of eigenspaces of perturbed matrix pairs
- Relative perturbation tan \(\Theta \)-theorems for definite matrix pairs
- A modified Gram--Schmidt-based downdating technique for ULV decompositions with applications to recursive TLS problems
- Statistical inference of constrained stochastic optimization via sketched sequential quadratic programming
- Computing the complete CS decomposition
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
- Spectral radii of sparse random matrices
- On eigenvalue perturbation bounds for Hermitian block tridiagonal matrices
- The Sup-norm Perturbation of HOSVD and Low Rank Tensor Denoising
- New additive perturbation bounds of the Moore-Penrose inverse
- Computing the CS decomposition of a partitioned orthonormal matrix
- Eigenvectors of Orthogonally Decomposable Functions
- A note on the perturbation bounds of eigenspaces for Hermitian matrices
- Reduction of round-off errors in chemical kinetics
- Structure-aware analyses and algorithms for interpolative decompositions
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Networked Robust Stability for LTV Systems with Simultaneous Uncertainties in Plant, Controller, and Communication Channels
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- Optimal paths for symmetric actions in the unitary group
- On some perturbation inequalities for operators
- Representation learning for dynamic graphs: a survey
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- The spectral spread of Hermitian matrices
- Synchronization of heterogeneous oscillators under network modifications: perturbation and optimization of the synchrony alignment function
- On Perturbations of Matrix Pencils with Real Spectra
- Cutoff for the averaging process on the hypercube and complete bipartite graphs
- Subspace acceleration for large-scale parameter-dependent Hermitian eigenproblems
- Asymptotic quadratic convergence of the two-sided serial and parallel block-Jacobi SVD algorithm
- Recovering a hidden community beyond the Kesten-Stigum threshold in \(O(| E|\log^\ast| V|)\) time
- A note on harmonic Ritz values and their reciprocals
- The \(\operatorname{Tan}2\Theta \) theorem for indefinite quadratic forms
- Eigenvalues of stochastic blockmodel graphs and random graphs with low-rank edge probability matrices
- A Sharp Estimate in an Operator Inequality
- Modeling and Learning on High-Dimensional Matrix-Variate Sequences
- Relative perturbation bounds for weighted polar decomposition
- Variations for the \(Q\)- and \(H\)-factors in the polar decomposition
This page was built for publication: The Rotation of Eigenvectors by a Perturbation. III
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5595481)