zbMATH — the first resource for mathematics

The existence of solution for a third-order two-point boundary value problem. (English) Zbl 1008.34010
Summary: The authors use the lower and upper solutions method and the fixed-point theorem on cones to establish several existence results on a third-order two-point boundary value problem.

34B15 Nonlinear boundary value problems for ordinary differential equations
Full Text: DOI
[1] Klaasen, G., Differential inequalities and existence theorems for second and third order boundary value problems, J. differential equations, 10, 529-537, (1971) · Zbl 0211.40001
[2] Jackson, L.K., Existence and uniqueness of solutions of boundary value problems for third order differential equations, J. differential equations, 13, 432-437, (1973) · Zbl 0256.34018
[3] O’Regan, D.J., Topological transversality: application to third order boundary value problems, SIAM J. math. anal., 19, 630-641, (1987) · Zbl 0628.34017
[4] Troy, W.C., Solutions of third-order differential equations relevant to draining and coating flows, SIAM J. math. anal., 24, 155-171, (1993) · Zbl 0807.34030
[5] Cabada, A., The method of lower and upper solutions for second, third, fourth and higher order boundary value problems, J. math. anal. appl., 185, 302-320, (1994) · Zbl 0807.34023
[6] Bernis, F.; Peletier, L.A., Two problems from draining flows involving third-order ordinary differential equations, SIAM J. math. anal., 27, 515-527, (1996) · Zbl 0845.34033
[7] Ruyun, M., Multiplicity results for a third order boundary value problem at resonance, Nonlinear anal., 32, 493-500, (1998) · Zbl 0932.34014
[8] Amann, H., Fixed point equations and nonlinear eigenvalue problems in ordered Banach spaces, SIAM rev., 18, 620-709, (1976) · Zbl 0345.47044
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.