Numerical Methods for Computing Angles Between Linear Subspaces

From MaRDI portal
Revision as of 23:34, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4768555

DOI10.2307/2005662zbMath0282.65031OpenAlexW3030910590WikidataQ57319027 ScholiaQ57319027MaRDI QIDQ4768555

Gene H. Golub, Åke Björck

Publication date: 1973

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2005662




Related Items (only showing first 100 items - show all)

A Novel Partitioning Method for Accelerating the Block Cimmino AlgorithmUnnamed ItemSharper Bounds for Regularized Data FittingBounds for fidelity of semiclassical Lagrangian states in Kähler quantizationOn Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular ProblemsModel Reduction for Nonlinear Systems by Balanced Truncation of State and Gradient CovarianceA new method to interpolate POD reduced bases–Application to the parametric model order reduction of a gas bearings supported rotorAnalysis of joint shape variation from multi-object complexesRow Replicated Block CimminoDevelopment and analysis of massive parallelization of a lattice basis reduction algorithmComparing the methods of alternating and simultaneous projections for two subspacesEigenvalue bounds for saddle-point systems with singular leading blocksA geometric approach to linear cryptanalysisOn the optimality of the Oja's algorithm for online PCARandomized Subspace Iteration: Analysis of Canonical Angles and Unitarily Invariant NormsNumerical Algorithms on the Affine GrassmannianDiscrete Poincaré Duality Angles as Shape Signatures on Simplicial Surfaces with BoundaryGeneralized low rank approximations of matricesSlowness as a Proxy for Temporal Predictability: An Empirical ComparisonGeneralized low rank approximations of matricesVariable selection in additive models via hierarchical sparse penaltyLow-Rank Solution Methods for Stochastic Eigenvalue ProblemsGeneralized inverses of matrices: a perspective of the work of PenroseUnnamed ItemStrongly Damped Quadratic Matrix Polynomials$\mathcal{H}_2$-Optimal Model Reduction Using Projected Nonlinear Least SquaresIsoclinic subspaces and quantum error correctionFast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value DecompositionFlag Manifolds for the Characterization of Geometric Structure in Large Data SetsTwice Is Enough for Dangerous EigenvaluesClass visualization of high-dimensional data with applications.Numerically stable cointegration analysisOptimally robust redundancy relations for failure detection in uncertain systemsTemporal localized nonlinear model reduction with a priori error estimateAnisotropic finite elements for the Stokes problem: a posteriori error estimator and adaptive meshA general framework for association analysis of heterogeneous dataCritical angles between two convex cones. I: General theoryHistory and generality of the CS decompositionMaximizing bilinear forms subject to linear constraintsPerturbation analysis of the canonical correlations of matrix pairsDimension reduction and construction of feature space for image pattern recognitionEventual linear convergence of the Douglas-Rachford iteration for basis pursuitCDPA: common and distinctive pattern analysis between high-dimensional datasetsPhysics-informed cluster analysis and a priori efficiency criterion for the construction of local reduced-order basesGeneralizations of the projection method with applications to SOR theory for Hermitian positive semidefinite linear systemsThe Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product SpacesOptimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspacesA gentle guide to the basics of two projections theoryEigenvalues of the difference and product of projectionsSensitivity integrals for multivariable discrete-time systemsDimensionality reduction and volume minimization -- generalization of the determinant minimization criterion for reduced rank regression problemsThe max‐length‐vector line of best fit to a set of vector subspaces and an optimization problem over a set of hyperellipsoidsSynthesis of multi-qudit hybrid and \(d\)-valued quantum logic circuits by decompositionThe many proofs of an identity on the norm of oblique projectionsThe FastHCS algorithm for robust PCAA combination of the fast multipole boundary element method and Krylov subspace recycling solversPlant directionality, coupling and multivariable loop-shapingConvergence of integration-based methods for the solution of standard and generalized Hermitian eigenvalue problemsA graphical procedure for comparing the principal components of several covariance matricesCanonical correlations and generalized SVD: Applications and new algorithmsBoosted manifold principal angles for image set-based recognitionTest procedures and test problems for least squares algorithmsExploring the common principal subspace of deep features in neural networksA fast recursive orthogonalization scheme for the Macaulay matrixSimultaneous multidiagonalization for the CS decompositionSome geometric interpretations of quantum fidelityMulti-time-scale analysis of a power systemSubspaces, angles and pairs of orthogonal projectionsAngles between subspaces and nearly optimal approximation in GFEMError analysis of signal zeros: A projected companion matrix approachRayleigh--Ritz Majorization Error Bounds of Mixed TypeModel-driven domain adaptation on product manifolds for unconstrained face recognitionA geometrical approach to finding multivariate approximate LCMs and GCDsA spectrum slicing method for the Kohn-Sham problemNew lower bounds on the minimum singular value of a matrixThe average condition number of most tensor rank decomposition problems is infiniteDeterminant efficiencies in ill-conditioned modelsManifold approximation by moving least-squares projection (MMLS)Counting collisions in an \(N\)-billiard system using angles between collision subspacesPersonal report : Gene Howard Golub, 1932--2007Near insensitivity of linear feedback systemsA flag representation for finite collections of subspaces of mixed dimensionsFast computation of robust subspace estimatorsThe spectral properties of Vandermonde matrices with clustered nodesUpdating the principal angle decompositionA pointwise criterion for controller robustnessFeedback stability under simultaneous gap metric uncertainties in plant and controllerD-CCA: A Decomposition-Based Canonical Correlation Analysis for High-Dimensional DatasetsOn principal angles between subspaces in \(\mathbb{R}^n\)On the structure and geometry of the product singular value decompositionBlade products and angles between subspacesSupervised multiway factorizationData-driven control: a behavioral approachA randomized exponential canonical correlation analysis method for data analysis and dimensionality reductionPartitioning strategies for the block Cimmino algorithmInexact rotated block triangular preconditioners for a class of block two-by-two matricesDiscriminative extended canonical correlation analysis for pattern set matchingThermal and reflectance based personal identification methodology under variable illuminationLocal improvements to reduced-order approximations of optimal control problems governed by diffusion-convection-reaction equationGrassmannian spectral shooting







This page was built for publication: Numerical Methods for Computing Angles Between Linear Subspaces