Stable iterations for the matrix square root
From MaRDI portal
Publication:1373134
DOI10.1023/A:1019150005407zbMath0884.65035OpenAlexW1826072219WikidataQ56998931 ScholiaQ56998931MaRDI QIDQ1373134
Publication date: 6 November 1997
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1019150005407
Related Items
Fast random field generation with \(H\)-matrices, Analysis of numerical methods for spectral fractional elliptic equations based on the best uniform rational approximation, Fast wave computation via Fourier integral operators, The computation of the principal square roots of centrosymmetric H-matrices, A Taylor expansion of the square root matrix function, A robust algorithm for finding the eigenvalues and eigenvectors of \(3 \times 3\) symmetric matrices, Mixed matrix sign function/DFT inversion method for solving parameter-dependent Riccati equation, Accelerating a recurrent neural network to finite-time convergence using a new design formula and its application to time-varying matrix square root, Symplectic analogs of polar decomposition and their applications to bosonic Gaussian channels, Time-varying square roots finding via Zhang dynamics versus gradient dynamics and the former's link and new explanation to Newton-Raphson iteration, On stability of functional differential equations with rapidly oscillating coefficients, Numerical linear algebra in data assimilation, A manual approach for calculating the root of square matrix of dimension \(\leq\ni\), Computing the square root and logarithm of a real \(P\)-orthogonal matrix, Scaled fixed point algorithm for computing the matrix square root, Revisiting Convolutional Neural Networks from the Viewpoint of Kernel-Based Methods, Measuring linear correlation between random vectors, The nontriviality of trivial general covariance: how electrons restrict `time' coordinates, spinors (almost) fit into tensor calculus, and \(\frac{7}{16}\) of a tetrad is surplus structure, On computing complex square roots of real matrices, The Padé iterations for the matrix sign function and their reciprocals are optimal, Approximate iterations for structured matrices, Numerical approximation of the product of the square root of a matrix with a vector, An iterative method for solving the stable subspace of a matrix pencil and its application, Least-squares collocation with covariance-matching constraints, Matrix hypergeometric function and its application to computation of characteristic function of spherically symmetric distributions with phase-type amplitude, Some properties of generalized \(K\)-centrosymmetric \(H\)-matrices, Uniqueness of matrix square roots and an application, An iterative method to compute the sign function of a non-Hermitian matrix and its application to the overlap Dirac operator at nonzero chemical potential, Residual methods for the large-scale matrix \(p\)th root and some related problems, Square roots of \(H\)-nonnegative matrices, The computation of the square roots of circulant matrices, Conditioning of the matrix-matrix exponentiation, Matrix Arithmetic-Geometric Mean and the Computation of the Logarithm, Zolotarev Iterations for the Matrix Square Root, Error analysis of Padé iterations for computing matrix invariant subspaces, Classical and nonclassical randomness in quantum measurements, Hamiltonian square roots of skew-Hamiltonian matrices, Newton's method for the matrix nonsingular square root, An Algorithm for the Matrix Lambert $W$ Function
Uses Software
