Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
interval subdivision
Description:
A computational technique that repeatedly divides an interval into smaller intervals, used in numerical analysis, root finding, and geometric subdivision.
Related topics:
Numerical Methods and Algorithms (16%),
Advanced Optimization Algorithms Research (13%),
Mathematical functions and polynomials (12%)
OpenAlex ID:
keywords/interval-subdivision
Rate Limits in Sensorimotor Synchronization With Auditory and Visual Sequences: The Synchronization Threshold and the Benefits and Costs of Interval Subdivision
2003
·
Bruno H. Repp
·
Journal of Motor Behavior
·
261
Subdivision Direction Selection in Interval Methods for Global Optimization
1997
·
T. Csendes
, D. Ratz
·
SIAM Journal on Numerical Analysis
·
184
Cadre: an Algorithm for Numerical Quadrature
1971
·
Carl de Boor
·
Elsevier eBooks
·
121
On the selection of subdivision directions in interval branch-and-bound methods for global optimization
1995
·
Dietmar Ratz
, Tibor Csendes
·
Journal of Global Optimization
·
113
Detection of and Recovery from Errors in Cardiac Interbeat Intervals
1981
·
Michael N. Cheung
·
Psychophysiology
·
83
Counting processes in human timing
1976
·
David J. Getty
·
Perception & Psychophysics
·
76
PDF
Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
2002
·
John P. Boyd
·
SIAM Journal on Numerical Analysis
·
71
A Simple and Accurate Method for the Calculation of Generalized Fermi Functions
1998
·
Josep M. Aparicio
·
The Astrophysical Journal Supplement Series
·
59
PDF
Computing roots of polynomials by quadratic clipping
2007
·
Michael Bartoň
, Bert Jüttler
·
Computer Aided Geometric Design
·
57
New Subinterval Selection Criteria for Interval Global Optimization
2001
·
Tibor Csendes
·
Journal of Global Optimization
·
54
A highly efficient multiplication-free binary arithmetic coder and its application in video coding
2003
·
D. Marpe
, T. Wiegand
·
Proceedings - International Conference on Image Processing
·
53
When Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomial
2012
·
Michael Sagraloff
·
International Symposium on Symbolic and Algebraic Computation
·
52
Multisection in Interval Branch-and-Bound Methods for Global Optimization – I. Theoretical Results
2000
·
András Erik Csallner
, Tibor Csendes
, et al.
·
Journal of Global Optimization
·
51
On sound relative error bounds for floating-point arithmetic
2017
·
Anastasiia Izycheva
, Eva Darulova
·
Formal Methods in Computer-Aided Design
·
48
PDF
Distortions in Reproduction of Two-Interval Rhythms: When the “Attractor Ratio” Is Not Exactly 1:2
2012
·
Bruno H. Repp
, Justin London
, et al.
·
Music Perception An Interdisciplinary Journal
·
39
Multisection in Interval Branch-and-Bound Methods for Global Optimization II. Numerical Tests
2000
·
Mihály Csaba Markót
, Tibor Csendes
, et al.
·
Journal of Global Optimization
·
39
The evaluation of definite integrals by interval subdivision
1969
·
H. O'Hara
·
The Computer Journal
·
38
Fast approach for computing roots of polynomials using cubic clipping
2009
·
Ligang Liu
, Lei Zhang
, et al.
·
Computer Aided Geometric Design
·
37
A Doubly-Adaptive Clenshaw-Curtis Quadrature Method
1972
·
J. Oliver
·
The Computer Journal
·
37
Parametric Interval Linear Solver
2004
·
Evgenija D. Popova
·
Numerical Algorithms
·
33
Self-Generated Interval Subdivision Reduces Variability of Synchronization with a Very Slow Metronome
2010
·
Bruno H. Repp
·
Music Perception An Interdisciplinary Journal
·
30
The Asymptotic Behavior of Spacings Under Kakutani's Model for Interval Subdivision
1980
·
Ronald Pyke
·
The Annals of Probability
·
29
PDF
Random sequential bisection and its associated binary tree
1987
·
Masaaki Sibuya
, Yoshiaki Itoh
·
Annals of the Institute of Statistical Mathematics
·
24
Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves
2005
·
John P. Boyd
·
Applied Mathematics and Computation
·
21
A probabilistic search algorithm for finding optimally directed solutions
2000
·
Benny Raphael
, Ian F. C. Smith
·
Infoscience (Ecole Polytechnique Fédérale de Lausanne)
·
21
Show more works
View as search
Works count:
141
Citation count:
2,091
Year
Topic
Type