نتایج جستجو برای: decomposition algorithm
تعداد نتایج: 831405 فیلتر نتایج به سال:
The particle size control of drug is one of the most important factors affecting the efficiency of the nano-drug production in confined liquid impinging jets. In the present research, for this investigation the confined liquid impinging jet was used to produce nanoparticles of Carbamazepine. The effects of several parameters such as concentration, solution and anti-solvent flow rate and solvent...
For solving the dynamic equilibrium equation of structures, several second-order numerical methods have so far been proposed. In these algorithms, conditional stability, period elongation, amplitude error, appearance of spurious frequencies and dependency of the algorithms to the time steps are the crucial problems. Among the numerical methods, Newmark average acceleration algorithm, regardl...
most geologic changes have a seismic response but sometimes this is expressed only in certain spectral ranges hidden within the broadband data. spectral decomposition is one of the methods which can be utilized to help interpreting such cases. there are several time-frequency methods including: short-time fourier transform (stft), continuous wavelet transform (cwt), wigner-ville distribution (w...
in this paper, first, an initial feature vector for vocal fold pathology diagnosis is proposed. then, for optimizing the initial feature vector, a genetic algorithm is proposed. some experiments are carried out for evaluating and comparing the classification accuracies which are obtained by the use of the different classifiers (ensemble of decision tree, discriminant analysis and k-nearest neig...
T-decomposition was first proposed and implemented as an algorithm by Mark Titchener. It has applications in communication of code sets and in the fields of entropy and similarity measurement. The first implementation of a T-decomposition algorithm by Titchener was subsequently followed by a faster version named tcalc, developed in conjunction with Scott Wackrow. An improved T-decomposition alg...
The problem of decomposing an ideal into pure-dimensional components (resp. reduced pure-dimensional components) is a key step in several basic algorithms of commutative algebra. The computation of the radical can be performed as intersection of the reduced components (but we wonder why you should really perform this intersection that throws away additional insight in the structure of the ideal...
Since 2001, Laplace decomposition algorithm (LDA) has been one of the reliable mathematical methods for obtaining exact or numerical approximation solutions for a wide range of nonlinear problems. The Laplace decomposition algorithm was developed by Khuri in [2] to solve a class of nonlinear differential equations. The basic idea in Laplace decomposition algorithm, which is a combined form of t...
In this paper, An effective and simple numerical method is proposed for solving systems of integral equations using radial basis functions (RBFs). We present an algorithm based on interpolation by radial basis functions including multiquadratics (MQs), using Legendre-Gauss-Lobatto nodes and weights. Also a theorem is proved for convergence of the algorithm. Some numerical examples are presented...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید