Results 41 to 50 of about 81,041 (236)
Convergence rates for inverse-free rational approximation of matrix functions [PDF]
, 2016 This article deduces geometric convergence rates for approximating matrix functions via inverse-free rational Krylov methods. In applications one frequently encounters matrix functions such as the matrix exponential or matrix logarithm; often the matrix ...
Jagels, Carl +3 more
core +2 more sources
A comparison of preconditioned Krylov subspace methods for large‐scale nonsymmetric linear systems [PDF]
Numerical Linear Algebra with Applications, 2016 Preconditioned Krylov subspace (KSP) methods are widely used for solving large‐scale sparse linear systems arising from numerical solutions of partial differential equations (PDEs).
Aditi Ghai, Cao Lu, X. Jiao
semanticscholar +1 more source
Krylov subspace split Bregman methods
Applied Numerical Mathematics, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Majed Alotaibi +2 more
openaire +1 more source
Krylov Subspace Solvers and Preconditioners
ESAIM: Proceedings and Surveys, 2018 In these lecture notes an introduction to Krylov subspace solvers and preconditioners is presented. After a discretization of partial differential equations large, sparse systems of linear equations have to be solved.
Vuik C.
doaj +1 more source
Uzawa Algorithms for Fully Fuzzy Linear Systems
International Journal of Computational Intelligence Systems, 2016 Recently, there have been many studies on solving different kinds of fuzzy equations. In this paper, the solution of a trapezoidal fully fuzzy linear system (FFLS) is studied.
H. Zareamoghaddam +3 more
doaj +1 more source
S-Step BiCGStab Algorithms for Geoscience Dynamic Simulations
Oil & Gas Science and Technology, 2016 In basin and reservoir simulations, the most expensive and time consuming phase is solving systems of linear equations using Krylov subspace methods such as BiCGStab.
Anciaux-Sedrakian Ani +3 more
doaj +1 more source
Error Bounds for the Krylov Subspace Methods for Computations of Matrix Exponentials [PDF]
SIAM Journal on Matrix Analysis and Applications, 2016 In this paper, we present new a posteriori and a priori error bounds for the Krylov subspace methods for computing $e^{-\tau A}v$ for a given $\tau>0$ and $v \in C^n$, where $A$ is a large sparse non-Hermitian matrix.
Hao Wang, Q. Ye
semanticscholar +1 more source
Computers and Mathematics with Applications, 2019 Two Krylov subspace methods, the GMRES and the BiCGSTAB, are analyzed for solving the linear systems arising from the mixed finite element discretization of the discrete ordinates radiative transfer equation.
M. Badri +3 more
semanticscholar +1 more source
Krylov subspace approximations for the exponential Euler method: error estimates and the harmonic Ritz approximant [PDF]
, 2011 We study Krylov subspace methods for approximating the matrix-function vector product φ(tA)b where φ(z) = [exp(z) - 1]/z. This product arises in the numerical integration of large stiff systems of differential equations by the Exponential Euler Method ...
Carr, Elliot, Ilic, Milos, Turner, Ian
core +3 more sources
Electronic Transactions on Numerical Analysis, 2019 In the present paper, we propose a preconditioned global approach as a new strategy to solve linear systems with several right-hand sides coming from saddle point problems.
A. Badahmane, A. H. Bentbib, H. Sadok
semanticscholar +1 more source