A preconditioned iteration method for solving Sylvester equations
type: Item
instance of: scholarly article
title: A preconditioned iteration method for solving Sylvester equations
zbMATH Open document ID: 1251.65044
DOI: 10.1155/2012/401059
author: Jituan Zhou
author: Rui-Rui Wang
author: Qiang Niu
published in: Journal of Applied Mathematics
publication date: 2012-11-15T00:00:00Z
review text: Summary: A preconditioned gradient-based iterative method is derived by judicious selection of two auxiliary matrices. The strategy is based on the Newton's iteration method and can be regarded as a generalization of the splitting iterative method for system of linear equations. We analyze the convergence of the method and illustrate that the approach is able to considerably accelerate the convergence of the gradient-based iterative method.
Mathematics Subject Classification ID: 65F08
Mathematics Subject Classification ID: 15A24
zbMATH DE Number: 6106202
zbMATH Keywords: preconditioned gradient-based iterative method
zbMATH Keywords: Newton's iteration method
zbMATH Keywords: splitting iterative method
Wikidata QID: Q58906837
describes a project that uses: Matlab
describes a project that uses: Algorithm 432
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2012/401059
OpenAlex ID: W2105828609
cites work: How and Why to Solve the Operator Equation AX −XB = Y
cites work: Gradient based and least squares based iterative algorithms for matrix equations \(AXB + CX^{T}D = F\)
cites work: Gradient based iterative solutions for general linear matrix equations
cites work: Iterative solutions to matrix equations of the form \(A_{i}XB_{i}=F_{i}\)
cites work: A Hessenberg-Schur method for the problem AX + XB= C
cites work: Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
cites work: Direct methods for matrix Sylvester and Lyapunov equations
cites work: Improving the Efficiency of Matrix Operations in the Numerical Solution of Stiff Ordinary Differential Equations
cites work: Application of ADI Iterative Methods to the Restoration of Noisy Images
cites work: Krylov-subspace methods for the Sylvester equation
cites work: Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\)
cites work: SOR for \(AX-XB=C\)
cites work: Observer-based Adaptive fuzzy control of time-delay uncertain nonlinear systems
cites work: On a Hermitian and skew-Hermitian splitting iteration method for continuous Sylvester equations
cites work: On Iterative Solutions of General Coupled Matrix Equations
cites work: Iterative least-squares solutions of coupled sylvester matrix equations
cites work: Gradient based iterative algorithms for solving a class of matrix equations
cites work: Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
cites work: Gradient-based identification methods for Hammerstein nonlinear ARMAX models
cites work: Convergence of stochastic gradient estimation algorithm for multivariable ARX-like systems
cites work: Multi-innovation stochastic gradient algorithm for multiple-input single-output systems using the auxiliary model
cites work: Parameter estimation with scarce measurements
cites work: Performance analysis of multi-innovation gradient type identification methods
cites work: A two-step matrix-free secant method for solving large-scale systems of nonlinear equations
cites work: Q3909906
cites work: Q4947421
cites work: Q4414855
cites work: A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications
DBLP publication ID: journals/jam/ZhouWN12
description: scientific article; zbMATH DE number 6106202