The Robust Newton Method for Polynomials and its Polynomiography

arXiv:2003.00372 · math.NA, cs.NA · Submitted 2020-03-01 · Read on arXiv

math.NA, cs.NA

Submitted: 2020-03-01

Updated: 2026-10-26

Terminology

• Reduction Theorem — 1× in this paper · explained in 2 episodes

Related papers

• Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
• A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
• Advanced Linear Algebra with Applications - Part I (Numerical linear algebra for PDEs, machine learning, and data assimilation)
• Operator learning meets inverse problems: A probabilistic perspective
• Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
• Windowed thinning and query complexity for the bouncy particle and Zigzag samplers