Search

The main aim of this paper is to prove novel results on stability of the semi-Fredholm property of operators on interpolation spaces generated by interpolation functors. The methods are based on some general ideas we develop in the paper. This allows us to extend some previous work in literature to the abstract setting. We show an application to interpolation methods introduced by Cwikel–Kalton–Milman–Rochberg which includes, as special cases, the real and complex methods up to equivalence of norms and also some other well known methods of interpolation. A by-product of these results get the stability of isomorphisms on Calderon products of Banach function lattices. We also study the important characteristics in operator Banach space theory, the so-called modules of injection and surjection, and we prove interpolation estimates of these modules of operators on scales of the Calderon complex interpolation spaces.

We study the approximation of compact linear operators defined over certain weighted tensor product Hilbert spaces. The information complexity is defined as the minimal number of arbitrary linear functionals needed to obtain an e -approximation for the d -variate problem which is fully determined in terms of the weights and univariate singular values. Exponential tractability means that the information complexity is bounded by a certain function that depends polynomially on d and logarithmically on e − 1 . The corresponding unweighted problem was studied in Hickernell et al. (2020) with many negative results for exponential tractability. The product weights studied in the present paper change the situation. Depending on the form of polynomial dependence on d and logarithmic dependence on e − 1 , we study exponential strong polynomial, exponential polynomial, exponential quasi-polynomial, and exponential ( s , t ) -weak tractability with max ( s , t ) ≥ 1 . For all these notions of exponential tractability, we establish necessary and sufficient conditions on weights and univariate singular values for which it is indeed possible to achieve the corresponding notion of exponential tractability. The case of exponential ( s , t ) -weak tractability with max ( s , t ) 1 is left for future study. The paper uses some general results obtained in Hickernell et al. (2020) and Kritzer and Woźniakowski (2019).

This paper further improves the Lie group method with Magnus expansion proposed in a previous paper by the authors, to solve some types of direct singular Sturm&ndash, Liouville problems. Next, a concrete implementation to the inverse Sturm&ndash, Liouville problem algorithm proposed by Barcilon (1974) is provided. Furthermore, computational feasibility and applicability of this algorithm to solve inverse Sturm&ndash, Liouville problems of higher order (for n=2,4) are verified successfully. It is observed that the method is successful even in the presence of significant noise, provided that the assumptions of the algorithm are satisfied. In conclusion, this work provides a method that can be adapted successfully for solving a direct (regular/singular) or inverse Sturm&ndash, Liouville problem (SLP) of an arbitrary order with arbitrary boundary conditions.

In 1977, Nourein (Intern. J. Comput. Math. 6:3, 1977) constructed a fourth-order iterative method for finding all zeros of a polynomial simultaneously. This method is also known as Ehrlich&rsquo, s method with Newton&rsquo, s correction because it is obtained by combining Ehrlich&rsquo, s method (Commun. ACM 10:2, 1967) and the classical Newton&rsquo, s method. The paper provides a detailed local convergence analysis of a well-known but not well-studied generalization of Nourein&rsquo, s method for simultaneous finding of multiple polynomial zeros. As a consequence, we obtain two types of local convergence theorems as well as semilocal convergence theorems (with verifiable initial condition and a posteriori error bound) for the classical Nourein&rsquo, s method. Each of the new semilocal convergence results improves the result of Petković, Petković and Rančić (J. Comput. Appl. Math. 205:1, 2007) in several directions. The paper ends with several examples that show the applicability of our semilocal convergence theorems.

This paper is a direct continuation of [26], where we proved that every normal lattice isomorphism of supersolvable Lie ring is induced at the isomorphism. In the present paper,we generalize this theorem for rational Lie rings.

In this paper, we construct a non-standard finite difference scheme for a general model of glucose-insulin interaction. We establish some new sufficient conditions to ensure that the discretized model preserves the persistence and global attractivity of the continuous model. One of the main findings in this paper is that we derive two important propositions (Proposition 3.1 and Proposition 3.2) which are used to prove the global attractivity of the discretized model. Furthermore, when investigating the persistence and, in some cases, the global attractivity of the discretized model, the nonlinear functions f and h are not required to be differentiable. Hence, our results are more realistic because the statistical data of glucose and insulin are collected and reported in discrete time. We also present some numerical examples and their simulations to illustrate our results.

The paper studies several approaches to numerical integration over a domain defined implicitly by an indicator function such as the level set function. The integration methods are based on subdivision, moment–fitting, local quasi-parametrization and Monte-Carlo techniques. As an application of these techniques, the paper addresses numerical solution of elliptic PDEs posed on domains and manifolds defined implicitly. A higher order unfitted finite element method (FEM) is assumed for the discretization. In such a method the underlying mesh is not fitted to the geometry, and hence the errors of numerical integration over curvilinear elements affect the accuracy of the finite element solution together with approximation errors. The paper studies the numerical complexity of the integration procedures and the performance of unfitted FEMs which employ these tools.

In the present paper, we expand the domain of work on theconcept of semiderivations in 3-prime near-rings through the study ofstructure and commutativity of near-rings admitting semiderivations sat-isfying certain differential identities. Moreover, several examples havebeen provided at places which show that the assumptions in the hypothe-ses of various theorems are not altogether superfluous. 1. IntroductionThroughout this paper, N is a zero-symmetric left near ring. A near ringN is called zero symmetric if 0x= 0 for all x∈ N (recall that in a left nearring x0 = 0 for all x∈ N). N is called 3-prime if xNy = {0} implies x= 0or y = 0. The symbol Z(N) will represent the multiplicative center of N,that is, Z(N) = {x∈ N | xy= yxfor all y∈ N}.For any x,y∈ N; as usual[x,y] = xy−yxand x◦y= xy+yxwill denote the well-known Lie product andJordan product, respectively. Recall that N is called 2-torsion free if 2x= 0implies x= 0 for all x∈ N. For terminologies concerning near-rings we referto G. Pilz [7].An additive mapping d: N → N is said to be a derivation if d(xy) = xd(y)+d(x)yforall x,y∈ N, orequivalently, asnotedin [8], that d(xy) = d(x)y+xd(y)for all x,y ∈ N. An additive mapping d: N → N is called semiderivation ifthere exists a function g : N → N such that d(xy) = xd(y) + d(x)g(y) =g(x)d(y)+d(x)yand d(g(x)) = g(d(x)) for all x,y∈ N.Obviously, any deriva-tion is a semiderivation, but the converse is not true in general (see [6]). Therehas been a greatdeal of workconcerning derivations in near-rings(see [1, 2, 4, 5]where further references can be found). In this paper, we study the commuta-tivity of addition and multiplication of near-rings. Two well-known results forderivations in near-rings have been generalized for semiderivation. In fact, ourresults generalize some theorems obtained by the authors together with Rajiin [1].

In a previous paper by the authors, the existence of Haar projections with growing norms in Sobolev–Triebel–Lizorkin spaces has been shown via a probabilistic argument. This existence was sufficient to determine the precise range of Triebel–Lizorkin spaces for which the Haar system is an unconditional basis. The aim of the present paper is to give simple deterministic examples of Haar projections that show this growth behavior in the respective range of parameters.

In this paper we study d -variate approximation for weighted Korobov spaces in the worst-case setting. The considered algorithms use finitely many evaluations of arbitrary linear functionals. We give matching necessary and sufficient conditions for some notions of tractability in terms of two weight parameters. Our result is an affirmative answer to a problem which is left open in a recent paper of Kritzer, Pillichshammer and Wo?niakowski.

This paper gives simple proofs of Sylvester (` = 2) and Frobenius (` = 3) inequalities. Moreover, a new sufficient condition for the equality of the Frobenius inequality is provided. In addition, an extension for ` > 3 matrices and an application to generalized inverses are provided., This paper has been partially supported by Ministerio de Economia y Competitividad (Grant DGI MTM2013-43678P and Red de Excelencia MTM2015-68805-REDT). The author thanks the referees for their valuable suggestions.

We define a “period-ring-valued beta function” and give a reciprocity law on its special values. The proof is based on some results of Rohrlich and Coleman concerning Fermat curves. We also have the following application. Stark’s conjecture implies that the exponentials of the derivatives at s = 0 s=0 of partial zeta functions are algebraic numbers which satisfy a reciprocity law under certain conditions. It follows from Euler’s formulas and properties of cyclotomic units when the base field is the rational number field. In this paper, we provide an alternative proof of a weaker result by using the reciprocity law on the period-ring-valued beta function. In other words, the reciprocity law given in this paper is a refinement of the reciprocity law on cyclotomic units.

It is well known that SOR iterative methods are convergent for linear systems, whose coefficient matrices are strictly or irreducibly diagonally dominant matrices and strong H-matrices (whose comparison matrices are nonsingular M-matrices). However, the same can not be true in case of those iterative methods for linear systems with weak H-matrices (whose comparison matrices are singular M-matrices). This paper proposes some necessary and sufficient conditions such that SOR iterative methods are convergent for linear systems with weak H-matrices. Furthermore, some numerical examples are given to demonstrate the convergence results obtained in this paper.

In this paper, we generalize the notion of Kantorovich-type sampling operators using the Fejer-type singular integral. By means of these operators we are able to reconstruct signals (functions) which are not necessarily continuous. Moreover, our generalization allows us to take the measurement error into account. The goal of this paper is to estimate the rate of approximation by the above operators via high-order modulus of smoothness.

In this paper, we introduce a system of split variational inequality problems in real Hilbert spaces. Using a projection method, we propose an iterative algorithm for solving this system of split variational inequality problems. Further, we prove that the sequence generated by the iterative algorithm converges strongly to a solution of the system of split variational inequality problems. Furthermore, we discuss some consequences of the main result. The iterative algorithms and results presented in this paper generalize, unify and improve the previously known results of this area.

In the present paper, we consider an important problem from the point of view of application in sciences and engineering, namely, a new class of nonlinear Love-equation with infinite memory in the presence of source term that takes general nonlinearity form. New minimal conditions on the relaxation function and the relationship between the weights of source term are used to show a very general decay rate for solution by certain properties of convex functions combined with some estimates. Investigations on the propagation of surface waves of Love-type have been made by many authors in different models and many attempts to solve Love&rsquo, s equation have been performed, in view of its wide applicability. To our knowledge, there are no decay results for damped equations of Love waves or Love type waves. However, the existence of solution or blow up results, with different boundary conditions, have been extensively studied by many authors. Our interest in this paper arose in the first place in consequence of a query for a new decay rate, which is related to those for infinite memory &piv, in the third section. We found that the system energy decreased according to a very general rate that includes all previous results.

This paper considers the problem of approximating the spectral factor of continuous spectral densities with finite Dirichlet energy based on finitely many samples of these spectral densities. Although there exists a closed form expression for the spectral factor, this formula shows a very complicated behavior because of the non-linear dependency of the spectral factor from spectral density and because of a singular integral in this expression. Therefore approximation methods are usually applied to calculate the spectral factor. It is shown that there exists no sampling-based method which depends continuously on the samples and which is able to approximate the spectral factor for all densities in this set. Instead, to any sampling-based approximation method there exists a large set of spectral densities so that the approximation method does not converge to the spectral factor for every spectral density in this set as the number of available sampling points is increased. The paper will also show that the same results hold for sampling-based algorithms for the calculation of the outer function in the theory of Hardy spaces.

The aim of this paper is to study the Lagrange interpolation on the unit circle taking only into account the separation properties of the nodal points. The novelty of this paper is that we do not consider nodal systems connected with orthogonal or paraorthogonal polynomials, which is an interesting approach because in practical applications this connection may not exist. A detailed study of the properties satisfied by the nodal system and the corresponding nodal polynomial is presented. We obtain the relevant results of the convergence related to the process for continuous smooth functions as well as the rate of convergence. Analogous results for interpolation on the bounded interval are deduced and finally some numerical examples are presented.

We introduce and study spaces of multivariate functions of bounded variation generalizing the classical Jordan and Wiener spaces. Multivariate generalizations of the Jordan space were given by several prominent researchers. However, each of the proposed concepts preserves only few properties of Jordan variation which are designed to a selected application. In contrast, the multivariate generalization of the Jordan space presented in this paper preserves all known and reveals some previously unknown properties of the space. These, in turn, are special cases of the basic properties of the introduced spaces proved in the paper. Specifically, the first part of the paper describes structure properties of functions of bounded ( k , p ) -variation ( V p k functions). It includes assertions on discontinuity sets and pointwise differentiability of V p k functions and their Luzin type and C ∞ approximations. The second part presents results on Banach structure of V p k spaces, namely, atomic decomposition and constructive characterization of their predual spaces. As a result, we obtain the so-called two-stars theorems describing V p k spaces as second duals of their separable subspaces consisting of functions of “vanishing variation”.

The Gibbs phenomenon is widely known for Fourier expansions of periodic functions and refers to the phenomenon that the $n$th Fourier partial sums overshoot a target function at jump discontinuities in such a way that such overshoots do not die out as $n$ goes to infinity. The Gibbs phenomenon for wavelet expansions using (bi)orthogonal wavelets has been studied in the literature. Framelets (also called wavelet frames) generalize (bi)orthogonal wavelets. Approximation by quasi-projection operators are intrinsically linked to approximation by truncated wavelet and framelet expansions. In this paper we shall establish a key identity for quasi-projection operators and then we use it to study the Gibbs phenomenon of framelet expansions and approximation by general quasi-projection operators. We shall also study and characterize the Gibbs phenomenon at an arbitrary point for approximation by quasi-projection operators. As a consequence, we show that the Gibbs phenomenon appears at all points for every tight or dual framelet having at least two vanishing moments and for quasi-projection operators having at least three accuracy orders. Our results not only improve current results in the literature on the Gibbs phenomenon for (bi)orthogonal wavelet expansions but also are new for framelet expansions and approximation by quasi-projection operators., revised paper

The new ingredient of this paper is that we consider infinitely dimensional classes of functions and instead of the relative error setting, which was used in previous papers on norm discretization, we consider the absolute error setting. We demonstrate how known results from two areas of research – supervised learning theory and numerical integration – can be used in sampling discretization of the square norm on different function classes.

In this paper we present a factorization framework for Hermite subdivision schemes refining function values and first derivatives, which satisfy a spectral condition of high order. In particular we show that spectral order $d$ allows for $d$ factorizations of the subdivision operator with respect to the Gregory operators: A new sequence of operators we define using Stirling numbers and Gregory coefficients. We further prove that the $d$-th factorization provides a ``convergence from contractivity'' method for showing $C^d$-convergence of the associated Hermite subdivision scheme. The power of our factorization framework lies in the reduction of computational effort for large $d$: In order to prove $C^d$-convergence, up to now, $d$ factorization steps were needed, while our method requires only one step, independently of $d$. Furthermore, in this paper, we show by an example that the spectral condition is not equivalent to the reproduction of polynomials., 31 pages, 1 figure, references and contact information updated

This paper analyses discontinuous Galerkin finite element methods (DGFEM) to approximate a regular solution to the von Karman equations defined on a polygonal domain. A discrete inf–sup condition sufficient for the stability of the discontinuous Galerkin discretization of a well-posed linear problem is established, and this allows the proof of local existence and uniqueness of a discrete solution to the nonlinear problem with a Banach fixed point theorem. The Newton scheme is locally second-order convergent and appears to be a robust solution strategy up to machine precision. A comprehensive a priori and a posteriori energy-norm error analysis relies on one sufficiently large stabilization parameter and sufficiently fine triangulations. In case the other stabilization parameter degenerates towards infinity, the DGFEM reduces to a novel C0-interior penalty method (IPDG). In contrast to the known C0-IPDG dueto Brenner et al., (2016, A C0 interior penalty method for a von Karman plate. Numer. Math., 1–30), the overall discrete formulation maintains symmetry of the trilinear form in the first two components—despite the general nonsymmetry of the discrete nonlinear problems. Moreover, a reliable and efficient a posteriori error analysis immediately follows for the DGFEM of this paper, while the different norms in the known C0-IPDG lead to complications with some nonresidual-type remaining terms. Numerical experiments confirm the best-approximation results and the equivalence of the error and the error estimators. A related adaptive mesh-refining algorithm leads to optimal empirical convergence rates for a nonconvex domain.

In a more recent paper, the second author has introduced a space |C α | k as the set of all series by absolute summable using Cesaro matrix of order α > −1. In the present paper we extend it to the absolute Norlund space |N | k taking Norlund matrix in place of Cesaro matrix, and also examine some topological structures, α-β-γ-duals and the Schauder base of this space. Further we characterize certain matrix operators on that space and determine their operator norms, and so extend some well-known results.

Adaptive regularization with cubics (ARC) is an algorithm for unconstrained, non-convex optimization. Akin to the popular trust-region method, its iterations can be thought of as approximate, safe-guarded Newton steps. For cost functions with Lipschitz continuous Hessian, ARC has optimal iteration complexity, in the sense that it produces an iterate with gradient smaller than $\varepsilon$ in $O(1/\varepsilon^{1.5})$ iterations. For the same price, it can also guarantee a Hessian with smallest eigenvalue larger than $-\varepsilon^{1/2}$. In this paper, we study a generalization of ARC to optimization on Riemannian manifolds. In particular, we generalize the iteration complexity results to this richer framework. Our central contribution lies in the identification of appropriate manifold-specific assumptions that allow us to secure these complexity guarantees both when using the exponential map and when using a general retraction. A substantial part of the paper is devoted to studying these assumptions---relevant beyond ARC---and providing user-friendly sufficient conditions for them. Numerical experiments are encouraging., Comment: 48 pages, 3 figures

In this paper, we study the theory of a Kantorovich version of the multivariate neural network operators. Such operators, are activated by suitable kernels generated by sigmoidal functions. In particular, the main result here proved is a modular convergence theorem in Orlicz spaces. As special cases, convergence theorem in $$L^p$$ -spaces, interpolation spaces, and exponential-type spaces can be deduced. In general, multivariate approximations by constructive neural network algorithms are useful for applications to neurocomputing processes involving high dimensional data. At the end of the paper, several examples of activation functions of sigmoidal-type for which the above theory holds have been described.

In this paper we study the numerical quadrature of a stochastic integral, where the temporal regularity of the integrand is measured in the fractional Sobolev-Slobodeckij norm in $W^{\sigma,p}(0,T)$, $\sigma \in (0,2)$, $p \in [2,\infty)$. We introduce two quadrature rules: The first is best suited for the parameter range $\sigma \in (0,1)$ and consists of a Riemann-Maruyama approximation on a randomly shifted grid. The second quadrature rule considered in this paper applies to the case of a deterministic integrand of fractional Sobolev regularity with $\sigma \in (1,2)$. In both cases the order of convergence is equal to $\sigma$ with respect to the $L^p$-norm. As an application, we consider the stochastic integration of a Poisson process, which has discontinuous sample paths. The theoretical results are accompanied by numerical experiments., Comment: 20 pages, 2 figures

This paper considers a stochastic Lotka-Volterra competitive model with infinite delay and impulsive perturbations. This model is new, more feasible and more accordance with the actual. The aim is to analyze what happens under the impulsive perturbations. With space $C_{g}$ as phase space, sufficient conditions for permanence in time average are established as well as extinction, stability in time average and global attractivity of each population. Numerical simulations are also exhibited to illustrate the validity of the results in this paper. In addition, a knowledge is given to illustrate that the statement in [21] is incorrect by choosing space $C_{g}$ as phase space. Our results demonstrate that impulsive perturbations which may represent human factor play a key role in protecting the population when environmental noise and interaction rates are disadvantageous to population survival.

This paper is concerned with problems in the context of the theoretical foundation of adaptive algorithms for the numerical treatment of operator equations. It is well-known that the analysis of such schemes naturally leads to function spaces of Besov type. But, especially when dealing with equations on non-smooth manifolds, the definition of these spaces is not straightforward. Nevertheless, motivated by applications, recently Besov-type spaces $$B^\alpha _{\Psi ,q}(L_p(\Gamma ))$$ on certain two-dimensional, patchwise smooth surfaces were defined and employed successfully. In the present paper, we extend this definition (based on wavelet expansions) to a quite general class of d-dimensional manifolds and investigate some analytical properties of the resulting quasi-Banach spaces. In particular, we prove that different prominent constructions of biorthogonal wavelet systems $$\Psi $$ on domains or manifolds $$\Gamma $$ which admit a decomposition into smooth patches actually generate the same Besov-type function spaces $$B^\alpha _{\Psi ,q}(L_p(\Gamma ))$$ , provided that their univariate ingredients possess a sufficiently large order of cancellation and regularity. For this purpose, a theory of almost diagonal matrices on related sequence spaces $$b^\alpha _{p,q}(\nabla )$$ of Besov type is developed.

In this paper, we propose two classes of derivative-free Newton-like methods for solving system of nonlinear equations based on double Newton step. We also give the local convergence analysis of the iterative methods. In addition, some numerical results are also reported in the paper, which confirm the good theoretical properties of our approach.

This paper is devoted to the design of an efficient and convergent {semi-proximal} alternating direction method of multipliers (ADMM) for finding a solution of low to medium accuracy to convex quadratic conic programming and related problems. For this class of problems, the convergent two block semi-proximal ADMM can be employed to solve their primal form in a straightforward way. However, it is known that it is more efficient to apply the directly extended multi-block semi-proximal ADMM, though its convergence is not guaranteed, to the dual form of these problems. Naturally, one may ask the following question: can one construct a convergent multi-block semi-proximal ADMM that is more efficient than the directly extended semi-proximal ADMM? Indeed, for linear conic programming with 4-block constraints this has been shown to be achievable in a recent paper by Sun, Toh and Yang [arXiv preprint arXiv:1404.5378, (2014)]. Inspired by the aforementioned work and with the convex quadratic conic programming in mind, we propose a Schur complement based convergent semi-proximal ADMM for solving convex programming problems, with a coupling linear equality constraint, whose objective function is the sum of two proper closed convex functions plus an arbitrary number of convex quadratic or linear functions. Our convergent semi-proximal ADMM is particularly suitable for solving convex quadratic semidefinite programming (QSDP) with constraints consisting of linear equalities, a positive semidefinite cone and a simple convex polyhedral set. The efficiency of our proposed algorithm is demonstrated by numerical experiments on various examples including QSDP., 39 pages, 1 figure, 4 tables

The Truncated Nonsmooth Newton Multigrid (TNNMG) method is a robust and efficient solution method for a wide range of block-separable convex minimization problems, typically stemming from discretizations of nonlinear and nonsmooth partial differential equations. This paper proves global convergence of the method under weak conditions both on the objective functional, and on the local inexact subproblem solvers that are part of the method. It also discusses a range of algorithmic choices that allows to customize the algorithm for many specific problems. Numerical examples are deliberately omitted, because many such examples have already been published elsewhere., Dedicate the paper to Elias Pipping

Non-convex optimization with local search heuristics has been widely used in machine learning, achieving many state-of-art results. It becomes increasingly important to understand why they can work for these NP-hard problems on typical data. The landscape of many objective functions in learning has been conjectured to have the geometric property that "all local optima are (approximately) global optima", and thus they can be solved efficiently by local search algorithms. However, establishing such property can be very difficult. In this paper, we analyze the optimization landscape of the random over-complete tensor decomposition problem, which has many applications in unsupervised learning, especially in learning latent variable models. In practice, it can be efficiently solved by gradient ascent on a non-convex objective. We show that for any small constant $\epsilon > 0$, among the set of points with function values $(1+\epsilon)$-factor larger than the expectation of the function, all the local maxima are approximate global maxima. Previously, the best-known result only characterizes the geometry in small neighborhoods around the true components. Our result implies that even with an initialization that is barely better than the random guess, the gradient ascent algorithm is guaranteed to solve this problem. Our main technique uses Kac-Rice formula and random matrix theory. To our best knowledge, this is the first time when Kac-Rice formula is successfully applied to counting the number of local minima of a highly-structured random polynomial with dependent coefficients., Comment: Best paper in the NIPS 2016 Workshop on Nonconvex Optimization for Machine Learning: Theory and Practice. In submission

This paper studies best finitely supported approximations of one-dimensional probability measures with respect to the $L^r$-Kantorovich (or transport) distance, where either the locations or the weights of the approximations' atoms are prescribed. Necessary and sufficient optimality conditions are established, and the rate of convergence (as the number of atoms goes to infinity) is discussed. In view of emerging mathematical and statistical applications, special attention is given to the case of best uniform approximations (i.e., all atoms having equal weight). The approach developed in this paper is elementary; it is based on best approximations of (monotone) $L^r$-functions by step functions, and thus different from, yet naturally complementary to, the classical Voronoi partition approach., To appear in J. Approx. Theory

In this paper, we give a resolution of the generalized Fermat equations $$x^5 + y^5 = 3 z^n \text{ and } x^{13} + y^{13} = 3 z^n,$$ for all integers $n \ge 2$, and all integers $n \ge 2$ which are not a multiple of $7$, respectively, using the modular method with Frey elliptic curves over totally real fields. The results require a refined application of the multi-Frey technique, which we show to be effective in new ways to reduce the bounds on the exponents $n$. We also give a number of results for the equations $x^5 + y^5 = d z^n$, where $d = 1, 2$, under additional local conditions on the solutions. This includes a result which is reminiscent of the second case of Fermat's Last Theorem, and which uses a new application of level raising at $p$ modulo $p$., Comment: Includes more details regarding the connection of this paper with its sequel 'Some extensions of the modular method and Fermat-equations of signature (13,13,n)'. More precisely: extended Remark 7.4; added details on the computational parts of the proofs of Proposition 9 and Theorem 2; included new comments and polished the auxiliary Magma files for Proposition 9 and Theorem 2

International audience; This paper includes an erratum to (Bouchut et al. (2014) Convection and total variation flow. IMA J. Numer. Anal.,34, 1037–1071.) which deals with a nonlinear hyperbolic scalar conservation law, regularized by the total variation flow operator (or 1-Laplacian), and in which a mistake occurred in the convergence proof of the numerical scheme to the continuous entropy solution. For correcting the proof, it is necessary to introduce an additional vanishing viscous term in the scheme. This modification requires casting the whole paper in the framework of discrete and continuous solutions with unbounded support. This new version, nevertheless, leads to a better result than the previous one, since the bounded variation regularity and the compactness of the support of the initial data are no longer assumed.

This paper deals with the nonmonotone projection algorithm for constrained nonlinear equations. For some starting points, the previous projection algorithms for the problem may encounter slow convergence which is related to the monotone behavior of the iterative sequence as well as the iterative direction. To circumvent this situation, we adopt the nonmonotone technique introduced by Dang to develop a nonmonotone projection algorithm. After constructing the nonmonotone projection algorithm, we show its convergence under some suitable condition. Preliminary numerical experiment is reported at the end of this paper, from which we can see that the algorithm we propose converges more quickly than that of the usual projection algorithm for some starting points.

We investigate the ratio asymptotic behavior of the sequence $(Q_{n})_{n=0}^{\infty}$ of multiple orthogonal polynomials associated with a Nikishin system of $p\geq 1$ measures that are compactly supported on the star-like set of $p+1$ rays $S_{+}=\{z\in\mathbb{C}: z^{p+1}\geq 0\}$. The main algebraic property of these polynomials is that they satisfy a three-term recurrence relation of the form $zQ_{n}(z)=Q_{n+1}(z)+a_{n} Q_{n-p}(z)$ with $a_{n}>0$ for all $n\geq p$. Under a Rakhmanov-type condition on the measures generating the Nikishin system, we prove that the sequence of ratios $Q_{n+1}(z)/Q_{n}(z)$ and the sequence $a_{n}$ of recurrence coefficients are limit periodic with period $p(p+1)$. Our results complement some results obtained by the first author and Mi\~{n}a-D\'{i}az in a recent paper in which algebraic properties and weak asymptotics of these polynomials were investigated. Our results also extend some results obtained by the first author in the case $p=2$., Comment: Minor corrections were done for this version. A continuation of this work is in arXiv: 1907.03002. This paper has 37 pages, 1 table, no figures

The purpose of this paper has twofold. The first is to establish a second main theorem with truncated counting functions for algebraically nondegenerate meromorphic mappings into an arbitrary projective variety intersecting a family of hypersurfaces in subgeneral position. In our result, the truncation level of the counting functions is estimated explicitly. Our result is an extension of the classical second main theorem of H. Cartan, also is a generalization of the recent second main theorem of M. Ru and improves some recent results. The second purpose of this paper is to give another proof for the second main theorem for the special case where the projective variety is a projective space, by which the truncation level of the counting functions is estimated better than that of the general case., This paper is accepted for publication in Transactions of the American Mathematical Society

In this paper, we present the application of the homotopy analysis method for solving integrodifferential equations. In this method, a series is created, the successive elements of which are determined by calculating the appropriate integral of the previous element. In this elaboration, we prove that, if this series is convergent, then its sum is the solution of the objective equation. We formulate and prove the sufficient condition of this convergence, and we give also the estimation of error of an approximate solution obtained by taking the partial sum of the considered series. Moreover, we present in this paper the example of using the investigated method for determining the vibrations of the freely supported reinforced concrete beam as well as for solving the equation of movement of the electromagnet jumper mechanical system.

Probabilistic evolution theory (PREVTH) forms a framework for the solution of explicit ODEs. The purpose of the paper is two-fold: (1) conversion of multinomial right-hand sides of the ODEs to purely second degree multinomial right-hand sides by space extension, (2) decrease the computational burden of probabilistic evolution theory by using the condensed Kronecker product. A first order ODE set with multinomial right-hand side functions may be converted to a first order ODE set with purely second degree multinomial right-hand side functions at the expense of an increase in the number of equations and unknowns. Obtaining purely second degree multinomial right-hand side functions is important because the solution of such equation set may be approximated by probabilistic evolution theory. A recent article by the authors states that the ODE set with the smallest number of unknowns can be found by searching. This paper gives the details of a way to search for the optimal space extension. As for the second purpose of the paper, the computational burden can be reduced by considering the properties of the Kronecker product of vectors and how the Kronecker product appears within the recursion of PREVTH: as a Cauchy product structure.

The Colebrook-White equation is often used for calculation of the friction factor in turbulent regimes; it has succeeded in attracting a great deal of attention from researchers. The Colebrook–White equation is a complex equation where the computation of the friction factor is not direct, and there is a need for trial-error methods or graphical solutions; on the other hand, several researchers have attempted to alter the Colebrook-White equation by explicit formulas with the hope of achieving zero-percent (0%) maximum deviation, among them Dejan Brkić and Pavel Praks. The goal of this paper is to discuss the results proposed by the authors in their paper:” Accurate and Efficient Explicit Approximations of the Colebrook Flow Friction Equation Based on the Wright ω-Function” and to propose more accurate formulas.

The paper studies the solution of stochastic optimization problems in which approximations to the gradient and Hessian are obtained through subsampling. We first consider Newton-like methods that employ these approximations and discuss how to coordinate the accuracy in the gradient and Hessian to yield a superlinear rate of convergence in expectation. The second part of the paper analyzes an inexact Newton method that solves linear systems approximately using the conjugate gradient (CG) method, and that samples the Hessian and not the gradient (the gradient is assumed to be exact). We provide a complexity analysis for this method based on the properties of the CG iteration and the quality of the Hessian approximation, and compare it with a method that employs a stochastic gradient iteration instead of the CG method. We report preliminary numerical results that illustrate the performance of inexact subsampled Newton methods on machine learning applications based on logistic regression., 37 pages

This paper describes the analysis of Lagrange interpolation errors on tetrahedrons. In many textbooks, the error analysis of Lagrange interpolation is conducted under geometric assumptions such as shape regularity or the (generalized) maximum angle condition. In this paper, we present a new estimation in which the error is bounded in terms of the diameter and projected circumradius of the tetrahedron. Because we do not impose any geometric restrictions on the tetrahedron itself, our error estimation may be applied to any tetrahedralizations of domains including very thin tetrahedrons., Comment: To appear in Journal of Approximation Theory

A generalization of the well-known results of M.G. Kreĭn on the description of the self-adjoint contractive extension of a Hermitian contraction is obtained. This generalization concerns the situation where the self-adjoint operator A and extensions e A belong to a Kreĭn space or a Pontryagin space, and their defect operators are allowed to have a fixed number of negative eigenvalues. A result of Yu. L. Shmul’yan on completions of nonnegative block operators is generalized for block operators with a fixed number of negative eigenvalues in a Kreĭn space. This paper is a natural continuation of S. Hassi’s and author’s recent paper [7].

In this paper we present computational techniques to investigate the solutions of two-component, nonlinear reaction-diffusion (RD) systems on arbitrary surfaces. We build on standard techniques for linear and nonlinear analysis of RD systems, and extend them to operate on large-scale meshes for arbitrary surfaces. In particular, we use spectral techniques for a linear stability analysis to characterize and directly compose patterns emerging from homogeneities. We develop an implementation using surface finite element methods and a numerical eigenanalysis of the Laplace-Beltrami operator on surface meshes. In addition, we describe a technique to explore solutions of the nonlinear RD equations using numerical continuation. Here, we present a multiresolution approach that allows us to trace solution branches of the nonlinear equations efficiently even for large-scale meshes. Finally, we demonstrate the working of our framework for two RD systems with applications in biological pattern formation: a Brusselator model that has been used to model pattern development on growing plant tips, and a chemotactic model for the formation of skin pigmentation patterns. While these models have been used previously on simple geometries, our framework allows us to study the impact of arbitrary geometries on emerging patterns., Comment: This paper was submitted at the Journal of Mathematical Biology, Springer on 07th July 2015, in its current form (barring image references on the last page and cosmetic changes owning to rebuild for arXiv). The complete body of work presented here was included and defended as a part of my PhD thesis in Nov 2015 at the University of Bern

This paper [1], which was published online on 1 June 2011, has been retracted by agreement between the authors, the journal’s Editor-in-Chief Derek Holt, the London Mathematical Society and Cambridge University Press. The retraction was agreed to prevent other authors from using incorrect mathematical results. (In this paper, we compute and verify the positivity of the Li coefficients for the Dirichlet $L$-functions using an arithmetic formula established in Omar and Mazhouda, J. Number Theory 125 (2007) no. 1, 50–58; J. Number Theory 130 (2010) no. 4, 1109–1114. Furthermore, we formulate a criterion for the partial Riemann hypothesis and we provide some numerical evidence for it using new formulas for the Li coefficients.)

In a paper Cheung, Cucker and Peña (in press) [5] that can be seen as the first part of this one, we extended the well-known condition numbers for polyhedral conic systems C(A) Renegar (1994, 1995) [7–9] and C(A) Cheung and Cucker (2001) [3] to versions C¯(A) and C¯(A) that are finite for all input matrices A∈Rn×m. In this paper we compare C¯(A) and C¯(A) with other condition measures for the same problem that are also always finite.

Many papers study polynomial tractability for multivariate problems. Let n(@?,d) be the minimal number of information evaluations needed to reduce the initial error by a factor of @? for a multivariate problem defined on a space of d-variate functions. Here, the initial error is the minimal error that can be achieved without sampling the function. Polynomial tractability means that n(@?,d) is bounded by a polynomial in @?^-^1 and d and this holds for all (@?^-^1,d)@?[1,~)xN. In this paper we study generalized tractability by verifying when n(@?,d) can be bounded by a power of T(@?^-^1,d) for all (@?^-^1,d)@[email protected], where @W can be a proper subset of [1,~)xN. Here T is a tractability function, which is non-decreasing in both variables and grows slower than exponentially to infinity. In this article we consider the set @W=[1,~)x{1,2,...,d^*}@?[1,@?"0^-^1)xN for some d^*>=1 and @?"[email protected]?(0,1). We study linear tensor product problems for which we can compute arbitrary linear functionals as information evaluations. We present necessary and sufficient conditions on T such that generalized tractability holds for linear tensor product problems. We show a number of examples for which polynomial tractability does not hold but generalized tractability does.

In this paper, we present the convergence analysis of the rectangular Morley element scheme utilised on the second order problem in arbitrary dimensions. Specifically, we prove that the convergence of the scheme is of $\mathcal{O}(h)$ order in energy norm and of $\mathcal{O}(h^2)$ order in $L^2$ norm on general $d$-rectangular grids. Moreover, when the grid is uniform, the convergence rate can be of $\mathcal{O}(h^2)$ order in energy norm, and the convergence rate in $L^2$ norm is still of $\mathcal{O}(h^2)$ order, which can not be improved. Numerical examples are presented to demonstrate our theoretical results., This paper has been withdrawn by the author due to some rewrittings of the proof