On Adaptive Choice of Shifts in Rational Krylov Subspace Reduction of Evolutionary Problems
We compute $u(t)=\exp(-tA)\varphi$ using rational Krylov subspace reduction for $0\leq t<\infty$, where $u(t),\varphi\in\mathbf{R}^N$ and $0<A=A^*\in\mathbf{R}^{N\times N}$. A priori optimization of the rational Krylov subspaces for this problem was considered in [V. Druskin, L. Knizhnerman, a...
Main Authors: | Druskin, Vladimir, Lieberman, Chad E., Zaslavsky, Mikhail |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
Format: | Article |
Language: | en_US |
Published: |
Society of Industrial and Applied Mathematics (SIAM)
2011
|
Online Access: | http://hdl.handle.net/1721.1/60578 |
Similar Items
-
Krylov subspace estimation
by: Schneider, Michael K. (Michael Klaus)
Published: (2005) -
Convergence of restarted Krylov subspaces to invariant subspaces
by: Beattie, C, et al.
Published: (2001) -
Krylov Subspace Solvers and Preconditioners
by: Vuik C.
Published: (2018-01-01) -
The matrix eigenvalue problem : GR and Krylov subspace methods /
by: 351933 Watkins, David S.
Published: (2007) -
On Ways To Improve Convergence Of
Krylov Subspace Methods
by: Al-Kharusi, Salim Abdullah Surur
Published: (2008)