Thread: OPR
View Single Post
  #25   Spotlight this post!  
Unread 26-02-2015, 11:18
Ether's Avatar
Ether Ether is offline
systems engineer (retired)
no team
 
Join Date: Nov 2009
Rookie Year: 1969
Location: US
Posts: 8,094
Ether has a reputation beyond reputeEther has a reputation beyond reputeEther has a reputation beyond reputeEther has a reputation beyond reputeEther has a reputation beyond reputeEther has a reputation beyond reputeEther has a reputation beyond reputeEther has a reputation beyond reputeEther has a reputation beyond reputeEther has a reputation beyond reputeEther has a reputation beyond repute
Re: OPR

Quote:
Originally Posted by plnyyanks View Post
...you can find the OPR (and DPR, CCWM) calculations done on TBA in this file.
Just a minor observation FWIW:

To solve [M][x]=[s], that code uses numpy.linalg.solve which uses LAPACK routine gesv which does LU decomposition.

Since [M] is symmetric positive definite, Cholesky decomposition can be used instead to take advantage of that particular matrix structure.

For OPR computation for single events the difference will likely be negligible, but when computing combined OPR for all events for an entire season Cholesky will be noticeably faster than LU.


Reply With Quote