Rational minimax iterations for computing the matrix pth root

DOI10.1007/S00365-020-09504-3OpenAlexW3024100276MaRDI QIDQ2049603FDOQ2049603

Evan S. Gawlik

Publication date: 27 August 2021

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.06268

zbMATH Keywords

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Pad%EF%BF%BD%EF%BF%BD+approximation&go=Go Pad�� approximation]matrix rootNewton iterationrational approximationuniform approximationmatrix powerChebyshev approximationminimax iteration

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Approximation by rational functions (41A20) Numerical computation of matrix exponential and similar matrix functions (65F60) Numerical methods for matrix equations (65F45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Functions of Matrices
• A Schur Algorithm for Computing Matrix pth Roots
• An improved Schur-Padé algorithm for fractional powers of a matrix and their Fréchet derivatives
• On the Newton Method for the Matrix Pth Root
• Algorithms for the matrix \(p\)th root
• The Carathéodory–Fejér Method for Real Rational Approximation
• A Schur–Padé Algorithm for Fractional Powers of a Matrix
• A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root
• Best uniform rational approximation of \(x^ \alpha\) on \([0,1]\).
• Tschebyscheff-Approximationen in kleinen Intervallen. I; II: Stetigkeitssätze für gebrochen rationale Approximationen
• Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
• A Schur–Newton Method for the Matrix \lowercase{\boldmathp}th Root and its Inverse
• A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability
• Iteration functions for \(p\)th roots of complex numbers
• A Padé family of iterations for the matrix sector function and the matrix p th root
• Regions of convergence of a Padé family of iterations for the matrix sector function and the matrix \(p\)th root
• A Padé family of iterations for the matrix sign function and related problems
• On Newton's method and Halley's method for the principal \(p\)th root of a matrix
• Optimal Partitioning of Newton's Method for Calculating Roots
• Representation of conformal maps by rational functions
• On Convergence and Degeneracy in Rational Padé and Chebyshev Approximation
• A faster, more stable method for comuting the pth roots of positive definite matrices
• Approximating the \(p\)th root by composite rational functions
• Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
• Zolotarev Iterations for the Matrix Square Root
• Improved Newton Iteration for Integral Roots
• A Backward Stable Algorithm for Computing the CS Decomposition via the Polar Decomposition

Cited In (3)

• Rational Minimax Iterations for Computing the Matrix $p$th Root
• Dressing for generalised linear Hamiltonian systems depending rationally on the spectral parameter and some applications
• Approximating the \(p\)th root by composite rational functions

Uses Software

• mctoolbox
• Chebfun
• mftoolbox

This page was built for publication: Rational minimax iterations for computing the matrix \(p\)th root

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