944 resultados para Second order cone programming
Resumo:
We establish existence results for solutions to three-point boundary value problems for nonlinear, second-order, ordinary differential equations with nonlinear boundary conditions. (C) 2001 Elsevier Science Ltd. All rights reserved.
Resumo:
We study difference equations which arise as discrete approximations to two-point boundary value problems for systems of second-order ordinary differential equations. We formulate conditions which guarantee a priori bounds on first differences of solutions to the discretized problem. We establish existence results for solutions to the discretized boundary value problems subject to nonlinear boundary conditions. We apply our results to show that solutions to the discrete problem converge to solutions of the continuous problem in an aggregate sense. (C) 2002 Elsevier Science Ltd. All rights reserved.
Resumo:
We give conditions on f involving pairs of discrete lower and discrete upper solutions which lead to the existence of at least three solutions of the discrete two-point boundary value problem yk+1 - 2yk + yk-1 + f (k, yk, vk) = 0, for k = 1,..., n - 1, y0 = 0 = yn,, where f is continuous and vk = yk - yk-1, for k = 1,..., n. In the special case f (k, t, p) = f (t) greater than or equal to 0, we give growth conditions on f and apply our general result to show the existence of three positive solutions. We give an example showing this latter result is sharp. Our results extend those of Avery and Peterson and are in the spirit of our results for the continuous analogue. (C) 2002 Elsevier Science Ltd. All rights reserved.
Resumo:
We study the continuous problem y"=f(x,y,y'), xc[0,1], 0=G((y(0),y(1)),(y'(0), y'(1))), and its discrete approximation (y(k+1)-2y(k)+y(k-1))/h(2) =f(t(k), y(k), v(k)), k = 1,..., n-1, 0 = G((y(0), y(n)), (v(1), v(n))), where f and G = (g(0), g(1)) are continuous and fully nonlinear, h = 1/n, v(k) = (y(k) - y(k-1))/h, for k =1,..., n, and t(k) = kh, for k = 0,...,n. We assume there exist strict lower and strict upper solutions and impose additional conditions on f and G which are known to yield a priori bounds on, and to guarantee the existence of solutions of the continuous problem. We show that the discrete approximation also has solutions which approximate solutions of the continuous problem and converge to the solution of the continuous problem when it is unique, as the grid size goes to 0. Homotopy methods can be used to compute the solution of the discrete approximation. Our results were motivated by those of Gaines.
Resumo:
Error condition detected We consider discrete two-point boundary value problems of the form D-2 y(k+1) = f (kh, y(k), D y(k)), for k = 1,...,n - 1, (0,0) = G((y(0),y(n));(Dy-1,Dy-n)), where Dy-k = (y(k) - Yk-I)/h and h = 1/n. This arises as a finite difference approximation to y" = f(x,y,y'), x is an element of [0,1], (0,0) = G((y(0),y(1));(y'(0),y'(1))). We assume that f and G = (g(0), g(1)) are continuous and fully nonlinear, that there exist pairs of strict lower and strict upper solutions for the continuous problem, and that f and G satisfy additional assumptions that are known to yield a priori bounds on, and to guarantee the existence of solutions of the continuous problem. Under these assumptions we show that there are at least three distinct solutions of the discrete approximation which approximate solutions to the continuous problem as the grid size, h, goes to 0. (C) 2003 Elsevier Science Ltd. All rights reserved.
Resumo:
We start by studying the existence of positive solutions for the differential equation u '' = a(x)u - g(u), with u ''(0) = u(+infinity) = 0, where a is a positive function, and g is a power or a bounded function. In other words, we are concerned with even positive homoclinics of the differential equation. The main motivation is to check that some well-known results concerning the existence of homoclinics for the autonomous case (where a is constant) are also true for the non-autonomous equation. This also motivates us to study the analogous fourth-order boundary value problem {u((4)) - cu '' + a(x)u = vertical bar u vertical bar(p-1)u u'(0) = u'''(0) = 0, u(+infinity) = u'(+infinity) = 0 for which we also find nontrivial (and, in some instances, positive) solutions.
Resumo:
A series of new ruthenium(II) complexes of the general formula [Ru(eta(5)-C5H5)(PP)(L)][PF6] (PP = DPPE or 2PPh(3), L = 4-butoxybenzonitrile or N-(3-cyanophenyl)formamide) and the binuclear iron(II) complex [Fe(eta(5)-C5H5)(PP)(mu-L)(PP)(eta(5)-C5H5)Fe][PF6](2) (L = (E)-2-(3-(4-nitrophenyl)allylidene)malononitrile, that has been also newly synthesized) have been prepared and studied to evaluate their potential in the second harmonic generation property. All the new compounds were fully characterized by NMR, IR and UV-Vis spectroscopies and their electrochemistry behaviour was studied by cyclic voltammetry. Quadratic hyperpolarizabilities (beta) of three of the complexes have been determined by hyper-Rayleigh scattering (HRS) measurements at fundamental wavelength of 1500 nm and the calculated static beta(0) values are found to fall in the range 65-212 x 10(-30) esu. Compound presenting beta(0) = 212 x 10(-30) esu has revealed to be 1.2 times more efficient than urea standard in the second harmonic generation (SHG) property, measured in the solid state by Kurtz powder technique, using a Nd:YAG laser (1064 nm). (C) 2013 Elsevier B.V. All rights reserved.
Resumo:
Vishnu is a tool for XSLT visual programming in Eclipse - a popular and extensible integrated development environment. Rather than writing the XSLT transformations, the programmer loads or edits two document instances, a source document and its corresponding target document, and pairs texts between then by drawing lines over the documents. This form of XSLT programming is intended for simple transformations between related document types, such as HTML formatting or conversion among similar formats. Complex XSLT programs involving, for instance, recursive templates or second order transformations are out of the scope of Vishnu. We present the architecture of Vishnu composed by a graphical editor and a programming engine. The editor is an Eclipse plug-in where the programmer loads and edits document examples and pairs their content using graphical primitives. The programming engine receives the data collected by the editor and produces an XSLT program. The design of the engine and the process of creation of an XSLT program from examples are also detailed. It starts with the generation of an initial transformation that maps source document to the target document. This transformation is fed to a rewrite process where each step produces a refined version of the transformation. Finally, the transformation is simplified before being presented to the programmer for further editing.
Resumo:
Some existence results are obtained for periodic solutions of nonautonomous second-order differential inclusions systems with p-Laplacian
Resumo:
Using the nonsmooth variant of minimax point theorems, some existence results are obtained for periodic solutions of nonautonomous second-order differential inclusions systems with p-Laplacian.
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
Based on Lucas functions, an improved version of the Diffie-Hellman distribution key scheme and to the ElGamal public key cryptosystem scheme are proposed, together with an implementation and computational cost. The security relies on the difficulty of factoring an RSA integer and on the difficulty of computing the discrete logarithm.
Resumo:
Less is known about social welfare objectives when it is costly to change prices, as in Rotemberg (1982), compared with Calvo-type models. We derive a quadratic approximate welfare function around a distorted steady state for the costly price adjustment model. We highlight the similarities and differences to the Calvo setup. Both models imply inflation and output stabilization goals. It is explained why the degree of distortion in the economy influences inflation aversion in the Rotemberg framework in a way that differs from the Calvo setup.