Continuation of invariant subspaces

DOI10.1002/nla.245zbMath1055.65054MaRDI QIDQ4828882

Luca Dieci, Mark J. Friedman

Publication date: 26 November 2004

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.245

zbMATH Keywords

algorithm; singular value decomposition; numerical experiments; continuation of invariant subspaces; parameter dependent matrices; adaptive Newton iteration; matrix valued real function; orthogonal matrix factorization; smooth block Schur factorization; smooth similarity transformation

Mathematics Subject Classification ID

65H10: Numerical computation of solutions to systems of equations

65F05: Direct numerical methods for linear systems and matrix inversion

15A54: Matrices over function rings in one or more variables

Related Items

IMPROVED DETECTION OF BIFURCATIONS IN LARGE NONLINEAR SYSTEMS VIA THE CONTINUATION OF INVARIANT SUBSPACES ALGORITHM, Smooth Schur factorizations in the continuation of separatrices, Efficient computation of analytic bases in Evans function analysis of large systems, ON THE LOCATION AND CONTINUATION OF HOPF BIFURCATIONS IN LARGE-SCALE PROBLEMS

Cites Work

• Three methods for refining estimates of invariant subspaces
• On the computation of multi-dimensional solution manifolds of parametrized equations
• Numerical computation of an analytic singular value decomposition of a matrix valued function
• Differential equations for the analytic singular value decomposition of a matrix
• The Numerical Computation of Connecting Orbits in Dynamical Systems
• A Hessenberg-Schur method for the problem AX + XB= C
• Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
• On Smooth Decompositions of Matrices
• Computing Connecting Orbits via an Improved Algorithm for Continuing Invariant Subspaces