Minimal decompositions and iterative methods

DOI10.1007/S002110000114MaRDI QIDQ1583833zbMATH OpenFDO

Authors Marko Huhtanen, Olavi Nevanlinna

Publication date 30 October 2000

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S002110000114

zbMATH Keywords

convergenceiterative methodsminimal decompositions

Mathematics Subject Classification ID

Equations and inequalities involving linear operators, with vector unknowns (47A50) Iterative numerical methods for linear systems (65F10) Numerical solutions to equations with linear operators (65J10)

Review text

Starting from concepts and results for infinite-dimensional operator theory, a new decomposition for a matrix \(A\) is proposed. This new decomposition can be used in assessing the convergence speed of iterative methods for solving linear systems involving \(A\).

Recommendations

• Some Remarks Concerning Iterative Methods for Linear Systems
• On convergence of nested stationary iterative methods
• scientific article; zbMATH DE number 6831460
• scientific article; zbMATH DE number 3915507
• New iterative methods for solving linear systems

Cited in

(8)

• Some iterative methods related to Frobenius norm minimization
• Generalizations of the field of values useful in the study of polynomial functions of a matrix
• Aspects of nonnormality for iterative methods
• Averaging operators for exponential splittings
• The role eigenvalues play in forming GMRES residual norms with non-normal matrices
• Convergence analysis of Krylov subspace methods
• A scheme of iterative minimization methods
• Stability of linear GMRES convergence with respect to compact perturbations

This page was built for publication: Minimal decompositions and iterative methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583833)