Pages that link to "Item:Q2489397"

The following pages link to CG-type algorithms to solve symmetric matrix equations (Q2489397):

Displaying 17 items.

• Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides (Q291379) (← links)
• Nested splitting conjugate gradient method for matrix equation \(AXB=C\) and preconditioning (Q305521) (← links)
• A new family of global methods for linear systems with multiple right-hand sides (Q654779) (← links)
• Deflated and augmented global Krylov subspace methods for the matrix equations (Q891693) (← links)
• A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems (Q966098) (← links)
• Generalized global conjugate gradient squared algorithm (Q988626) (← links)
• Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides (Q2357421) (← links)
• A breakdown-free block conjugate gradient method (Q2359753) (← links)
• Global SCD algorithm for real positive definite linear systems with multiple right-hand sides (Q2381292) (← links)
• On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations. (Q2829106) (← links)
• The symmetric solutions of the matrix inequality<i>AX</i>≥<i>B</i>in least-squares sense (Q2852113) (← links)
• A novel class of block methods based on the block<i>AA</i>^T-Lanczos bi-orthogonalization process for matrix equations (Q2868174) (← links)
• (Q3174713) (← links)
• A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C (Q3389578) (← links)
• (Q4962487) (← links)
• A block preconditioner for the Gl-LSMR algorithm (Q5025108) (← links)
• The right–left preconditioning technique for the solution of the large matrix equation<i>AXB = C</i> (Q5739609) (← links)