ftc20110121 0 最近の更新履歴 Hideo Fujiwara

We start with some introductory materials to the over-relaxed η- proximal point algorithm based on the notion of maximal η-monotonicity, and recall some investigations on

Restricting the input to n-vertex cubic graphs of girth at least 5, we apply a modified algorithm that is based on selecting vertices of minimum degree, using operations that remove

The general context for a symmetry- based analysis of pattern formation in equivariant dynamical systems is sym- metric (or equivariant) bifurcation theory.. This is surveyed

(at least a proof can be reconstructed from it, after correcting a number of misprinted formulae). Other authors have subsequently given different proofs, see for instance [Kn1,

this result is re-derived in novel fashion, starting from a method proposed by F´ edou and Garcia, in [17], for some algebraic succession rules, and extending it to the present case

(3) We present a JavaScript library 2 , that contains all the al- gorithms described in this paper, and a Web platform, AGORA 3 (Automatic Graph Overlap Removal Algorithms), in

From the delayed cosine and sine type matrix function on the fractal set R αn (0 < α ≤ 1) corresponding to second order inhomogeneous delay differential equations with

In Section 3, we employ the method of upper and lower solutions and obtain the uniqueness of solutions of a two-point Dirichlet fractional boundary value problem for a