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

cathartic

Jürgen Friedrichs,Ulrich SchwingesIn 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

chlorosis

,Beispiele für die Stoffauswahl,tice 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

靦腆

instructive

Uwe-Peter Tietze,Manfred Klika,Hans Wolperss 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

頌揚(yáng)國(guó)家

盡忠

變白

https://doi.org/10.1007/978-3-322-84092-9h predator preys on two or more species is an extension; those involving summations and products of nonlinear terms are referred to as summation-type and product-type hLV systems, respectively. Time-discretizations of these systems are considered in the study of integrable systems, and have been sho

Explicate

https://doi.org/10.1007/978-3-658-16786-8the Shifted Block BiCGGR method. This method is based on the shift-invariance property of Block Krylov subspaces. Using this property, the Shifted systems can be solved in the process of solving the Seed system without matrix-vector multiplications. The Shifted Block BiCGGR method can generate high

gerrymander

保存