Journal article
Non-optimality of the Greedy Algorithm for subspace orderings in the method of alternating projections
- Abstract:
-
The method of alternating projections involves projecting an element of a Hilbert space cyclically onto a collection of closed subspaces. It is known that the resulting sequence always converges in norm and that one can obtain estimates for the rate of convergence in terms of quantities describing the geometric relationship between the subspaces in question, namely their pairwise Friedrichs numbers. We consider the question of how best to order a given collection of subspaces so as to obtain ...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
Bibliographic Details
- Publisher:
- Springer Verlag Publisher's website
- Journal:
- Results in Mathematics Journal website
- Volume:
- 72
- Issue:
- 1-2
- Pages:
- 979–990
- Publication date:
- 2017-07-14
- Acceptance date:
- 2017-06-28
- DOI:
- EISSN:
-
1420-9012
- ISSN:
-
1422-6383
- Source identifiers:
-
702134
Item Description
- Pubs id:
-
pubs:702134
- UUID:
-
uuid:bdebead7-9268-4296-88be-5178dfccae91
- Local pid:
- pubs:702134
- Deposit date:
- 2017-06-28
Terms of use
- Copyright holder:
- Darwin et al
- Copyright date:
- 2017
- Notes:
- © The Author(s) 2017. Open Access: this article is distributed under the terms of the Creative Commons Attribution 4.0 International License.
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record