Search results for "root-finding"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
79	Michel Cosnard, Pierre Fraigniaud	Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	poles and zeros, distributed memorysystems, asynchronous polynomial root finding, iterative polynomial root finding, locally convergent, asynchronous methods, synchronous, convergence, polynomials, convergence of numerical methods, distributed memory multicomputer, hypercube multicomputer, polynomial zeros
60	Markus Färber, Beat D. Brüderlin	Multivariate root finding with search space decomposition and randomisation.	SAC	2009	DBLP DOI BibTeX RDF	randomised search, spatial data structures, root finding
52	Raghu Pasupathy, Bruce W. Schmeiser	Retrospective-approximation algorithms for the multidimensional stochastic root-finding problem.	ACM Trans. Model. Comput. Simul.	2009	DBLP DOI BibTeX RDF	Retrospective approximation, sample-average approximation, stochastic root finding
52	Luca Gemignani	Structured matrix methods for polynomial root-finding.	ISSAC	2007	DBLP DOI BibTeX RDF	polynomial root-finding, rank-structured matrices, complexity, eigenvalue computation
52	Zhonggang Zeng	A method computing multiple roots of inexact polynomials.	ISSAC	2003	DBLP DOI BibTeX RDF	polynomial root-finding
44	Victor Y. Pan, Brian Murphy, Rhys Eric Rosholt, Guoliang Qian, Yuqing Tang 0001	Real root-finding.	SNC	2007	DBLP DOI BibTeX RDF	univariate polynomials, root-finding, real roots
41	Kaoru Kurosawa, Tetsu Iwata, Quang Viet Duong	Root Finding Interpolation Attack.	Selected Areas in Cryptography	2000	DBLP DOI BibTeX RDF
38	Oliver Schütze, Adriana Lara, Carlos A. Coello Coello	Evolutionary continuation methods for optimization problems.	GECCO	2009	DBLP DOI BibTeX RDF	scalar optimization, multi-objective optimization, root finding, continuation method
36	Kai-Sheng Song	A globally convergent and consistent method for estimating the shape parameter of a generalized Gaussian distribution.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
35	Guilhem Castagnos, Antoine Joux, Fabien Laguillaumie, Phong Q. Nguyen	Factoring pq2 with Quadratic Forms: Nice Cryptanalyses.	ASIACRYPT	2009	DBLP DOI BibTeX RDF	Factorisation, Binary Quadratic Forms, Homogeneous Coppersmith’s Root Finding, Lattices, Public-key Cryptanalysis
28	Xin-Wen Wu, Margreta Kuijper, Parampalli Udaya	A root-finding algorithm for list decoding of Reed-Muller codes.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
28	Raghu Pasupathy, Bruce W. Schmeiser	Issues on simulation and optimization II: some issues in multivariate stochastic root finding.	WSC	2003	DBLP DOI BibTeX RDF
28	David F. McAllister, Stephen M. Pizer	Applications of root finding methods for discrete rational Chebyshev approximation.	ACM Southeast Regional Conference	1980	DBLP DOI BibTeX RDF
27	Soo Go, Victor Y. Pan, Pedro Soto	Root-Squaring for Root-Finding.	CASC	2023	DBLP DOI BibTeX RDF
27	Victor Y. Pan	New Progress in Classic Area: Polynomial Root-squaring and Root-finding.	CoRR	2022	DBLP DOI BibTeX RDF
27	Rémi Imbach, Victor Y. Pan	Root Radii and Subdivision for Polynomial Root-Finding.	CoRR	2021	DBLP BibTeX RDF
27	Rémi Imbach, Victor Y. Pan	Root Radii and Subdivision for Polynomial Root-Finding.	CASC	2021	DBLP DOI BibTeX RDF
27	Andre Schollmeyer, Bernd Fröhlich 0001	Direct trimming of NURBS surfaces on the GPU.	ACM Trans. Graph.	2009	DBLP DOI BibTeX RDF	point classification, trimmed NURBS, ray casting, programmable graphics hardware, parametric surfaces, root finding
27	Stef Graillat, Philippe Trebuchet	A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system.	ISSAC	2009	DBLP DOI BibTeX RDF	quotient algebra, normal form, multivariate polynomial, symbolic-numeric computation, root-finding
27	Le Thi Hoai An, Mohand Ouanes, Ahmed Zidna	An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial.	MCO	2008	DBLP DOI BibTeX RDF	quadratic upper function, quadratic lower function, Global optimization, root-finding
27	Anton I. Iliev, Nikolay Kyurkchiev	Some Methods for Simultaneous Extraction of a Part of All Multiple Roots of Algebraic Polynomials.	Computing	2005	DBLP DOI BibTeX RDF	Simultaneous root finding, multiple roots, Weierstrass method
27	Bernard Mourrain	Generalized normal forms and polynomial system solving.	ISSAC	2005	DBLP DOI BibTeX RDF	quotient algebra, normal form, multivariate polynomial, symbolic-numeric computation, root-finding
27	Zhonggang Zeng	Algorithm 835: MultRoot - a Matlab package for computing polynomial roots and multiplicities.	ACM Trans. Math. Softw.	2004	DBLP DOI BibTeX RDF	multiple root, multiple zero, multiplicity identification, polynomial, root-finding
27	Yiqiang Zhao	Analysis of the GIX/M/c model.	Queueing Syst. Theory Appl.	1994	DBLP DOI BibTeX RDF	Imbedded Markov chain, equilibrium probabilities, generating functions, characteristic functions, root-finding
27	D. Le	An Efficient Derivative-Free Method for Solving Nonlinear Equations.	ACM Trans. Math. Softw.	1985	DBLP DOI BibTeX RDF	root finding
25	Rouwaida Kanj, Zhuo Li 0001, Rajiv V. Joshi, Frank Liu 0001, Sani R. Nassif	A Root-Finding Method for Assessing SRAM Stability.	ISQED	2008	DBLP DOI BibTeX RDF	stability, memory, yield, sram, roots
25	Samuel Ehrlichman, Shane G. Henderson	Finite-sample performance guarantees for one-dimensional stochastic root finding.	WSC	2007	DBLP DOI BibTeX RDF
25	M. Moslemi, Hossein Ahmadi 0001, Hamid Sarbazi-Azad	Efficient Polynomial Root Finding Using SIMD Extensions.	ICPADS (2)	2005	DBLP DOI BibTeX RDF
25	Juan-Luis García Zapata, Juan Carlos Díaz Martín, Pedro Gómez Vilda	Parallel Root-Finding Method for LPC Analysis of Speech.	TSD	2004	DBLP DOI BibTeX RDF
24	Ole Caprani, Lars Hvidegaard, Mikkel Mortensen, Thomas Schneider	Robust and Efficient Ray Intersection of Implicit Surfaces.	Reliab. Comput.	2000	DBLP DOI BibTeX RDF
19	Allen Van Gelder, Alex Pang	Using PVsolve to Analyze and Locate Positions of Parallel Vectors.	IEEE Trans. Vis. Comput. Graph.	2009	DBLP DOI BibTeX RDF
17	Quoc Tran-Dinh	From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
17	Dúnia Marchiori, Ricardo Custódio, Daniel Panario, Lucia Moura	Probabilistic root finding in code-based cryptography.	J. Cryptogr. Eng.	2024	DBLP DOI BibTeX RDF
17	Daniel Johnson, Ronald Fedkiw	Addressing discontinuous root-finding for subsequent differentiability in machine learning, inverse problems, and control.	J. Comput. Phys.	2024	DBLP DOI BibTeX RDF
17	John Erik Fornaess, Mi Hu, Tuyen Trung Truong, Takayuki Watanabe	Backtracking New Q-Newton's method, Newton's flow, Voronoi's diagram and Stochastic root finding.	CoRR	2024	DBLP DOI BibTeX RDF
17	Beatriz Campos, Jordi Canela, Alberto Rodríguez-Arenas, Pura Vindel	Computing parameter planes of iterative root-finding methods with several free critical points.	CoRR	2024	DBLP DOI BibTeX RDF
17	Sania Qureshi, Ioannis K. Argyros, Amanullah Soomro, Krzysztof Gdawiec, Asif Ali Shaikh, Evren Hincal	A new optimal root-finding iterative algorithm: local and semilocal analysis with polynomiography.	Numer. Algorithms	2024	DBLP DOI BibTeX RDF
17	Silvia Berra, Alessandro La Torraca, Federico Benvenuto, Sara Sommariva	Combined Newton-Gradient Method for Constrained Root-Finding in Chemical Reaction Networks.	J. Optim. Theory Appl.	2024	DBLP DOI BibTeX RDF
17	Henrik A. Friberg	Projection onto the exponential cone: a univariate root-finding problem.	Optim. Methods Softw.	2023	DBLP DOI BibTeX RDF
17	Amir Naseem, M. A. Rehman, Sania Qureshi, Nasr-Al-Din Ide	Graphical and Numerical Study of a Newly Developed Root-Finding Algorithm and Its Engineering Applications.	IEEE Access	2023	DBLP DOI BibTeX RDF
17	Eugène Ndiaye, Ichiro Takeuchi	Root-finding approaches for computing conformal prediction set.	Mach. Learn.	2023	DBLP DOI BibTeX RDF
17	Daniel Johnson, Ronald Fedkiw	Addressing Discontinuous Root-Finding for Subsequent Differentiability in Machine Learning, Inverse Problems, and Control.	CoRR	2023	DBLP DOI BibTeX RDF
17	Komi Agbalenyo, Vincent Cailliez, Jonathan Cailliez	A novel Newton-Raphson style root finding algorithm.	CoRR	2023	DBLP DOI BibTeX RDF
17	Richard J. Martin	Root-finding: from Newton to Halley and beyond.	CoRR	2023	DBLP DOI BibTeX RDF
17	Jonathan Landy, YongSeok Jho	Root finding via local measurement.	CoRR	2023	DBLP DOI BibTeX RDF
17	Rémi Imbach, Guillaume Moroz	Fast evaluation and root finding for polynomials with floating-point coefficients.	CoRR	2023	DBLP DOI BibTeX RDF
17	Tuyen Trung Truong	Creating walls to avoid unwanted points in root finding and optimization.	CoRR	2023	DBLP DOI BibTeX RDF
17	Przemyslaw Koprowski	Factorization and root-finding for polynomials over division quaternion algebras.	CoRR	2023	DBLP DOI BibTeX RDF
17	Beatriz Campos, Jordi Canela, Pura Vindel	Dynamics of Newton-like root finding methods.	Numer. Algorithms	2023	DBLP DOI BibTeX RDF
17	Damek Davis	Variance reduction for root-finding problems.	Math. Program.	2023	DBLP DOI BibTeX RDF
17	Maria Irene Falcão, Fernando Miranda, Ricardo Severino, Maria Joana Soares	A Two-Step Quaternionic Root-Finding Method.	ICCSA (Workshops 1)	2023	DBLP DOI BibTeX RDF
17	Przemyslaw Koprowski	Factorization and root-finding for polynomials over division quaternion algebras.	ISSAC	2023	DBLP DOI BibTeX RDF
17	Rémi Imbach, Guillaume Moroz	Fast evaluation and root finding for polynomials with floating-point coefficients.	ISSAC	2023	DBLP DOI BibTeX RDF
17	Jiajie Luo, Lin Xiao 0002, Ping Tan, Jiguang Li, Wei Yao, Jichun Li 0002	Anti-interference Zeroing Neural Network Model for Time-Varying Tensor Square Root Finding.	ICONIP (7)	2023	DBLP DOI BibTeX RDF
17	Amir Naseem, M. A. Rehman, Thabet Abdeljawad	A Novel Root-Finding Algorithm With Engineering Applications and its Dynamics via Computer Technology.	IEEE Access	2022	DBLP DOI BibTeX RDF
17	Cem Yuksel	High-Performance Polynomial Root Finding for Graphics.	Proc. ACM Comput. Graph. Interact. Tech.	2022	DBLP DOI BibTeX RDF
17	Xunjian LI, Guo-Liang Tian	The upper-crossing/solution (US) algorithm for root-finding with strongly stable convergence.	CoRR	2022	DBLP DOI BibTeX RDF
17	Aaron Melman	Root finding techniques that work.	CoRR	2022	DBLP DOI BibTeX RDF
17	Ilias S. Kotsireas, Panos M. Pardalos, Alexander Semenov, William T. Trevena, Michael N. Vrahatis	Survey of Methods for Solving Systems of Nonlinear Equations, Part I: Root-finding Approaches.	CoRR	2022	DBLP DOI BibTeX RDF
17	Amir Naseem, M. A. Rehman, Thabet Abdeljawad	Real-World Applications of a Newly Designed Root-Finding Algorithm and Its Polynomiography.	IEEE Access	2021	DBLP DOI BibTeX RDF
17	Metin Vural, Aleksandr Y. Aravkin, Slawomir Stanczak	$\ell _{1}$-Norm Minimization With Regula Falsi Type Root Finding Methods.	IEEE Signal Process. Lett.	2021	DBLP DOI BibTeX RDF
17	Hui Zhai, Zheng Li 0013, Xiaofei Zhang 0001	DOA Estimation of Noncircular Signals for Coprime Linear Array via Polynomial Root-Finding Technique.	J. Circuits Syst. Comput.	2021	DBLP DOI BibTeX RDF
17	Guillaume Moroz	Fast real and complex root-finding methods for well-conditioned polynomials.	CoRR	2021	DBLP BibTeX RDF
17	Walter F. Mascarenhas	Root Finding With Interval Arithmetic.	CoRR	2021	DBLP BibTeX RDF
17	Eugène Ndiaye, Ichiro Takeuchi	Root-finding Approaches for Computing Conformal Prediction Set.	CoRR	2021	DBLP BibTeX RDF
17	Zoltán Kovács, Róbert Vajda	Parametric Root Finding for Supporting Proving and Discovering Geometric Inequalities in GeoGebra.	ADG	2021	DBLP DOI BibTeX RDF
17	Jianrong Chen, Jinjin Guo, Yunong Zhang	General Ten-Instant DTDMSR Model for Dynamic Matrix Square Root Finding.	Cybern. Syst.	2021	DBLP DOI BibTeX RDF
17	Amir Naseem, M. A. Rehman, Jihad Younis	A New Root-Finding Algorithm for Solving Real-World Problems and Its Complex Dynamics via Computer Technology.	Complex.	2021	DBLP DOI BibTeX RDF
17	Dejan Cebic, Nebojsa M. Ralevic	An Efficient Class of Iterative Root-Finding Methods with Applications.	SISY	2021	DBLP DOI BibTeX RDF
17	Didier Henrion, Simone Naldi, Mohab Safey El Din	Real root finding for low rank linear matrices.	Appl. Algebra Eng. Commun. Comput.	2020	DBLP DOI BibTeX RDF
17	Jinqing Shen, Xiaofei Zhang 0001, Yi He	Blind Joint DOA and Polarization Estimation for Polarization-Sensitive Coprime Arrays Via Reduced-Dimensional Root Finding Approach.	J. Circuits Syst. Comput.	2020	DBLP DOI BibTeX RDF
17	Mark M. Plecnik, Ronald S. Fearing	Designing Dynamic Machines With Large-Scale Root Finding.	IEEE Trans. Robotics	2020	DBLP DOI BibTeX RDF
17	Jian Huang 0003, Yuling Jiao, Lican Kang, Jin Liu 0011, Yanyan Liu, Xiliang Lu	A Support Detection and Root Finding Approach for Learning High-dimensional Generalized Linear Models.	CoRR	2020	DBLP BibTeX RDF
17	Ireneusz Gosciniak, Krzysztof Gdawiec	One more look on visualization of operation of a root-finding algorithm.	Soft Comput.	2020	DBLP DOI BibTeX RDF
17	Ivan Petkovic, Ðorde Herceg	Computers in mathematical research: the study of three-point root-finding methods.	Numer. Algorithms	2020	DBLP DOI BibTeX RDF
17	Dmitry I. Khomovsky	On using symmetric polynomials for constructing root finding methods.	Math. Comput.	2020	DBLP DOI BibTeX RDF
17	Sergio Rodriguez, Michael Ludkovski	Generalized Probabilistic Bisection for Stochastic Root Finding.	ACM Trans. Model. Comput. Simul.	2020	DBLP DOI BibTeX RDF
17	Ankush Aggarwal, Sanjay Pant	Beyond Newton: A New Root-Finding Fixed-Point Iteration for Nonlinear Equations.	Algorithms	2020	DBLP DOI BibTeX RDF
17	Joris van der Hoeven, Michael B. Monagan	Implementing the Tangent Graeffe Root Finding Method.	ICMS	2020	DBLP DOI BibTeX RDF
17	Qi Luan, Victor Y. Pan, Won-geun Kim, Vitaly Zaderman	Faster Numerical Univariate Polynomial Root-Finding by Means of Subdivision Iterations.	CASC	2020	DBLP DOI BibTeX RDF
17	Victor Y. Pan	Acceleration of Subdivision Root-Finding for Sparse Polynomials.	CASC	2020	DBLP DOI BibTeX RDF
17	Rémi Imbach, Victor Y. Pan	New progress in univariate polynomial root finding.	ISSAC	2020	DBLP DOI BibTeX RDF
17	Fiza Zafar, Alicia Cordero, Juan R. Torregrosa, Aneeqa Rafi	A class of four parametric with- and without-memory root finding methods.	Comput. Math. Methods	2019	DBLP DOI BibTeX RDF
17	Lin Xiao 0002	A finite-time convergent Zhang neural network and its application to real-time matrix square root finding.	Neural Comput. Appl.	2019	DBLP DOI BibTeX RDF
17	Sondre Glimsdal, Ole-Christoffer Granmo	Thompson Sampling Guided Stochastic Searching on the Line for Deceptive Environments with Applications to Root-Finding Problems.	J. Mach. Learn. Res.	2019	DBLP BibTeX RDF
17	Morteza Bisheh-Niasar, Krzysztof Gdawiec	Bisheh-Niasar-Saadatmandi root finding method via the S-iteration with periodic parameters and its polynomiography.	Math. Comput. Simul.	2019	DBLP DOI BibTeX RDF
17	Xiaoxiao Li, Jiguo Yu, Shuai Li 0002, Zehui Shao, Lina Ni	A Non-linear and Noise-Tolerant ZNN Model and Its Application to Static and Time-Varying Matrix Square Root Finding.	Neural Process. Lett.	2019	DBLP DOI BibTeX RDF
17	Alicia Cordero, Lucia Guasp, Juan R. Torregrosa	Fixed Point Root-Finding Methods of Fourth-Order of Convergence.	Symmetry	2019	DBLP DOI BibTeX RDF
17	Weibing Li, Bolin Liao, Lin Xiao 0002, Rongbo Lu	A recurrent neural network with predefined-time convergence and improved noise tolerance for dynamic matrix square root finding.	Neurocomputing	2019	DBLP DOI BibTeX RDF
17	Viviane Ledoux, Guillaume Moroz	Evaluation of Chebyshev polynomials on intervals and application to root finding.	CoRR	2019	DBLP BibTeX RDF
17	Hashim A. Yamani, Abdulaziz D. Alhaidari	Iterative polynomial-root-finding procedure with enhanced accuracy.	CoRR	2019	DBLP BibTeX RDF
17	Ramandeep Behl, Vinay Kanwar, Young Ik Kim	Higher-order families of Multiple root Finding Methods Suitable for non-convergent Cases and their dynamics.	Math. Model. Anal.	2019	DBLP DOI BibTeX RDF
17	Douglas Marcelino Beppler Martins, Gustavo Banegas, Ricardo Felipe Custódio	Don't forget your roots: constant-time root finding over 픽2m.	IACR Cryptol. ePrint Arch.	2019	DBLP BibTeX RDF
17	Juan-Luis García Zapata, Juan Carlos Díaz Martín, Álvaro Cortés Fácila	An adaptive subdivision method for root finding of univariate polynomials.	J. Comput. Appl. Math.	2019	DBLP DOI BibTeX RDF
17	Viviane Ledoux, Guillaume Moroz	Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding.	MACIS	2019	DBLP DOI BibTeX RDF
17	Hannes Bartz, Thomas Jerkovits, Sven Puchinger, Johan Rosenkilde	Fast Root Finding for Interpolation-Based Decoding of Interleaved Gabidulin Codes.	ITW	2019	DBLP DOI BibTeX RDF
17	Xiao Liu, Chaowei Hu, Xiangui Kang, Mingzhi Mao, Yunong Zhang, Binbin Qiu	New 5-Step Discrete-Time Zeroing Neuronet for Time-Dependent Matrix Square Root Finding.	ICSAI	2019	DBLP DOI BibTeX RDF
17	Douglas Marcelino Beppler Martins, Gustavo Banegas, Ricardo Felipe Custódio	Don't Forget Your Roots: Constant-Time Root Finding over \mathbb F_2^m F 2 m.	LATINCRYPT	2019	DBLP DOI BibTeX RDF
17	Rémi Imbach, Victor Y. Pan, Chee Yap, Ilias S. Kotsireas, Vitaly Zaderman	Root-Finding with Implicit Deflation.	CASC	2019	DBLP DOI BibTeX RDF
17	Gorav Jindal	On approximate polynomial identy testing and real root finding.		2019	RDF