Titlebook: Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing; EPASA 2015, Tsukuba, Tetsuya Sakurai,Shao-Liang Zhang,Ta

Corporeal

Improved Coefficients for Polynomial Filtering in ESSEX,. We describe techniques that allow using lower-degree polynomials than possible with standard Chebyshev expansion of the window function and kernel smoothing. With these polynomials, the degree, and thus the number of matrix–vector multiplications, typically can be reduced by roughly one half, resulting in comparable savings in runtime.

愛了嗎

溫和女孩

Numerical Integral Eigensolver for a Ring Region on the Complex Plane,M finds eigenvalues in a specified region on the complex plane and the corresponding eigenvectors by using numerical quadrature. The original SSPM has also been extended to compute the eigenpairs near the circumference of a circle on the complex plane. However these extensions can result in division

一再煩擾

Banquet

The Flexible ILU Preconditioning for Solving Large Nonsymmetric Linear Systems of Equations, derived from the ILU factorization are relayed onto the dropping rules. Recently, Zhang et al.?(Numer Linear Algebra Appl 19:555–569, 2011) proposed a Flexible incomplete Cholesky (IC) factorization for symmetric linear systems. This paper is a study of the extension of the IC factorization to the

全部

Improved Coefficients for Polynomial Filtering in ESSEX,In this paper we first briefly summarize some key achievements that have been made within this project..Then we focus on a projection-based eigensolver with polynomial approximation of the projector. This eigensolver can be used for computing hundreds of interior eigenvalues of large sparse matrices

Cardiac-Output

Eigenspectrum Calculation of the ,(,)-Improved Wilson-Dirac Operator in Lattice QCD Using the Sakurtice QCD). The Sakurai-Sugiura (SS) method?(Sakurai and Sugiura, J Comput Appl Math 159:119, 2003) is employed here, which is based on a contour integral, allowing us to obtain desired eigenvalues located inside a given contour of the complex plane. We apply the method here to calculating several lo

Magisterial

能量守恒

Preconditioned Iterative Methods for Eigenvalue Counts,s useful in a number of applications. It can also be used to develop an efficient spectrum-slicing strategy to compute many eigenpairs of a Hermitian matrix. Our method is based on the Lanczos- and Arnoldi-type of iterations. We show that with a properly defined preconditioner, only a few iterations

Initial