A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations (Q1644283)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations

scientific article; zbMATH DE number 6892704

Language	Label	Description	Also known as
default for all languages	No label defined
English	A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations	scientific article; zbMATH DE number 6892704

Statements

instance of

scholarly article

0 references

title

A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations (English)

0 references

author

Xingping Sheng

0 references

published in

Journal of the Franklin Institute

0 references

publication date

21 June 2018

0 references

zbMATH Keywords

relaxed gradient based iterative (RGI) algorithm

0 references

coupled Sylvester matrix equations

0 references

maximum convergence rate

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

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

0 references

cites work

Pole assignment via Sylvester's equation

0 references

Solutions of the equation AV+BW=VF and their application to eigenstructure assignment in linear systems

0 references

On the solution to the Sylvester matrix equation AV+BW=EVF

0 references

A new solution to the generalized Sylvester matrix equation $AV-EVF=BW$

0 references

Unified gradient approach to performance optimization under a pole assignment constraint.

0 references

A gradient flow approach to the robust pole‐placement problem

0 references

Pole assignment with optimal spectral conditioning

0 references

Pole assignment with eigenvalue and stability robustness

0 references

Robust Partial Pole Assignment for Vibrating Systems With Aerodynamic Effects

0 references

Gradient-based maximal convergence rate iterative method for solving linear matrix equations

0 references

A novel numerical method for exact model matching problem with stability

0 references

Regularization of Singular Systems by Derivative and Proportional Output Feedback

0 references

Minimum norm regularization of descriptor systems by mixed output feedback

0 references

Disturbance Decoupling for Descriptor Systems by State Feedback

0 references

Numerically Reliable Computing for the Row by Row Decoupling Problem with Stability

0 references

On the solution of a Sylvester equation appearing in descriptor systems control theory

0 references

The generalised Sylvester matrix equations over the generalised bisymmetric and skew-symmetric matrices

0 references

Convergence of an iterative method for solving Sylvester matrix equations over reflexive matrices

0 references

On the generalized bisymmetric and skew-symmetric solutions of the system of generalized Sylvester matrix equations

0 references

Generalized solution sets of the interval generalized Sylvester matrix equation $\sum_{i=1}^p\mathbf A_iX_i+\sum_{j=1}^qY_j\mathbf B_j=\mathbf C$ and some approaches for inner and outer estimations

0 references

Block Krylov subspace methods for solving large Sylvester equations

0 references

Krylov-subspace methods for the Sylvester equation

0 references

On solutions of matrix equation $XF-AX=C$ and $XF-A\widetilde{X}=C$ over quaternion field

0 references

Almost non-interacting control by measurement feedback

0 references

Consistency for bi(skew)symmetric solutions to systems of generalized Sylvester equations over a finite central algebra

0 references

A system of real quaternion matrix equations with applications

0 references

Solution to Generalized Sylvester Matrix Equations

0 references

Gradient based iterative solutions for general linear matrix equations

0 references

On the generalized Sylvester mapping and matrix equations

0 references

The maximum likelihood least squares based iterative estimation algorithm for bilinear systems with autoregressive moving average noise

0 references

Least-squares-based iterative and gradient-based iterative estimation algorithms for bilinear systems

0 references

The gradient-based iterative estimation algorithms for bilinear systems with autoregressive noise

0 references

Hierarchical gradient-based identification of multivariable discrete-time systems

0 references

Hierarchical least squares identification methods for multivariable systems

0 references

Hierarchical identification of lifted state-space models for general dual-rate systems

0 references

An implicit preconditioning strategy for large-scale generalized Sylvester equations

0 references

Gradient based iterative algorithms for solving a class of matrix equations

0 references

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

0 references

A relaxed gradient based algorithm for solving Sylvester equations

0 references

The accelerated gradient based iterative algorithm for solving a class of generalized Sylvester-transpose matrix equation

0 references

Consistency of a pair of generalized Sylvester equations

0 references

A Perturbation Analysis of the Generalized Sylvester Equation $( AR - LB,DR - LE ) = ( C,F )$

0 references

Iterative least-squares solutions of coupled sylvester matrix equations

0 references

On Iterative Solutions of General Coupled Matrix Equations

0 references

Identifiers

zbMATH Open document ID

1390.93305

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.JFRANKLIN.2018.04.008

0 references

Sitelinks

Mathematics(1 entry)

mardi A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations