Pages that link to "Item:Q1085563"

The following pages link to A fast method for computing the principal \(n\)-th roots of complex matrices (Q1085563):

Displaying 13 items.

• Residual methods for the large-scale matrix \(p\)th root and some related problems (Q711300) (← links)
• Fast and stable recursive algorithms for continuous-time and discrete- time model conversions (Q1103336) (← links)
• Fast and stable algorithms for computing the principal \(n\)th root of a complex matrix and the matrix sector function (Q1107951) (← links)
• On the computation of a matrix inverse square root (Q1179549) (← links)
• A computer-aided method for solvents and spectral factors of matrix polynomials (Q1184816) (← links)
• Numerical approximation of the product of the square root of a matrix with a vector (Q1978127) (← links)
• Modelling of multirate feedback systems using uniform-rate models (Q2366508) (← links)
• Algorithms for the matrix \(p\)th root (Q2501233) (← links)
• Rectangular and polar representations of a complex matrix (Q3773179) (← links)
• Hybrid suboptimal control of multi-rate multi-loop sampled-data systems (Q4012715) (← links)
• Multi-rate digital redesign of cascaded and dynamic output feedback systems (Q5168023) (← links)
• On optimal symmetric orthogonalisation and square roots of a normal matrix (Q5288103) (← links)
• An Iterative Method for the Computation of a Matrix Inverse Square Root (Q5689876) (← links)