I have a second order diff eqn that is in the form of
\begin{equation} y^{\prime\prime} + \Big(\frac{3}{x} - \frac{3x^{-4}}{2[x^{-3} + B]}\Big)y^{\prime} - \frac{3}{2}\frac{1}{x^5[x^{-3} + B]}y = \mathcal{F}\,. \end{equation}
where $B$ and $\mathcal{F}$ are known constant. I have two initial conditions given as:
$$y(x=x_{\rm ini}) = \mathcal{C}x_{\rm ini}, ~~ y'(x_{\rm ini})=\mathcal{C}$$
where $\mathcal{C}$ is a constant number.
Note that this initial condition is for $y(x) \ll 1$ where $B\sim 0$ and $\mathcal{F} = 0$.
Is there a general (known) numeric method to find the $\mathcal{C}$, which satisfies the above equation? I have an algorithm but it's like brute force. It iterates every number and tries to find the root. Note that function is always positive for given $x>0$.
Note that: $0 \leq x \leq 1$ and $y(x) \geq 0$.