Pages that link to "Item:Q2146340"
From MaRDI portal
The following pages link to On the Kaczmarz methods based on relaxed greedy selection for solving matrix equation \(A X B = C\) (Q2146340):
Displaying 10 items.
- Developing Kaczmarz method for solving Sylvester matrix equations (Q2094980) (← links)
- Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method (Q2095163) (← links)
- On the parameterized two-step iteration method for solving the matrix equation \(AXB=C\) (Q6069410) (← links)
- A pre-defined finite time neural solver for the time-variant matrix equation \(E(t)X(t)G(t)=D(t)\) (Q6495045) (← links)
- On convergence of a sketch-and-project method for the matrix equation \(AXB = C\) (Q6576445) (← links)
- Kaczmarz-type methods for solving matrix equations (Q6590586) (← links)
- A randomized block Douglas-Rachford method for solving linear matrix equation (Q6592872) (← links)
- Tikhonov regularization with conjugate gradient least squares method for large-scale discrete ill-posed problem in image restoration (Q6593404) (← links)
- The parameterized accelerated iteration method for solving the matrix equation \(AXB=C\) (Q6618231) (← links)
- On the randomized block Kaczmarz algorithms for solving matrix equation \(A X B = C\) (Q6664931) (← links)
