Results 81 to 90 of about 155 (114)

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

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

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? 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  

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

A Stable Numerical Method For Inverting Shape From Moments

, 1997
. We derive a stable technique, based upon matrix pencils, for the reconstruction of (or approximation by) polygonal shapes from moments. Wepoint out that this problem can be considered the dual of 2 ; D numerical quadrature over polygonal domains.
Peyman Milanfar, Gene H. Golub, James Varah   +2 more
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

The Parameterized SR Algorithm For Symplectic (Butterfly) Matrices

, 2007
. The SR algorithm is a structure-preserving algorithm for computing the spectrum of symplectic matrices. Any symplectic matrix can be reduced to symplectic butterfly form.
H. Faßbender
core  

The Generalized Newton Iteration for the Matrix Sign Function

, 1997
. In this paper we present modified algorithms for computing deflating subspaces of matrix pencils by means of the matrix sign function. Specifically, our new algorithms reduce the number of iterations to half, cut the cost of each Newton iteration by ...
Enrique S. Quintana-Orti, Xiaobai Sun, Enrique   +2 more
core