نتایج جستجو برای: bisection method

تعداد نتایج: 1632081  

Journal: :Journal of Parallel and Distributed Computing 2017

Journal: :Attention, Perception & Psychophysics 2009

2002
E. A. PERDIOS V. S. KALANTONIS M. N. VRAHATIS

We present an improved method for locating periodic orbits of a dynamical system of arbitrary dimension. The method first employs the characteristic bisection method (CBM) to roughly locate a periodic orbit, followed by the quadratically convergent Newton method to rapidly refine its position. The method is applied to the physically interesting example of the two degrees of freedom photogravita...

Journal: :Vision Research 1999
Thom Carney Stanley A. Klein

Bisection is one of several spatial localization tasks that achieve hyperacuity performance levels. We find that optimal bisection thresholds, and hyperacuity tasks in general, are no better than might be expected from simple contrast detection and discrimination performance. The three-line bisection task can be described in terms of the test-pedestal paradigm where the test pattern is a horizo...

1998
JULIE KAMM JAMES G. NAGY

A Newton method to solve total least squares problems for Toeplitz systems of equations is considered. When coupled with a bisection scheme, which is based on an eecient algorithm for factoring Toeplitz matrices, global convergence can be guaranteed. Circulant and approximate factorization preconditioners are proposed to speed convergence when a conjugate gradient method is used to solve linear...

Journal: :Electronic Notes in Discrete Mathematics 2007
Drago Bokal Éva Czabarka László A. Székely Imrich Vrto

There are three general lower bound techniques for the crossing numbers of graphs, all of which can be traced back to Leighton’s work on applications of crossing number in VLSI: the Crossing Lemma, the Bisection Method, and the Embedding Method. In this contribution, we sketch their adaptations to the minor crossing number.

1997
James G. Nagy Julie Kamm

A Newton method to solve total least squares problems for Toeplitz systems of equations is considered. When coupled with a bisection scheme, which is based on an eecient algorithm for factoring Toeplitz matrices, global convergence can be guaranteed. Circulant and approximate factorization preconditioners are proposed to speed convergence when a conjugate gradient method is used to solve linear...

We first study some properties‎ ‎of $A$-module homomorphisms $theta:Xrightarrow Y$‎, ‎where $X$‎ ‎and $Y$ are Fréchet $A$-modules and $A$ is a unital‎ ‎Fréchet algebra‎. ‎Then we show that if there exists a‎ ‎continued bisection of the identity for $A$‎, ‎then $theta$ is‎ ‎automatically continuous under certain condition on $X$‎. ‎In‎ ‎particular‎, ‎every homomorphism from $A$ into certain‎ ‎Fr...

Journal: :Math. Comput. 1996
Reiner Horst

A generalized procedure of bisection of n–simplices is introduced, where the bisection point can be an (almost) arbitrary point at one of the longest edges. It is shown that nested sequences of simplices generated by successive generalized bisection converge to a singleton, and an exact bound of the convergence speed in terms of diameter reduction is given. For regular simplices, which mark the...

Journal: :Journal of neuropsychology 2015
Marco Pitteri Georg Kerkhoff Ingo Keller Francesca Meneghello Konstantinos Priftis

We studied the effects of optokinetic stimulation (OKS; leftward, rightward, control) on the visuo-perceptual and number space, in the same sample, during line bisection and mental number interval bisection tasks. To this end, we tested six patients with right-hemisphere damage and neglect, six patients with right-hemisphere damage but without neglect, and six neurologically healthy participant...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید