نتایج جستجو برای: our program uses the marquardt

تعداد نتایج: 16131240  

2009
Pedro Davalos

1 – Introduction Parameter estimation for function optimization is a well established problem in computing, as there are countless applications in practice. For this work, we will focus specifically in implementing a distributed and parallel implementation of the Levenberg Marquardt algorithm, which is a well established numerical solver for function approximation given a limited data set. Para...

2012
Nirjhar Bar Sudip Kumar Das

Prediction of the gas holdup and pressure drop in a horizontal pipe for gas-non-Newtonian liquid flow using Artificial Neural Networks (ANN) methodology have been reported in this paper from the data acquired from our earlier experiment. The ANN prediction is done using Multilayer Perceptrons (MLP) trained with three different algorithms, namely: Backpropagation (BP), Scaled Conjugate gradient ...

2009
László Gál János Botzheim László T. Kóczy António E. Ruano

In our previous work we proposed some extensions of the Levenberg-Marquardt algorithm; the Bacterial Memetic Algorithm and the Bacterial Memetic Algorithm with Modified Operator Execution Order for fuzzy rule base extraction from inputoutput data. Furthermore, we have investigated fuzzy flip-flop based feedforward neural networks. In this paper we introduce the adaptation of the Bacterial Memet...

Journal: :IEEE transactions on neural networks 1994
Martin T. Hagan Mohammad Bagher Menhaj

The Marquardt algorithm for nonlinear least squares is presented and is incorporated into the backpropagation algorithm for training feedforward neural networks. The algorithm is tested on several function approximation problems, and is compared with a conjugate gradient algorithm and a variable learning rate algorithm. It is found that the Marquardt algorithm is much more efficient than either...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان 1390

section{introduction} the concept of {sl cartan geometry} appeared at the beginning of the twentieth century, when {e}lie cartan was working on the so-called {sl equivalence problem}, the aim of which is to determine whether two given geometric structures can be mapped bijectively onto each other by some diffeomorphism. this problem can be considered in many different contexts, such as ...

2013
Robert J. Renka

Least squares methods are effective for solving systems of partial differential equations. In the case of nonlinear systems the equations are usually linearized by a Newton iteration or successive substitution method, and then treated as a linear least squares problem. We show that it is often advantageous to form a sum of squared residuals first, and then compute a zero of the gradient with a ...

2001
Serdar Iplikci

This report presents the studies carried out on two modifications suggested in the literature for Levenberg-Marquardt algorithm. The modifications are applicable to feed-forward neural networks. One modification [18], made on performance index, reduces computational complexity of the Levenberg-Marquardt algorithm, while the other one [17], made on calculation of the gradient information, improv...

Journal: :Sains Malaysiana 2021

Levenberg-Marquardt algorithm and conjugate gradient method are frequently used for optimization in multi-layer perceptron (MLP). However, both algorithms have mixed conclusions optimizing MLP time series forecasting. This study uses autoregressive integrated moving average (ARIMA) with method. These methods were to predict the Air Pollutant Index (API) Malaysia's central region where represent...

Journal: :Health education research 2007
Sherri Bisset Louise Potvin

This work presents a theoretical framework in which health promotion and health education program implementation can be conceived as an open dynamic system. By tracing the evolution of an elementary school-based nutrition program from its conception to its recent form, we construct a program genealogy. Data were derived from two interviews and three historical documents from which historical ev...

2001
Dongkeun Kim Donald Yeung

Pre-execution uses helper threads running in spare hardware contexts to trigger cache misses in front of the main thread, hence hiding their latency. At the heart of pre-execution is the code that runs in the pre-execution threads themselves. The most common approach is for preexecution threads to run a subset of the instructions executed by the original program, called backward slices [18], wh...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید