Algorithms for approximating means of semi-infinite quasi-Toeplitz matrices
From MaRDI portal
Publication:2117879
DOI10.1007/978-3-030-80209-7_45zbMATH Open1496.65059OpenAlexW3177946599MaRDI QIDQ2117879FDOQ2117879
Authors: Dario A. Bini, Bruno Iannazzo, Jie Meng 
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-80209-7_45
Recommendations
- Geometric means of quasi-Toeplitz matrices
- Computing the Karcher mean of symmetric positive definite matrices
- A majorization-minimization algorithm for computing the Karcher mean of positive definite matrices
- On the exponential of semi-infinite quasi-Toeplitz matrices
- Geometric means of structured matrices
Matrix exponential and similar functions of matrices (15A16) Toeplitz, Cauchy, and related matrices (15B05) Numerical computation of matrix exponential and similar matrix functions (65F60)
Cites Work
- Quasi-Toeplitz matrix arithmetic: a MATLAB toolbox
- Introduction to large truncated Toeplitz matrices
- Means of positive linear operators
- Geometric means
- Karcher means and Karcher equations of positive definite operators
- An Introduction to Iterative Toeplitz Solvers
- Matrix power means and the Karcher mean
- Spectral Properties of Banded Toeplitz Matrices
- Computing the Karcher mean of symmetric positive definite matrices
- An effective matrix geometric mean satisfying the Ando-Li-Mathias properties
- Title not available (Why is that?)
- Geometric Means of Positive Operators
- A note on computing matrix geometric means
- On quadratic matrix equations with infinite size coefficients encountered in QBD stochastic processes
- Semi-infinite quasi-Toeplitz matrices with applications to QBD stochastic processes
- Large truncated Toeplitz matrices, Toeplitz operators, and related topics. The Albrecht Böttcher anniversary volume
- The Riemannian Barzilai–Borwein method with nonmonotone line search and the matrix geometric mean computation
- On functions of quasi-Toeplitz matrices
- A Computational Framework for Two-Dimensional Random Walks With Restarts
- Solving Quadratic Matrix Equations Arising in Random Walks in the Quarter Plane
- Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector
- Existence, uniqueness and an ODE approach to the \(L^1\)-Karcher mean
- Computing the matrix geometric mean: Riemannian versus Euclidean conditioning, implementation techniques, and a Riemannian BFGS method
Cited In (3)
Uses Software
This page was built for publication: Algorithms for approximating means of semi-infinite quasi-Toeplitz matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117879)
