×

A faster, more stable method for comuting the pth roots of positive definite matrices. (English) Zbl 0407.65017


MSC:

65F30 Other matrix algorithms (MSC2010)
15B57 Hermitian, skew-Hermitian, and related matrices
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] W.D. Hoskins and D.J. Walton, A faster method of computing the square root of a matrix, IEEE Trans. Automatic Control, to appear.; W.D. Hoskins and D.J. Walton, A faster method of computing the square root of a matrix, IEEE Trans. Automatic Control, to appear. · Zbl 0378.65028
[2] Denman, E. D.; Beavers, A. N., The matrix sign function and computations in systems, Appl. Math. and Comp., 2, 63-94 (1976) · Zbl 0398.65023
[3] Ostrowski, A. M., Solution of Equations in Euclidean and Banach Spaces (1973), Academic: Academic New York · Zbl 0304.65002
[4] F.T. Mann, A high-order method of solution for the Lyapunov matrix equation, Comput. J.; F.T. Mann, A high-order method of solution for the Lyapunov matrix equation, Comput. J.
[5] Fox, L., An Introduction to Numerical Linear Algebra (1964), Clarendon: Clarendon Oxford · Zbl 0122.35701
[6] Knuth, D. E., The Art of Computer Programming, Vol. 2 (1969), Addison-Wesley, Don Mills · Zbl 0191.17903
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.