scientific article; zbMATH DE number 4111904

MaRDI QIDQ3834952zbMATH OpenFDO

Authors Jason Tsai, Norman P. Coleman, Leang-San Shieh

Publication date 1989

zbMATH Keywords

allocation of matrix eigenvaluesblock- diagonalizationblock-triangularizationcomputational algorithmscontinued-fraction methodmatrix Lyapunov and Riccati equationsmatrix- sector functionsprincipal nth root of a complex matrixrecursive algorithmsresearch monograph

Mathematics Subject Classification ID

Matrix equations and identities (15A24)

Recommendations

• Fast and stable algorithms for computing the principal \(n\)th root of a complex matrix and the matrix sector function
• A fast method for computing the principal \(n\)-th roots of complex matrices
• Publication:4865454
• Fast and stable algorithms for computing the principal square root of a complex matrix
• Algorithms for the matrix \(p\)th root

Cited in

(6)

• A fast method for computing the principal \(n\)-th roots of complex matrices
• Fast and stable algorithms for computing the principal \(n\)th root of a complex matrix and the matrix sector function
• Fast and stable algorithms for computing the principal square root of a complex matrix
• Matrix sector functions and their applications to systems theory
• scientific article; zbMATH DE number 844683 (Why is no real title available?)
• On the roots of complex r r matrices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3834952)