Algorithms for the matrix $p$th root

DOI10.1007/s11075-004-6709-8zbMath1103.65046OpenAlexW2063599529WikidataQ56998779 ScholiaQ56998779MaRDI QIDQ2501233

Nicholas J. Higham, Beatrice Meini, Dario Andrea Bini

Publication date: 4 September 2006

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-004-6709-8

zbMATH Keywords

numerical instability Wiener-Hopf factorization cyclic reduction matrix sign function Schur method Laurent polynomial Newtons method Graeffe iteration

Mathematics Subject Classification ID

Matrix equations and identities (15A24)

Related Items

Nonlinear matrix equations and structured linear algebra, Dynamics of theN-link pendulum: a fractional perspective, Roots in operator and Banach algebras, Reduction model approach for linear time-varying systems with input delays based on extensions of Floquet theory, On Newton's method and Halley's method for the principal $p$th root of a matrix, Determination of a matrix function using the divided difference method of Newton and the interpolation technique of Hermite, Efficient implementation of rational approximations to fractional differential operators, Monotonicity and positivity of coefficients of power series expansions associated with Newton and Halley methods for the matrix $p$th root, Fast verified computation for the matrix principal $p$th root, The roots of elements of Aut(SH2), Breaking the curse of dimensional collapse in graph contrastive learning: a whitening perspective, Rational Approximation to the Fractional Laplacian Operator in Reaction-Diffusion Problems, Iteration functions for $p$th roots of complex numbers, Regions of convergence of a Padé family of iterations for the matrix sector function and the matrix $p$th root, Unnamed Item, A globally convergent variant of mid-point method for finding the matrix sign, Constructing a high-order globally convergent iterative method for calculating the matrix sign function, Newton's method and secant methods: a longstanding relationship from vectors to matrices, A note on cycling LP examples with permutation structure, On stochasticity preserving methods for the computation of the matrix $p$th root, A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices, The dual Padé families of iterations for the matrix $p$th root and the matrix $p$-sector function, On $p$th roots of stochastic matrices, Inversion free algorithms for computing the principal square root of a matrix, On the convergence of Schröder iteration functions for pth roots of complex numbers, Residual methods for the large-scale matrix $p$th root and some related problems, Unnamed Item, A fractional perspective on the trajectory control of redundant and hyper-redundant robot manipulators, Numerical approximation to the fractional derivative operator, A study of Schröder's method for the matrix $p$th root using power series expansions, Local Identification of Piecewise Deterministic Models of Genetic Networks, Matrix fractional systems, Rational minimax iterations for computing the matrix $p$th root, The cyclic reduction algorithm: From Poisson equation to stochastic processes and beyond. In memoriam of Gene H. Golub, Explicit convergence regions of Newton's method and Chebyshev's method for the matrix $p$th root, Some matrix iterations for computing matrix sign function, On the Construction and Properties of $m$-step Methods for FDEs, Rhapsody in fractional

Uses Software

Cites Work

Algorithms for the matrix \(p\)th root