
doi: 10.1002/nla.245
AbstractIn this work we consider implementation and testing of an algorithm for continuation of invariant subspaces. Copyright © 2001 John Wiley & Sons, Ltd.
algorithm, adaptive Newton iteration, Numerical computation of solutions to systems of equations, Other matrix algorithms, singular value decomposition, Direct numerical methods for linear systems and matrix inversion, smooth similarity transformation, smooth block Schur factorization, Matrices over function rings in one or more variables, continuation of invariant subspaces, orthogonal matrix factorization, parameter dependent matrices, matrix valued real function, numerical experiments
algorithm, adaptive Newton iteration, Numerical computation of solutions to systems of equations, Other matrix algorithms, singular value decomposition, Direct numerical methods for linear systems and matrix inversion, smooth similarity transformation, smooth block Schur factorization, Matrices over function rings in one or more variables, continuation of invariant subspaces, orthogonal matrix factorization, parameter dependent matrices, matrix valued real function, numerical experiments
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 32 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
