论文信息 - Rational Krylov Algorithms for Eigenvalue Computation and Model Reduction - 字舞流文

Rational Krylov Algorithms for Eigenvalue Computation and Model Reduction

Rational Krylov is an extension of the Lanczos or Arnoldi eigenvalue algorithm where several shifts (matrix factorizations) are performed in one run. A variant has been developed, where these factorizations are performed in parallel.

Daniel Skoogh | Axel Ruhe

[1] Axel Ruhe,et al. Eigenvalue algorithms with several factorizations -- a unified theory yet? , 1998 .

[2] Axel Ruhe,et al. Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils , 1998, SIAM J. Sci. Comput..

[3] R. W. Freund,et al. Circuit Simulation Techniques Based on Lanczos-Type Algorithms , 1997 .

[4] Ibrahim M. Elfadel,et al. Zeros and passivity of Arnoldi-reduced-order models for interconnect networks , 1997, DAC.

[5] Hans O. Karlsson. Atomic and molecular density-of-states by direct Lanczos methods , 1994 .

[6] Axel Ruhe,et al. The spectral transformation Lánczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems , 1980 .

[7] R. Freund. Reduced-Order Modeling Techniques Based on Krylov Subspaces and Their Use in Circuit Simulation , 1999 .

[8] I. Elfadel,et al. A block rational Arnoldi algorithm for multipoint passive model-order reduction of multiport RLC networks , 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[9] Daniel Skoogh. A rational Krylov method for model order reduction , 1998 .

[10] I. Elfadel,et al. A block rational Arnoldi algorithm for multipoint passive model-order reduction of multiport RLC networks , 1997, ICCAD 1997.