Preconditioners generated by minimizing norms

DOI10.1016/J.CAMWA.2008.10.096zbMATH Open1186.65039OpenAlexW1972727112MaRDI QIDQ971634FDOQ971634

Authors: Pablo Tarazaga, Diego Cuellar 

Publication date: 16 May 2010

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2008.10.096

Recommendations

• Sequential iterations for two diagonal preconditioners
• A comparison theorem for the iterative method with the preconditioner \((I+S_{max})\)
• A new effective preconditioned method
• Preconditioned diagonal dominant matrices
• Optimal preconditioners of a given sparsity pattern

zbMATH Keywords

simulationsiterative methodslinear systemsnumerical methodspreconditioners

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)

Cites Work

• Parallel iterative methods for sparse linear systems
• Title not available (Why is that?)
• Convergence of a Q-learning variant for continuous states and actions

Cited In (8)

• Preconditioned diagonal dominant matrices
• Sequential iterations for two diagonal preconditioners
• A generalization of the optimal diagonal approximate inverse preconditioner
• Robust Norm Equivalencies and Preconditioning
• Preconditioning and convergence in the right norm
• Improving approximate inverses based on Frobenius norm minimization
• Three optimization models for multisplitting preconditioner
• An efficient computation of generalized inverse of a matrix

This page was built for publication: Preconditioners generated by minimizing norms

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