Solving large linear system of Ax=b while A is a non-square Matrix?
41 views (last 30 days)
Show older comments
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 Comments
Accepted Answer
Matt J
on 23 Oct 2019
Edited: Matt J
on 23 Oct 2019
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 Comments
More Answers (0)
See Also
Categories
Find more on Linear Least Squares in Help Center and File Exchange
Products
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!