Complex shift and invert strategies for real matrices (Q1091758): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(87)90126-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977369260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The principle of minimized iterations in the solution of the matrix eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioning strategies for models of incompressible flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: The QR Transformation A Unitary Analogue to the LR Transformation--Part 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simultaneous Iteration Algorithm for Real Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674306 / rank
 
Normal rank

Latest revision as of 09:48, 18 June 2024

scientific article
Language Label Description Also known as
English
Complex shift and invert strategies for real matrices
scientific article

    Statements

    Complex shift and invert strategies for real matrices (English)
    0 references
    0 references
    0 references
    1987
    0 references
    Algorithms for the nonsymmetric eigenvalue problem \((F-\lambda M)X=0\) with real matrices are studied. It is shown that the symmetry around the real axis can be exploited in algorithms based on inverse iteration. Algorithm are developed which use either the real or the imaginary part of \((F-\lambda M)^{-1}M\), obtained by a complex banded Gaussian elimination. Numerical results are given for an example arising from a brusselator model of a tubular chemical reactor.
    0 references
    nonsymmetric eigenvalue problem
    0 references
    inverse iteration
    0 references
    Algorithm
    0 references
    banded Gaussian elimination
    0 references
    Numerical results
    0 references
    tubular chemical reactor
    0 references
    0 references

    Identifiers