Search results
From MaRDI portal
- Newton's and Chebyshev's methods to parallel factorization of polynomials 2001-10-14 Paper On a family of parallel root-finding methods for generalized polynomials...10 bytes (13 words) - 18:37, 12 April 2026
- efficiency of multipoint root-ratio methods for finding multiple zeros 2019-01-29 Paper On root-ratio multipoint methods for finding multiple zeros of univariate...10 bytes (17 words) - 18:04, 10 April 2026
- TRAINING METHOD ON A PARALLEL COMPUTER SYSTEM 2004-10-06 Paper PARALLEL DISTRIBUTED NEURAL NETWORKS FOR CLASSIFICATION 2004-10-06 Paper PARALLEL SYMMETRIC ELIMINATION...10 bytes (15 words) - 17:58, 10 April 2026
- of some efficient root-finding simultaneous methods 2022-06-13 Paper Computer visualization and dynamic study of new families of root-solvers 2021-09-29...10 bytes (14 words) - 18:04, 10 April 2026
- Paper Numerical root finding via Cox rings 2020-04-17 Paper Robust Numerical Tracking of One Path of a Polynomial Homotopy on Parallel Shared Memory Computers...10 bytes (13 words) - 23:01, 12 April 2026
- 2004-08-04 Paper An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs 2002-07-04 Paper Finding a 2-core of a tree in linear...10 bytes (15 words) - 19:47, 10 April 2026
- quasi-Laguerre iteration 1997-01-09 Paper The BKK root count in $\mathbf {C}^n$ 1996-12-03 Paper Parallel homotopy algorithm for symmetric large sparse eigenproblems...10 bytes (16 words) - 19:44, 10 April 2026
- The complexity of finding arc-disjoint branching flows 2016-06-21 Paper DAG-width and circumference of digraphs 2016-06-10 Paper Finding good 2-partitions...10 bytes (17 words) - 20:32, 10 April 2026
- Difference Equations 1977-01-01 Paper Optimal sequential and parallel search for finding a root 1977-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3876949...10 bytes (16 words) - 19:16, 10 April 2026
- 910897 (Why is no real title available?) 1996-08-22 Paper A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET International Journal...10 bytes (47 words) - 19:08, 10 April 2026
- initial-value problems 2021-11-15 Paper Higher-order families of multiple root finding methods suitable for non-convergent cases and their dynamics 2021-09-13...10 bytes (13 words) - 21:56, 10 April 2026
- Publication Date of Publication Type A parallel root-finding algorithm 2016-01-22 Paper A method to accelerate the convergence...10 bytes (17 words) - 12:50, 6 October 2023
- https://portal.mardi4nfdi.de/entity/Q4512562 2000-11-05 Paper On a family of parallel root-finding methods for generalized polynomials 2000-09-24 Paper https://portal...10 bytes (13 words) - 18:53, 10 April 2026
- Publication Date of Publication Type A new MM algorithm for root-finding problems 2025-01-22 Paper Poisson item count techniques with noncompliance...10 bytes (14 words) - 17:11, 10 April 2026
- Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs 1996-04-11 Paper HOW TO DRAW A SERIES-PARALLEL DIGRAPH 1995-04-06 Paper Algorithms...10 bytes (17 words) - 01:43, 11 April 2026
- vehicle routing problem with time and capacity constraints 2024-07-08 Paper Parallel algorithms for global optimization problems 2024-06-21 Paper A modified...10 bytes (17 words) - 16:51, 10 April 2026
- Improved initialization of the accelerated and robust QR-like polynomial root-finding 2005-04-15 Paper On the shifted QR iteration applied to companion matrices...10 bytes (16 words) - 17:54, 10 April 2026
- mardi4nfdi.de/entity/Q4023844 1993-01-23 Paper Systolic designs for Aitken's root finding method 1992-10-07 Paper More on systolic line drawing 1992-06-28 Paper...10 bytes (15 words) - 16:34, 11 April 2026
- 2019-05-03 Paper Finding a most parsimonious or likely tree in a network with respect to an alignment 2019-03-29 Paper On unrooted and root-uncertain variants...10 bytes (15 words) - 21:41, 10 April 2026
- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints 2008-06-03 Paper GASUB: finding global optima to discrete...10 bytes (14 words) - 17:40, 10 April 2026