{"publication_status":"published","page":"378-388","doi":"10.1007/3-540-45335-0_23","abstract":[{"lang":"eng","text":"Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them suffer from instabilities when applied to degenerate matrices, i.e., those having multiple eigenvalues. We investigate the spectral representation's effectivity properties on the sound formal basis of computable analysis. It turns out that in general the eigenvectors cannot be computed from a given matrix. If however the size of the matrix' spectrum (=number of different eigenvalues) is known in advance, it can be diagonalized effectively. Thus, in principle the spectral decomposition can be computed under remarkably weak non-degeneracy conditions."}],"date_created":"2020-08-24T10:14:06Z","language":[{"iso":"eng"}],"publication":"Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA'2000)","type":"conference","date_updated":"2022-01-06T06:53:26Z","author":[{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"},{"first_name":"Vasco","full_name":"Brattka, Vasco","last_name":"Brattka"}],"intvolume":" 2064","status":"public","place":"Berlin, Heidelberg","year":"2001","citation":{"ieee":"M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), 2001, vol. 2064, pp. 378–388.","mla":"Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), vol. 2064, 2001, pp. 378–88, doi:10.1007/3-540-45335-0_23.","ama":"Ziegler M, Brattka V. A Computable Spectral Theorem. In: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000). Vol 2064. Berlin, Heidelberg; 2001:378-388. doi:10.1007/3-540-45335-0_23","bibtex":"@inproceedings{Ziegler_Brattka_2001, place={Berlin, Heidelberg}, title={A Computable Spectral Theorem}, volume={2064}, DOI={10.1007/3-540-45335-0_23}, booktitle={Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)}, author={Ziegler, Martin and Brattka, Vasco}, year={2001}, pages={378–388} }","apa":"Ziegler, M., & Brattka, V. (2001). A Computable Spectral Theorem. In Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000) (Vol. 2064, pp. 378–388). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_23","short":"M. Ziegler, V. Brattka, in: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), Berlin, Heidelberg, 2001, pp. 378–388.","chicago":"Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” In Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), 2064:378–88. Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45335-0_23."},"user_id":"15415","department":[{"_id":"63"}],"publication_identifier":{"isbn":["9783540421979","9783540453352"],"issn":["0302-9743"]},"_id":"18152","title":"A Computable Spectral Theorem","volume":2064}