標(biāo)題: Titlebook: Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing; EPASA 2015, Tsukuba, Tetsuya Sakurai,Shao-Liang Zhang,Ta [打印本頁] 作者: NK871 時間: 2025-3-21 18:16
書目名稱Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing影響因子(影響力)
書目名稱Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing影響因子(影響力)學(xué)科排名
書目名稱Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing網(wǎng)絡(luò)公開度
書目名稱Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing被引頻次
書目名稱Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing被引頻次學(xué)科排名
書目名稱Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing年度引用
書目名稱Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing年度引用學(xué)科排名
書目名稱Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing讀者反饋
書目名稱Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing讀者反饋學(xué)科排名
作者: BRAND 時間: 2025-3-21 22:09
978-3-319-87309-1Springer International Publishing AG 2017作者: Adulate 時間: 2025-3-22 02:35
Computation of Eigenvectors for a Specially Structured Banded Matrix,eigenvectors. We show that the eigenvector entries are arranged radiating out from the origin on the complex plane. This property enables us to efficiently compute all the eigenvectors. Although the intended matrix has complex eigenvalues, the proposed method can compute all the complex eigenvectors using only arithmetic of real numbers.作者: 假裝是你 時間: 2025-3-22 08:24 作者: 花束 時間: 2025-3-22 10:15 作者: 辯論的終結(jié) 時間: 2025-3-22 13:59
Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing978-3-319-62426-6Series ISSN 1439-7358 Series E-ISSN 2197-7100 作者: 辯論的終結(jié) 時間: 2025-3-22 19:51 作者: 舊病復(fù)發(fā) 時間: 2025-3-23 00:57
. In this paper, we provide an error resilience strategy of a Rayleigh–Ritz type complex moment-based parallel eigensolver for solving generalized eigenvalue problems. Our strategy is based on an error bound of the eigensolver in the case that soft-errors like bit-flip occur. Using the error bound, 作者: 危機(jī) 時間: 2025-3-23 01:51 作者: 大猩猩 時間: 2025-3-23 05:51
Geowissenschaftsdidaktische Forschung,cution time in parallel processing owing to the communication cost and the number of floating-point operations. To overcome this problem, we focus on real symmetric band eigensolvers proposed by Gupta and Murata since their eigensolvers are composed of the bisection and inverse iteration algorithms 作者: cathartic 時間: 2025-3-23 17:17
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 時間: 2025-3-23 18:08
,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作者: 靦腆 時間: 2025-3-24 01:25 作者: instructive 時間: 2025-3-24 03:44
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)國家 時間: 2025-3-24 09:03 作者: 盡忠 時間: 2025-3-24 12:02 作者: 變白 時間: 2025-3-24 18:55
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 時間: 2025-3-24 22:20
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 時間: 2025-3-25 02:52 作者: 保存 時間: 2025-3-25 06:35 作者: hair-bulb 時間: 2025-3-25 08:27 作者: output 時間: 2025-3-25 14:48
Der methodologische Standpunkt der EC,re .(.) is an analytic matrix valued function, by several authors. To the best of the authors’ knowledge, existing derivations of these methods rely on canonical forms of an analytic matrix function such as the Smith form or the theorem of Keldysh. While these theorems are powerful tools, they requi作者: erythema 時間: 2025-3-25 17:02 作者: critique 時間: 2025-3-25 21:05
Christina Holtz-Bacha,Eva-Maria LessingerLinear response eigenvalue problems arise from the calculation of excitation states of many-particle systems in computational materials science. In this paper, from the point of view of numerical linear algebra and matrix computations, we review the progress of linear response eigenvalue problems in theory and algorithms since 2012.作者: strain 時間: 2025-3-26 01:11 作者: 多骨 時間: 2025-3-26 05:55
1439-7358 novel numerical libraries for solving eigenvalue problems.In.This book provides state-of-the-art and interdisciplinary topics on solving matrix eigenvalue problems, particularly by using recent petascale and upcoming post-petascale supercomputers. It gathers selected topics presented at the Internat作者: SPER 時間: 2025-3-26 08:58
envalue problems. Our strategy is based on an error bound of the eigensolver in the case that soft-errors like bit-flip occur. Using the error bound, we achieve an inherent error resilience of the eigensolver that does not require standard checkpointing and replication techniques in the most time-consuming part.作者: 倫理學(xué) 時間: 2025-3-26 13:29 作者: Deadpan 時間: 2025-3-26 16:58 作者: 弄污 時間: 2025-3-26 23:13 作者: multiply 時間: 2025-3-27 02:56
https://doi.org/10.1007/978-3-658-16786-8e error of the matrix multiplications appearing in the algorithm. In this paper, we improve the accuracy of the approximate solutions of the Shifted systems generated by the Shifted Block BiCGGR method.作者: compassion 時間: 2025-3-27 08:08
Von der Arithmetik zur Algebra,when eigenvectors are unnecessary. Our technique is also beneficial in cases where eigenvectors are necessary, because the residual norms of the target eigenpairs can be cheaply computed and monitored during each iteration step of the inner linear solver.作者: Sleep-Paralysis 時間: 2025-3-27 11:00
,“Never Was There More to Do.”,ategorize the recent advances in this field from the perspective of compute-memory tradeoff, which has not been considered in much detail in this area. Benchmark tests reveal that there is a large difference in the memory consumption and performance between the different methods.作者: synovial-joint 時間: 2025-3-27 16:56
Numerical Integral Eigensolver for a Ring Region on the Complex Plane,avoid a decrease in the computational accuracy of the eigenpairs resulting from locating the quadrature points near the eigenvalues. We implement the proposed method in the SLEPc library, and examine its performance on a supercomputer cluster with many-core architecture.作者: 發(fā)酵劑 時間: 2025-3-27 18:01 作者: 輕率的你 時間: 2025-3-27 23:33
Accuracy Improvement of the Shifted Block BiCGGR Method for Linear Systems with Multiple Shifts ande error of the matrix multiplications appearing in the algorithm. In this paper, we improve the accuracy of the approximate solutions of the Shifted systems generated by the Shifted Block BiCGGR method.作者: Biofeedback 時間: 2025-3-28 05:52 作者: 表否定 時間: 2025-3-28 09:44 作者: CLAY 時間: 2025-3-28 12:05 作者: 新娘 時間: 2025-3-28 16:20
,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) 時間: 2025-3-28 20:18 作者: freight 時間: 2025-3-28 23:56
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.作者: 殘忍 時間: 2025-3-29 03:57
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 時間: 2025-3-29 08:45
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..作者: 思考才皺眉 時間: 2025-3-29 13:00
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 時間: 2025-3-29 16:25
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.作者: 外來 時間: 2025-3-29 23:00 作者: AVID 時間: 2025-3-30 02:40 作者: output 時間: 2025-3-30 04:47
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.作者: Corporeal 時間: 2025-3-30 08:21
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.作者: 愛了嗎 時間: 2025-3-30 14:21 作者: 溫和女孩 時間: 2025-3-30 19:17
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作者: 一再煩擾 時間: 2025-3-30 23:10 作者: Banquet 時間: 2025-3-31 03:08
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 作者: 全部 時間: 2025-3-31 08:05
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 時間: 2025-3-31 09:41
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 時間: 2025-3-31 17:21 作者: 能量守恒 時間: 2025-3-31 18:45
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 時間: 2025-3-31 23:01 作者: Innovative 時間: 2025-4-1 03:30 作者: Outwit 時間: 2025-4-1 06:34
Monotonic Convergence to Eigenvalues of Totally Nonnegative Matrices in an Integrable Variant of thh 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作者: MORT 時間: 2025-4-1 12:08 作者: 潛移默化 時間: 2025-4-1 16:02
,Memory-Saving Technique for the Sakurai–Sugiura Eigenvalue Solver Using the Shifted Block Conjugatee of their highly coarse-grained parallelism. In this paper, we propose a memory-saving technique for a variant of the Sakurai–Sugiura method. The proposed technique can be utilized when inner linear systems are solved with the shifted block conjugate gradient method. Using our technique, eigenvalue作者: 粗野 時間: 2025-4-1 19:54 作者: 史前 時間: 2025-4-2 01:50 作者: 臆斷 時間: 2025-4-2 06:29
