10
Rational Iterative Methods for the Matrix Sign Function
source link: https://epubs.siam.org/doi/10.1137/0612020
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
SIAM J. Matrix Anal. Appl., 12(2), 273–291. (19 pages)
Rational Iterative Methods for the Matrix Sign Function
In this paper an analysis of rational iterations for the matrix sign function is presented. This analysis is based on Padé approximations of a certain hypergeometric function and it is shown that local convergence results for “multiplication-rich” polynomial iterations also apply to these rational methods. Multiplication-rich methods are of particular interest for many parallel and vector computing environments. The main diagonal Padé recursions, which include Newton’s and Halley’s methods as special cases, are globally convergent and can be implemented in a multiplication-rich fashion which is computationally competitive with the polynomial recursions (which are not globally convergent). Other rational iteration schemes are also discussed, including Laurent approximations, Cayley power methods, and globally convergent eigenvalue assignment methods.
Copyright © 1991 Society for Industrial and Applied Mathematics
Permalink: https://doi.org/10.1137/0612020
Cited by
(2021) A numerical study of fractional linear algebraic systems. Mathematics and Computers in Simulation 182, 495-513. Crossref
(2020) A family of high order iterations for calculating the sign of a matrix. Mathematical Methods in the Applied Sciences 43:14, 8192-8203. Crossref
(2020) Numerical approximation of fractional powers of elliptic operators. IMA Journal of Numerical Analysis 40:3, 1746-1771. Crossref
(2020) CP2K: An electronic structure and molecular dynamics software package - Quickstep: Efficient and accurate electronic structure calculations. The Journal of Chemical Physics 152:19, 194103. Crossref
(2020) Analysis of numerical methods for spectral fractional elliptic equations based on the best uniform rational approximation. Journal of Computational Physics 408, 109285. Crossref
(2020) Localized inverse factorization. IMA Journal of Numerical Analysis 89. Crossref
(2019) A fast iterative method to find the matrix geometric mean of two HPD matrices. Mathematical Methods in the Applied Sciences 42:16, 5615-5625. Crossref
(2019) Construction of stable and globally convergent schemes for the matrix sign function. Linear Algebra and its Applications 580, 14-36. Crossref
(2019) On a class of two-dimensional incomplete Riemann solvers. Journal of Computational Physics 386, 541-567. Crossref
(2019) New iterative methods for finding matrix sign function: derivation and application. Computational and Applied Mathematics 38:2. Crossref
(2019) A fourth-order method for computing the sign function of a matrix with application in the Yang–Baxter-like matrix equation. Computational and Applied Mathematics 38:2. Crossref
2019. Comparison Analysis of Two Numerical Methods for Fractional Diffusion Problems Based on the Best Rational Approximations of t γ on [0, 1]. Advanced Finite Element Methods with Applications, 165-185. Crossref
(2018) A globally convergent variant of mid-point method for finding the matrix sign. Computational and Applied Mathematics 37:5, 5795-5806. Crossref
(2018) Fast random field generation with H-matrices. Numerische Mathematik 140:3, 639-676. Crossref
(2018) Optimal solvers for linear systems with fractional powers of sparse SPD matrices. Numerical Linear Algebra with Applications 25:5, e2167. Crossref
(2018) An iterative method for solving the stable subspace of a matrix pencil and its application. Linear and Multilinear Algebra 66:7, 1279-1298. Crossref
(2018) Constructing a High-Order Globally Convergent Iterative Method for Calculating the Matrix Sign Function. Mathematical Problems in Engineering 2018, 1-9. Crossref
(2017) Numerically stable improved Chebyshev–Halley type schemes for matrix sign function. Journal of Computational and Applied Mathematics 318, 189-198. Crossref
Evan S. Gawlik and Melvin Leok. (2017) Iterative Computation of the Fréchet Derivative of the Polar Decomposition. SIAM Journal on Matrix Analysis and Applications 38:4, 1354-1379. Abstract | PDF (697 KB)
(2016) Several numerical methods for computing unitary polar factor of a matrix. Advances in Difference Equations 2016:1. Crossref
(2016) Communication: Generalized canonical purification for density matrix minimization. The Journal of Chemical Physics 144:9, 091102. Crossref
(2015) On iterative algorithms for the polar decomposition of a matrix and the matrix sign function. Applied Mathematics and Computation 270, 483-495. Crossref
(2015) A fast convergent numerical method for matrix sign function with application in SDEs. Journal of Computational and Applied Mathematics 282, 167-178. Crossref
(2015) Construction of a convergent scheme for finding matrix sign function. Applied Mathematics and Computation 260, 242-248. Crossref
2015. Finite-Dimensional Indefinite Inner Product Spaces and Applications in Numerical Analysis. Operator Theory, 431-449. Crossref
2015. Matrix Eigenvalue Problems. Numerical Methods in Matrix Computations, 431-612. Crossref
(2015) A Novel Iterative Method for Polar Decomposition and Matrix Sign Function. Discrete Dynamics in Nature and Society 2015, 1-11. Crossref
(2015) On a Cubically Convergent Iterative Method for Matrix Sign. The Scientific World Journal 2015, 1-6. Crossref
(2014) The dual Padé families of iterations for the matrix
p
th root and the matrix
p
-sector function. Journal of Computational and Applied Mathematics 272, 468-486. Crossref
(2014) A Third-Order Newton-Type Method for Finding Polar Decomposition. Advances in Numerical Analysis 2014, 1-5. Crossref
(2014) Distributed decorrelation in sensor networks with application to distributed particle filtering. 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 6117-6121. Crossref
2014. Finite-Dimensional Indefinite Inner Product Spaces and Applications in Numerical Analysis. Operator Theory, 1-17. Crossref
(2014) Approximating the Matrix Sign Function Using a Novel Iterative Method. Abstract and Applied Analysis 2014, 1-9. Crossref
(2014) Some Matrix Iterations for Computing Matrix Sign Function. Journal of Applied Mathematics 2014, 1-9. Crossref
(2014) A Numerical Method for Computing the Principal Square Root of a Matrix. Abstract and Applied Analysis 2014, 1-7. Crossref
(2014) An Algorithm for Computing Geometric Mean of Two Hermitian Positive Definite Matrices via Matrix Sign. Abstract and Applied Analysis 2014, 1-6. Crossref
2013. Functions of Matrices. Handbook of Linear Algebra, Second Edition, 279-293. Crossref
(2013) THE BINOMIAL METHOD FOR A MATRIX SQUARE ROOT. East Asian mathematical journal 29:5, 511-519. Crossref
(2012) Regions of convergence of a Padé family of iterations for the matrix sector function and the matrix pth root. Journal of Computational and Applied Mathematics 236:17, 4410-4420. Crossref
(2012) A Padé family of iterations for the matrix sign function and related problems. Numerical Linear Algebra with Applications 19:3, 585-605. Crossref
(2012) The Padé iterations for the matrix sign function and their reciprocals are optimal. Linear Algebra and its Applications 436:3, 472-477. Crossref
Emanuel H. Rubensson. (2012) Controlling Errors in Recursive Fermi–Dirac Operator Expansions with Applications in Electronic Structure Theory. SIAM Journal on Scientific Computing 34:1, B1-B23. Abstract | PDF (688 KB)
2011. Density Matrix Methods in Linear Scaling Electronic Structure Theory. Linear-Scaling Techniques in Computational Chemistry and Physics, 439-473. Crossref
(2010) Computing matrix functions. Acta Numerica 19, 159-208. Crossref
(2009) A Padé family of iterations for the matrix sector function and the matrix
p
th root. Numerical Linear Algebra with Applications 16:11-12, 951-970. Crossref
(2009) Error analysis of Padé iterations for computing matrix invariant subspaces. Frontiers of Mathematics in China 4:2, 381-404. Crossref
Bruno Iannazzo. (2009) A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root. SIAM Journal on Matrix Analysis and Applications 30:4, 1445-1462. Abstract | PDF (521 KB)
(2008) Matrix sign function in the problems of analysis and design of the linear systems. Automation and Remote Control 69:2, 198-222. Crossref
2008. Matrix Functions. Model Order Reduction: Theory, Research Aspects and Applications, 275-303. Crossref
(2007) 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. Computer Physics Communications 177:12, 933-943. Crossref
(2007) Linear-scaling symmetric square-root decomposition of the overlap matrix. The Journal of Chemical Physics 126:12, 124104. Crossref
(2006) Solving Stable Sylvester Equations via Rational Iterative Schemes. Journal of Scientific Computing 28:1, 51-83. Crossref
D. Steven Mackey, Niloufer Mackey, and Françoise Tisseur. (2005) Structured Factorizations in Scalar Product Spaces. SIAM Journal on Matrix Analysis and Applications 27:3, 821-850. Abstract | PDF (284 KB)
Nicholas J. Higham, D. Steven Mackey, Niloufer Mackey, and Françoise Tisseur. (2005) Functions Preserving Matrix Groups and Iterations for the Matrix Square Root. SIAM Journal on Matrix Analysis and Applications 26:3, 849-877. Abstract | PDF (284 KB)
(2004) Density Matrix Perturbation Theory. Physical Review Letters 92:19. Crossref
Nicholas J. Higham, D. Steven Mackey, Niloufer Mackey, and Françoise Tisseur. (2004) Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups. SIAM Journal on Matrix Analysis and Applications 25:4, 1178-1192. Abstract | PDF (188 KB)
Beatrice Meini. (2004) The Matrix Square Root from a New Functional Perspective: Theoretical Results and Computational Issues. SIAM Journal on Matrix Analysis and Applications 26:2, 362-376. Abstract | PDF (183 KB)
(2003) Implicit purification for temperature-dependent density matrices. Physical Review B 68:23. Crossref
Nicholas J. Higham. (2003) J-Orthogonal Matrices: Properties and Generation. SIAM Review 45:3, 504-519. Abstract | PDF (496 KB)
2003. Issues in the Design of Scalable Out-of-Core Dense Symmetric Indefinite Factorization Algorithms. Computational Science — ICCS 2003, 715-724. Crossref
(2003) Analysis of new pivoting strategy for the LDLT decomposition on a multiprocessor system with distributed memory. IEE Proceedings - Computers and Digital Techniques 150:1, 53. Crossref
Xiaobai Sun and Enrique S. Quintana-Ortí. (2002) The Generalized Newton Iteration forthe Matrix Sign Function. SIAM Journal on Scientific Computing 24:2, 669-683. Abstract | PDF (182 KB)
2002. Sylvester and Riccati Equations. Computational Aspects of Linear Control, 249-253. Crossref
Sheung Hun Cheng, Nicholas J. Higham, Charles S. Kenney, and Alan J. Laub. (2001) Approximating the Logarithm of a Matrix to Specified Accuracy. SIAM Journal on Matrix Analysis and Applications 22:4, 1112-1125. Abstract | PDF (176 KB)
(2000) Linear scaling density matrix search based on
sign
matrices. The Journal of Chemical Physics 113:15, 6035-6041. Crossref
(2000) Solving algebraic Riccati equations on parallel computers using Newton's method with exact line search. Parallel Computing 26:10, 1345-1368. Crossref
(2000) A novel computational method for solving finite qbd processes. Communications in Statistics. Stochastic Models 16:2, 273-311. Crossref
(1999) A method for solving the algebraic Riccati and Lyapunov equations using higher order matrix sign function algorithms. Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251), 2345-2349 vol.4. Crossref
(1999) Matrix sign algorithms for signal subspace applications. Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251), 2350-2354 vol.4. Crossref
(1998) Parallel solution of Riccati matrix equations with the matrix sign function. Automatica 34:2, 151-156. Crossref
(1997) A Parallel algorithm for principal nth roots of matrices. Automatica 33:9, 1735-1738. Crossref
Ralph Byers, Chunyang He, and Volker Mehrmann. (1997) The Matrix Sign Function Method and the Computation of Invariant Subspaces. SIAM Journal on Matrix Analysis and Applications 18:3, 615-632. Abstract | PDF (347 KB)
Steven Huss-Lederman, Anna Tsao, and Thomas Turnbull. (1997) A Parallelizable Eigensolver for Real Diagonalizable Matrices with Real Eigenvalues. SIAM Journal on Scientific Computing 18:3, 869-885. Abstract | PDF (3350 KB)
1997. Stabilizing large control linear systems on multicomputers. Vector and Parallel Processing — VECPAR'96, 338-364. Crossref
(1997) An invariant subspace approach in m/g/l and g/m/l type markov chains. Communications in Statistics. Stochastic Models 13:3, 381-416. Crossref
Roy Mathias. (1996) A Chain Rule for Matrix Functions and Applications. SIAM Journal on Matrix Analysis and Applications 17:3, 610-620. Abstract | PDF (1102 KB)
(1995) The matrix sign function. IEEE Transactions on Automatic Control 40:8, 1330-1348. Crossref
(1995) Halley's method for the matrix sector function. IEEE Transactions on Automatic Control 40:5, 944-949. Crossref
(1994) The matrix sign decomposition and its relation to the polar decomposition. Linear Algebra and its Applications 212-213, 3-20. Crossref
(1994) A hyperbolic tangent identity and the geometry of Padé sign function iterations. Numerical Algorithms 7:2, 111-128. Crossref
(1994) A local convergence theorem for the super-halley method in a Banach space. Applied Mathematics Letters 7:5, 49-52. Crossref
(1994) Computation of the matrix sign function using continued fraction expansion. IEEE Transactions on Automatic Control 39:8, 1644-1647. Crossref
(1994) Computation of the structured stability radius via matrix sign function. Systems & Control Letters 22:5, 341-349. Crossref
(1993) A Newton-squaring algorithm for computing the negative invariant subspace of a matrix. IEEE Transactions on Automatic Control 38:8, 1284-1289. Crossref
(1992) Control-structure interaction. IEEE Control Systems 12:5, 4-13. Crossref
Charles Kenney and Alan J. Laub. (1992) On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function. SIAM Journal on Matrix Analysis and Applications 13:3, 688-706. Abstract | PDF (2060 KB)
(1991) Parallel algorithms for algebraic Riccati equations. International Journal of Control 54:6, 1317-1333. Crossref
1991. Invariant Subspace Methods for the Numerical Solution of Riccati Equations. The Riccati Equation, 163-196. Crossref
Stability analysis via projections and eigen distribution in half-planes and disks. Proceedings of the 2003 American Control Conference, 2003., 2738-2742. Crossref
On the matrix sign function method for the computation of invariant subspaces. Proceedings of Joint Conference on Control Applications Intelligent Control and Computer Aided Control System Design, 71-76. Crossref
Optimal control study for the Space Station solar dynamic power module. [1991] Proceedings of the 30th IEEE Conference on Decision and Control, 2224-2229. Crossref
A method for solving the algebraic Riccati and Lyapunov equations using higher order matrix sign function algorithms. Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171), 4416-4421. Crossref
Fixed point iterations for computing square roots and the matrix sign function of complex matrices. Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187), 4253-4258. Crossref
Matrix sign algorithm for sinusoidal frequency and DOA estimation problems. Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181), 1369-1372. Crossref
A new paradigm in teletraffic analysis of communication networks. Proceedings of IEEE INFOCOM '96. Conference on Computer Communications, 1318-1326. Crossref
Finite and infinite QBD chains: a simple and unifying algorithmic approach. Proceedings of INFOCOM '97, 1105-1113. Crossref
Computation of projections and eigen distribution in half-planes and disks. Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03., IV-580-IV-583. Crossref
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK