Results 81 to 90 of about 160 (114)

Refined saddle-point preconditioners for discretized Stokes problems. [PDF]

Numer Math (Heidelb), 2018
Pearson JW, Pestana J, Silvester DJ.
europepmc   +1 more source

An Evaluation of Software for Computing Eigenvalues of Sparse Nonsymmetric Matrices

The past few years have seen a significant increase in research into numerical methods for computing selected eigenvalues of large sparse nonsymmetric matrices. This research has begun to lead to the development of high-quality mathematical software. The
Lehoucq Scott, R. B. Lehoucq, J. A. Scott   +2 more
core  

Infinite Eigenvalues and the QZ Algorithm

, 1999
The implicitly shifted (bulge chasing ) QZ algorithm is the most popular method for solving the generalized eigenvalue problem Av = Bv. This paper explains why the QZ algorithm functions well even in the presence of infinite eigenvalues. The key to rapid
David S. Watkins, Preprint Sfb
core  

A simple, randomized algorithm for diagonalizing normal matrices. [PDF]

Calcolo
He H, Kressner D.
europepmc   +1 more source

If A Matrix Has Only A Single Eigenvalue How Sensitive Is This Eigenvalue?

, 1997
. For matrices with a single eigenvalue we analyse the sensitivity of the eigenvalue to perturbations in the matrix. We derive a closed form result that is similar in spirit to an analytical result by Lidskii; improve a bound by Henrici; and express the ...
Grace E. Cho, Ilse C.F. Ipsen
core  

Analysis of eigenvalue condition numbers for a class of randomized numerical methods for singular matrix pencils. [PDF]

BIT Numer Math
Kressner D, Plestenjak B.
europepmc   +1 more source

Restarting iterative projection methods for Hermitian nonlinear eigenvalue problems with minmax property. [PDF]

Numer Math (Heidelb), 2017
Betcke MM, Voss H.
europepmc   +1 more source

If A Matrix Has Only A Single Eigenvalue How Sensitive Is This Eigenvalue? II

, 1998
. For matrices with a single eigenvalue the sensitivity of the eigenvalue to perturbations in the matrix is analyzed. Simple bounds are derived that separate the influence of the index on the eigenvalue sensitivity from the influence of the non-normality.
Grace E. Cho, C. F. Ipsen, Ilse
core  

Randomized methods for computing joint eigenvalues, with applications to multiparameter eigenvalue problems and root finding. [PDF]

Numer Algorithms
He H, Kressner D, Plestenjak B.
europepmc   +1 more source

Identifying key papers within a journal via network centrality measures. [PDF]

Scientometrics, 2016
Diallo SY, Lynch CJ, Gore R, Padilla JJ.
europepmc   +1 more source