Equations are not being displayed properly on some articles. We hope to have this fixed soon. Our apologies. ISSN 1751-3030   Log in   Register 1341 Articles and Observations available | Content last updated 23 February, 05:23 Philica entries accessed 3 654 676 times
 NEWS: The SOAP Project, in collaboration with CERN, are conducting a survey on open-access publishing. Please take a moment to give them your viewsWe aim to suit all browsers, but recommend Firefox particularly:
The Recursive Future And Past Equation Based On The Ananda Damayanthi Normalized Similarity Measure. ISSN 1751-3030

Ramesh Chandra Bagadi (Physics, Engineering Mechanics, Civil & Environmental Engineering, University of Wisconsin)

Published in matho.philica.com

Abstract
In this research investigation, the author has presented a Recursive Future Equation based on the Ananda-Damayanthi Normalized Similarity Measure [1].

Article body

This Article was published on 5th May, 2017 at 08:48:09 and has been viewed 788 times.

1 Author comment added 6th May, 2017 at 03:35:21

Useful Hints For Computation Of The Required Answer:

Say if the Time Series Y={y[1], y[2], y[3],…..y[n-1], y[n]} is given and we are to find y[n+1], then we find y[n+1] each, (using the aforesaid Recursive Future Equation) for each of the following cases given by
1. y[j]

2 Author comment added 6th May, 2017 at 03:42:46

Useful Hints For Computation Of The Required Answer:

Say if the Time Series Y={y[1], y[2], y[3],…..y[n-1], y[n]} is given and we are to find y[n+1], then we find y[n+1] each, (using the aforesaid Recursive Future Equation) for each of the following cases given by
1. y[j]

3 Author comment added 6th May, 2017 at 03:43:34

Useful Hints For Computation Of The Required Answer:

Say if the Time Series Y={y[1], y[2], y[3],…..y[n-1], y[n]} is given and we are to find y[n+1], then we find y[n+1] each, (using the aforesaid Recursive Future Equation) for each of the following cases given by

4 Author comment added 6th May, 2017 at 03:45:55

Useful Hints For Computation Of The Required Answer:
Say if the Time Series Y={y[1], y[2], y[3],…..y[n-1], y[n]} is given and we are to find y[n+1], then we find y[n+1] each, (using the aforesaid Recursive Future Equation) for each of the following cases given by
1. y[j]

 Website copyright © 2006-07 Philica; authors retain the rights to their work under this Creative Commons License and reviews are copyleft under the GNU free documentation license.Using this site indicates acceptance of our Terms and Conditions. This page was generated in 0.4353 seconds.