نتایج جستجو برای: bisection method
تعداد نتایج: 1632081 فیلتر نتایج به سال:
Introduction: One way to evaluate visual-spatial functions is to use line bisection test. With the advancement of information technology, this study attempted to design a line bisection test software and investigate its efficacy compared to the conventional paper-pencil form in schizophrenic patients. Method: The present study was a causal-comparative one and line bisection test software was de...
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...
In this paper we study the different approaches used so far to apply the bisection method for solving the symmetric tridiagonal eigenproblem. We review the sequential methods used to perform the final extraction of the eigenvalues and compare two new techniques that offer very good results. The sequential version of the bisection method we have implemented even surpasses the results of the QR i...
The communication overhead is a major bottleneck for the execution of a process graph on a parallel computer system. In the case of two processors, the minimization of the communication can be modeled by the graph bisection problem. The spectral lower bound of 2jV j 4 for the bisection width of a graph is well-known. The bisection width is equal to 2jV j 4 iff all vertices are incident to 2 2 c...
The paper presents a vowel classification model that explicitly predicts vowel identification by second language (L2) learners based on the phonological map of their first language (L1). The model represents vowels in formant space by polar coordinates with the mid-range of the formants as the origin. The model assumes that category boundaries bisect the angles made by two adjacent category cen...
We present an implementation of the Continued Fractions (CF) real root isolation method using a recently developed upper bound on the positive values of the roots of polynomials. Empirical results presented in this paper verify that this implementation makes the CF method always faster than the Vincent-Collins-Akritas bisection method, or any of its variants.
The conclusion of the classical ham sandwich theorem of Banach and Steinhaus may be strengthened: there always exists a common bisecting hyperplane that touches each of the sets, that is, intersects the closure of each set. Hence, if the knife is smeared with mayonnaise, a cut can always be made so that it will not only simultaneously bisect each of the ingredients, but it will also spread mayo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید