Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
118 tokens/sec
GPT-4o
12 tokens/sec
Gemini 2.5 Pro Pro
24 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
3 tokens/sec
DeepSeek R1 via Azure Pro
33 tokens/sec
2000 character limit reached

Flexible Modified LSMR Method for Least Squares Problems (2408.16652v1)

Published 29 Aug 2024 in math.NA and cs.NA

Abstract: LSMR is a widely recognized method for solving least squares problems via the double QR decomposition. Various preconditioning techniques have been explored to improve its efficiency. One issue that arises when implementing these preconditioning techniques is the need to solve two linear systems per iterative step. In this paper, to tackle this issue, among others, a modified LSMR method (MLSMR), in which only one linear system per iterative step needs to be solved instead of two, is introduced, and then it is integrated with the idea of flexible GMRES to yield a flexible MLSMR method (FMLSMR). Numerical examples are presented to demonstrate the efficiency of the proposed FMLSMR method.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.