Numerical Methods for Computing Angles Between Linear Subspaces
From MaRDI portal
Publication:4768555
DOI10.2307/2005662zbMath0282.65031OpenAlexW3030910590WikidataQ57319027 ScholiaQ57319027MaRDI QIDQ4768555
Publication date: 1973
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2005662
Software, source code, etc. for problems pertaining to statistics (62-04) Measures of association (correlation, canonical correlation, etc.) (62H20) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items
Class visualization of high-dimensional data with applications. ⋮ Numerically stable cointegration analysis ⋮ Optimally robust redundancy relations for failure detection in uncertain systems ⋮ Temporal localized nonlinear model reduction with a priori error estimate ⋮ Anisotropic finite elements for the Stokes problem: a posteriori error estimator and adaptive mesh ⋮ A general framework for association analysis of heterogeneous data ⋮ Critical angles between two convex cones. I: General theory ⋮ History and generality of the CS decomposition ⋮ Maximizing bilinear forms subject to linear constraints ⋮ Perturbation analysis of the canonical correlations of matrix pairs ⋮ Dimension reduction and construction of feature space for image pattern recognition ⋮ Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit ⋮ CDPA: common and distinctive pattern analysis between high-dimensional datasets ⋮ Physics-informed cluster analysis and a priori efficiency criterion for the construction of local reduced-order bases ⋮ Generalizations of the projection method with applications to SOR theory for Hermitian positive semidefinite linear systems ⋮ The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces ⋮ Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces ⋮ A gentle guide to the basics of two projections theory ⋮ Eigenvalues of the difference and product of projections ⋮ Sensitivity integrals for multivariable discrete-time systems ⋮ Dimensionality reduction and volume minimization -- generalization of the determinant minimization criterion for reduced rank regression problems ⋮ The max‐length‐vector line of best fit to a set of vector subspaces and an optimization problem over a set of hyperellipsoids ⋮ Synthesis of multi-qudit hybrid and \(d\)-valued quantum logic circuits by decomposition ⋮ The many proofs of an identity on the norm of oblique projections ⋮ The FastHCS algorithm for robust PCA ⋮ A combination of the fast multipole boundary element method and Krylov subspace recycling solvers ⋮ Plant directionality, coupling and multivariable loop-shaping ⋮ Convergence of integration-based methods for the solution of standard and generalized Hermitian eigenvalue problems ⋮ A graphical procedure for comparing the principal components of several covariance matrices ⋮ Canonical correlations and generalized SVD: Applications and new algorithms ⋮ Boosted manifold principal angles for image set-based recognition ⋮ Test procedures and test problems for least squares algorithms ⋮ Exploring the common principal subspace of deep features in neural networks ⋮ A fast recursive orthogonalization scheme for the Macaulay matrix ⋮ Simultaneous multidiagonalization for the CS decomposition ⋮ Some geometric interpretations of quantum fidelity ⋮ Multi-time-scale analysis of a power system ⋮ Subspaces, angles and pairs of orthogonal projections ⋮ Angles between subspaces and nearly optimal approximation in GFEM ⋮ Error analysis of signal zeros: A projected companion matrix approach ⋮ Rayleigh--Ritz Majorization Error Bounds of Mixed Type ⋮ Model-driven domain adaptation on product manifolds for unconstrained face recognition ⋮ A geometrical approach to finding multivariate approximate LCMs and GCDs ⋮ A spectrum slicing method for the Kohn-Sham problem ⋮ New lower bounds on the minimum singular value of a matrix ⋮ The average condition number of most tensor rank decomposition problems is infinite ⋮ Determinant efficiencies in ill-conditioned models ⋮ Manifold approximation by moving least-squares projection (MMLS) ⋮ Counting collisions in an \(N\)-billiard system using angles between collision subspaces ⋮ Personal report : Gene Howard Golub, 1932--2007 ⋮ Near insensitivity of linear feedback systems ⋮ A flag representation for finite collections of subspaces of mixed dimensions ⋮ Fast computation of robust subspace estimators ⋮ The spectral properties of Vandermonde matrices with clustered nodes ⋮ Updating the principal angle decomposition ⋮ A pointwise criterion for controller robustness ⋮ Feedback stability under simultaneous gap metric uncertainties in plant and controller ⋮ D-CCA: A Decomposition-Based Canonical Correlation Analysis for High-Dimensional Datasets ⋮ On principal angles between subspaces in \(\mathbb{R}^n\) ⋮ On the structure and geometry of the product singular value decomposition ⋮ Blade products and angles between subspaces ⋮ Supervised multiway factorization ⋮ Data-driven control: a behavioral approach ⋮ A randomized exponential canonical correlation analysis method for data analysis and dimensionality reduction ⋮ Partitioning strategies for the block Cimmino algorithm ⋮ Inexact rotated block triangular preconditioners for a class of block two-by-two matrices ⋮ Discriminative extended canonical correlation analysis for pattern set matching ⋮ Thermal and reflectance based personal identification methodology under variable illumination ⋮ Local improvements to reduced-order approximations of optimal control problems governed by diffusion-convection-reaction equation ⋮ Grassmannian spectral shooting ⋮ Variable selection in linear regression: several approaches based on normalized maximum likelihood ⋮ An iterative method for solving partitioned linear equations ⋮ The Grassmannian of affine subspaces ⋮ Constructing subspace packings from other packings ⋮ On a minimum enclosing ball of a collection of linear subspaces ⋮ Reduced-order fluid/structure modeling of a complete aircraft configuration ⋮ Angle-based joint and individual variation explained ⋮ Layout of random circulant graphs ⋮ Structuring data with block term decomposition: decomposition of joint tensors and variational block term decomposition as a parametrized mixture distribution model ⋮ Minimal rank completions for overlapping blocks ⋮ A Canonical CS Representation of a Pair of Subspaces ⋮ Subspace algorithms for the stochastic identification problem ⋮ A two-directional Arnoldi process and its application to parametric model order reduction ⋮ On relationships between two linear subspaces and two orthogonal projectors ⋮ Convergence of algorithms of decomposition type for the eigenvalue problem ⋮ Schubert Varieties and Distances between Subspaces of Different Dimensions ⋮ Block-iterative methods for consistent and inconsistent linear equations ⋮ More robust Chebyshev filtering for SCF iteration, with applications in real-space DFT ⋮ Clustered Matrix Approximation ⋮ Implicit manifold reconstruction ⋮ Rigorous restricted isometry property of low-dimensional subspaces ⋮ On the rate of convergence of the alternating projection method in finite dimensional spaces ⋮ Acceleration of the generalized global basis (GGB) method for nonlinear problems ⋮ Geometry in Canonical Correlations ⋮ A block QR algorithm for partitioning stiff differential systems ⋮ Perturbation analysis of the canonical subspaces ⋮ Latent models for cross-covariance ⋮ Subspace angles between ARMA models ⋮ Riemannian optimization with a preconditioning scheme on the generalized Stiefel manifold ⋮ A realization approach to stochastic model reduction ⋮ A Novel Partitioning Method for Accelerating the Block Cimmino Algorithm ⋮ Unnamed Item ⋮ Sharper Bounds for Regularized Data Fitting ⋮ Bounds for fidelity of semiclassical Lagrangian states in Kähler quantization ⋮ On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems ⋮ Model Reduction for Nonlinear Systems by Balanced Truncation of State and Gradient Covariance ⋮ A new method to interpolate POD reduced bases–Application to the parametric model order reduction of a gas bearings supported rotor ⋮ Analysis of joint shape variation from multi-object complexes ⋮ Row Replicated Block Cimmino ⋮ Development and analysis of massive parallelization of a lattice basis reduction algorithm ⋮ Comparing the methods of alternating and simultaneous projections for two subspaces ⋮ Eigenvalue bounds for saddle-point systems with singular leading blocks ⋮ A geometric approach to linear cryptanalysis ⋮ On the optimality of the Oja's algorithm for online PCA ⋮ Randomized Subspace Iteration: Analysis of Canonical Angles and Unitarily Invariant Norms ⋮ Numerical Algorithms on the Affine Grassmannian ⋮ Discrete Poincaré Duality Angles as Shape Signatures on Simplicial Surfaces with Boundary ⋮ Generalized low rank approximations of matrices ⋮ Slowness as a Proxy for Temporal Predictability: An Empirical Comparison ⋮ Generalized low rank approximations of matrices ⋮ Low-Rank Solution Methods for Stochastic Eigenvalue Problems ⋮ Generalized inverses of matrices: a perspective of the work of Penrose ⋮ Unnamed Item ⋮ Strongly Damped Quadratic Matrix Polynomials ⋮ $\mathcal{H}_2$-Optimal Model Reduction Using Projected Nonlinear Least Squares ⋮ Isoclinic subspaces and quantum error correction ⋮ Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition ⋮ Flag Manifolds for the Characterization of Geometric Structure in Large Data Sets ⋮ Twice Is Enough for Dangerous Eigenvalues
This page was built for publication: Numerical Methods for Computing Angles Between Linear Subspaces
