|
|
|
|
|
Zabidin Salleh, Ghaliah Alhamzi, Ibitsam Masmali and Ahmad Alhawarat
The conjugate gradient method is one of the most popular methods to solve large-scale unconstrained optimization problems since it does not require the second derivative, such as Newton?s method or approximations. Moreover, the conjugate gradient method ...
ver más
|
|
|
|
|
|
|
|
|
Francesca Vatta, Alessandro Soranzo, Massimiliano Comisso, Giulia Buttazzoni and Fulvio Babich
Low Density Parity Check (LDPC) codes are currently being deeply analyzed through algorithms that require the capability of addressing their iterative decoding convergence performance. Since it has been observed that the probability distribution function...
ver más
|
|
|
|
|
|
|
|
|
Chong Sun and Qin Sheng
This paper studies an effective finite difference scheme for solving two-dimensional Heston stochastic volatility option-pricing model problems. A dynamically balanced up-downwind strategy for approximating the cross-derivative is implemented and analyze...
ver más
|
|
|
|
|
|
|
|
|
Shiva Sharma,Prashant K. Pandey,Rajesh K. Pandey,Kamlesh Kumar
This paper presents the Bernstein and hybrid Bernstein approximations to solve the generalized Abel?s integral equations (GAIEs) via collocation approach. Bernstein polynomial and hybrid Bernstein functions are used in the approximation of GAIEs solution...
ver más
|
|
|
|
|
|
|
|
|
Alexander Trunov
Pág. 34 - 43
A problem on building the methodology for transforming the implicit form of a model has been stated and solved, which improves the efficiency of replacing complex nonlinear forms of mathematical models to reducing them to a recurrent sequence in the form...
ver más
|
|
|
|