🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Thread View: sci.math.num-analysis
1 messages
1 total messages Started by KUN YU Fri, 10 Apr 1992 00:49
AX <= B ---- HELP
#269
Author: KUN YU
Date: Fri, 10 Apr 1992 00:49
30 lines
1487 bytes
 AX=B, A=[a1 a2 a3 ... an], X=[x1 x2 x3 ...xn]' , a's and B are (mx1) vectors
                               x's are scalars.
 Known: only a1
 Sought: x1

 The problem seems ridiculous, but it does make sense and is important.
 If a1 is orthogonal to other a's,  the problem is perfectly soluble.
              x1=a1\B=a1^{+}B
 If a1 is linearly related to others, it's absolutely insoluble.

 There must be somthing between the extremes, especially if we add some
 constraints. The  physical meaning of my problem requires that nothing be
 negative, none of the elements of a's. x's and B. Thus, the problem becomes
      AX <= B,  A=[a1 a2 a3 ... an], X=[x1 x2 x3 ...xn]' ,
                     a's and B are (mx1) vectors
      rank(A)=n, A is well conditioned(not orthogonal, however).
                 All elements      of A and B are non-negative.
      Sought: X, which is all positive.

I don't know how to start the analysis.
Any advice/hints/help/references will be highly appreciated.
-- 
 
 
           /
         / _ \
       /  _I_  \
           I
         / I \
Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads