Numerical Methods for Computing Angles Between Linear Subspaces
From MaRDI portal
Cited in
(only showing first 100 items - show all)- On the optimality of the Oja's algorithm for online PCA
- The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces
- Optimally robust redundancy relations for failure detection in uncertain systems
- Exploring the common principal subspace of deep features in neural networks
- Clustered matrix approximation
- Flag manifolds for the characterization of geometric structure in large data sets
- Isoclinic subspaces and quantum error correction
- On the structure and geometry of the product singular value decomposition
- Generalized low rank approximations of matrices
- On relationships between two linear subspaces and two orthogonal projectors
- Strongly damped quadratic matrix polynomials
- Projection-based preprocessing for electrical impedance tomography to reduce the effect of electrode contacts
- Variable selection in additive models via hierarchical sparse penalty
- Angle between two complex lines
- On the rate of convergence of the alternating projection method in finite dimensional spaces
- Determinant efficiencies in ill-conditioned models
- Angles between subspaces and nearly optimal approximation in GFEM
- Personal report : Gene Howard Golub, 1932--2007
- Analysis of joint shape variation from multi-object complexes
- A block QR algorithm for partitioning stiff differential systems
- Space complexity of Euclidean clustering
- Generalized probabilistic principal component analysis of correlated data
- Information-theoretic and operational measures of quantum contextuality
- Riemannian optimization with a preconditioning scheme on the generalized Stiefel manifold
- D-CCA: A Decomposition-Based Canonical Correlation Analysis for High-Dimensional Datasets
- Schubert varieties and distances between subspaces of different dimensions
- Multi-time-scale analysis of a power system
- A realization approach to stochastic model reduction
- What do physics-informed DeepONets learn? Understanding and improving training for scientific computing applications
- Hermitian geometry of complex multivectors, determinants and orientations
- Near insensitivity of linear feedback systems
- \( \mathcal{H}_2\)-optimal model reduction using projected nonlinear least squares
- Subspaces, angles and pairs of orthogonal projections
- New lower bounds on the minimum singular value of a matrix
- Characterization of matrices satisfying the reverse order law for the Moore–Penrose pseudoinverse
- The max-length-vector line of best fit to a set of vector subspaces and an optimization problem over a set of hyperellipsoids.
- Sensitivity integrals for multivariable discrete-time systems
- Updating the principal angle decomposition
- The average condition number of most tensor rank decomposition problems is infinite
- How more data can hurt: instability and regularization in next-generation reservoir computing
- Mathematical and numerical assessment of data-driven identification method applied to nonlinear elasticity
- A graphical procedure for comparing the principal components of several covariance matrices
- Row Replicated Block Cimmino
- Generalized Knill-Laflamme theorem for families of isoclinic subspaces
- Data-driven control: a behavioral approach
- Supervised multiway factorization
- A geometrical approach to finding multivariate approximate LCMs and GCDs
- Slowness as a proxy for temporal predictability: an empirical comparison
- Test procedures and test problems for least squares algorithms
- Class visualization of high-dimensional data with applications.
- Partitioning strategies for the block Cimmino algorithm
- Acceleration of the generalized global basis (GGB) method for nonlinear problems
- Latent models for cross-covariance
- Convergence of algorithms of decomposition type for the eigenvalue problem
- Fixed-precision randomized low-rank approximation methods for nonlinear model order reduction of large systems
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- A geometric approach to linear cryptanalysis
- A spectrum slicing method for the Kohn-Sham problem
- A fast recursive orthogonalization scheme for the Macaulay matrix
- Simultaneous multidiagonalization for the CS decomposition
- Local improvements to reduced-order approximations of optimal control problems governed by diffusion-convection-reaction equation
- Fast computation of robust subspace estimators
- On principal angles between subspaces in \(\mathbb{R}^n\)
- Thermal and reflectance based personal identification methodology under variable illumination
- Riemannian-based neural network method for solving canonical correlation analysis
- Counting collisions in an \(N\)-billiard system using angles between collision subspaces
- Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
- Implicit manifold reconstruction
- Eigenvalues of the difference and product of projections
- A randomized exponential canonical correlation analysis method for data analysis and dimensionality reduction
- Manifold approximation by moving least-squares projection (MMLS)
- Development and analysis of massive parallelization of a lattice basis reduction algorithm
- A pointwise criterion for controller robustness
- Generalized low rank approximations of matrices
- History and generality of the CS decomposition
- Rayleigh-Ritz majorization error bounds of mixed type
- Inexact rotated block triangular preconditioners for a class of block two-by-two matrices
- Geometry in Canonical Correlations
- scientific article; zbMATH DE number 7307477 (Why is no real title available?)
- Low-rank solution methods for stochastic eigenvalue problems
- Estimation of local geometric structure on manifolds from noisy data
- A random matrix approach to low-multilinear-rank tensor approximation
- Comparing the methods of alternating and simultaneous projections for two subspaces
- Critical angles between two convex cones. I: General theory
- Anisotropic finite elements for the Stokes problem: a posteriori error estimator and adaptive mesh
- Variable selection in linear regression: several approaches based on normalized maximum likelihood
- Numerically stable cointegration analysis
- A general framework for association analysis of heterogeneous data
- Grassmannian spectral shooting
- Reduced-order fluid/structure modeling of a complete aircraft configuration
- A two-directional Arnoldi process and its application to parametric model order reduction
- More robust Chebyshev filtering for SCF iteration, with applications in real-space DFT
- Dimensionality reduction and volume minimization -- generalization of the determinant minimization criterion for reduced rank regression problems
- A new method to interpolate POD reduced bases–Application to the parametric model order reduction of a gas bearings supported rotor
- Sharper bounds for regularized data fitting
- Randomized subspace iteration: analysis of canonical angles and unitarily invariant norms
- Canonical correlations and generalized SVD: Applications and new algorithms
- Plant directionality, coupling and multivariable loop-shaping
- Blade products and angles between subspaces
- Block-iterative methods for consistent and inconsistent linear equations
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)
