Developing Kaczmarz method for solving Sylvester matrix equations
From MaRDI portal
Publication:2094980
Recommendations
- On the Kaczmarz methods based on relaxed greedy selection for solving matrix equation A X B = C
- Iterative solutions to Sylvester matrix equations
- Krylov subspace methods for the generalized Sylvester equation
- Block linear method for large scale Sylvester equations
- Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
Cites work
- s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
- A finite iterative algorithm for solving the complex generalized coupled Sylvester matrix equations by using the linear operators
- A modified CG algorithm for solving generalized coupled Sylvester tensor equations
- A modified gradient based algorithm for solving Sylvester equations
- A randomized Kaczmarz algorithm with exponential convergence
- A recursive parameter estimation algorithm for modeling signals with multi-frequencies
- Accelerated Smith iterative algorithms for coupled Lyapunov matrix equations
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- An accelerated Jacobi-gradient based iterative algorithm for solving Sylvester matrix equations
- Block-s-step Krylov iterative methods
- Computational Methods for Linear Matrix Equations
- Conjugate gradient least squares algorithm for solving the generalized coupled Sylvester matrix equations
- Distributed Computation of Linear Matrix Equations: An Optimization Perspective
- Distributed Design for Nuclear Norm Minimization of Linear Matrix Equations With Constraints
- Finite iterative solutions to periodic Sylvester matrix equations
- Gradient based approach for generalized discrete-time periodic coupled Sylvester matrix equations
- Gradient based iterative algorithms for solving a class of matrix equations
- scientific article; zbMATH DE number 3919670 (Why is no real title available?)
- scientific article; zbMATH DE number 2031025 (Why is no real title available?)
- scientific article; zbMATH DE number 2098307 (Why is no real title available?)
- Iterative parameter estimation for signal models based on measured data
- Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
- Krylov Subspace Methods for Solving Large Lyapunov Equations
- Matrix Equation XA + BX = C
- Matrix iterative methods for solving the Sylvester-transpose and periodic Sylvester matrix equations
- On robust observer compensator design
- On the rate of convergence of the alternating projection method in finite dimensional spaces
- On the Sylvester-like matrix equation AX+f(X)B=C
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Preconditioned Krylov Subspace Methods for Lyapunov Matrix Equations
- Quasi gradient-based inversion-free iterative algorithm for solving a class of the nonlinear matrix equations
- Randomized Kaczmarz Converges Along Small Singular Vectors
- Recursive least squares and multi-innovation stochastic gradient parameter estimation methods for signal modeling
- Reduced order observers: A new algorithm and proof
- Reduced-rank gradient-based algorithms for generalized coupled Sylvester matrix equations and its applications
- Some necessary and sufficient conditions for eigenstructure assignment
- The BCR algorithms for solving the reflexive or anti-reflexive solutions of generalized coupled Sylvester matrix equations
- The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint
- The rate of convergence for the method of alternating projections. II
- The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\)
Cited in
(14)- On the Kaczmarz methods based on relaxed greedy selection for solving matrix equation A X B = C
- Some results for Kaczmarz method to solve Sylvester matrix equations
- Cyclic gradient based iterative algorithm for a class of generalized coupled Sylvester-conjugate matrix equations
- On convergence of a sketch-and-project method for the matrix equation AXB = C
- Kaczmarz-type methods for solving matrix equations
- A randomized block Douglas-Rachford method for solving linear matrix equation
- Deterministic and randomized Kaczmarz methods for AXB=C with applications to color image restoration
- On sketch-and-project methods for solving tensor equations
- Efficient image reconstruction via regularized variable s-step conjugate gradient method for Sylvester matrix equations
- A low-rank global Krylov squared Smith method for solving large-scale Stein matrix equation
- Discrete gradient-zeroing neural network algorithm for solving future Sylvester equation aided with left-right four-step rule as well as robot arm inverse kinematics
- Dimension reduction for optimal design problems with Kronecker product structure
- Sketch-and-project method to semi-supervised graph-based learning via Sylvester-class matrix equation
- On the alternating randomized row-action methods with the application to data fitting
This page was built for publication: Developing Kaczmarz method for solving Sylvester matrix equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2094980)
