Abstract
A structured eigen-problem Ax+F(x)=λx is studied in this paper, where in applications A∈Rn×n is an irreducible Stieltjes matrix. Under certain restrictions, this problem has a unique positive solution. We show that, starting from a multiple of the positive eigenvector of A, the Newton-like algorithm for this eigen-problem is well defined and converges monotonically. Numerical results illustrate the effectiveness of this Newton-like method.
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.
