Abstract We propose the approximate Laplace approximation (ALA) to evaluate integrated likelihoods, a bottleneck in Bayesian model selection. The (LA) is popular tool that speeds up such computation and equips strong selection properties. However, when sample size large or one considers many models cost of required optimizations becomes impractical. ALA reduces solving least-squares problem for...

In this paper two different methods are presented to approximate the solution of the fractional Black-Scholes equation for valuation of barrier option. Also, the two schemes need less computational work in comparison with the traditional methods. In this work, we propose a new generalization of the two-dimensional differential transform method and decomposition method that will extend the appli...

we study the notion of bounded approximate connes-amenability for‎ ‎dual banach algebras and characterize this type of algebras in terms‎ ‎of approximate diagonals‎. ‎we show that bounded approximate‎ ‎connes-amenability of dual banach algebras forces them to be unital‎. ‎for a separable dual banach algebra‎, ‎we prove that bounded‎ ‎approximate connes-amenability implies sequential approximate...

the railway transportation planning under the fuzzy environment is investigated in this paper. as a main result, a new modeling method, called minimum risk chance-constrained model, is presented based on the credibility measure. for the convenience ofs olving the mathematical model, the crisp equivalents ofc hance functions are analyzed under the condition that the involved fuzzy parameter...

This paper addresses the problem of measuring complexity from embedded attractors as a way to characterize changes in the dynamical behavior of different types of systems with a quasi-periodic behavior by observing their outputs. With the aim of measuring the stability of the trajectories of the attractor along time, this paper proposes three new estimations of entropy that are derived from a M...