The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action (Q1855446): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: JDQR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: mctoolbox / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: IRAM / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4] / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Riccati equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4433919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matlab code for sorting real Schur forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Finite Precision Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Davidson Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three methods for refining estimates of invariant subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geometry of Algorithms with Orthogonality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part I: Versal Deformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3748420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation theory and backward error for \(AX - XB = C\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Krylov-subspace methods for the Sylvester equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4383439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restarting the Arnoldi method for large nonsymmetric eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arnoldi-Riccati method for large eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numerical solution of \(AX-XB=C\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effects of inexact solvers in algorithms for symmetric eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Application of Polynomial Filters in a <i>k</i>-Step Arnoldi Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation Theory for Algebraic Riccati Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis of the algebraic Riccati equations / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0024-3795(02)00392-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079508024 / rank
 
Normal rank

Latest revision as of 11:10, 30 July 2024

scientific article
Language Label Description Also known as
English
The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action
scientific article

    Statements

    The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action (English)
    0 references
    5 February 2003
    0 references
    This paper concentrates on numerical methods for computing Lipschitz-stable invariant subspaces. This is achieved through corrections to subspaces, corrections which satisfy a generalised algebraic Riccati equation. This is a tensor or Kronecker product operator, and the formulation is in tensor products of Krylov subspaces, and the algorithms can be interpreted as Riccati versions of subspace iteration and block Rayleigh quotient iteration. The paper ends with some numerical examples and comparisons with the Jacobi-Davidson method.
    0 references
    Ritz-Galerkin method
    0 references
    comparison of methods
    0 references
    algebraic Riccati equation
    0 references
    tensor products
    0 references
    invariant subspace
    0 references
    orthogonal corrections
    0 references
    stability
    0 references
    Krylov subspaces
    0 references
    subspace iteration
    0 references
    block Rayleigh quotient iteration
    0 references
    numerical examples
    0 references
    Jacobi-Davidson method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers