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
Recommendations
- Gradient-descent iterative algorithm for solving a class of linear matrix equations with applications to heat and Poisson equations
- Using a simplified gradient method to solve a system of linear equations
- Iterative gradient descent methods for solving linear equations
- On a new iterative method for solving linear systems and comparison results
- An optimally generalized steepest-descent algorithm for solving ill-posed linear systems
Cites work
- A modified gradient based algorithm for solving Sylvester equations
- A property of the eigenvalues of the symmetric positive definite matrix and the iterative algorithm for coupled Sylvester matrix equations
- A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations
- A relaxed gradient based algorithm for solving Sylvester equations
- Analysis of monotone gradient methods
- Extrapolated Iterative Methods for Linear Systems Approximation
- Gradient based and least squares based iterative algorithms for matrix equations \(AXB + CX^{T}D = F\)
- Gradient based iterative algorithms for solving a class of matrix equations
- Gradient based iterative solutions for general linear matrix equations
- Gradient estimation algorithms for the parameter identification of bilinear systems using the auxiliary model
- Hierarchical gradient-based identification of multivariable discrete-time systems
- Hierarchical least squares identification methods for multivariable systems
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1820666 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3366440 (Why is no real title available?)
- Iterative algorithms for \(X+A^{\mathrm T}X^{-1}A=I\) by using the hierarchical identification principle
- Iterative least-squares solutions of coupled sylvester matrix equations
- Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
- Modified two-point stepsize gradient methods for unconstrained optimization
- On a Hermitian and skew-Hermitian splitting iteration method for continuous Sylvester equations
- On Iterative Solutions of General Coupled Matrix Equations
- On single-step HSS iterative method with circulant preconditioner for fractional diffusion equations
- Step-sizes for the gradient method
- The accelerated gradient based iterative algorithm for solving a class of generalized Sylvester-transpose matrix equation
- The Convergence of Accelerated Overrelaxation Iterations
- The gradient-based iterative estimation algorithms for bilinear systems with autoregressive noise
- The relaxed gradient based iterative algorithm for solving matrix equations \(A_iXB_i=F_i\)
- 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
- Two-Point Step Size Gradient Methods
Cited in
(4)- Gradient-descent iterative algorithm for solving a class of linear matrix equations with applications to heat and Poisson equations
- Approximated least-squares solutions of a generalized Sylvester-transpose matrix equation via gradient-descent iterative algorithm
- Iterative gradient descent methods for solving linear equations
- Convergence analysis of gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2078458)
