Re: Question about sparsity-based implementation in MATPower

2015-10-23 Thread Shruti Rao
;>> >>>> I am not surprised that PARDISO was found to be slower than ‘\'. Most >>>> of the power system test cases in MATPOWER are so small that having a >>>> multi-threaded linear solver may not yield any appreciable speedup. The >>>> thread la

Re: Question about sparsity-based implementation in MATPower

2015-10-22 Thread Jose Luis Marin
;mari...@gridquant.com> > Reply-To: MATPOWER discussion forum <matpowe...@list.cornell.edu> > Date: Monday, October 19, 2015 at 12:15 PM > > To: MATPOWER discussion forum <matpowe...@list.cornell.edu> > Subject: Re: Question about sparsity-based implementation in

Re: Question about sparsity-based implementation in MATPower

2015-10-22 Thread Shruti Rao
Ray >>> >>> >>> On Oct 19, 2015, at 1:05 AM, Shruti Rao <sra...@asu.edu> wrote: >>> >>> Thank you Dr. Abhyankar for the guidance. I appreciate your time and >>> effort. >>> >>> Shruti >>> >>> On Sun, Oct 18, 2015

Re: Question about sparsity-based implementation in MATPower

2015-10-19 Thread Ray Zimmerman
a...@asu.edu <mailto:sra...@asu.edu>> > Reply-To: MATPOWER discussion forum <matpowe...@list.cornell.edu > <mailto:matpowe...@list.cornell.edu>> > Date: Sunday, October 18, 2015 at 8:31 PM > To: MATPOWER discussion forum <matpowe...@list.cornell.edu > <mailto:mat

Re: Question about sparsity-based implementation in MATPower

2015-10-19 Thread Shruti Rao
ruti, >>> MATPOWER does use “\” operator for the linear solves. However note >>> that, internally, MATLAB does perform some sort of matrix reordering to >>> reduce the fill-ins in the factored matrix. For instance, UMFPACK uses an >>> approximate minimum degree r

Re: Question about sparsity-based implementation in MATPower

2015-10-19 Thread Jose Luis Marin
nds on the symmetry of the >>> Jacobian matrix. For MATPOWER test cases that have symmetric Jacobians (due >>> to inactive taps), a Cholesky factorization is used (LL^T = A). For cases >>> that lead to non-symmetric Jacobian, MATLAB uses UMFPACK for performing the >>>

Re: Question about sparsity-based implementation in MATPower

2015-10-18 Thread Abhyankar, Shrirang G.
matpowe...@list.cornell.edu<mailto:matpowe...@list.cornell.edu>> Subject: Question about sparsity-based implementation in MATPower Greetings MATPower community, I had a question about the way sparsity-based techniques are used in the Newton-Raphson solver of the power flow algorithm in MA

Question about sparsity-based implementation in MATPower

2015-10-18 Thread Shruti Rao
Greetings MATPower community, I had a question about the way sparsity-based techniques are used in the Newton-Raphson solver of the power flow algorithm in MATPower. I ran the code step-by-step and from my understanding, the way the sparsity of the Jacobian matrix is exploited is that it is

Re: Question about sparsity-based implementation in MATPower

2015-10-18 Thread Shruti Rao
WER discussion forum <matpowe...@list.cornell.edu> > Date: Sunday, October 18, 2015 at 5:37 PM > To: MATPOWER discussion forum <matpowe...@list.cornell.edu> > Subject: Question about sparsity-based implementation in MATPower > > Greetings MATPower community, > > I had a que

Re: Question about sparsity-based implementation in MATPower

2015-10-18 Thread Abhyankar, Shrirang G.
...@list.cornell.edu>> Subject: Re: Question about sparsity-based implementation in MATPower Thank you Dr. Abhyakar, My main aim was to confirm that MATPower uses the inbuilt "\" to solve the matrix equations and not Tinney or some other form of reordering and then LU factorizat

Re: Question about sparsity-based implementation in MATPower

2015-10-18 Thread Shruti Rao
...@list.cornell.edu> > Date: Sunday, October 18, 2015 at 8:31 PM > To: MATPOWER discussion forum <matpowe...@list.cornell.edu> > Subject: Re: Question about sparsity-based implementation in MATPower > > Thank you Dr. Abhyakar, > > My main aim was to confirm that M