A flexible global GCRO-DR method for shifted linear systems and general coupled matrix equations
From MaRDI portal
Publication:2036082
Summary: In this paper, we mainly focus on the development and study of a new global GCRO-DR method that allows both the flexible preconditioning and the subspace recycling for sequences of shifted linear systems. The novel method presented here has two main advantages: firstly, it does not require the right-hand sides to be related, and, secondly, it can also be compatible with the general preconditioning. Meanwhile, we apply the new algorithm to solve the general coupled matrix equations. Moreover, by performing an error analysis, we deduce that a much looser tolerance can be applied to save computation by limiting the flexible preconditioned work without sacrificing the closeness of the computed and the true residuals. Finally, numerical experiments demonstrate that the proposed method illustrated can be more competitive than some other global GMRES-type methods.
Recommendations
- A flexible generalized conjugate residual method with inner orthogonalization and deflated restarting
- On the global Krylov subspace methods for solving general coupled matrix equations
- Accelerated GCRO-DR method for solving sequences of systems of linear equations
- Two recursive GMRES-type methods for shifted linear systems with general preconditioning
- Flexible global generalized Hessenberg methods for linear systems with multiple right-hand sides
Cites work
- A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides
- A flexible generalized conjugate residual method with inner orthogonalization and deflated restarting
- A flexible Krylov solver for shifted systems with application to oscillatory hydraulic tomography
- A nested Krylov subspace method to compute the sign function of large complex matrices
- A new deflated block GCROT(m,k) method for the solution of linear systems with multiple right-hand sides
- A new projection method for solving large Sylvester equations
- A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications
- A switching rule for exponential stability of switched recurrent neural networks with interval time-varying delay
- Application of block Krylov subspace algorithms to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD
- BiCGStab() for families of shifted linear systems
- BiCR-type methods for families of shifted linear systems
- Computational Methods for Linear Matrix Equations
- Deflated GMRES for systems with multiple shifts and multiple right-hand sides
- Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously
- Flexible GMRES with deflated restarting
- Further mean-square asymptotic stability of impulsive discrete-time stochastic BAM neural networks with Markovian jumping and multiple time-varying delays
- Gaussian processes for machine learning.
- Global FOM and GMRES algorithms for matrix equations
- GMRES with Deflated Restarting
- Gradient based iterative algorithms for solving a class of matrix equations
- scientific article; zbMATH DE number 3557389 (Why is no real title available?)
- Implicit QR algorithms for palindromic and even eigenvalue problems
- Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
- Iterative algorithms for solving a class of complex conjugate and transpose matrix equations
- Krylov subspace methods for the generalized Sylvester equation
- Krylov subspace recycling for sequences of shifted linear systems
- Krylov-subspace methods for reduced-order modeling in circuit simulation
- Low rank approximate solutions to large Sylvester matrix equations
- LSQR iterative method for generalized coupled Sylvester matrix equations
- Matrix form of the CGS method for solving general coupled matrix equations
- Nested Krylov methods based on GCR
- On Iterative Solutions of General Coupled Matrix Equations
- On solutions of the matrix equations \(XF - AX = C\) and \(XF - A\bar {X} =C\)
- On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\)
- On the global Krylov subspace methods for solving general coupled matrix equations
- On the numerical solution of AX-XB=C
- On the solution of a Sylvester equation appearing in descriptor systems control theory
- On the solution of the continuous-time Lyapunov matrix equation in two canonical forms
- Parallel iterative methods for sparse linear systems
- Recycling Krylov Subspaces for Sequences of Linear Systems
- Restarted full orthogonalization method for shifted linear systems
- Restarted GMRES for Shifted Linear Systems
- Restarted Hessenberg method for solving shifted nonsymmetric linear systems
- Short-recurrence Krylov subspace methods for the overlap Dirac operator at nonzero chemical potential
- Structured Condition Numbers for Invariant Subspaces
- The Matrix Equation A\bar X - XB = C and Its Special Cases
- The matrix iterative methods for solving a class of generalized coupled Sylvester-conjugate linear matrix equations
- The MGPBiCG method for solving the generalized coupled Sylvester-conjugate matrix equations
- Theoretical results on the global GMRES method for solving generalized Sylvester matrix equations
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Truncation Strategies for Optimal Krylov Subspace Methods
- Uniqueness of solution of a generalized \(\star\)-Sylvester matrix equation
- Valency-based topological descriptors and structural property of the generalized Sierpiński networks
This page was built for publication: A flexible global GCRO-DR method for shifted linear systems and general coupled matrix equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2036082)
