Convergence properties of some block Krylov subspace methods for multiple linear systems

From MaRDI portal
Publication:2503023

DOI10.1016/j.cam.2005.09.017zbMath1100.65024OpenAlexW2051770164MaRDI QIDQ2503023

R. Sadaka, R. Bouyouli, Hassane Sadok, Khalide Jbilou

Publication date: 13 September 2006

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2005.09.017



Related Items

A global rational Arnoldi method for model reduction, An extended-rational Arnoldi method for large matrix exponential evaluations, A computational global tangential Krylov subspace method for model reduction of large-scale MIMO dynamical systems, A tensor format for the generalized Hessenberg method for solving Sylvester tensor equations, Extended Arnoldi methods for large low-rank Sylvester matrix equations, On tensor tubal-Krylov subspace methods, Deflated and augmented global Krylov subspace methods for the matrix equations, An enhancement of the convergence of the IDR method, A shifted complex global Lanczos method and the quasi-minimal residual variant for the Stein-conjugate matrix equation \(X + A \overline{X} B = C\), On the global Krylov subspace methods for solving general coupled matrix equations, Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM, Weighted versions of Gl-FOM and Gl-GMRES for solving general coupled linear matrix equations, Accelerating data uncertainty quantification by solving linear systems with multiple right-hand sides, GMRES algorithms over 35 years, On Hessenberg type methods for low-rank Lyapunov matrix equations, The extended global Lanczos method for matrix function approximation, Two new variants of the simpler block GMRES method with vector deflation and eigenvalue deflation for multiple linear systems, New convergence results on the global GMRES method for diagonalizable matrices, Global FOM and GMRES algorithms for a class of complex matrix equations, A generalized matrix Krylov subspace method for TV regularization, Unnamed Item, Discrete cosine transform LSQR and GMRES methods for multidimensional ill-posed problems, On some properties of the extended block and global Arnoldi methods with applications to model reduction, ADI preconditioned Krylov methods for large Lyapunov matrix equations, A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems, Parallel matrix function evaluation via initial value ODE modeling, Restarted global FOM and GMRES algorithms for the Stein-like matrix equation \(X + \mathcal{M}(X) = C\), A global variant of the COCR method for the complex symmetric Sylvester matrix equation \(AX+XB=C\), Parallel maximum likelihood estimator for multiple linear regression models, Shifted extended global Lanczos processes for trace estimation with application to network analysis, Matrix polynomial and epsilon-type extrapolation methods with applications, Tensor extrapolation methods with applications, Numerical methods for differential linear matrix equations via Krylov subspace methods, Global extended Krylov subspace methods for large-scale differential Sylvester matrix equations, Global Hessenberg and CMRH methods for a class of complex matrix equations, Parallel statistical computing for statistical inference, Preconditioned Krylov subspace and GMRHSS iteration methods for solving the nonsymmetric saddle point problems, Extended nonsymmetric global Lanczos method for matrix function approximation, The symmetric solutions of the matrix inequalityAXBin least-squares sense, Unnamed Item, A matrix rational Lanczos method for model reduction in large‐scale first‐ and second‐order dynamical systems



Cites Work