An optimal preconditioner with an alternate relaxation parameter used to solve ill-posed linear problems

zbMATH Open1356.65099MaRDI QIDQ2964804FDOQ2964804

Authors: Chein-Shan Liu 

Publication date: 27 February 2017

Recommendations

• An optimally generalized steepest-descent algorithm for solving ill-posed linear systems
• A double optimal descent algorithm for iteratively solving ill-posed linear inverse problems
• A new method for solving linear ill-posed problems
• An iterative method for solving linear ill-posed problems based on dynamical systems
• A revision of relaxed steepest descent method from the dynamics on an invariant manifold

zbMATH Keywords

linear inverse problemrelaxation parameterfast manifoldgeneralized relaxed steepest descent method (GRSDM)ill-posed linear problemoptimal GRSDM (OGRSDM)optimal GRSDM with an alternate relaxation parameter (OGRSDM- \(\alpha \))

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08) Ill-posedness and regularization problems in numerical linear algebra (65F22)

Cited In (8)

• Optimization of the relaxation parameter for S. S. O. R. and A. D. I. preconditioning
• Analysis of fully preconditioned alternating direction method of multipliers with relaxation in Hilbert spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• A revision of relaxed steepest descent method from the dynamics on an invariant manifold
• Optimal order multilevel preconditioners for regularized ill-posed problems
• A double optimal descent algorithm for iteratively solving ill-posed linear inverse problems
• An optimally generalized steepest-descent algorithm for solving ill-posed linear systems

This page was built for publication: An optimal preconditioner with an alternate relaxation parameter used to solve ill-posed linear problems

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