A Combinatorial Construction of High Order Algorithms for Finding Polynomial Roots of Known Multiplicity

Proceedings of the American Mathematical Society - United States
doi 10.1090/s0002-9939-10-10309-8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

A Globally Convergent Method for Simultaneously Finding Polynomial Roots

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1985English

Polynomial Local Improvement Algorithms in Combinatorial Optimization.

1981English

Exact Combinatorial Algorithms and Experiments for Finding Maximum K-Plexes

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2011English

Polynomial Time Algorithms for Multicast Network Code Construction

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2005English

High-Performance Combinatorial Algorithms

2003English

A Polynomial Time Algorithm for Finding Rational General Solutions of First Order Autonomous ODEs

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
2006English

Combinatorial Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

A Theory and Algorithms for Combinatorial Reoptimization

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2017English

A Theory and Algorithms for Combinatorial Reoptimization

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy