Numerical Methods for Computing Angles Between Linear Subspaces
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A two-directional Arnoldi process and its application to parametric model order reduction
- A block QR algorithm for partitioning stiff differential systems
- Optimally robust redundancy relations for failure detection in uncertain systems
- Generalizations of the projection method with applications to SOR theory for Hermitian positive semidefinite linear systems
- Canonical correlations and generalized SVD: Applications and new algorithms
- Test procedures and test problems for least squares algorithms
- Multi-time-scale analysis of a power system
- Near insensitivity of linear feedback systems
- A pointwise criterion for controller robustness
- Feedback stability under simultaneous gap metric uncertainties in plant and controller
- On principal angles between subspaces in \(\mathbb{R}^n\)
- On the structure and geometry of the product singular value decomposition
- An iterative method for solving partitioned linear equations
- Angle-based joint and individual variation explained
- Perturbation analysis of the canonical subspaces
- History and generality of the CS decomposition
- Maximizing bilinear forms subject to linear constraints
- Perturbation analysis of the canonical correlations of matrix pairs
- Error analysis of signal zeros: A projected companion matrix approach
- Subspace angles between ARMA models
- A general framework for association analysis of heterogeneous data
- A combination of the fast multipole boundary element method and Krylov subspace recycling solvers
- Convergence of integration-based methods for the solution of standard and generalized Hermitian eigenvalue problems
- Fast computation of robust subspace estimators
- Supervised multiway factorization
- Layout of random circulant graphs
- Subspace algorithms for the stochastic identification problem
- Class visualization of high-dimensional data with applications.
- Numerically stable cointegration analysis
- Anisotropic finite elements for the Stokes problem: a posteriori error estimator and adaptive mesh
- Sensitivity integrals for multivariable discrete-time systems
- A geometrical approach to finding multivariate approximate LCMs and GCDs
- A spectrum slicing method for the Kohn-Sham problem
- A randomized exponential canonical correlation analysis method for data analysis and dimensionality reduction
- Local improvements to reduced-order approximations of optimal control problems governed by diffusion-convection-reaction equation
- The Grassmannian of affine subspaces
- Constructing subspace packings from other packings
- On a minimum enclosing ball of a collection of linear subspaces
- 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
- Riemannian optimization with a preconditioning scheme on the generalized Stiefel manifold
- 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
- Manifold approximation by moving least-squares projection (MMLS)
- Counting collisions in an \(N\)-billiard system using angles between collision subspaces
- The spectral properties of Vandermonde matrices with clustered nodes
- Blade products and angles between subspaces
- Discriminative extended canonical correlation analysis for pattern set matching
- On relationships between two linear subspaces and two orthogonal projectors
- More robust Chebyshev filtering for SCF iteration, with applications in real-space DFT
- Implicit manifold reconstruction
- Temporal localized nonlinear model reduction with a priori error estimate
- A flag representation for finite collections of subspaces of mixed dimensions
- 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
- Latent models for cross-covariance
- Exploring the common principal subspace of deep features in neural networks
- Angles between subspaces and nearly optimal approximation in GFEM
- New lower bounds on the minimum singular value of a matrix
- The average condition number of most tensor rank decomposition problems is infinite
- A canonical CS representation of a pair of subspaces
- Schubert varieties and distances between subspaces of different dimensions
- Clustered matrix approximation
- Critical angles between two convex cones. I: General theory
- Dimension reduction and construction of feature space for image pattern recognition
- Rayleigh-Ritz majorization error bounds of mixed type
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces
- D-CCA: A Decomposition-Based Canonical Correlation Analysis for High-Dimensional Datasets
- The FastHCS algorithm for robust PCA
- Geometry in Canonical Correlations
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
- The max-length-vector line of best fit to a set of vector subspaces and an optimization problem over a set of hyperellipsoids.
- Plant directionality, coupling and multivariable loop-shaping
- Subspaces, angles and pairs of orthogonal projections
- Grassmannian spectral shooting
- A realization approach to stochastic model reduction
- Eigenvalues of the difference and product of projections
- A graphical procedure for comparing the principal components of several covariance matrices
- A fast recursive orthogonalization scheme for the Macaulay matrix
- Simultaneous multidiagonalization for the CS decomposition
- A novel partitioning method for accelerating the block Cimmino algorithm
- Bounds for fidelity of semiclassical Lagrangian states in Kähler quantization
- Randomized subspace iteration: analysis of canonical angles and unitarily invariant norms
- Numerical algorithms on the affine Grassmannian
- Generalized inverses of matrices: a perspective of the work of Penrose
- Generalized probabilistic principal component analysis of correlated data
- Sharper bounds for regularized data fitting
- Twice is enough for dangerous eigenvalues
- Discrete Poincaré Duality Angles as Shape Signatures on Simplicial Surfaces with Boundary
- scientific article; zbMATH DE number 7307477 (Why is no real title available?)
- Slowness as a proxy for temporal predictability: an empirical comparison
- Data-driven control: a behavioral approach
- Low-rank solution methods for stochastic eigenvalue problems
- Partitioning strategies for the block Cimmino algorithm
- Inexact rotated block triangular preconditioners for a class of block two-by-two matrices
- Strongly damped quadratic matrix polynomials
- Flag manifolds for the characterization of geometric structure in large data sets
- On geometrical properties of preconditioners in IPMs for classes of block-angular problems
- Variable selection in linear regression: several approaches based on normalized maximum likelihood
This page was built for publication: Numerical Methods for Computing Angles Between Linear Subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4768555)
