Speeding Up Krylov Subspace Methods for Computing via Randomization
This work is concerned with the computation of the action of a matrix function f (A), such as
the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this …
the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this …
[图书][B] A Journey through the History of Numerical Linear Algebra
C Brezinski, G Meurant, M Redivo-Zaglia - 2022 - SIAM
A Journey through the History of Numerical Linear Algebra: Back Matter Page 1 Bibliography
[1] A. Abdelfattah, H. Anzt, A. Bouteiller, A. Danalis, JJ Dongarra, M. Gates, A. Haidar, J. Kurzak …
[1] A. Abdelfattah, H. Anzt, A. Bouteiller, A. Danalis, JJ Dongarra, M. Gates, A. Haidar, J. Kurzak …
Residual and Restarting in Krylov Subspace Evaluation of the Function
An efficient Krylov subspace algorithm for computing actions of the φ matrix function for large
matrices is proposed. This matrix function is widely used in exponential time integration …
matrices is proposed. This matrix function is widely used in exponential time integration …
Limited‐memory polynomial methods for large‐scale matrix functions
Matrix functions are a central topic of linear algebra, and problems requiring their numerical
approximation appear increasingly often in scientific computing. We review various limited …
approximation appear increasingly often in scientific computing. We review various limited …
Challenges in computing matrix functions
This manuscript summarizes the outcome of the focus groups at" The f (A) bulous workshop
on matrix functions and exponential integrators", held at the Max Planck Institute for …
on matrix functions and exponential integrators", held at the Max Planck Institute for …
Krylov subspace restarting for matrix Laplace transforms
A common way to approximate—the action of a matrix function on a vector—is to use the
Arnoldi approximation. Since a new vector needs to be generated and stored in every …
Arnoldi approximation. Since a new vector needs to be generated and stored in every …
3-D large-scale TEM modeling using restarting polynomial Krylov method
J Zhou, K Lu, X Li, W Liu, Z Qi… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
The transient electromagnetic (TEM) method is widely used in near-surface geophysical
prospecting. The high-precision forward and inversion of large-scale complex models is a …
prospecting. The high-precision forward and inversion of large-scale complex models is a …
A fast method to compute dispersion diagrams of three-dimensional photonic crystals with rectangular geometry
We propose a method and codes for fast computation of complex dispersion relations in
three-dimensional photonic crystals (PCs) with rectangular geometry. The main idea of the …
three-dimensional photonic crystals (PCs) with rectangular geometry. The main idea of the …
[PDF][PDF] 基于重启多项式犓狉狔犾狅狏子空间模型降阶的全波形瞬变电磁三维正演
周建美， 景旭， 鲁凯亮， 刘文韬， 李貅 - 地球物理学报, 2023 - dsjyj.com.cn
摘要瞬变电磁三维正演在内存占用和求解时间上都是大的挑战. 瞬变电磁响应受到发射波形的
影响, 正演计算中还需考虑发射波形. 基于重启多项式Krylov 子空间模型降阶方法 …
影响, 正演计算中还需考虑发射波形. 基于重启多项式Krylov 子空间模型降阶方法 …
A residual concept for Krylov subspace evaluation of the matrix function
MA Botchev, LA Knizhnerman… - arXiv preprint arXiv …, 2020 - arxiv.org
An efficient Krylov subspace algorithm for computing actions of the $\varphi $ matrix function
for large matrices is proposed. This matrix function is widely used in exponential time …
for large matrices is proposed. This matrix function is widely used in exponential time …