Developing Kaczmarz method for solving Sylvester matrix equations (Q2094980)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Developing Kaczmarz method for solving Sylvester matrix equations	scientific article

Statements

scholarly article

0 references

Developing Kaczmarz method for solving Sylvester matrix equations (English)

0 references

Soheila Ghoroghi Shafiei

0 references

Masoud Hajarian

0 references

Journal of the Franklin Institute

0 references

publication date

9 November 2022

0 references

zbMATH Keywords

Kaczmarz method

0 references

matrix equations

0 references

Sylvester equations

0 references

iterative methods

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.jfranklin.2022.09.028

0 references

On the Sylvester-like matrix equation \(AX+f(X)B=C\)

0 references

Accelerated Smith iterative algorithms for coupled Lyapunov matrix equations

0 references

Gradient based approach for generalized discrete-time periodic coupled Sylvester matrix equations

0 references

Finite iterative solutions to periodic Sylvester matrix equations

0 references

Matrix iterative methods for solving the Sylvester-transpose and periodic Sylvester matrix equations

0 references

A finite iterative algorithm for solving the complex generalized coupled Sylvester matrix equations by using the linear operators

0 references

Block s-step Krylov iterative methods

0 references

0 references

<i>s</i>-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems

0 references

A randomized Kaczmarz algorithm with exponential convergence

0 references

0 references

The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\)

0 references

Computational Methods for Linear Matrix Equations

0 references

On the rate of convergence of the alternating projection method in finite dimensional spaces

0 references

0 references

The rate of convergence for the method of alternating projections. II

0 references

Paved with good intentions: analysis of a randomized block Kaczmarz method

0 references

Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma

0 references

Randomized Kaczmarz Converges Along Small Singular Vectors

0 references

Gradient based iterative algorithms for solving a class of matrix equations

0 references

A modified gradient based algorithm for solving Sylvester equations

0 references

An accelerated Jacobi-gradient based iterative algorithm for solving sylvester matrix equations

0 references

Distributed Design for Nuclear Norm Minimization of Linear Matrix Equations With Constraints

0 references

Distributed Computation of Linear Matrix Equations: An Optimization Perspective

0 references

Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle

0 references

Preconditioned Krylov Subspace Methods for Lyapunov Matrix Equations

0 references

Krylov Subspace Methods for Solving Large Lyapunov Equations

0 references

On robust observer compensator design

0 references

Reduced order observers: A new algorithm and proof

0 references

Some necessary and sufficient conditions for eigenstructure assignment

0 references

Reduced-rank gradient-based algorithms for generalized coupled Sylvester matrix equations and its applications

0 references

Conjugate gradient least squares algorithm for solving the generalized coupled Sylvester matrix equations

0 references

Quasi gradient-based inversion-free iterative algorithm for solving a class of the nonlinear matrix equations

0 references

A recursive parameter estimation algorithm for modeling signals with multi-frequencies

0 references

Recursive least squares and multi-innovation stochastic gradient parameter estimation methods for signal modeling

0 references

Iterative parameter estimation for signal models based on measured data

0 references

The BCR algorithms for solving the reflexive or anti-reflexive solutions of generalized coupled Sylvester matrix equations

0 references

A modified CG algorithm for solving generalized coupled Sylvester tensor equations

0 references

The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint

0 references

Matrix Equation $XA + BX = C$

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.JFRANKLIN.2022.09.028

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2094980

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2094980&oldid=38875791"