The steepest descent of gradient-based iterative method for solving rectangular linear systems with an application to Poisson's equation
From MaRDI portal
Publication:2078458
DOI10.1186/s13662-020-02715-9zbMath1482.65052OpenAlexW3033257446MaRDI QIDQ2078458
Adisorn Kittisopaporn, Pattrawut Chansangiam
Publication date: 28 February 2022
Published in: Advances in Difference Equations (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13662-020-02715-9
Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Iterative numerical methods for linear systems (65F10)
Related Items (3)
Approximated least-squares solutions of a generalized Sylvester-transpose matrix equation via gradient-descent iterative algorithm ⋮ Convergence analysis of gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle ⋮ Gradient-descent iterative algorithm for solving a class of linear matrix equations with applications to heat and Poisson equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative algorithms for \(X+A^{\mathrm T}X^{-1}A=I\) by using the hierarchical identification principle
- A property of the eigenvalues of the symmetric positive definite matrix and the iterative algorithm for coupled Sylvester matrix equations
- A modified gradient based algorithm for solving Sylvester equations
- Gradient based and least squares based iterative algorithms for matrix equations \(AXB + CX^{T}D = F\)
- The accelerated gradient based iterative algorithm for solving a class of generalized Sylvester-transpose matrix equation
- Gradient based iterative solutions for general linear matrix equations
- Modified two-point stepsize gradient methods for unconstrained optimization
- A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations
- The relaxed gradient based iterative algorithm for solving matrix equations \(A_iXB_i=F_i\)
- Hierarchical gradient-based identification of multivariable discrete-time systems
- Analysis of monotone gradient methods
- The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\)
- Two modified least-squares iterative algorithms for the Lyapunov matrix equations
- On single-step HSS iterative method with circulant preconditioner for fractional diffusion equations
- Gradient estimation algorithms for the parameter identification of bilinear systems using the auxiliary model
- The gradient-based iterative estimation algorithms for bilinear systems with autoregressive noise
- Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
- Iterative least-squares solutions of coupled sylvester matrix equations
- On Hermitian and Skew-Hermitian Splitting Ietration Methods for the Continuous Sylvester Equations
- Extrapolated Iterative Methods for Linear Systems Approximation
- On Iterative Solutions of General Coupled Matrix Equations
- The Convergence of Accelerated Overrelaxation Iterations
- Two-Point Step Size Gradient Methods
- Hierarchical least squares identification methods for multivariable systems
- Gradient based iterative algorithms for solving a class of matrix equations
- Observer-based Adaptive fuzzy control of time-delay uncertain nonlinear systems
This page was built for publication: The steepest descent of gradient-based iterative method for solving rectangular linear systems with an application to Poisson's equation