Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Upper and lower solutions for periodic problems
Yang X. Applied Mathematics and Computation137 (2-3):413-422,2003.Type:Article
Date Reviewed: Jun 9 2003

The author combines the method of upper and lower solutions with the topological degree and the Miranda fixed point theorem to prove the existence of at least one solution for second order systems: x’(t)=f(t,x(t)) with periodic boundary conditions x(0)=x(1), x’(0)=x’(1), and first order systems: x’(t)=f(t,x(t)), with periodic boundary condition x(0)=x(T), assuming that there exist lower and upper solutions, and that the nonlinearity f satisfies a Lipschitz condition.

Research-oriented and intended for mathematicians and engineers, this paper contains interesting ideas, and is of good physical form. The statement on page 417 that there is no proof in English of Miranda’s fixed point theorem is incorrect, however. The interested reader can consult the book Ordinary differential equations in Rn [1].

Reviewer:  Abdelkader Boucherif Review #: CR127746 (0309-0910)
1) Piccinini, L.C. ; Vidossich, G.; Stampacchia, G. Ordinary differential equations in Rn. Springer-Verlag, New York, NY, 1984.
Bookmark and Share
  Reviewer Selected
 
 
Boundary Value Problems (G.1.7 ... )
 
 
Convergence And Stability (G.1.7 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Boundary Value Problems": Date
Computer-assisted existence proofs for two-point boundary value problems
Plum M. Computing 46(1): 19-34, 1991. Type: Article
Apr 1 1992
On parallel methods for boundary value ODEs
Ascher U., Chan S. Computing 46(1): 1-17, 1991. Type: Article
Aug 1 1991
Singular perturbation methods for ordinary differential equations
Robert E. J. (ed), Springer-Verlag New York, Inc., New York, NY, 1991. Type: Book (9780387975566)
Aug 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy