The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math.num-analysis

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Solve linear equation with matrix multiplies only
Replies: 4   Last Post: Oct 5, 2012 6:39 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 303
Registered: 12/10/05
Solve linear equation with matrix multiplies only
Posted: Oct 3, 2012 1:50 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

For a general matrix (rectangular, non-symmetric) is there an iterative method for solving J*x=b that only uses multiplies J*v and no transpose multiples J'*u? I know there are many methods based on J'*J.

The problem I'm facing is a nonlinear optimization over thousands of variables with hundreds of thousands of measurements. It is well behaved, but each step requires the Jacobian which can barely be held in memory. Plus, it seems wasteful to calculate the entire Jacobian (thousands of function evaluations) when probably only a few principal directions are needed on each step of the optimization.

The Jacobian is formed numerically by adding small "h" to each element in turn so it costs thousands of evaluations. A cheaper alternative I have tried is to approximate J using a few (small norm) random vectors Y=[y1 y2 y3...] such that Q = J*Y. Then solve Q*(pinv(Y)*x)=b to recover something resembling x.

This kind of works but I hate to use a kludge if there is something better available. It seems to me that I would need an approximate way to solve J*x=b with only multiplications.

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.