The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action (Q1855446): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 04:57, 5 March 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