Back to Search
Start Over
Numerical analysis for the quadratic matrix equations from a modification of fixed‐point type.
- Source :
-
Mathematical Methods in the Applied Sciences . 11/30/2019, Vol. 42 Issue 17, p5856-5866. 11p. - Publication Year :
- 2019
-
Abstract
- In this paper, we study the quadratic matrix equations. To improve the application of iterative schemes, we use a transform of the quadratic matrix equation into an equivalent fixed‐point equation. Then, we consider an iterative process of Chebyshev‐type to solve this equation. We prove that this iterative scheme is more efficient than Newton's method. Moreover, we obtain a local convergence result for this iterative scheme. We finish showing, by an application to noisy Wiener‐Hopf problems, that the iterative process considered is computationally more efficient than Newton's method. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01704214
- Volume :
- 42
- Issue :
- 17
- Database :
- Academic Search Index
- Journal :
- Mathematical Methods in the Applied Sciences
- Publication Type :
- Academic Journal
- Accession number :
- 139686680
- Full Text :
- https://doi.org/10.1002/mma.5726