- Journal Home
- Volume 22 - 2025
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
By simply transforming the quadratic matrix equation into an equivalent fixed-point equation, we construct a successive approximation method and a Newton's method based on this fixed-point equation. Under suitable conditions, we prove the local convergence of these two methods, as well as the linear convergence speed of the successive approximation method and the quadratic convergence speed of the Newton's method. Numerical results show that these new methods are accurate and effective when they are used to solve the quadratic matrix equation.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/951.html} }By simply transforming the quadratic matrix equation into an equivalent fixed-point equation, we construct a successive approximation method and a Newton's method based on this fixed-point equation. Under suitable conditions, we prove the local convergence of these two methods, as well as the linear convergence speed of the successive approximation method and the quadratic convergence speed of the Newton's method. Numerical results show that these new methods are accurate and effective when they are used to solve the quadratic matrix equation.