Continuation of invariant subspaces (Q4828882)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2119480
Language Label Description Also known as
default for all languages
No label defined
    English
    Continuation of invariant subspaces
    scientific article; zbMATH DE number 2119480

      Statements

      Continuation of invariant subspaces (English)
      0 references
      0 references
      0 references
      26 November 2004
      0 references
      parameter dependent matrices
      0 references
      smooth similarity transformation
      0 references
      matrix valued real function
      0 references
      continuation of invariant subspaces
      0 references
      algorithm
      0 references
      orthogonal matrix factorization
      0 references
      smooth block Schur factorization
      0 references
      numerical experiments
      0 references
      adaptive Newton iteration
      0 references
      singular value decomposition
      0 references
      The basic problem of computing a smooth similarity transformation to block triangular form of a matrix valued real function is formulated. The continuation of invariant subspaces (CIS) algorithm generates a smooth path of orthogonal matrix factorizations. It can be viewed as a continuous analog of standard linear algebra techniques. In the context of smooth block Schur factorization, the authors use the underlying differential equations governing the evolution of the singular value decomposition factors in order to obtain initial approximations of the exact factors. An adaptive Newton iteration is then used to refine these approximations. The paper contains a proof of the existence of a \(C^k\) orthogonal parameter dependent function \(Q(t)\), \(t \in \langle 0,1 \rangle ,\) by which the block triangularization of a given \(C^k\) matrix valued real function \(A(t)\), \(t \in \langle 0,1 \rangle ,\) is achieved. The CIS algorithm is described and its implementation aspects are discussed. Numerical experiments of both ``easy problems'' (well-separated blocks and slowly varying eigenvalues and subspaces) and ``harder problems'' (weakly separated blocks and/or rapidly varying eigenvalues or subspaces) are analyzed.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references