Rajesh Ransing

Dr. Rajesh Ransing

orcid

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2000 in Materials & Design (1980-2015)
Verified
Journal Article
Closed access
RRRajesh Ransing
Rajesh Ransing
DGD.T Gethin
D.T Gethin
AKA.R Khoei
A.R Khoei
PMP Mosbah
P Mosbah
RLR.W Lewis
R.W Lewis

1 January 2002 in Journal of Materials Processing Technology
Verified
Journal Article
Closed access
ICI.J Cox
I.J Cox
RLR.W Lewis
R.W Lewis
RRRajesh Ransing
Rajesh Ransing
HLH Laszczewski
H Laszczewski
GBG Berni
G Berni

1 May 2001 in Computers & Structures
Verified
Journal Article
Closed access
DGD.T Gethin
D.T Gethin
RRRajesh Ransing
Rajesh Ransing
RLR.W Lewis
R.W Lewis
MDM Dutko
M Dutko
ACA.J.L Crook
A.J.L Crook

13 December 2002 in Modelling and Simulation in Materials Science and Engineering
Verified
Journal Article
Closed access
DGDavid T Gethin
David T Gethin
RLRoland W Lewis
Roland W Lewis
RRRajesh Ransing
Rajesh Ransing

1 October 2006
Verified
Conference Paper
Closed access
NNNazri Mohd Nawi
Nazri Mohd Nawi
MRMeghana R. Ransing
Meghana R. Ransing
RRRajesh Ransing
Rajesh Ransing
The Broyden-Fletcher-Goldfarh-Shanno (BFGS) optimization algorithm usually used for nonlinear least squares is presented and is combined with the modified back propagation algorithm yielding a new fast training multilayer perceptron (MLP) algorithm (BFGS/AG). The approaches presented in the paper consist of three steps: (1) modification on standard back propagation algorithm by introducing "gain variation" term of the activation function, (2) Calculating the gradient descent on error with respect to the weights and gains values and (3) the determination of the new search direction by exploiting the information calculated by gradient descent in step (2) as well as the previous search direction. The new approach improved the training efficiency of back propagation algorithm by adaptively modifying the initial search direction. Performance of the proposed method is demonstrated by comparing to the Broyden-Fletcher-Goldfarb-Shanno algorithm from neural network toolbox for the chosen benchmark. The results show that the number of iterations required by this algorithm to converge is less than 15% of what is required by the standard BFGS and neural network toolbox algorithm. It considerably improves the convergence rate significantly faster because of it new efficient search direction

1 January 2010
Verified
Book Chapter
Closed access
PDF file
NNNazri Mohd Nawi
Nazri Mohd Nawi
RRRajesh Ransing
Rajesh Ransing
MSMohd Najib Mohd Salleh
Mohd Najib Mohd Salleh
RGRozaida Ghazali
Rozaida Ghazali
NHNorhamreeza Abdul Hamid
Norhamreeza Abdul Hamid