SkillAgentSearch skills...

root-finding

Problem-solving strategies for root finding in numerical methods

Install / Use

npx skills add parcadei/Continuous-Claude-v3 --skill root-finding

Installs into whichever agent you are using.

About this skill
📄

SKILL.md

Installable skill definition

Quality Score

82/100

Supported Platforms

Universal

Tags

Our assessment of root-finding

root-finding scores 82/100 on our quality scale, 3337th of 4,698 Development & Engineering skills we index.

Its SKILL.md is 3.5 KB long, well organised into 9 sections with 3 code examples: a solid amount of guidance for an agent.

With 3,943 GitHub stars, it is one of the more widely adopted skills in the catalogue.

Substance
26/30
Structure
18/20
Description
12/15
Adoption
15/20
Freshness
11/15

Maintenance, license and trust

  • The repository was last updated about 10 months ago. That is recent enough to be usable, but agent tooling moves fast, so check the instructions against your agent's current version.
  • Our last check on 2026-11-07 found the source still online.
  • It is released under the MIT license, a permissive license that allows use, modification and commercial use with attribution.
  • Its trust signals score 94/100, with 1 caution from licensing, adoption, age or documentation. These come from repository metadata, not a code audit — read the skill file before letting an agent act on it.

Safety scan

No issues found

Our scan of the whole file found no instruction hijacking, hidden characters, credential access, data exfiltration or destructive commands. An AI review of the same text found nothing harmful.

AI review by kimi-k2.7-code on 2026-10-01. Automated pattern scan on 2026-10-01. It catches known dangerous patterns, not every risk — read a skill before letting an agent act on it.

root-finding compared with similar skills

All 4 of these similar skills score higher than root-finding; compare them before choosing.

SkillScoreStarsUpdatedFormat
root-finding (this skill)by parcadei823.9k10mo agoSKILL.md
taste-skillby Leonxlnx100116.8k8d agoCLAUDE.md
ai-job-searchby ai-job-search-dev10072.1ktodayCLAUDE.md
claude-howtoby luongnv8910047.3k2d agoCLAUDE.md
lobehubby lobehub10085.6ktodayMCP Server

Frequently asked questions

How do I install root-finding?
Run npx skills add parcadei/Continuous-Claude-v3 --skill root-finding. The install tabs above show the steps for each supported agent.
Which AI agents does root-finding work with?
It is written for Universal, as a SKILL.md file. Other agents that read the same format can often use it too.
Is root-finding safe to use?
Our scan of the whole file found no instruction hijacking, hidden characters, credential access, data exfiltration or destructive commands. An AI review of the same text found nothing harmful. It is MIT-licensed and scores 94/100 on trust signals. Skills are instructions an agent will follow, so read the file before installing it and do not approve commands you do not understand.
Is root-finding still maintained?
The repository was last updated about 10 months ago. That is recent enough to be usable, but agent tooling moves fast, so check the instructions against your agent's current version.

name: root-finding description: "Problem-solving strategies for root finding in numerical methods" allowed-tools: [Bash, Read]

Root Finding

When to Use

Use this skill when working on root-finding problems in numerical methods.

Decision Tree

  1. Characterize the Problem

    • Single root or multiple roots?
    • Bracketed (know interval containing root)?
    • Derivatives available?
  2. Method Selection | Situation | Method | Implementation | |-----------|--------|----------------| | Bracketed, no derivatives | Bisection, Brent | scipy.optimize.brentq | | Derivatives available | Newton-Raphson | scipy.optimize.newton | | No derivatives | Secant method | scipy.optimize.newton (no fprime) | | System of equations | scipy.optimize.fsolve | Requires Jacobian ideally |

  3. Implement Root Finding

    • scipy.optimize.brentq(f, a, b) - guaranteed convergence if bracketed
    • scipy.optimize.newton(f, x0, fprime=df) - quadratic convergence near root
    • For systems: scipy.optimize.fsolve(F, x0)
  4. Handle Multiple Roots

    • Deflation: divide out found roots
    • Multiple starting points
    • sympy_compute.py solve "f(x)" --var x for symbolic solutions
  5. Verify Solutions

    • Check |f(root)| < tolerance
    • Verify root is in expected domain
    • z3_solve.py prove "f(root) == 0"

Tool Commands

Scipy_Brentq

uv run python -c "from scipy.optimize import brentq; root = brentq(lambda x: x**2 - 2, 0, 2); print('Root:', root)"

Scipy_Newton

uv run python -c "from scipy.optimize import newton; root = newton(lambda x: x**2 - 2, 1.0, fprime=lambda x: 2*x); print('Root:', root)"

Sympy_Solve

uv run python -m runtime.harness scripts/sympy_compute.py solve "x**3 - x - 1" --var x

Key Techniques

From indexed textbooks:

  • [Numerical analysis (Burden R.L., Fair... (Z-Library)] How accurate was his approximation? C H A P T E R 2 Solutions of Equations in One Variable 2. Survey of Methods and Software In this chapter we have considered the problem of solving the equation f (x) = 0, where f is a given continuous function.
  • [An Introduction to Numerical Analysis... (Z-Library)] Computational Solution of Nonlinear Operator Equations. Methods for Solving Systems of Nonlinear Equations. Society for Industrial and Applied Mathematics, Philadelphia.
  • [An Introduction to Numerical Analysis... (Z-Library)] General polynomial rootfinding methods There are a large number of rootfind ing algorithms designed especially for polynomials. Many of these are taken up in detail in the books Dejon and Henrici (1969), Henrici (1974, chap. There are far too many types of such methods to attempt to describe them all here.
  • [An Introduction to Numerical Analysis... (Z-Library)] J n Consider the product a 0 a 1 ••• am, where a 0 , a1, ••• , am are m + 1 num bers stored in a computer that uses n digit base fJ arithmetic. What is a rigorous bound for w? What is a statistical estimate for the size of w?
  • [An Introduction to Numerical Analysis... (Z-Library)] Discussion of the Literature There is a large literature on methods for calculating the roots of a single equation. See the books by Householder (1970), Ostrowski (1973), and Traub (1964) for a more extensive development than has been given here. Newton's method is one of the most widely used methods, and its development is due to many people.

Cognitive Tools Reference

See .claude/skills/math-mode/SKILL.md for full tool documentation.

Related Skills

View on GitHub
GitHub Stars3.9k
CategoryDevelopment
Updated9mo ago
Forks303

Languages

Python

Trust signals

94/100

From repository metadata: license, adoption, age and documentation. Not a code audit — see the Safety scan above for what the skill file itself contains.

1 low