Abstract
AbstractThe steepest descent and conjugate gradient methods are classical gradient based iterative methods for solving symmetric positive definite linear system . In this article, we are concerned with the numerical solution of the tensor equation by those well‐known iterations in which is an mth order n‐dimensional symmetric tensor. Then we prove that the developed iterative methods converge locally linearly under some appropriate conditions. Finally, some numerical experiments are provided to illustrate the feasibility and effectiveness of the proposed methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
