activity
20082016
most citedA Projected Preconditioned Conjugate Gradient Algorithm for Computing Many Extreme Eigenpairs of a Hermitian Matrix

54 citations · 104 across the 14 of their papers we have counts for

collaborators

15 papers

math.NA2016★ 3 cited

Preconditioned steepest descent-like methods for symmetric indefinite systems

Eugene Vecharynski, Andrew Knyazev

This paper addresses the question of what exactly is an analogue of the preconditioned steepest descent (PSD) algorithm in the case of a symmetric indefinite system with an SPD pre…

math.NA2016

Preconditioned iterative methods for eigenvalue counts

Eugene Vecharynski, Chao Yang

We describe preconditioned iterative methods for estimating the number of eigenvalues of a Hermitian matrix within a given interval. Such estimation is useful in a number of applic…

math.NA2015

A Thick-Restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems

Ruipeng Li, Yuanzhe Xi, Eugene Vecharynski +2

Polynomial filtering can provide a highly effective means of computing all eigenvalues of a real symmetric (or complex Hermitian) matrix that are located in a given interval, anywh…

math.NA2015

A generalization of Saad's bound on harmonic Ritz vectors of Hermitian matrices

Eugene Vecharynski

We prove a Saad's type bound for harmonic Ritz vectors of a Hermitian matrix. The new bound reveals a dependence of the harmonic Rayleigh--Ritz procedure on the condition number of…

physics.chem-ph2015★ 20 cited

An efficient basis set representation for calculating electrons in molecules

Jeremiah R. Jones, Francois-Henry Rouet, Keith V. Lawler +9

The method of McCurdy, Baertschy, and Rescigno, J. Phys. B, 37, R137 (2004) is generalized to obtain a straightforward, surprisingly accurate, and scalable numerical representation…

math.NA2015

Generalized preconditioned locally harmonic residual method for non-Hermitian eigenproblems

Eugene Vecharynski, Chao Yang, Fei Xue

We introduce the Generalized Preconditioned Locally Harmonic Residual (GPLHR) method for solving standard and generalized non-Hermitian eigenproblems. The method is particularly us…

math.NA2015★ 1 cited

Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. II. Interior eigenvalues

Daniel B. Szyld, Eugene Vecharynski, Fei Xue

We consider the solution of large-scale nonlinear algebraic Hermitian eigenproblems of the form that admit a variational characterization of eigenvalues. These problems a…

math.NA2014★ 12 cited

Preconditioned Locally Harmonic Residual Method for Computing Interior Eigenpairs of Certain Classes of Hermitian Matrices

Eugene Vecharynski, Andrew Knyazev

We propose a Preconditioned Locally Harmonic Residual (PLHR) method for computing several interior eigenpairs of a generalized Hermitian eigenvalue problem, without traditional spe…

math.NA2014★ 54 cited

A Projected Preconditioned Conjugate Gradient Algorithm for Computing Many Extreme Eigenpairs of a Hermitian Matrix

Eugene Vecharynski, Chao Yang, John E. Pask

We present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We…

math.NA2013

Fast updating algorithms for latent semantic indexing

Eugene Vecharynski, Yousef Saad

This paper discusses a few algorithms for updating the approximate Singular Value Decomposition (SVD) in the context of information retrieval by Latent Semantic Indexing (LSI) meth…

math.NA2011

Graph partitioning using matrix values for preconditioning symmetric positive definite systems

Eugene Vecharynski, Yousef Saad, Masha Sosonkina

Prior to the parallel solution of a large linear system, it is required to perform a partitioning of its equations/unknowns. Standard partitioning algorithms are designed using the…

math.NA2011★ 12 cited

Absolute value preconditioning for symmetric indefinite linear systems

Eugene Vecharynski, Andrew V. Knyazev

We introduce a novel strategy for constructing symmetric positive definite (SPD) preconditioners for linear systems with symmetric indefinite matrices. The strategy, called absolut…

math.NA2009★ 1 cited

Any decreasing cycle-convergence curve is possible for restarted GMRES

Eugene Vecharynski, Julien Langou

Given a matrix order , a restart parameter (), a decreasing positive sequence , where , it is shown that there exits an -…

math.OC2008★ 1 cited

Solution of large linear systems with embedded network structure for a non-homogeneous network flow programming problem

Ludmila Pilipchuk, Eugene Vecharynski

In the paper we consider the linear underdetermined system of a special type. Systems of this type appear in non-homogeneous network flow programming problems in the form of system…

math.NA2008

The cycle-convergence of restarted GMRES for normal matrices is sublinear

Eugene Vecharynski, Julien Langou

We prove that the cycle-convergence of the restarted GMRES applied to a system of linear equations with a normal coefficient matrix is sublinear.