Recent content by aashish.v

  1. A

    A certian Linear Algebra gimmick needed for a part of my project

    So this is what I understand... since the equation v'Av is a number... we can write... v'Av=(v'Av)'=v'(v'A)'=v'A'v Am I correct?
  2. A

    A certian Linear Algebra gimmick needed for a part of my project

    I do understand intuitively how this can be true... Because of the arrangement of the equation, both side of the equation gets the same value. I am able to show that with small example,, A=\left[\begin{array}{cc} p & q\\ r & s \end{array}\right],v=\left[\begin{array}{cc} a &...
  3. A

    A certian Linear Algebra gimmick needed for a part of my project

    1. I need to prove that for any matrix A(n,n) and a vector v(n,1) the following is true... vTAv=vTATv So far I wasn't able to think of anyway for proving this... any help will be appreciated.
  4. A

    Prove that: F(x1,x2, xn)<=min Fi(xi)

    1. Prove that: F(x1,x2,...xn)<=min Fi(xi) Where F is a DF on (x1...xn) I know that this is very intuitive. But I am not able to find proper mathematical argument for that.
  5. A

    Undergrad Eigen Value Approximation algorithms?

    Hi Guys, I have just started studying about this field. Can you give me some ideas about some best eigen value estimators? Both for SPD and non-SPD matrices. Thanks you. :-)
  6. A

    Reading Source fr Numerical Linear Algebra?

    I am using An Introduction to numerical linear algebra by Charles Cullen and I'm not very satisfied with it. Kindly suggest me some alternatives. Also suggest good linear algebra book to clear up basics. finally also suggest any online study materials, lecture notes, videos regarding the...
  7. A

    Converegence Problem for forward and backward propogation

    The typical approach shown in text is to show that if the solution of such function truns out to be in form of C.λ^n then we can say that such recursive function diverges, I have tried the same approach for the problem but the λ I am getting turns out to be function of n. I can scan and...
  8. A

    Converegence Problem for forward and backward propogation

    http://www.wolframalpha.com/share/clip?f=d41d8cd98f00b204e9800998ecf8427e9oo6gajcl6 view this to avoid any ambiguity
  9. A

    Converegence Problem for forward and backward propogation

    Yes. for forward direction we can re-write it this way.. J(n)=2*(n-1)*J(n-1)-J(n-2) and for backward propagation... J(n)=2*(n+1)*J(n+1)-J(n+2)
  10. A

    C tower of hanoi - Stack Implementation using structures .

    Thanks for the reply... I got it figured out... :)
  11. A

    Converegence Problem for forward and backward propogation

    The function is J(n-1)+J(n+1)=2nJ(n) I need to prove that it diverges in forward direction but converges in backward direction. I am unable to find any method, kindly suggest.
  12. A

    C tower of hanoi - Stack Implementation using structures .

    I've written a code for the problem but I'm contantly getting segmentation fault, core dump error, kindly help. I'm using gcc from ubuntu 12.04, Here is my code... #include<stdio.h> //#include<conio.h> #include<stdlib.h> struct node { int ind; int ele; struct node *next...