A note on golden means, nonlinear matrix equations and structured doubling algorithms
The authors consider two matrix equations \[ BX^{-1}B-X-A=0, \quad XA^{-1}X+X-(B-A)=0, \] where \(0 < A \leq B\). They propose some structured doubling algorithms for computing solutions of these equations and so-called golden means \[ A\natural B = \tfrac{1}{2}[A + A\sharp(4B-3A)], \quad A\bar\natural B = \tfrac{1}{2}[-A + A\sharp(4B-3A)], \] where \(A\sharp B = A^{1/2}(A^{-1/2}BA^{-1/2})^{1/2}A^{1/2}\) [see the paper by \textit{Y.~Lim}, SIAM J. Matrix Anal. Appl. 29, No.~1, 54--66 (2006; Zbl 1171.15014)]. As illustration, some numerical examples are given.
- The Matrix Golden Mean and Its Applications to Riccati Matrix Equations
- Structure-preserving doubling algorithms for nonlinear matrix equations
- The structure-preserving doubling algorithm and convergence analysis for a nonlinear matrix equation
- Golden ratio algorithms for solving equilibrium problems in Hilbert spaces
- The structure-preserving doubling algorithms for positive definite solution to a system of nonlinear matrix equations
- Golden ratio algorithms for variational inequalities
- Convergence analysis of the doubling algorithm for several nonlinear matrix equations in the critical case
- A golden ratio primal-dual algorithm for structured convex optimization
- The inverse problem of geometric and golden means of positive definite matrices
- Iterative and doubling algorithms for Riccati‐type matrix equations: A comparative introduction
This page was built for publication: A note on golden means, nonlinear matrix equations and structured doubling algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987880)
