root-finding
Problem-solving strategies for root finding in numerical methods
Install / Use
npx skills add parcadei/Continuous-Claude-v3 --skill root-findingInstalls into whichever agent you are using.
SKILL.md
Installable skill definition
Quality Score
Category
Development & EngineeringSupported Platforms
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.
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 foundOur 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.
| Skill | Score | Stars | Updated | Format |
|---|---|---|---|---|
| root-finding (this skill)by parcadei | 82 | 3.9k | 10mo ago | SKILL.md |
| taste-skillby Leonxlnx | 100 | 116.8k | 8d ago | CLAUDE.md |
| ai-job-searchby ai-job-search-dev | 100 | 72.1k | today | CLAUDE.md |
| claude-howtoby luongnv89 | 100 | 47.3k | 2d ago | CLAUDE.md |
| lobehubby lobehub | 100 | 85.6k | today | MCP 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.
Skill content
View source on GitHubname: 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
-
Characterize the Problem
- Single root or multiple roots?
- Bracketed (know interval containing root)?
- Derivatives available?
-
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 | -
Implement Root Finding
scipy.optimize.brentq(f, a, b)- guaranteed convergence if bracketedscipy.optimize.newton(f, x0, fprime=df)- quadratic convergence near root- For systems:
scipy.optimize.fsolve(F, x0)
-
Handle Multiple Roots
- Deflation: divide out found roots
- Multiple starting points
sympy_compute.py solve "f(x)" --var xfor symbolic solutions
-
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
taste-skill
116.8kAgent skills that give coding agents taste: art direction, reference images and a browser check instead of generic AI pages
ai-job-search
72.1kThe job search that runs on your machine. AI job application framework built on Claude Code: evaluate postings, tailor CVs, write cover letters, prep interviews. Fork it and own it.
claude-howto
47.3kA visual, example-driven guide to Claude Code — from basic concepts to advanced agents, with copy-paste templates that bring immediate value.
lobehub
85.6k🤯 LobeHub - Super-Agents on Your Team. Add super-agents to the chats your team already uses.They take on work by themselves and get better every week.
Languages
Trust signals
From repository metadata: license, adoption, age and documentation. Not a code audit — see the Safety scan above for what the skill file itself contains.
