Prev: OFDMA and SC-FDMA simulink
Next: Histogram Bin Values
From: John D'Errico on 8 Feb 2010 23:43
"Andy " <litchfield.a(a)gmail.com> wrote in message <hko507$cca$1(a)fred.mathworks.com>...
> Hi everyone,
>
> I'm about to close a particular chapter of the work I've been doing using Matlab to solve an A*x=b system of equations. Before doing so I wanted to get some other peoples opinions regarding a way to solve for x before I just leave my results where they are.
> I only have one constraint and that is that x must be positive. This obviously rules out x=A\b (which gives negative and positive values) and the great LSQR function which also gives me negative values. With help from forum users I attempted to use quadprog (using Euclidean norm) but to no avail. My staple function has been LSQLIN and I set my lower bound to zero. The best fit I get is between 7-15% NRMSE (where as LSQR would give ~1% if allowed). Whilst the result won't be exact for this overdetermined system, why can't I get a closer result?
>
> My A matrix is 500 x 216 and b is 500 x 1. I have tried reading the available resources, including text books and have done my best to understand how to implement more complex constraints but they always seem to worsen the solution.
>
> I feel I must be doing something incorrectly as most people here are trying what seem to be much more advanced problems and still having success. Can anyone point me towards additional resources or suggest a different method to approach this problem?

Just wanting a better result does not assure that you
will get it.

This is the best you can achieve with that system of
equations.

John
First  |  Prev  | 
Pages: 1 2
Prev: OFDMA and SC-FDMA simulink
Next: Histogram Bin Values