نتایج جستجو برای: arnoldi method

تعداد نتایج: 1630255  

Journal: :SIAM J. Scientific Computing 2001
Karl Meerbergen

This paper studies the solution of quadratic eigenvalue problems by the quadratic residual iteration method. The focus is on applications arising from nite-element simulations in acoustics. One approach is the shift-invert Arnoldi method applied to the linearized problem. When more than one eigenvalue is wanted, it is advisable to use locking or de-ation of converged eigenvectors (or Schur vect...

2011
Russell Carden Danny C. Sorensen Noah G. Harding Athanasios C. Antoulas

Ritz Values and Arnoldi Convergence for Non-Hermitian Matrices

2004
Tamara Bechtold Evgenii B. Rudnyi Jan G. Korvink

In this paper, we present three heuristic error indicators for the iterative model order reduction of electro-thermal MEMS models via the Arnoldi algorithm. Such error indicators help a designer to choose an optimal order of the reduced model, required to achieve a desired accuracy, and hence allow a completely automatic extraction of heattransfer macromodels for MEMS. We first suggest a conver...

Journal: :SIAM J. Matrix Analysis Applications 2005
Zhaojun Bai Yangfeng Su

We first introduce a second-order Krylov subspace Gn(A,B;u) based on a pair of square matrices A and B and a vector u. The subspace is spanned by a sequence of vectors defined via a second-order linear homogeneous recurrence relation with coefficient matrices A and B and an initial vector u. It generalizes the well-known Krylov subspace Kn(A;v), which is spanned by a sequence of vectors defined...

2014
Zhongxiao Jia Yuquan Sun

We investigate the generalized second-order Arnoldi (GSOAR) method, a generalization of the SOAR method proposed by Bai and Su [SIAM J. Matrix Anal. Appl., 26 (2005): 640–659.], and the Refined GSOAR (RGSOAR) method for the quadratic eigenvalue problem (QEP). The two methods use the GSOAR procedure to generate an orthonormal basis of a given generalized second-order Krylov subspace, and with su...

2009
Russell Carden Steven J. Cox Danny C. Sorensen Noah G. Harding

Ritz Values and Arnoldi Convergence for Nonsymmetric Matrices by Russell Carden The restarted Arnoldi method, useful for determining a few desired eigenvalues of a matrix, employs shifts to refine eigenvalue estimates. In the symmetric case, using selected Ritz values as shifts produces convergence due to interlacing. For nonsymmetric matrices the behavior of Ritz values is insufficiently under...

2013
Emilio Valbuena-Ureña Fèlix Amat Salvador Carranza

The genus Calotriton includes two species of newts highly adapted to live in cold and fast-flowing mountain springs. The Pyrenean brook newt (Calotriton asper), restricted to the Pyrenean region, and the Montseny brook newt (Calotriton arnoldi), endemic to the Montseny massif and one of the most endangered amphibian species in Europe. In the present manuscript, we use an integrative approach in...

2007
JÖRG LAMPE

The total least squares (TLS) method is a successful approach for linear problems if both the system matrix and the right hand side are contaminated by some noise. For ill-posed TLS problems Renaut and Guo [SIAM J. Matrix Anal. Appl., 26 (2005), pp. 457 476] suggested an iterative method which is based on a sequence of linear eigenvalue problems. Here we analyze this method carefully, and we ac...

2004
Hongbin Guo Rosemary A. Renaut R. A. RENAUT

Fast algorithms, based on the unsymmetric look-ahead Lanczos and the Arnoldi process, are developed for the estimation of the functional (f)= uf(A)v for xed u; v and A, where A∈Rn×n is a largescale unsymmetric matrix. Numerical results are presented which validate the comparable accuracy of both approaches. Although the Arnoldi process reaches convergence more quickly in some cases, it has grea...

Journal: :SIAM Journal on Numerical Analysis 2021

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید