On faster convergence of the bisection method for certain triangles
نویسندگان
چکیده
منابع مشابه
On Faster Convergence of the Bisection Method
Let AABC be a triangle with vertices A, B, and C. It is "bisected" as follows: choose a/the longest side (say AB) of AABC, let D be the midpoint of AB, then replace AABC by two triangles aA.DC and ADBC. Let Ag| be a given triangle. Bisect Aqj into two triangles A¡¡ and Aj2. Next bisect each Aj(-, /= 1, 2, forming four new triangles A2j-, i = 1,2, 3,4. Continue thus, forming an infinite sequence...
متن کامل“the effect of risk aversion on the demand for life insurance: the case of iranian life insurance market”
abstract: about 60% of total premium of insurance industry is pertained?to life policies in the world; while the life insurance total premium in iran is less than 6% of total premium in insurance industry in 2008 (sigma, no 3/2009). among the reasons that discourage the life insurance industry is the problem of adverse selection. adverse selection theory describes a situation where the inf...
15 صفحه اولModified Bisection Search for Faster Metastability Characterization
Circuit state bisection is a robust technique to characterize the performance of multi-stage synchronizers. The passage of metastability between synchronizer stages introduces effects that are not captured by small-signal models and thus numerical integration remains the most reliable method for characterizing this behavior. However, the large number of transient simulations required to charact...
متن کاملOn convergence of certain nonlinear Durrmeyer operators at Lebesgue points
The aim of this paper is to study the behaviour of certain sequence of nonlinear Durrmeyer operators $ND_{n}f$ of the form $$(ND_{n}f)(x)=intlimits_{0}^{1}K_{n}left( x,t,fleft( tright) right) dt,,,0leq xleq 1,,,,,,nin mathbb{N}, $$ acting on bounded functions on an interval $left[ 0,1right] ,$ where $% K_{n}left( x,t,uright) $ satisfies some suitable assumptions. Here we estimate the rate...
متن کاملOn the Number of Triangles Contained in Certain Graphs
Let G(n ;m) denote a graph of n vertices and m edges. Vertices of G will be denoted by x 1 ,. .. ,y 1. .. ; edges will be denoted by (x, y) and triangles by (x, y, z). (G-x 1-x 2 x k) will denote the graph G from which the vertices x 1 ,. .. , xk and all edges incident to them have been omitted. has been omitted. A special case of a well known theorem of Turin states 2 that every G(n ; 4 + 1) c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1979
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1979-0521285-4