Abstract.
In this work we consider computing a smooth path for a (block) singular value decomposition of a full rank matrix valued function. We give new theoretical results and then introduce and implement several algorithms to compute a smooth path. We illustrate performance of the algorithms with a few numerical examples.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported in part under NSF Grant DMS-0139895, and INDAM-GNCS and MIUR Rome-Italy.
Rights and permissions
About this article
Cite this article
Dieci, L., Gasparo, M.G. & Papini, A. Continuation of Singular Value Decompositions. MedJM 2, 179–203 (2005). https://doi.org/10.1007/s00009-005-0038-6
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s00009-005-0038-6