CG-type algorithms to solve symmetric matrix equations (Q2489397): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2005.03.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055000341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4] / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hessenberg-Schur method for the problem AX + XB= C / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global FOM and GMRES algorithms for matrix equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The block conjugate gradient algorithm and related methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides / rank
 
Normal rank

Latest revision as of 12:18, 24 June 2024

scientific article
Language Label Description Also known as
English
CG-type algorithms to solve symmetric matrix equations
scientific article

    Statements

    CG-type algorithms to solve symmetric matrix equations (English)
    0 references
    28 April 2006
    0 references
    The author studies two conjugate gradient (CG) type algorithms for the efficient numerical solution of symmetric linear algebraic systems with multiple right-hand sides. Numerical examples are given to illustrate the performance of the suggested methods in comparison with existing ones.
    0 references
    symmetric linear systems
    0 references
    multiple right-hand sides
    0 references
    Global FOM GMRES algorithms
    0 references
    matrix equations
    0 references
    Krylov subspace method
    0 references
    conjugate gradient type algorithms
    0 references
    numerical examples
    0 references

    Identifiers