نتایج جستجو برای: numerical algorithms
تعداد نتایج: 637749 فیلتر نتایج به سال:
Classes of Abaffy-Broyden-Spedicato (ABS) methods have been introduced for solving linear systems of equations. The algorithms are powerful methods for developing matrix factorizations and many fundamental numerical linear algebra processes. Here, we show how to apply the ABS algorithms to devise algorithms to compute the WZ and ZW factorizations of a nonsingular matrix as well as...
Arithmetic manipulation with matrices and polynomials is a common subject for algebraic (or symbolic) and numerical computing. Typical computational problems in these areas include the solution of a polynomial equation and linear and polynomial systems of equations, univariate and multivariate polynomial evaluation, interpolation, factorization and decompositions, rational interpolation, comput...
in this paper, we apply the homotopy analysis method (ham) for solving fuzzy linear systems and present the necessary and sufficient conditions for the convergence of series solution obtained via the ham. also, we present a new criterion for choosing a proper value of convergence-control parameter $hbar$ when the ham is applied to linear system of equations. comparisons are made between the ...
Increasingly, sophisticated methods are available for analyzing financial data and helping decision makers. In practice, the data that will be used can be full of errors. It is often the more sophisticated methods that seem to be particularly sensitive to the presence of bad values in the data. Therefore, it makes sense to deal with the bad data before the modeling takes place – improve the qua...
Clustering is one of the main techniques in data mining. Clustering is a process that classifies data set into groups. In clustering, the data in a cluster are the closest to each other and the data in two different clusters have the most difference. Clustering algorithms are divided into two categories according to the type of data: Clustering algorithms for numerical data and clustering algor...
The newly emerging science of studying complex systems is being applied to global finance markets by a new joint academic/commercial venture, the Oxford Centre for Computational Finance. Multi-agent-based models are used to create artificial markets and to perform dynamic tests of new methods for option pricing and the like. At the same time, this laboratory for analysis of live-market data is ...
The main aim of the present paper is to propose efficient multi-objective optimization algorithms (MOOAs) to tackle truss structure optimization problems. The proposed meta-heuristic algorithms are based on the firefly algorithm (FA) and bat algorithm (BA), which have been recently developed for single-objective optimization. In order to produce a well distributed Pareto front, some improvement...
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
in this paper, a new approach for estimating the number of wideband sources is proposed which is based on rss or ism algorithms. numerical results show that the mdl-based and eit-based proposed algorithm havea much better detection performance than that in egm and aic cases for small differences between the incident angles of sources. in addition, for similar conditions, rss algorithm offers hi...
in this paper, the numerical algorithms for solving ‘fuzzy ordinary differential equations’ are considered. a scheme based on the 4th order runge-kutta method is discussed in detail and it is followed by a complete error analysis. the algorithm is illustrated by solving some linear and nonlinear fuzzy cauchy problems.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید