solve_bvp(fun, bc, x, y, p=None, S=None, fun_jac=None, bc_jac=None, tol=0.001, max_nodes=1000, verbose=0, bc_tol=None)

Notes

Parameters

fun : callable

bc : callable

x : array_like, shape (m,)

y : array_like, shape (n, m)

p : array_like with shape (k,) or None, optional

S : array_like with shape (n, n) or None

fun_jac : callable or None, optional

bc_jac : callable or None, optional

tol : float, optional

max_nodes : int, optional

verbose : {0, 1, 2}, optional

bc_tol : float, optional

Returns

Bunch object with the following fields defined:

sol : PPoly

p : ndarray or None, shape (k,)

x : ndarray, shape (m,)

y : ndarray, shape (n, m)

yp : ndarray, shape (n, m)

rms_residuals : ndarray, shape (m - 1,)

niter : int

status : int

message : string

success : bool

Examples

See :

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /scipy/integrate/_bvp.py#710
type: <class 'function'>
Commit: