eScholarship
metadata only
Trajectories of Iterates of Orthogonal Projections
We study cases and variants of the following problem: Given a collection of subspaces of a finite-dimensional Euclidean space and a unit vector, iteratively project that vector onto the subspaces in an order determined by a subspace-selection rule. After many iterates, how far away can the final poi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Bang vectors in the real polarization problem: The exact dimensional range#819125
- Bang vectors in the real polarization problem: The exact dimensional range#809133
- Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices#1052135
- Rank-One Signal Recovery in Sparse Wishart Noise#1064707
- The Sunada method on Metric Measure Spaces#792557
Record · ID 983505
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive