Solving large linear system of Ax=b while A is a non-square Matrix?

44 次查看（过去 30 天）
ZR
ZR 2019-10-23
评论： ZR 2019-10-25
Hi,
I was using gmres to solve linear sysmtem Ax=b where A is a n*n large square matrix and b is n*1.
However, if A is m*n matrix where m>n that is least square case than can we use some iterative method like gmres (Generalized minimum residual method) or pcg (Preconditioned conjugate gradients method) type approach to solve it faster like for square case.
The basic goal is to solve large non-square matrix A faster for x.
Please help me with the matlab functions that handle this case?
Thanks
  5 个评论
显示 3更早的评论
ZR
ZR 2019-10-24
I have also test the matlab operator lsqlin() which is even faster than qr().
However, still i feel a more faster operator will be available compare to lsqlin that can solve large matrix A for x.
ZR
ZR 2019-10-25
Although i can solve non-sqaure A matrix using operator qr() but it is not fast as we observe in case of gmres for square matrix A.

请先登录，再进行评论。

请先登录，再回答此问题。

采纳的回答

Matt J
Matt J 2019-10-23
编辑：Matt J 2019-10-23
In addition to mldivide, as suggested by Walter, you could pre-multiply your equation by A.' to obtain the square symmetric system
(A.'*A)*x=A.'*b
and then use pcg or gmres as before. PCG might be preferable, because the conditioning of the above system is poorer than for the original system A*x=b.

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Linear Least Squares 的更多信息

标签

产品

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by