An analysis on the efficiency of Euler's method for computing the matrix pth root

DOI10.1002/NLA.2104MaRDI QIDQ4599019zbMATH OpenOpenAlexFDO

Authors Yonghui Ling, Zhengda Huang

Publication date 15 December 2017

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.2104

zbMATH Keywords

convergencematrix \(p\)th rootSchur decompositionEuler's method

Mathematics Subject Classification ID

Numerical computation of matrix exponential and similar matrix functions (65F60)

Recommendations

• On the Computation of the Matrixk-th Root
• Algorithms for the matrix \(p\)th root
• On the convergence of Newton's method for computing the matrix \(p\)-th root
• Computing the \(p\)th roots of a matrix with repeated eigenvalues
• scientific article; zbMATH DE number 4199482
• A Schur Algorithm for Computing Matrix pth Roots
• A method for computing the Perron root for primitive matrices
• On the Newton Method for the Matrix Pth Root
• Fast verified computation for the matrix principal \(p\)th root
• A fast method for computing the principal \(n\)-th roots of complex matrices

Cited in

(4)

• A study of Schröder's method for the matrix \(p\)th root using power series expansions
• Explicit convergence regions of Newton's method and Chebyshev's method for the matrix \(p\)th root
• On semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spaces
• Generalization of Some Algorithms of Euler

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: An analysis on the efficiency of Euler's method for computing the matrix pth root

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