Derivation of three-derivative Runge-Kutta methods

We introduce an algorithm for a numerical integration of ordinary differential equations in the form of y′ = f(y). We extend the two-derivative Runge-Kutta methods (Chan and Tsai, Numer. Algor. 53, 171–194, 2010) to three-derivative Runge-Kutta methods by including the third derivative \(y^{\prime \prime \prime }=\hat {g}(y)=f^{\prime \prime }(y)(f(y), f(y))+f^{\prime }(y)f^{\prime }(y)f(y)\). We present an approach based on the algebraic theory of Butcher (Math. Comp. 26, 79–106, 1972) and the \(\mathcal {B}-\) series theory of Hairer and Wanner (Computing 13, 1–15 (1974)) combined with the methodology of Chan and Chan (Computing 77(3), 237–252, 2006). In this study, special explicit three-derivative Runge-Kutta methods that possess one evaluation of first derivative, one evaluation of second derivative, and many evaluations of third derivative per step are introduced. Methods with stages up to six and of order up to ten are presented. The numerical calculations have been performed on some standard problems and comparisons made with the accessible methods in the literature.     

Directed Partial Orders on Complex Numbers and Quaternions over Non-Archimedean Linearly Ordered Fields

Let F be a non-archimedean linearly ordered field, and C and H be the field of complex numbers and the division algebra of quaternions over F, respectively. In this paper, a class of directed partial orders on C are constructed directly and concretely using additive subgroup of F ⁺. This class of directed partial orders includes those given in Rump and Wang (J. Algebra 400, 1–7, 2014), and Yang (J. Algebra 295(2), 452–457, 2006) as special cases and we conjecture that it covers all directed partial orders on C such that 1 > 0. It turns out that this construction also works very well on H. We note that none of these directed partial orders is a lattice order on C or H.     

Rigid Binary Relations on a 4-Element Domain

An n-ary relation ρ on a set U is strongly rigid if it is preserved only by trivial operations. It is projective if the only idempotent operations in P o l ρ are projections. Rosenberg, (Rocky Mt. J. Math. 3, 631–639, 1973) characterized all strongly rigid relations on a set with two elements and found a strongly rigid binary relation on every domain U of at least 3 elements. Larose and Tardif (Mult.-Valued Log. 7(5-6), 339–362, 2001) studied the projective and strongly rigid graphs and constructed large families of strongly rigid graphs. ?uczak and Ne?et?il (J. Graph Theory. 47, 81–86, 2004) settled in the affirmative a conjecture of Larose and Tardif that most graphs on a large set are projective, and characterized all homogenous graphs that are projective. ?uczak and Ne?et?il (SIAM J. Comput. 36(3), 835–843, 2006) confirmed a conjecture of Rosenberg that most relations on a big set are strongly rigid. In this paper, we characterize all strongly rigid relations on a set with at least three elements to answer an open question by Rosenberg, (Rocky Mt. J. Math. 3, 631–639, 1973) and we classify the binary relations on the 4-element domain by rigidity and demonstrate that there are merely 40 pairwise nonisomorphic rigid binary relations on the same domain (among them 25 are pairwise nonisomorphic strongly rigid).     

New error bounds for linear complementarity problems of Nekrasov matrices and <Emphasis Type="Italic">B</Emphasis>-Nekrasov matrices

New error bounds for the linear complementarity problems are given respectively when the involved matrices are Nekrasov matrices and B-Nekrasov matrices. Numerical examples are given to show that the new bounds are better respectively than those provided by García-Esnaola and Peña (Numer. Algor. 67(3), 655–667, 2014 and Numer. Algor. 72(2), 435–445, 2016) in some cases.     

An hp finite element method for 4th order singularly perturbed problems

We present the analysis for the hp finite element approximation of the solution to singularly perturbed fourth order problems, using a balanced norm. In Panaseti et al. (2016) it was shown that the hp version of the Finite Element Method (FEM) on the so-called Spectral Boundary Layer Mesh yields robust exponential convergence when the error is measured in the natural energy norm associated with the problem. In the present article we sharpen the result by showing that the same hp-FEM on the Spectral Boundary Layer Mesh gives robust exponential convergence in a stronger, more balanced norm. As a corollary we also get robust exponential convergence in the maximum norm. The analysis is based on the ideas in Roos and Franz (Calcolo 51, 423–440, 2014) and Roos and Schopf (ZAMM 95, 551–565, 2015) and the recent results in Melenk and Xenophontos (2016). Numerical examples illustrating the theory are also presented.     

On Measure Contraction Property without Ricci Curvature Lower Bound

Measure contraction properties M C P (K, N) are synthetic Ricci curvature lower bounds for metric measure spaces which do not necessarily have smooth structures. It is known that if a Riemannian manifold has dimension N, then M C P (K, N) is equivalent to Ricci curvature bounded below by K. On the other hand, it was observed in Rifford (Math. Control Relat. Fields 3(4), 467–487 2013) that there is a family of left invariant metrics on the three dimensional Heisenberg group for which the Ricci curvature is not bounded below. Though this family of metric spaces equipped with the Harr measure satisfy M C P (0,5). In this paper, we give sufficient conditions for a 2n+1 dimensional weakly Sasakian manifold to satisfy M C P (0, 2n + 3). This extends the above mentioned result on the Heisenberg group in Rifford (Math. Control Relat. Fields 3(4), 467–487 2013).     

Truncation error estimates for generalized Hermite sampling

The generalized Hermite sampling uses samples from the function itself and its derivatives up to order r. In this paper, we investigate truncation error estimates for the generalized Hermite sampling series on a complex domain for functions from Bernstein space. We will extend some known techniques to derive those estimates and the bounds of Jagerman (SIAM J. Appl. Math. 14, 714–723 1966), Li (J. Approx. Theory 93, 100–113 1998), Annaby-Asharabi (J. Korean Math. Soc. 47, 1299–1316 2010), and Ye and Song (Appl. Math. J. Chinese Univ. 27, 412–418 2012) will be special cases for our results. Some examples with tables and figures are given at the end of the paper.     

Multi-step hybrid methods for special second-order differential equations y″(t) = f(t,y(t))

In this paper, multi-step hybrid methods for solving special second-order differential equations y^″(t) = f(t,y(t)) are presented and studied. The new methods inherit the frameworks of RKN methods and linear multi-step methods and include two-step hybrid methods proposed by Coleman (IMA J. Numer. Anal. 23, 197–220, 8) as special cases. The order conditions of the methods were derived by using the SN-series defined on the set SNT of SN-trees. Based on the order conditions, we construct two explicit four-step hybrid methods, which are convergent of order six and seven, respectively. Numerical results show that our new methods are more efficient in comparison with the well-known high quality methods proposed in the scientific literature.     

Contractive Hilbert modules and their dilations

In this note, we show that a quasi-free Hilbert module R defined over the polydisk algebra with kernel function k(z,w) admits a unique minimal dilation (actually an isometric co-extension) to the Hardy module over the polydisk if and only if S ^?1(z, w)k(z, w) is a positive kernel function, where S(z,w) is the Szegö kernel for the polydisk. Moreover, we establish the equivalence of such a factorization of the kernel function and a positivity condition, defined using the hereditary functional calculus, which was introduced earlier by Athavale [8] and Ambrozie, Englis and Müller [2]. An explicit realization of the dilation space is given along with the isometric embedding of the module R in it. The proof works for a wider class of Hilbert modules in which the Hardy module is replaced by more general quasi-free Hilbert modules such as the classical spaces on the polydisk or the unit ball in ? ^m . Some consequences of this more general result are then explored in the case of several natural function algebras.     

Tensor Functional Topology on Woronowicz Categories

Functional topology is concerned with developing topological concepts in a category endowed with certain axiomatically defined classes of morphisms (Clementino et al. 2004). In this paper, we extend functional topology to a monoidal framework, replacing categorical pullbacks by pullbacks relative to the monoidal structure (which itself replaces the product) or more generally relative to a relation on the category (Janelidze, Appl. Categ. Structures, 17(4),351–371, 2009). Our main application is to the opposite Woronowicz category of C ^?-algebras. In this category a natural class of proper morphisms yields the unital algebras as compact objects. When restricted to the commutative C ^?-algebras, we recover exactly the morphisms induced by proper continuous maps of locally compact Hausdorff spaces. We further endow this category with a factorization system and investigate the precise relation with the proper maps, building on an approach which we previously developed with the eye on the category of schemes (Lowen and Mestdagh, J. Pure Appl. Algebra 217(11), 2180–2197, 2013). We also show how our results for C ^?-algebras can naturally be adapted to the opposite Woronowicz category of nondegenerate algebras over a commutative ring.     

Generalized sinc-Gaussian sampling involving derivatives

The generalized sampling expansion which uses samples from a bandlimited function f and its first r derivatives was first introduced by Linden and Abramson (Inform. Contr. 3, 26–31, 1960) and it was extended in different situations by some authors through the last fifty years. The use of the generalized sampling series in approximation theory is limited because of the slow convergence. In this paper, we derive a modification of a generalized sampling involving derivatives, which is studied by Shin (Commun. Korean Math. Soc. 17, 731–740, 2002), using a Gaussian multiplier. This modification is introduced for wider classes, the class of entire functions including unbounded functions on ? and the class of analytic functions in a strip. It highly improves the convergence rate of the generalized sampling which will be of exponential order. We will show that many known results included in Sampl. Theory Signal Image Process. 9, 199–221 (2007) and Numer. Funct. Anal. Optim. 36, 419–437 (2015) are special cases of our results. Numerical examples show a rightly good agreement with our theoretical analysis.     

<Emphasis Type="Italic">l</Emphasis><Subscript>1</Subscript>-<Emphasis Type="Italic">l</Emphasis><Subscript>2</Subscript> regularization of split feasibility problems

Numerous problems in signal processing and imaging, statistical learning and data mining, or computer vision can be formulated as optimization problems which consist in minimizing a sum of convex functions, not necessarily differentiable, possibly composed with linear operators and that in turn can be transformed to split feasibility problems (SFP); see for example Censor and Elfving (Numer. Algorithms 8, 221–239 1994). Each function is typically either a data fidelity term or a regularization term enforcing some properties on the solution; see for example Chaux et al. (SIAM J. Imag. Sci. 2, 730–762 2009) and references therein. In this paper, we are interested in split feasibility problems which can be seen as a general form of Q-Lasso introduced in Alghamdi et al. (2013) that extended the well-known Lasso of Tibshirani (J. R. Stat. Soc. Ser. B 58, 267–288 1996). Q is a closed convex subset of a Euclidean m-space, for some integer m ≥ 1, that can be interpreted as the set of errors within given tolerance level when linear measurements are taken to recover a signal/image via the Lasso. Inspired by recent works by Lou and Yan (2016), Xu (IEEE Trans. Neural Netw. Learn. Syst. 23, 1013–1027 2012), we are interested in a nonconvex regularization of SFP and propose three split algorithms for solving this general case. The first one is based on the DC (difference of convex) algorithm (DCA) introduced by Pham Dinh Tao, the second one is nothing else than the celebrate forward-backward algorithm, and the third one uses a method introduced by Mine and Fukushima. It is worth mentioning that the SFP model a number of applied problems arising from signal/image processing and specially optimization problems for intensity-modulated radiation therapy (IMRT) treatment planning; see for example Censor et al. (Phys. Med. Biol. 51, 2353–2365, 2006).     

Poset Entropy Versus Number of Linear Extensions: The Width-2 Case

Kahn and Kim (J. Comput. Sci. 51, 3, 390–399, 1995) have shown that for a finite poset P, the entropy of the incomparability graph of P (normalized by multiplying by the order of P) and the base-2 logarithm of the number of linear extensions of P are within constant factors from each other. The tight constant for the upper bound was recently shown to be 2 by Cardinal et al. (Combinatorica 33, 655–697, 2013). Here, we refine this last result in case P has width 2: we show that the constant can be replaced by 2?ε if one also takes into account the number of connected components of size 2 in the incomparability graph of P. Our result leads to a better upper bound for the number of comparisons in algorithms for the problem of sorting under partial information.     

The Relaxed Edge-Coloring Game and <Emphasis Type="Italic">k</Emphasis>-Degenerate Graphs

The (r, d)-relaxed edge-coloring game is a two-player game using r colors played on the edge set of a graph G. We consider this game on forests and more generally, on k-degenerate graphs. If F is a forest with Δ(F)=Δ, then the first player, Alice, has a winning strategy for this game with r=Δ?j and d≥2j+2 for 0≤j≤Δ?1. This both improves and generalizes the result for trees in Dunn, C. (Discret. Math. 307, 1767–1775, 2007). More broadly, we generalize the main result in Dunn, C. (Discret. Math. 307, 1767–1775, 2007) by showing that if G is k-degenerate with Δ(G)=Δ and j∈[Δ+k?1], then there exists a function h(k,j) such that Alice has a winning strategy for this game with r=Δ+k?j and d≥h(k,j).     

A new unicity theorem and Erdös’ problem for polarized semi-abelian varieties

In 1988 Erdös asked if the prime divisors of x ⁿ ? 1 for all n = 1, 2, … determine the given integer x; the problem was affirmatively answered by Corrales-Rodrigáñez and Schoof (J Number Theory 64:276–290, 1997) [but a solution could also be deduced from an earlier result of Schinzel (Bull Acad Polon Sci 8:307–309, 2007)] together with its elliptic version. Analogously, Yamanoi (Forum Math 16:749–788, 2004) proved that the support of the pulled-back divisor f ^* D of an ample divisor on an abelian variety A by an algebraically non-degenerate entire holomorphic curve f : C → A essentially determines the pair (A, D). By making use of the main theorem of Noguchi (Forum Math 20:469–503, 2008) we here deal with this problem for semi-abelian varieties; namely, given two polarized semi-abelian varieties (A ₁, D ₁), (A ₂, D ₂) and algebraically non-degenerate entire holomorphic curves f _i : C → A _i , i = 1, 2, we classify the cases when the inclusion \({{\rm{Supp}}\, f_1^*D_1\subset {\rm{Supp}}\, f_2^* D_2}\) holds. We shall remark in §5 that these methods yield an affirmative answer to a question of Lang formulated in 1966. Our answer is more general and more geometric than the original question. Finally, we interpret the main result of Corvaja and Zannier (Invent Math 149:431–451, 2002) to provide an arithmetic counterpart in the toric case.     

Trigonometrical fitting conditions for two derivative Runge-Kutta methods

Two derivative Runge-Kutta methods are Runge-Kutta methods for problems of the form y^′ = f(y) that include the second derivative y^″ = g(y) = f^′(y)f(y) and were developed in the work of Chan and Tsai (Numer. Alg. 53, 171–194 2010). Explicit methods were considered and attention was given to the construction of methods that involve one evaluation of f and many evaluations of g per step. In this work, we consider trigonometrically fitted two derivative explicit Runge-Kutta methods of the general case that use several evaluations of f and g per step; trigonometrically fitting conditions for this general case are given. Attention is given to the construction of methods that involve several evaluations of f and one evaluation of g per step. We modify methods with stages up to four, with three f and one g evaluation and with four f and one g, evaluation based on the fourth and fifth order methods presented in Chan and Tsai (Numer. Alg. 53, 171–194 2010). We provide numerical results to demonstrate the efficiency of the new methods using four test problems.     

Connection Between Polynomial Optimization and Maximum Cliques of Non-Uniform Hypergraphs

In Motzkin and Straus (Canad. J. Math 498 17, 533540 1965) provided a connection between the order of a maximum clique in a graph G and the Lagrangian function of G. In Rota Bulò and Pelillo (Optim. Lett. 500 3, 287295 2009) extended the Motzkin-Straus result to r-uniform hypergraphs by establishing a one-to-one correspondence between local (global) minimizers of a family of homogeneous polynomial functions of degree r and the maximal (maximum) cliques of an r-uniform hypergraph. In this paper, we study similar optimization problems and obtain the connection to maximum cliques for {s, r}-hypergraphs and {p, s, r}-hypergraphs, which can be applied to obtain upper bounds on the Turán densities of the complete {s, r}-hypergraphs and {p, s, r}-hypergraphs.     

On modified Gordon-Wixom interpolation schemes and their applications to nonlinear and exterior domain problems

We introduce and study extensions and modifications of the Gordon-Wixom transfinite barycentric interpolation scheme (Gordon and Wixom, SIAM J. Numer. Anal. 11(5), 909–933, 1974). We demonstrate that the modified Gordon-Wixom scheme proposed in Belyaev and Fayolle (Comput. Graph. 51, 74–80, 2015) reproduces harmonic quadratic polynomials in convex domains. We adapt the scheme for dealing with the exterior of a bounded domain and for the exterior of a disk, where we demonstrate that our interpolation formula reproduces harmonic functions. Finally, we show how to adapt the Gordon-Wixom approach for approximating p-harmonic functions and to derive computationally efficient approximations of the solutions to boundary value problems involving the p-Laplacian.     

The truncated Euler–Maruyama method for stochastic differential delay equations

The numerical solutions of stochastic differential delay equations (SDDEs) under the generalized Khasminskii-type condition were discussed by Mao (Appl. Math. Comput. 217, 5512–5524 2011), and the theory there showed that the Euler–Maruyama (EM) numerical solutions converge to the true solutions in probability. However, there is so far no result on the strong convergence (namely in L ^p ) of the numerical solutions for the SDDEs under this generalized condition. In this paper, we will use the truncated EM method developed by Mao (J. Comput. Appl. Math. 290, 370–384 2015) to study the strong convergence of the numerical solutions for the SDDEs under the generalized Khasminskii-type condition.     

On bigraded regularities of Rees algebra

For any homogeneous ideal I in \(K[x_1,\ldots ,x_n]\) of analytic spread \(\ell \), we show that for the Rees algebra R(I), \({\text {reg}}_{(0,1)}^{\mathrm{syz}}(R(I))={\text {reg}}_{(0,1)}^{\mathrm{T}}(R(I))\). We compute a formula for the (0, 1)-regularity of R(I), which is a bigraded analog of Theorem 1.1 of Aramova and Herzog (Am. J. Math. 122(4) (2000) 689–719) and Theorem 2.2 of Römer (Ill. J. Math. 45(4) (2001) 1361–1376) to R(I). We show that if the defect sequence, \(e_k:= {\text {reg}}(I^k)-k\rho (I)\), is weakly increasing for \(k \ge {\text {reg}}^{\mathrm{syz}}_{(0,1)}(R(I))\), then \({\text {reg}}(I^j)=j\rho (I)+e\) for \(j \ge {\text {reg}}^{\mathrm{syz}}_{(0,1)}(R(I))+\ell \), where \(\ell ={\text {min}}\{\mu (J)~|~ J\subseteq I \text{ a } \text{ graded } \text{ minimal } \text{ reduction } \text{ of } I\}\). This is an improvement of Corollary 5.9(i) of [16].