Analysis of the Truncated Conjugate Gradient Method for Linear Matrix Equations
From MaRDI portal
Publication:5885818
DOI10.1137/22M147880XOpenAlexW4289081705MaRDI QIDQ5885818
Publication date: 30 March 2023
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/22m147880x
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient low-rank solution of generalized Lyapunov equations
- Solving stochastic systems with low-rank tensor compression
- On the real convergence rate of the conjugate gradient method
- On low-rank approximability of solutions to high-dimensional operator equations and eigenvalue problems
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- Numerical behaviour of the modified Gram-Schmidt GMRES implementation
- Eigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case
- Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations
- On the convergence of Krylov methods with low-rank truncations
- Low rank methods for a class of generalized Lyapunov equations and related issues
- Flexible Conjugate Gradients
- A preconditioned low-rank CG method for parameter-dependent Lyapunov matrix equations
- Krylov Subspace Methods for Linear Systems with Tensor Product Structure
- A Riemannian Optimization Approach for Computing Low-Rank Solutions of Lyapunov Equations
- Computational Methods for Linear Matrix Equations
- Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
- Matrix and other direct methods for the solution of systems of linear difference equations
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- A Low-Rank in Time Approach to PDE-Constrained Optimization
- Truncated low‐rank methods for solving general linear matrix equations
- Direct methods and ADI‐preconditioned Krylov subspace methods for generalized Lyapunov equations
- Truncation Strategies for Optimal Krylov Subspace Methods
- Inexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
- An alternating direction method of multipliers for the solution of matrix equations arising in inverse problems
- A Restarted GMRES Method Augmented with Eigenvectors
- The Sherman–Morrison–Woodbury formula for generalized linear matrix equations and applications
- Matrix Oriented Reduction of Space-Time Petrov-Galerkin Variational Problems
- A Low-Rank Matrix Equation Method for Solving PDE-Constrained Optimization Problems
- Explicit Solutions of Linear Matrix Equations
- Extended Application of Alternating Direction Implicit Iteration Model Problem Theory
- Minimizing convex quadratics with variable precision conjugate gradients