نتایج جستجو برای: polynomial numerical hull
تعداد نتایج: 430243 فیلتر نتایج به سال:
In this paper, we present some efficient numerical algorithm for solving system of fuzzy polynomial equations based on Newton's method. The modified Adomian decomposition method is applied to construct the numerical algorithms. Some numerical illustrations are given to show the efficiency of algorithms.
Given a graph G = (V, E), the closed interval of a pair of vertices u, v ∈ V , denoted by I[u, v], is the set of vertices that belongs to some shortest (u, v)-path. The convex hull I h [S] of a subset S ⊆ V is the smallest convex set that contains S. We say that S is a hull set if I h [S] = V. The cardinality of a minimum hull set of G is the hull number of G, denoted by hn(G). We show that dec...
We consider the design problem for a Marx generator electrical network, a pulsed power generator. The engineering specification of the design is that a suitable resonance condition is satisfied by the circuit so that the energy initially stored in a number of stage capacitors is transferred in finite time to a single load capacitor which can then store the total energy and deliver the pulse. We...
there are different methods to reduce drag in high speed hulls. one of these methods is a change in the shape of the body by adding longitudinal side tunnels. in this paper it has been attempted to determine the influence of the tunnel height on hydrodynamic characteristics of the hull to achieving an optimum shape for the tunnel. to achieve this purpose, numerical simulation of the problem has...
Abstract. Let dμ be a nonnegative measure with support on the real axis and let α ∈ R be outside the convex hull of the support. This paper describes a new approach to determining recursion coefficients for Gauss quadrature rules associated with measures of the form dμ̌(x) := dμ(x)/(x − α)2l. The proposed method is based on determining recursion coefficients for a suitable family of orthonormal ...
A rational polytope is the convex hull of a finite set of points in Rd with rational coordinates. Given a rational polytope P ⊆ Rd, Ehrhart proved that, for t ∈ Z>0, the function #(tP ∩ Zd) agrees with a quasi-polynomial LP(t), called the Ehrhart quasi-polynomial. The Ehrhart quasi-polynomial can be regarded as a discrete version of the volume of a polytope. We use that analogy to derive a new ...
There are different methods to reduce drag in high speed hulls. One of these methods is a change in the shape of the body by adding longitudinal side tunnels. In this paper it has been attempted to determine the influence of the tunnel height on hydrodynamic characteristics of the hull to achieving an optimum shape for the tunnel. To achieve this purpose, numerical simulation of the problem has...
We obtain the (contracted) weak zero asymptotics for orthogonal polynomials with respect to Sobolev inner products with exponential weights in the real semiaxis, of the form xγe−φ(x), with γ > 0, which include as particular cases the counterparts of the so-called Freud (i.e., when φ has a polynomial growth at infinity) and Erdös (when φ grows faster than any polynomial at infinity) weights. In ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید