Skip to main content
skill CX Codex

boundary-value-problems — Claude Code skill: what it does

A Claude skill that walks from a boundary value problem statement to a numerical answer: shooting, finite differences, solve_bvp and Sturm–Liouville eigenvalues.

MIT ★ 3,951 updated 2026-01-26

Install into Claude Code · Skills CLI (Vercel) All methods and platforms ↓
npx skills add parcadei/Continuous-Claude-v3 --skill boundary-value-problems -a claude-code
Open on GitHub

What boundary-value-problems does

The skill walks a boundary value problem through a decision tree. First it classifies the setup: conditions at both ends of an interval, an eigenvalue problem, or mixed Dirichlet, Neumann and Robin conditions. Then it picks a method. Shooting turns the problem into an initial value problem with guessed missing conditions. Finite differences swap derivatives for a tridiagonal system. Collocation goes through scipy.integrate.solve_bvp. A separate branch covers Sturm–Liouville form, when eigenvalues come out real, and weighted orthogonality of the eigenfunctions.

Inside SKILL.md you get the tree plus runnable commands: a solve_bvp one-liner, sympy_compute.py linsolve, and z3_solve.py prove. The skill may only call Bash and Read, so it computes and reads files without editing your project.

Those commands are invoked as uv run python -m runtime.harness scripts/.... Without uv and the repository's runtime scripts the lines won't start. The one-liner also imports scipy and numpy.

What it helps with

  • turn a two-point BVP into an initial value problem by shooting
  • build a tridiagonal system from finite differences and solve it
  • pick an initial mesh and guess for solve_bvp
  • check whether Sturm–Liouville eigenvalues are real
  • tell Dirichlet, Neumann and Robin conditions apart

Example prompts for the agent

  • I have a two-point boundary value problem with Dirichlet conditions at both ends. Walk me through the shooting method.
  • Set up scipy.integrate.solve_bvp for this ODE and show me how to check the residual.
  • How does the skill handle a Sturm–Liouville eigenvalue problem?

How to install boundary-value-problems

1Skills CLI (Vercel)

npx skills add parcadei/Continuous-Claude-v3 --skill boundary-value-problems -a claude-code

2Manually: put the files in place

~/.claude/skills/boundary-value-problems/SKILL.md

Copy the whole skill folder; for one project use .claude/skills/boundary-value-problems/

Step by step, with commands for each platform: How to install skills in Claude Code: five ways

Questions about boundary-value-problems

How do I install boundary-value-problems in Claude Code?

Run npx skills add parcadei/Continuous-Claude-v3 --skill boundary-value-problems -a claude-code. The skill lands at ~/.claude/skills/boundary-value-problems/SKILL.md.

What does boundary-value-problems do?

It hands Claude a decision tree for boundary value problems in ODEs and PDEs: classification, shooting, finite differences, collocation, eigenvalues, each with commands.

What is the skill allowed to run?

Only Bash and Read. The command examples go through uv run python and rely on scipy and numpy.

Source text

SKILL.md · MIT
---
name: boundary-value-problems
description: "Problem-solving strategies for boundary value problems in odes pdes"
allowed-tools: [Bash, Read]
---

# Boundary Value Problems

## When to Use

Use this skill when working on boundary-value-problems problems in odes pdes.

## Decision Tree


1. **Problem Classification**
   - Two-point BVP: conditions at x=a and x=b?
   - Sturm-Liouville: eigenvalue problem?
   - Mixed conditions: Dirichlet, Neumann, Robin?

2. **Shooting Method**
   - Convert BVP to IVP
   - Guess missing initial conditions
   - Iterate to satisfy boundary conditions
   - `scipy.integrate.solve_ivp` + root finding

3. **Finite Difference Method**
   - Discretize domain: x_i = a + i*h
   - Replace derivatives with differences: y'' ~ (y_{i+1} - 2y_i + y_{i-1})/h^2
   - Solve resulting linear system
   - `sympy_compute.py linsolve "tridiagonal_matrix" "boundary_vector"`

4. **Collocation/BVP Solver**
   - `scipy.integrate.solve_bvp(ode, bc, x, y_init)`
   - Provide initial mesh and guess
   - Check residual for accuracy

5. **Eigenvalue Problems**
   - Sturm-Liouville form: -(p(x)y')' + q(x)y = lambda*w(x)*y
   - Eigenvalues are real if p, w > 0
   - Eigenfunctions orthogonal with weight w
   - `sympy_compute.py eigenvalues "sturm_liouville_matrix"`


## Tool Commands

### Scipy_Solve_Bvp
```bash
uv run python -c "from scipy.integrate import solve_bvp; import numpy as np; ode = lambda x, y: [y[1], -y[0]]; bc = lambda ya, yb: [ya[0], yb[0]-1]; x = np.linspace(0, np.pi, 10); y = np.zeros((2, 10)); sol = solve_bvp(ode, bc, x, y); print('Solution at pi/2:', sol.sol(np.pi/2)[0])"
```

### Sympy_Linsolve
```bash
uv run python -m runtime.harness scripts/sympy_compute.py linsolve "tridiagonal_matrix" "boundary_vector"
```

### Z3_Sturm_Liouville
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "eigenvalue_real"
```

## Key Techniques

*From indexed textbooks:*

- [Elementary Differential Equations and... (Z-Library)] Boundary Value Problems and Partial Differential Equations (6th ed. Boston: Academic August 7, 2012 21:05 c10 Sheet number 88 Page number 676 cyan black August 7, 2012 21:05 c11 Sheet number 1 Page number 677 cyan black C H A P T E R Boundary Value Problems and Sturm–Liouville Theory As a result of separating variables in a partial differential equation in Chapter 10, we repeatedly encountered the differential equation X + λX = 0, 0 < x < L with the boundary conditions X (0) = 0, X (L) = 0. This boundary value problem is the prototype of a large class of problems that are important in applied mathematics.
- [Elementary Differential Equations and... (Z-Library)] Nonhomogeneous Boundary Value Problems In this section we discuss how to solve nonhomogeneous boundary value problems for both ordinary and partial differential equations. Most of our attention is directed toward problems in which the differential equation alone is nonhomogeneous, while the boundary conditions are homogeneous. We assume that the solution can be expanded in a series of eigenfunctions of a related homogeneous problem, and then we determine the coefcients in this series so that the nonhomogeneous problem is satised.
- [Elementary Differential Equations and... (Z-Library)] Consider the boundary conditions y, y bounded as x → −1, −1 m = n. August 7, 2012 21:05 c11 Sheet number 46 Page number 722 cyan black Chapter 11. Boundary Value Problems general differential equations or boundary conditions.
- [An Introduction to Numerical Analysis... (Z-Library)] Modern Numerical Methods for Ordinary Wiley, New York. User's guide for DVERK: A subroutine for solving non-stiff ODEs. Keller (1966), Analysis of Numerical Methods.
- [Elementary Differential Equations and... (Z-Library)] Describe in a few words how the solution evolves as time advances. A nonreactive tracer at concentration c0 is continuously introduced into a steady ow at the upstream end of a column of length L packed with a homogeneous granular medium. Assuming that the tracer concentration in the column is initially zero, the boundary value problem that models this process is 0 < x < L, t > 0, t > 0, 0 < x < L, where c(x, t), v, and D are as in Problem 27.

## Cognitive Tools Reference

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

© parcadei · MIT · parcadei/Continuous-Claude-v3

Similar skills

All skills for Science and research →

From the same set161

The whole set →
gradient-methods gradient-methods is a Claude Code skill that helps choose gradient-based optimization methods and step sizes, and diagnose convergence in minimization problems. CX Codex +1 ★ 3,951repo stars aegis aegis is a Claude Code subagent that finds code vulnerabilities and assesses security risks. It checks a supplied threat model and writes its findings to a project file. CX Codex ★ 3,951repo stars oracle oracle — a subagent for Claude Code that searches the web, queries APIs, and gathers information from external sources. Frames research systematically and synthesizes findings through optional LLM analysis. CX Codex ★ 3,951repo stars onboard onboard — a subagent for Claude Code that analyzes existing code and creates a continuity ledger. Runs when entering a brownfield project with code already in place. CX Codex ★ 3,951repo stars atlas atlas executes acceptance and end-to-end test scenarios across web applications. It inspects your project framework, runs user journeys, and outputs failure artifacts. CX Codex ★ 3,951repo stars judge judge is a Claude Code subagent that reviews refactoring and code transformations, checking behavior changes, code quality, and safety risks. CX Codex ★ 3,951repo stars profiler profiler identifies bottlenecks in your code: slow functions, memory leaks, concurrency bugs. Profiles Python and Node.js, spots N+1 queries and blocking operations. CX Codex ★ 3,951repo stars dynamic-recall dynamic-recall directs Claude Code to query and store session learnings, architectural decisions, and error fixes using hybrid semantic search. CX Codex +1 ★ 3,951repo stars

Project sponsors

Companies that keep this analytics open