Skip to search formSkip to main contentSkip to account menu

Arnoldi iteration

Known as: Arnoldi, Arnoldi decomposition, Arnoldi's algorithm 
In numerical linear algebra, the Arnoldi iteration is an eigenvalue algorithm and an important example of iterative methods. Arnoldi finds the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
This paper presents a method of estimating the electromechanical damping and frequency coefficients of interconnected power… 
2009
2009
The restarted Arnoldi algorithm, implemented in the ARPACK software library and MATLAB's eigs command, is among the most common… 
2008
2008
The conventional numerical analysis methods could not perform the rapid system-level simulation to MEMS especially when… 
2006
2006
A three-dimensional (3-D) above-threshold analysis has been performed for laterally antiguided laser structures of the… 
2003
2003
A deflation procedure is introduced that is designed to improve the convergence of an implicitly restarted Arnoldi iteration for… 
2002
2002
In this paper we propose a dynamic noise model to verify functional failures due to crosstalk in high-speed circuits… 
1998
1998
Accelerating the Arnoldi Iteration { Theory and Practice by Chao Yang The Arnoldi iteration is widely used to compute a few… 
1998
1998
A general discussion of applications where numerical solution of large scale matrix eigenvalue problems occur is given and the… 
Highly Cited
1997
Highly Cited
1997
A mathematical model for lossy, multiconductor transmission lines is introduced to facilitate the efficient application of Krylov… 
1993
1993
Lanczos vectors computed in finite precision arithmetic by the three-term recurrence tend to lose their mutual biorthogonality…