Abstract
One considers the generalized eigenvalue problem (A0λ−A1)x=0, (1) when one or both matrices A0,A1 are singular and ker A0 ∩ ker A1=φ is the empty set. With the aid of the normalized process, the solving of problem (1) reduces to the solving of the eigenvalue problem of a constant matrix of order r=min (r0,r1), where r0,r1 are the ranks of the matrices A0,A1, which are determined at the normalized decomposition of the matrices. One gives an Algol program which performs the presented algorithm and testing examples.
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.
