The steepest descent of gradient-based iterative method for solving rectangular linear systems with an application to Poisson's equation
type: Item
instance of: scholarly article
title: The steepest descent of gradient-based iterative method for solving rectangular linear systems with an application to Poisson's equation
zbMATH Open document ID: 1482.65052
author: Adisorn Kittisopaporn
author: Pattrawut Chansangiam
published in: Advances in Difference Equations
publication date: 2022-02-28T00:00:00Z
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 41A60
zbMATH DE Number: 7482041
zbMATH Keywords: rectangular linear system
zbMATH Keywords: iterative method
zbMATH Keywords: gradient
zbMATH Keywords: steepest descent
zbMATH Keywords: condition number
zbMATH Keywords: Poisson's equation
MaRDI profile type: Publication
full work available at URL: s13662-020-02715-9
OpenAlex ID: W3033257446
cites work: Q4348513
cites work: Q5639278
cites work: Extrapolated Iterative Methods for Linear Systems Approximation
cites work: The Convergence of Accelerated Overrelaxation Iterations
cites work: Gradient based iterative algorithms for solving a class of matrix equations
cites work: Hierarchical gradient-based identification of multivariable discrete-time systems
cites work: Hierarchical least squares identification methods for multivariable systems
cites work: Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
cites work: Observer-based Adaptive fuzzy control of time-delay uncertain nonlinear systems
cites work: A modified gradient based algorithm for solving Sylvester equations
cites work: The accelerated gradient based iterative algorithm for solving a class of generalized Sylvester-transpose matrix equation
cites work: The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\)
cites work: The relaxed gradient based iterative algorithm for solving matrix equations \(A_iXB_i=F_i\)
cites work: A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations
cites work: The gradient-based iterative estimation algorithms for bilinear systems with autoregressive noise
cites work: Two modified least-squares iterative algorithms for the Lyapunov matrix equations
cites work: On single-step HSS iterative method with circulant preconditioner for fractional diffusion equations
cites work: A property of the eigenvalues of the symmetric positive definite matrix and the iterative algorithm for coupled Sylvester matrix equations
cites work: Iterative algorithms for \(X+A^{\mathrm T}X^{-1}A=I\) by using the hierarchical identification principle
cites work: Gradient based iterative solutions for general linear matrix equations
cites work: Gradient based and least squares based iterative algorithms for matrix equations \(AXB + CX^{T}D = F\)
cites work: Gradient estimation algorithms for the parameter identification of bilinear systems using the auxiliary model
cites work: Iterative least-squares solutions of coupled sylvester matrix equations
cites work: On Iterative Solutions of General Coupled Matrix Equations
cites work: Q4779803
cites work: Two-Point Step Size Gradient Methods
cites work: Q3626659
cites work: Modified two-point stepsize gradient methods for unconstrained optimization
cites work: Analysis of monotone gradient methods
cites work: Q4821526
cites work: On a Hermitian and skew-Hermitian splitting iteration method for continuous Sylvester equations
DOI: 10.1186/S13662-020-02715-9
description: scientific article; zbMATH DE number 7482041