๐๐๐
-methods for the eigenvalue problem with large sparse matrices
๐๐๐
-methods for the eigenvalue problem with large sparse matrices
The eigenvalue problem <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A x equals lamda upper B x"> <mml:semantics> <mml:mrow> <mml:mi>A</mml:mi> <mml:mi>x</mml:mi> <mml:mo>=</mml:mo> <mml:mi>ฮป<!-- ฮป --></mml:mi> <mml:mi>B</mml:mi> <mml:mi>x</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">Ax = \lambda Bx</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, where <italic>A</italic> and <italic>B</italic> are large and sparse symmetric matrices, is considered. An iterative algorithm for โฆ