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

新娘

,Properties of Definite Bethe–Salpeter Eigenvalue Problems,iltonian matrix is definite, the corresponding eigenvalue problem can be reduced to a symmetric eigenvalue problem. However, its special structure leads to a number of interesting spectral properties. We describe these properties that are crucial for developing efficient and reliable numerical algorithms for solving this class of problems.

倒轉(zhuǎn)

freight

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

殘忍

Conference proceedings 2017coming post-petascale supercomputers. It gathers selected topics presented at the International Workshops on Eigenvalue Problems: Algorithms; Software and Applications, in Petascale Computing (EPASA2014 and EPASA2015), which brought together leading researchers working on the numerical solution of m

cloture

Conference proceedings 2017ics presented in the book, including novel numerical algorithms, high-performance implementation techniques, software developments and sample applications, will contribute to various fields that involve solving large-scale eigenvalue problems..

思考才皺眉

https://doi.org/10.1007/978-3-322-84092-9ith the time-discretization of the product-type hLV system, and then clarify how the solutions approach an equilibrium corresponding to the eigenvalues of TN matrices in the final phase of convergence.

gregarious

Der methodologische Standpunkt der EC,derivation uses only the analyticity of the eigenvalues and eigenvectors of a parametrized matrix .(.), which is a standard result in matrix perturbation theory. Thus we expect that our approach will provide an easily accessible path to the theory of nonlinear SS-type methods.

外來(lái)

AVID

output

The Flexible ILU Preconditioning for Solving Large Nonsymmetric Linear Systems of Equations,nonsymmetric case. The new algorithm is called the Crout version of the flexible ILU factorization, and attempts to reduce the number of nonzero elements in the preconditioner and computation time during the GMRES iterations. Numerical results show that our approach is effective and useful.