|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 98 occurrences of 78 keywords
|
|
|
Results
Found 282 publication records. Showing 282 according to the selection in the facets
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(6), pp. 639-648, 1994. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), Honolulu, Hawaii, USA, March 9-12, 2009, pp. 1142-1143, 2009, ACM, 978-1-60558-166-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Model. Comput. Simul. ![In: ACM Trans. Model. Comput. Simul. 19(2), pp. 5:1-5:36, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Retrospective approximation, sample-average approximation, stochastic root finding |
52 | Luca Gemignani |
Structured matrix methods for polynomial root-finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pp. 175-180, 2007, ACM, 978-1-59593-743-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2003, Drexel University, Philadelphia, Pennsylvania, USA, August 3-6, 2003, Proceedings, pp. 266-272, 2003, ACM, 1-58113-641-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNC ![In: Symbolic-Numeric Computation, SNC 2007, International Workshop, 25-27 July 2007, University of Western Ontario, London, Ontario, Canada, pp. 161-169, 2007, ACM, 978-1-59593-744-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
univariate polynomials, root-finding, real roots |
41 | Kaoru Kurosawa, Tetsu Iwata, Quang Viet Duong |
Root Finding Interpolation Attack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Selected Areas in Cryptography ![In: Selected Areas in Cryptography, 7th Annual International Workshop, SAC 2000, Waterloo, Ontario, Canada, August 14-15, 2000, Proceedings, pp. 303-314, 2000, Springer, 3-540-42069-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
38 | Oliver Schütze, Adriana Lara, Carlos A. Coello Coello |
Evolutionary continuation methods for optimization problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12, 2009, pp. 651-658, 2009, ACM, 978-1-60558-325-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(2), pp. 510-527, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Guilhem Castagnos, Antoine Joux, Fabien Laguillaumie, Phong Q. Nguyen |
Factoring pq2 with Quadratic Forms: Nice Cryptanalyses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009. Proceedings, pp. 469-486, 2009, Springer, 978-3-642-10365-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(3), pp. 1190-1196, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Raghu Pasupathy, Bruce W. Schmeiser |
Issues on simulation and optimization II: some issues in multivariate stochastic root finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSC ![In: Proceedings of the 35th Winter Simulation Conference: Driving Innovation, New Orleans, Louisiana, USA, December 7-10, 2003, pp. 574-577, 2003, IEEE Computer Society, 0-7803-8132-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | David F. McAllister, Stephen M. Pizer |
Applications of root finding methods for discrete rational Chebyshev approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 18th Annual Southeast Regional Conference, 1980, Tallahassee, Florida, USA, March 24-26, 1980, pp. 99-102, 1980, ACM, 0-89791-014-1. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
27 | Soo Go, Victor Y. Pan, Pedro Soto |
Root-Squaring for Root-Finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing - 25th International Workshop, CASC 2023, Havana, Cuba, August 28 - September 1, 2023, Proceedings, pp. 107-127, 2023, Springer, 978-3-031-41723-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
27 | Victor Y. Pan |
New Progress in Classic Area: Polynomial Root-squaring and Root-finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.01727, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
27 | Rémi Imbach, Victor Y. Pan |
Root Radii and Subdivision for Polynomial Root-Finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.10821, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
27 | Rémi Imbach, Victor Y. Pan |
Root Radii and Subdivision for Polynomial Root-Finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing - 23rd International Workshop, CASC 2021, Sochi, Russia, September 13-17, 2021, Proceedings, pp. 136-156, 2021, Springer, 978-3-030-85164-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
27 | Andre Schollmeyer, Bernd Fröhlich 0001 |
Direct trimming of NURBS surfaces on the GPU. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 28(3), pp. 47, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pp. 167-174, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCO ![In: Modelling, Computation and Optimization in Information Systems and Management Sciences, Second International Conference, MCO 2008, Metz, France - Luxembourg, September 8-10, 2008. Proceedings, pp. 182-189, 2008, Springer, 978-3-540-87476-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 75(1), pp. 85-97, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Simultaneous root finding, multiple roots, Weierstrass method |
27 | Bernard Mourrain |
Generalized normal forms and polynomial system solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pp. 253-260, 2005, ACM, 1-59593-095-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 30(2), pp. 218-236, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
multiple root, multiple zero, multiplicity identification, polynomial, root-finding |
27 | Yiqiang Zhao |
Analysis of the GIX/M/c model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 15(1-4), pp. 347-364, 1994. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 11(3), pp. 250-262, 1985. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISQED ![In: 9th International Symposium on Quality of Electronic Design (ISQED 2008), 17-19 March 2008, San Jose, CA, USA, pp. 804-809, 2008, IEEE Computer Society, 978-0-7695-3117-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSC ![In: Proceedings of the Winter Simulation Conference, WSC 2007, Washington, DC, USA, December 9-12, 2007, pp. 313-321, 2007, WSC, 1-4244-1306-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | M. Moslemi, Hossein Ahmadi 0001, Hamid Sarbazi-Azad |
Efficient Polynomial Root Finding Using SIMD Extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS (2) ![In: 11th International Conference on Parallel and Distributed Systems, ICPADS 2005, Fuduoka, Japan, July 20-22, 2005, pp. 529-533, 2005, IEEE Computer Society, 0-7695-2281-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TSD ![In: Text, Speech and Dialogue, 7th International Conference, TSD 2004, Brno, Czech Republic, September 8-11, 2004, Proceedings, pp. 529-536, 2004, Springer, 3-540-23049-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Ole Caprani, Lars Hvidegaard, Mikkel Mortensen, Thomas Schneider |
Robust and Efficient Ray Intersection of Implicit Surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliab. Comput. ![In: Reliab. Comput. 6(1), pp. 9-21, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Allen Van Gelder, Alex Pang |
Using PVsolve to Analyze and Locate Positions of Parallel Vectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 15(4), pp. 682-695, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Quoc Tran-Dinh |
From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Optim. Appl. ![In: Comput. Optim. Appl. 87(1), pp. 181-218, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
17 | Dúnia Marchiori, Ricardo Custódio, Daniel Panario, Lucia Moura |
Probabilistic root finding in code-based cryptography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptogr. Eng. ![In: J. Cryptogr. Eng. 14(1), pp. 71-85, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
17 | Daniel Johnson, Ronald Fedkiw |
Addressing discontinuous root-finding for subsequent differentiability in machine learning, inverse problems, and control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Phys. ![In: J. Comput. Phys. 497, pp. 112624, January 2024. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.01393, 2024. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.06207, 2024. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 95(4), pp. 1715-1745, April 2024. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Optim. Theory Appl. ![In: J. Optim. Theory Appl. 200(1), pp. 404-427, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
17 | Henrik A. Friberg |
Projection onto the exponential cone: a univariate root-finding problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Methods Softw. ![In: Optim. Methods Softw. 38(3), pp. 457-473, May 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 11, pp. 2375-2383, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Eugène Ndiaye, Ichiro Takeuchi |
Root-finding approaches for computing conformal prediction set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 112(1), pp. 151-176, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Daniel Johnson, Ronald Fedkiw |
Addressing Discontinuous Root-Finding for Subsequent Differentiability in Machine Learning, Inverse Problems, and Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.12413, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Komi Agbalenyo, Vincent Cailliez, Jonathan Cailliez |
A novel Newton-Raphson style root finding algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.00698, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Richard J. Martin |
Root-finding: from Newton to Halley and beyond. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.12305, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Jonathan Landy, YongSeok Jho |
Root finding via local measurement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.13211, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Rémi Imbach, Guillaume Moroz |
Fast evaluation and root finding for polynomials with floating-point coefficients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.06244, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Tuyen Trung Truong |
Creating walls to avoid unwanted points in root finding and optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.11475, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Przemyslaw Koprowski |
Factorization and root-finding for polynomials over division quaternion algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.02072, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Beatriz Campos, Jordi Canela, Pura Vindel |
Dynamics of Newton-like root finding methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 93(4), pp. 1453-1480, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Damek Davis |
Variance reduction for root-finding problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 197(1), pp. 375-410, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Maria Irene Falcão, Fernando Miranda, Ricardo Severino, Maria Joana Soares |
A Two-Step Quaternionic Root-Finding Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (Workshops 1) ![In: Computational Science and Its Applications - ICCSA 2023 Workshops - Athens, Greece, July 3-6, 2023, Proceedings, Part I, pp. 708-721, 2023, Springer, 978-3-031-37104-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Przemyslaw Koprowski |
Factorization and root-finding for polynomials over division quaternion algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Tromsø, Norway, July 24-27, 2023, pp. 417-424, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Rémi Imbach, Guillaume Moroz |
Fast evaluation and root finding for polynomials with floating-point coefficients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Tromsø, Norway, July 24-27, 2023, pp. 325-334, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICONIP (7) ![In: Neural Information Processing - 30th International Conference, ICONIP 2023, Changsha, China, November 20-23, 2023, Proceedings, Part VII, pp. 113-124, 2023, Springer, 978-981-99-8125-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 10, pp. 19677-19684, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
17 | Cem Yuksel |
High-Performance Polynomial Root Finding for Graphics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Comput. Graph. Interact. Tech. ![In: Proc. ACM Comput. Graph. Interact. Tech. 5(3), pp. 27:1-27:15, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
17 | Xunjian LI, Guo-Liang Tian |
The upper-crossing/solution (US) algorithm for root-finding with strongly stable convergence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.00797, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
17 | Aaron Melman |
Root finding techniques that work. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.02326, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.08530, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 9, pp. 160868-160877, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
17 | Metin Vural, Aleksandr Y. Aravkin, Slawomir Stanczak |
$\ell _{1}$-Norm Minimization With Regula Falsi Type Root Finding Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Signal Process. Lett. ![In: IEEE Signal Process. Lett. 28, pp. 2132-2136, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Circuits Syst. Comput. ![In: J. Circuits Syst. Comput. 30(2), pp. 2150028:1-2150028:19, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
17 | Guillaume Moroz |
Fast real and complex root-finding methods for well-conditioned polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.04180, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
17 | Walter F. Mascarenhas |
Root Finding With Interval Arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.07126, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
17 | Eugène Ndiaye, Ichiro Takeuchi |
Root-finding Approaches for Computing Conformal Prediction Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.06648, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
17 | Zoltán Kovács, Róbert Vajda |
Parametric Root Finding for Supporting Proving and Discovering Geometric Inequalities in GeoGebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADG ![In: Proceedings of the 13th International Conference on Automated Deduction in Geometry, ADG 2021, Hagenberg, Austria/virtual, September 15-17, 2021., pp. 167-172, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
17 | Jianrong Chen, Jinjin Guo, Yunong Zhang |
General Ten-Instant DTDMSR Model for Dynamic Matrix Square Root Finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cybern. Syst. ![In: Cybern. Syst. 52(1), pp. 127-143, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex. ![In: Complex. 2021, pp. 6369466:1-6369466:10, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
17 | Dejan Cebic, Nebojsa M. Ralevic |
An Efficient Class of Iterative Root-Finding Methods with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SISY ![In: 19th IEEE International Symposium on Intelligent Systems and Informatics, SISY 2021, Subotica, Serbia, September 16-18, 2021, pp. 107-112, 2021, IEEE, 978-1-6654-1380-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
17 | Didier Henrion, Simone Naldi, Mohab Safey El Din |
Real root finding for low rank linear matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 31(2), pp. 101-133, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Circuits Syst. Comput. ![In: J. Circuits Syst. Comput. 29(7), pp. 2050104:1-2050104:22, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
17 | Mark M. Plecnik, Ronald S. Fearing |
Designing Dynamic Machines With Large-Scale Root Finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Robotics ![In: IEEE Trans. Robotics 36(4), pp. 1135-1152, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2001.05819, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
17 | Ireneusz Gosciniak, Krzysztof Gdawiec |
One more look on visualization of operation of a root-finding algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 24(18), pp. 14135-14155, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
17 | Ivan Petkovic, Ðorde Herceg |
Computers in mathematical research: the study of three-point root-finding methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 84(3), pp. 1179-1198, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
17 | Dmitry I. Khomovsky |
On using symmetric polynomials for constructing root finding methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. ![In: Math. Comput. 89(325), pp. 2321-2331, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
17 | Sergio Rodriguez, Michael Ludkovski |
Generalized Probabilistic Bisection for Stochastic Root Finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Model. Comput. Simul. ![In: ACM Trans. Model. Comput. Simul. 30(1), pp. 2:1-2:27, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
17 | Ankush Aggarwal, Sanjay Pant |
Beyond Newton: A New Root-Finding Fixed-Point Iteration for Nonlinear Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 13(4), pp. 78, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
17 | Joris van der Hoeven, Michael B. Monagan |
Implementing the Tangent Graeffe Root Finding Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMS ![In: Mathematical Software - ICMS 2020 - 7th International Conference, Braunschweig, Germany, July 13-16, 2020, Proceedings, pp. 482-492, 2020, Springer, 978-3-030-52199-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing - 22nd International Workshop, CASC 2020, Linz, Austria, September 14-18, 2020, Proceedings, pp. 431-446, 2020, Springer, 978-3-030-60025-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
17 | Victor Y. Pan |
Acceleration of Subdivision Root-Finding for Sparse Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing - 22nd International Workshop, CASC 2020, Linz, Austria, September 14-18, 2020, Proceedings, pp. 461-477, 2020, Springer, 978-3-030-60025-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
17 | Rémi Imbach, Victor Y. Pan |
New progress in univariate polynomial root finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: ISSAC '20: International Symposium on Symbolic and Algebraic Computation, Kalamata, Greece, July 20-23, 2020, pp. 249-256, 2020, ACM, 978-1-4503-7100-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Math. Methods ![In: Comput. Math. Methods 1(3), 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 31(S-2), pp. 793-800, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Mach. Learn. Res. ![In: J. Mach. Learn. Res. 20, pp. 52:1-52:24, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Simul. ![In: Math. Comput. Simul. 160, pp. 1-12, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Process. Lett. ![In: Neural Process. Lett. 50(2), pp. 1687-1703, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
17 | Alicia Cordero, Lucia Guasp, Juan R. Torregrosa |
Fixed Point Root-Finding Methods of Fourth-Order of Convergence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 11(6), pp. 769, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neurocomputing ![In: Neurocomputing 337, pp. 262-273, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
17 | Viviane Ledoux, Guillaume Moroz |
Evaluation of Chebyshev polynomials on intervals and application to root finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1912.05843, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
17 | Hashim A. Yamani, Abdulaziz D. Alhaidari |
Iterative polynomial-root-finding procedure with enhanced accuracy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1910.03507, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Model. Anal. ![In: Math. Model. Anal. 24(3), pp. 422-444, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2019, pp. 797, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Appl. Math. ![In: J. Comput. Appl. Math. 352, pp. 146-164, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
17 | Viviane Ledoux, Guillaume Moroz |
Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MACIS ![In: Mathematical Aspects of Computer and Information Sciences - 8th International Conference, MACIS 2019, Gebze, Turkey, November 13-15, 2019, Revised Selected Papers, pp. 35-41, 2019, Springer, 978-3-030-43119-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITW ![In: 2019 IEEE Information Theory Workshop, ITW 2019, Visby, Sweden, August 25-28, 2019, pp. 1-5, 2019, IEEE, 978-1-5386-6900-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSAI ![In: 6th International Conference on Systems and Informatics, ICSAI 2019, Shanghai, China, November 2-4, 2019, pp. 943-949, 2019, IEEE, 978-1-7281-5256-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATINCRYPT ![In: Progress in Cryptology - LATINCRYPT 2019 - 6th International Conference on Cryptology and Information Security in Latin America, Santiago de Chile, Chile, October 2-4, 2019, Proceedings, pp. 109-129, 2019, Springer, 978-3-030-30529-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
17 | Rémi Imbach, Victor Y. Pan, Chee Yap, Ilias S. Kotsireas, Vitaly Zaderman |
Root-Finding with Implicit Deflation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing - 21st International Workshop, CASC 2019, Moscow, Russia, August 26-30, 2019, Proceedings, pp. 236-245, 2019, Springer, 978-3-030-26830-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
17 | Gorav Jindal |
On approximate polynomial identy testing and real root finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2019 |
RDF |
|
Displaying result #1 - #100 of 282 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ >>] |
|