The Rotation of Eigenvectors by a Perturbation. III
From MaRDI portal
Publication:5595481
DOI10.1137/0707001zbMath0198.47201OpenAlexW1970377488MaRDI QIDQ5595481
Publication date: 1970
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0707001
Related Items
Heteroskedastic PCA: algorithm, optimality, and applications, On the non-asymptotic concentration of heteroskedastic Wishart-type matrix, Consistent fundamental matrix estimation in a quadratic measurement error model arising in motion analysis, A modified Gram--Schmidt-based downdating technique for ULV decompositions with applications to recursive TLS problems, Eigenvalues of stochastic blockmodel graphs and random graphs with low-rank edge probability matrices, A self-consistent-field iteration for MAXBET with an application to multi-view feature extraction, Cluster robust error estimates for the Rayleigh-Ritz approximation. I: Estimates for invariant subspaces, Non-asymptotic properties of spectral decomposition of large Gram-type matrices and applications, Semiparametric estimation of fractional cointegrating subspaces, Componentwise perturbation analysis for the generalized Schur decomposition, Applications of CS decomposition in linear combinations of two orthogonal projectors, Smoothed analysis for tensor methods in unsupervised learning, Effects on the eigenstructure of a data matrix when deleting an observation, An algorithm for computing Jordan chains and inverting analytic matrix functions, An extension of the angular synchronization problem to the heterogeneous setting, The uncovering of hidden structures by latent semantic analysis, Experiences with a method for enclosing solutions of systems of equations, Bayesian factor-adjusted sparse regression, Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods, Filament plots for data visualization, On some bounds on the perturbation of invariant subspaces of normal matrices with application to a graph connection problem, Robust linear classification from limited training data, Asymmetry helps: eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices, The spectral spread of Hermitian matrices, Fully computable a posteriori error bounds for eigenfunctions, General explicit descriptions for intertwining operators and direct rotations of two orthogonal projections, Verified inclusions for a nearest matrix of specified rank deficiency via a generalization of Wedin's \(\sin (\theta)\) theorem, Unique continuation and lifting of spectral band edges of Schrödinger operators on unbounded domains, Model reduction of state space systems via an implicitly restarted Lanczos method, Asymptotic quadratic convergence of the serial block-Jacobi EVD algorithm for Hermitian matrices, A sharp version of Kahan's theorem on clustered eigenvalues, Large covariance estimation through elliptical factor models, The a priori \(\tan \Theta\) theorem for spectral subspaces, Manifold curvature learning from hypersurface integral invariants, Schur reduction of trees and extremal entries of the Fiedler vector, Matrix means and a novel high-dimensional shrinkage phenomenon, Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering, Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution, Fundamental limits of weak recovery with applications to phase retrieval, Central limit theorems for classical multidimensional scaling, Entrywise eigenvector analysis of random matrices with low expected rank, Graph convolutional neural networks via scattering, The \(\operatorname{Tan}2\Theta \) theorem for indefinite quadratic forms, Estimation of high-dimensional change-points under a group sparsity structure, Mysteries around the graph Laplacian eigenvalue 4, Robust dimension reduction using sliced inverse median regression, Sparse PCA: optimal rates and adaptive estimation, A similarity measure for second order properties of non-stationary functional time series with applications to clustering and testing, On eigenvalue perturbation bounds for Hermitian block tridiagonal matrices, Identifying latent group structures in nonlinear panels, Panel threshold models with interactive fixed effects, On boundary detection, Spectral radii of sparse random matrices, Optimal perturbation bounds for the Hermitian eigenvalue problem, Absolute and relative perturbation bounds for invariant subspaces of matrices, Relative perturbation theory for hyperbolic eigenvalue problem, Normal approximation and confidence region of singular subspaces, The mathematics of Chandler Davis, An efficient algorithm for rank and subspace tracking, A note on an upper and a lower bound on sines between eigenspaces for regular Hermitian matrix pairs, A rank test for the number of factors with high-frequency data, Subspace tracking in low-rank real-time systems, Optimal paths for symmetric actions in the unitary group, Multiplicative perturbation bounds for weighted polar decomposition, Relative perturbation theory for quadratic Hermitian eigenvalue problems, A note on the perturbation bounds of eigenspaces for Hermitian matrices, On Ritz approximations for positive definite operators. I: Theory, Phase retrieval from local measurements: improved robustness via eigenvector-based angular synchronization, Rank-one multi-reference factor analysis, On an eigenvector-dependent nonlinear eigenvalue problem from the perspective of relative perturbation theory, On convergence to eigenvalues and eigenvectors in the block-Jacobi EVD algorithm with dynamic ordering, Recovering the structure of random linear graphs, Layout of random circulant graphs, Minimal curves in \(\mathcal{U}(n)\) and \(\mathcal{G}l(n)^+\) with respect to the spectral and the trace norms, Robust high-dimensional factor models with applications to statistical machine learning, Principal component analysis in the local differential privacy model, On the \(\ell^\infty\)-norms of the singular vectors of arbitrary powers of a difference matrix with applications to sigma-delta quantization, Perturbation expansions and error bounds for the truncated singular value decomposition, Robust covariance and scatter matrix estimation under Huber's contamination model, Perturbation analysis of an eigenvector-dependent nonlinear eigenvalue problem with applications, Convergence of the Rayleigh-Ritz method for eigenvalue problems., Testing and estimating change-points in the covariance matrix of a high-dimensional time series, Accuracy of approximate projection to the semidefinite cone, Spectral method and regularized MLE are both optimal for top-\(K\) ranking, Solvability of the operator Riccati equation in the Feshbach case, Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues, Spectral clustering revisited: information hidden in the Fiedler vector, On the Bures-Wasserstein distance between positive definite matrices, The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics, Random graph asymptotics for treatment effect estimation under network interference, An \({\ell_p}\) theory of PCA and spectral clustering, High order approximations of the operator Lyapunov equation have low rank, Optimal estimation and rank detection for sparse spiked covariance matrices, A note on unifying absolute and relative perturbation bounds, Relative perturbation theory for hyperbolic singular value problem, Highly accurate symmetric eigenvalue decomposition and hyperbolic SVD, Regression based thresholds in principal loading analysis, Rate-optimal posterior contraction for sparse PCA, A \(\sin 2\varTheta\) theorem for graded indefinite Hermitian matrices, On a minimax principle in spectral gaps, Backward perturbation analysis of certain characteristic subspaces, A Schatten-\(q\) low-rank matrix perturbation analysis via perturbation projection error bound, Some new perturbation bounds of generalized polar decomposition, High-resolution signal recovery via generalized sampling and functional principal component analysis, A survey of Chandler Davis, History and generality of the CS decomposition, Analyzing specific cases of an operator inequality, Alternative proof of the a priori \(\tan \theta\) theorem, Relative eigenvalues of Hermitian matrices, On Kogbetliantz's SVD algorithm in the presence of clusters, A gentle guide to the basics of two projections theory, On eigenelements sensitivity for compact self-adjoint operators and applications, Perturbation of the SVD in the presence of small singular values, A note on the Davis-Kahan \(\sin\Theta\) theorem, On the systematic and idiosyncratic volatility with large panel high-frequency data, Stability and minimax optimality of tangential Delaunay complexes for manifold reconstruction, On the variation of the spectrum of a Hermitian matrix, On some perturbation inequalities for operators, On the angular metrics between linear subspaces, A refined variant of the inverse-free Krylov subspace method for symmetric generalized eigenvalue problems, Computable bounds for eigenvalues and eigenfunctions of elliptic differential operators, Sparse principal component analysis and iterative thresholding, On an estimate in the subspace perturbation problem, A spectral algorithm with additive clustering for the recovery of overlapping communities in networks, A subspace iteration algorithm for Fredholm valued functions, Universally consistent vertex classification for latent positions graphs, Simultaneous multiple change-point and factor analysis for high-dimensional time series, Sharpening the norm bound in the subspace perturbation theory, Using principal component analysis to estimate a high dimensional factor model with high-frequency data, Matrices \(A\) such that \(AA^\dagger-A^\dagger A\) are nonsingular, Methods and algorithms of solving spectral problems for polynomial and rational matrices, Maximization of the sum of the trace ratio on the Stiefel manifold. II: computation, Minimax estimation in sparse canonical correlation analysis, Characterizations of dominant and dominated solutions of linear recursions, Additive and multiplicative perturbation bounds for the Moore-Penrose inverse, Random perturbation of low rank matrices: improving classical bounds, Accuracy of singular vectors obtained by projection-based SVD methods, Perturbations of invariant subspaces of operators with Hilbert-Schmidt Hermitian components, Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time, The rotation of eigenspaces of perturbed matrix pairs, Computational methods of linear algebra, Canonical angles and limits of sequences of EP and co-EP matrices, Spectral algorithms for unique games, The perturbation bounds for eigenspaces of a definite matrix-pair, Notes on the \(\sin 2\Theta\) theorem, Residual bounds for some or all singular values, Eigenvalue perturbation bounds for Hermitian block tridiagonal matrices, On the perturbation bound in unitarily invariant norms for subunitary polar factors, Multiplicative perturbation bounds for spectral and singular value decompositions, Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer, Eigenvalues of Rayleigh quotient matrices, The tan \(\theta \) theorem with relaxed conditions, Algebraic properties of the rank-deficient equality-constrained and weighted least squares problems, A pointwise criterion for controller robustness, Feedback stability under simultaneous gap metric uncertainties in plant and controller, Convergence of the block Lanczos method for eigenvalue clusters, Residual bounds for unitarily invariant norms on clustered eigenvalues, Matrix pencils: Theory, applications, and numerical methods, Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics, Consistent estimation in an implicit quadratic measurement error model, Closing the gap in a subspace perturbation bound, Sufficient forecasting using factor models, Computing eigenvalue bounds for iterative subspace matrix methods, Relative perturbation bounds for weighted polar decomposition, Large faces in Poisson hyperplane mosaics, Updating of the Gaussian graphical model through targeted penalized estimation, Relative perturbation bounds for eigenpairs of diagonalizable matrices, Angles between infinite dimensional subspaces with applications to the Rayleigh-Ritz and alternating projectors methods, Geometric median and robust estimation in Banach spaces, Approximation of the eigenvectors of a positive compact operator and estimate of the error, Operator norm consistent estimation of large-dimensional sparse covariance matrices, Finite sample approximation results for principal component analysis: A matrix perturbation approach, Principal curvatures from the integral invariant viewpoint, Variations for the \(Q\)- and \(H\)-factors in the polar decomposition, On the Householder Fox algorithm for decomposing a projection, Community detection in sparse networks via Grothendieck's inequality, Using SVD for Topic Modeling, On perturbations of some constrained subspaces, Perturbation bounds for the definite generalized eigenvalue problem, Projected estimation for large-dimensional matrix factor models, An algorithm for computing the spectral structure of a singular linear matrix pencil, Computing the complete CS decomposition, Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices, Spectral inclusion for unbounded block operator matrices, Relative perturbation results for eigenvalues and eigenvectors of diagonalisable matrices, The numerically stable reconstruction of Jacobi matrices from spectral data, An efficient rank detection procedure for modifying the ULV decomposition, Relative perturbation theory. IV: \(\sin 2\theta\) theorems, Rajendra Bhatia and his mathematical achievements, Moment bounds for large autocovariance matrices under dependence, Perturbation bounds for the linear least squares problem subject to linear inequality constraints, Computing the CS decomposition of a partitioned orthonormal matrix, Characterization of similarities between two n-frames of projectors, Perturbation of spectral subspaces and solution of linear operator equations, Eigenvalue computation in the 20th century, An overview of relative \(\sin\Theta\) theorems for invariant subspaces of complex matrices, Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian, Computing the CS and the generalized singular value decompositions, The generalized singular value decomposition and the general (A-\(\lambda\) B)-problem, The general linear model of the generalized singular value decomposition, Unnamed Item, Properties of a representation of a basis for the null space, The Rectifiable Metric on the Set of Closed Subspaces of Hilbert Space, Adaptive Geometric Multiscale Approximations for Intrinsically Low-dimensional Data, Some new bounds on perturbation of subspaces, A special irreducible matrix representation of the real Clifford algebra C(3,1), Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors, Self-calibration and biconvex compressive sensing, Bounds on the spectral sparsification of symmetric and off-diagonal nonnegative real matrices, Unnamed Item, Unnamed Item, New additive perturbation bounds of the Moore-Penrose inverse, Spectral condition numbers for defective elements of linear operators in hilbert spaces, Unifying the treatment of indefinite and semidefinite perturbations in the subspace perturbation problem, Reduction of round-off errors in chemical kinetics, Unnamed Item, Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method, The Lanczos Algorithm with Selective Orthogonalization, A Note on Perturbation Estimates for Invariant Subspaces of Hessenberg Matrices, Graph Coloring Using Eigenvalue Decomposition, Convergence to Singular Triplets in the Two-Sided Block-Jacobi SVD Algorithm with Dynamic Ordering, A Theory of Quantum Subspace Diagonalization, Find Your Place: Simple Distributed Algorithms for Community Detection, Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier, Greedy Approaches to Symmetric Orthogonal Tensor Decomposition, Subspaces, angles and pairs of orthogonal projections, Rayleigh--Ritz Majorization Error Bounds of Mixed Type, Unnamed Item, Unnamed Item, Majorization Bounds for Ritz Values of Self-Adjoint Matrices, A Simple SVD Algorithm for Finding Hidden Partitions, Consistency and convergence rate for nearest subspace classifier, High Dimensional Change Point Estimation via Sparse Projection, Diagonalization of indefinite saddle point forms, Computing Invariant Subspaces of a General Matrix when the Eigensystem is Poorly Conditioned, New estimates for Ritz vectors, Desingularization of Bounded-Rank Matrix Sets, Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems, On perturbations of matrix pencils with real spectra. II, Sensitivity analysis of the Lanczos reduction, Sketching for Principal Component Regression, Operator Stieltjes integrals with respect to a spectral measure and solutions of some operator equations, Singular vectors under random perturbation, Rotations of occupied invariant subspaces in self-consistent field calculations, Solving Jigsaw Puzzles by the Graph Connection Laplacian, The Five Trolls Under the Bridge: Principal Component Analysis With Asynchronous and Noisy High Frequency Data, Low-Rank Matrix Iteration Using Polynomial-Filtered Subspace Extraction, Uniform Bounds for Invariant Subspace Perturbations, An invariant subspace‐based approach to the random eigenvalue problem of systems with clustered spectrum, Near-Optimal Bounds for Phase Synchronization, Componentwise Perturbation Analysis of the Schur Decomposition of a Matrix, Eigenvectors of Orthogonally Decomposable Functions, Perturbation theory of output feedback pole assignment, Singular Value Decomposition Approximation via Kronecker Summations for Imaging Applications, A twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix, Modifiable low-rank approximation to a matrix, A generalization of the Bott-Duffin inverse and its applications, Unnamed Item, Unnamed Item, Posterior consistency of semi-supervised regression on graphs, Unnamed Item, A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs, On Perturbations of Matrix Pencils with Real Spectra, Submatrix localization via message passing, An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation, Statistical inference on random dot product graphs: a survey, A note on generating finer‐grain parallelism in a representation tree, Perturbation bounds for weighted polar decomposition in the weighted unitarily invariant norm, On the almost rank deficient case of the least squares problem, A Sharp Estimate in an Operator Inequality, Matrix pencil characterization of almost ( A, Z) -invariant subspaces : A classification of geometric concepts, An algorithm for rank estimation and subspace tracking, On a subspace perturbation problem, Recovering a hidden community beyond the Kesten–Stigum threshold in O(|E|log*|V|) time, On an Eigenvector-Dependent Nonlinear Eigenvalue Problem, Structural Variability from Noisy Tomographic Projections, ECA: High-Dimensional Elliptical Component Analysis in Non-Gaussian Distributions, The Sup-norm Perturbation of HOSVD and Low Rank Tensor Denoising, Sharp error bounds for Ritz vectors and approximate singular vectors, Perturbation bounds for eigenspaces under a relative gap condition, Subspace Acceleration for Large-Scale Parameter-Dependent Hermitian Eigenproblems, A note on harmonic Ritz values and their reciprocals, Synchronization of Heterogeneous Oscillators Under Network Modifications: Perturbation and Optimization of the Synchrony Alignment Function, Krylov-Subspace Recycling via the POD-Augmented Conjugate-Gradient Method, Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness, Asymptotic Quadratic Convergence of the Two-Sided Serial and Parallel Block-Jacobi SVD Algorithm, A Well-Tempered Landscape for Non-convex Robust Subspace Recovery, Unnamed Item, PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming, Error Bounds for Dynamical Spectral Estimation, A Performance Guarantee for Spectral Clustering, Low-Rank Matrix Approximations Do Not Need a Singular Value Gap, Perturbation of spectra and spectral subspaces, Singular Vector Perturbation Under Gaussian Noise, Unnamed Item, Absolute Variation of Ritz Values, Principal Angles, and Spectral Spread, The Effect of the Perturbation of Hermitian Matrices on their Eigenvectors, Multilinear Compressive Sensing and an Application to Convolutional Linear Networks, Graph Powering and Spectral Robustness, Blind Identification of Stochastic Block Models from Dynamical Observations, Modeling High-Dimensional Time Series: A Factor Model With Dynamically Dependent Factors and Diverging Eigenvalues, On the Cartan decomposition for classical random matrix ensembles, Optimal estimation of high-dimensional Gaussian location mixtures, Overcoming the timescale barrier in molecular dynamics: Transfer operators, variational principles and machine learning, Maximum spread of graphs and bipartite graphs, The tan Θ theorem for definite matrix pairs, Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches, On the efficacy of higher-order spectral clustering under weighted stochastic block models, Optimal Estimation of the Number of Network Communities, Perturbation upper bounds for singular subspaces with a kind of heteroskedastic noise and its application in clustering, Perturbation bounds in connection with singular value decomposition, Fifty Three Matrix Factorizations: A Systematic Approach, Pattern Formation in Random Networks Using Graphons, Distributed Estimation for Principal Component Analysis: An Enlarged Eigenspace Analysis, Sparse constrained projection approximation subspace tracking, 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, Cutoff for the averaging process on the hypercube and complete bipartite graphs, Operator shifting for noisy elliptic systems, A fast randomized algorithm for computing an approximate null space, A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization, Euclidean Representation of Low-Rank Matrices and Its Geometric Properties, Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method, Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals, Acceleration of iterative refinement for singular value decomposition, Affine invariant integrated rank-weighted statistical depth: properties and finite sample analysis, Graph Limits and Spectral Extremal Problems for Graphs, Asymptotic estimations of a perturbed symmetric eigenproblem, Perturbation theory for pseudo-inverses, The method of conjugate gradients used in inverse iteration, Perturbation of invariant subspaces, Partitioning Well-Clustered Graphs: Spectral Clustering Works!, Block classical Gram–Schmidt-based block updating in low-rank matrix approximation, Large Covariance Estimation by Thresholding Principal Orthogonal Complements, Angles, triangle inequalities, correlation matrices and metric-preserving and subadditive functions, Estimating structured high-dimensional covariance and precision matrices: optimal rates and adaptive estimation, An Eigenvalue-Based Method for the Unbalanced Procrustes Problem, Networked Robust Stability for LTV Systems with Simultaneous Uncertainties in Plant, Controller, and Communication Channels, Sharp Estimation of Convergence Rate for Self-Consistent Field Iteration to Solve Eigenvector-Dependent Nonlinear Eigenvalue Problems
