• Korean Journal of Mathematics
• /
• v.25 no.1
• /
• pp.37-43
• /
• 2017

We study the existence of positive solutions of second order nonlinear separated boundary value problems of superlinear as well as sublinear type without imposing monotonicity restrictions on the problem. The type of problem investigated cannot be analyzed using the linearization about the trivial solution because either it does not exist (the sublinear case) or is trivial (the superlinear case). The results follow from a known fixed point theorem by noticing that the concavity of the solutions provides an important condition for the applicability of the fixed point result.

• Korean Journal of Mathematics
• /
• v.20 no.3
• /
• pp.333-341
• /
• 2012

We investigate the number of solutions for the superlinear elliptic bifurcation problem with Dirichlet boundary condition. We get a theorem which shows the existence of at least $k$ weak solutions for the superlinear elliptic bifurcation problem with boundary value condition. We obtain this result by using the critical point theory induced from invariant linear subspace and the invariant functional.

• Korean Journal of Mathematics
• /
• v.26 no.4
• /
• pp.823-824
• /
• 2018

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.3
• /
• pp.789-801
• /
• 2014

In this paper, we study the existence of ground state solutions for a class of non-resonant cooperative elliptic systems by a variant weak linking theorem. Here the classical Ambrosetti-Rabinowitz superquadratic condition is replaced by a general super quadratic condition.

• Electronics and Telecommunications Trends
• /
• v.14 no.2 s.56
• /
• pp.53-57
• /
• 1999

Speedup is often used to show scalability, but its classical definition fails to explain some real measurements such as superlinear speedup. This leads to scaled speedup which scales other system parameters as number of rocessors changes. In this paper, scaled speedup and architectural speedup are introduced and superlinear speedup is explained with its cause.

• Journal of applied mathematics & informatics
• /
• v.6 no.2
• /
• pp.393-406
• /
• 1999

Affine invariant sufficient conditions are given for two local convergence theorems involving inexact Newton-like methods. The first uses conditions on the first Frechet-derivative whereas the second theorem employs hypotheses on the second. Radius of con-vergence as well as rate of convergence results are derived. Results involving superlinear convergence and known to be true for inexact Newton methods are extended here. Moreover we show that under hypotheses on the second Frechet-derivation our radius of convergence results are derived. Results involving superlinear convergence and known to be true or inexact Newton methods are extended here. Moreover we show that under hypotheses on the second Frechet-derivative our radius of conver-gence is larger than the corresponding one in [10]. This allows a wider choice for the initial guess. A numerical example is also pro-vided to show that our radius of convergence is larger then the one in [10].

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.2
• /
• pp.409-421
• /
• 2014

This paper deals with the superlinear elliptic problem without Ambrosetti and Rabinowitz type growth condition of the form: $$\{-div\((1+\frac{|{\nabla}u|^{p(x)}}{\sqrt{1+|{\nabla}u|^{2p(x)}}}})|{\nabla}u|^{p(x)-2}{\nabla}u\)={\lambda}f(x,u)\;a.e.\;in\;{\Omega}\\u=0,\;on\;{\partial}{\Omega}$$ where ${\Omega}{\subset}R^N$ is a bounded domain with smooth boundary ${\partial}{\Omega}$, ${\lambda}$ > 0 is a parameter. The purpose of this paper is to obtain the existence results of nontrivial solutions for every parameter ${\lambda}$. Firstly, by using the mountain pass theorem a nontrivial solution is constructed for almost every parameter ${\lambda}$ > 0. Then we consider the continuation of the solutions. Our results are a generalization of that of Manuela Rodrigues.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.759-772
• /
• 2012

In this paper, semi-infinite constrained programming, a class of constrained nonsmooth optimization problems, are transformed into unconstrained nonsmooth convex programs under the help of exact penalty function. The unconstrained objective function which owns the primal-dual gradient structure has connection with $\mathcal{VU}$-space decomposition. Then a $\mathcal{VU}$-space decomposition method can be applied for solving this unconstrained programs. Finally, the superlinear convergence algorithm is proved under certain assumption.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.401-418
• /
• 2005

In this paper, a dual algorithm, based on a smoothing function of Bertsekas (1982), is established for solving unconstrained minimax problems. It is proven that a sequence of points, generated by solving a sequence of unconstrained minimizers of the smoothing function with changing parameter t, converges with Q-superlinear rate to a Kuhn-Thcker point locally under some mild conditions. The relationship between the condition number of the Hessian matrix of the smoothing function and the parameter is studied, which also validates the convergence theory. Finally the numerical results are reported to show the effectiveness of this algorithm.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2006.06a
• /
• pp.303-310
• /
• 2006

The sorting algorithms have been developed to take advantage of distributed computers. But the speedup of parallel sorting algorithms decrease rapidly with increased number of processors due to parallel processing overhead such as context switching time and inter-processor communication cost. In this paper, we propose a parallel sorting method which provides linear speedup of an optimal serial algorithm for a system with a large number of processors. This algorithm may even provide superlinear speedup for a practical system. The algorithm takes advantage of an interconnection network properties and its protocol.