Computing Function of Large Matrices by a Preconditioned Rational Krylov Method

DOI10.1007/978-3-030-55874-1_33zbMath1470.65077OpenAlexW3159597048MaRDI QIDQ5152823

Fabio Durastante, Daniele Bertaccini

Publication date: 27 September 2021

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-55874-1_33

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of matrix exponential and similar matrix functions (65F60)

Related Items (2)

Adaptive Rational Krylov Methods for Exponential Runge–Kutta Integrators ⋮ Inexact rational Krylov Subspace methods for approximating the action of functions of matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse approximate inverse preconditioners on high performance GPU platforms
• Interpolating preconditioners for the solution of sequence of linear systems
• Approximate inverse preconditioning for shifted linear systems
• Efficient preconditioning for sequences of parametric complex symmetric linear systems
• Rational Krylov methods for functions of matrices with applications to fractional partial differential equations
• Rational approximations to fractional powers of self-adjoint positive operators
• Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
• Nonsymmetric Preconditioner Updates in Newton–Krylov Methods for Nonlinear Systems
• Factorized Sparse Approximate Inverse Preconditionings I. Theory
• Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
• Iterative Solution Methods
• The RKFIT Algorithm for Nonlinear Rational Approximation

This page was built for publication: Computing Function of Large Matrices by a Preconditioned Rational Krylov Method