Continuation of invariant subspaces
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.
- IMPROVED DETECTION OF BIFURCATIONS IN LARGE NONLINEAR SYSTEMS VIA THE CONTINUATION OF INVARIANT SUBSPACES ALGORITHM
- Continuation of singular value decompositions
- Continuation of Invariant Subspaces in Large Bifurcation Problems
- scientific article; zbMATH DE number 4151736
- Numerical computation of bifurcations in large equilibrium systems in \textsc{Matlab}
- A Hessenberg-Schur method for the problem AX + XB= C
- Computing Connecting Orbits via an Improved Algorithm for Continuing Invariant Subspaces
- Differential equations for the analytic singular value decomposition of a matrix
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- Numerical computation of an analytic singular value decomposition of a matrix valued function
- On Smooth Decompositions of Matrices
- On the computation of multi-dimensional solution manifolds of parametrized equations
- The Numerical Computation of Connecting Orbits in Dynamical Systems
- Three methods for refining estimates of invariant subspaces
- Emergence of unstable modes for classical shock waves in isothermal ideal MHD
- Indication of a stability loss in the continuation of invariant subspaces
- On the unitary block-decomposability of 1-parameter matrix flows and static matrices
- Refining estimates of invariant and deflating subspaces for large and sparse matrices and pencils
- Efficient computation of analytic bases in Evans function analysis of large systems
- Spatially quasi-periodic bifurcations from periodic traveling water waves and a method for detecting bifurcations using signed singular values
- Initialization of homoclinic solutions near Bogdanov-Takens points: Lindstedt-Poincaré compared with regular perturbation method
- ON THE LOCATION AND CONTINUATION OF HOPF BIFURCATIONS IN LARGE-SCALE PROBLEMS
- Numerical computation of bifurcations in large equilibrium systems in \textsc{Matlab}
- First-order perturbation theory for eigenvalues and eigenvectors
- Numerical continuation of connecting orbits of maps in MATLAB
- Continuous decompositions and coalescing eigenvalues for matrices depending on parameters
- IMPROVED DETECTION OF BIFURCATIONS IN LARGE NONLINEAR SYSTEMS VIA THE CONTINUATION OF INVARIANT SUBSPACES ALGORITHM
- Pluriharmonic continuation in a fixed direction
- A bisection-like algorithm for branch switching at a simple branch point
- Continuation of eigenvalues and invariant pairs for parameterized nonlinear eigenvalue problems
- Projected nonsymmetric algebraic Riccati equations and refining estimates of invariant and deflating subspaces
- Second-Order Steps, Spectral Accuracy: Discrete Parallel Transport of Invariant Subspaces
- Smooth Schur factorizations in the continuation of separatrices
This page was built for publication: Continuation of invariant subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828882)