Strongly real elements in finite simple orthogonal groups

We prove the strong reality of an infinite series of groups and some elements of a special form in the simple real groups.     

A study of accelerated Newton methods for multiple polynomial roots

We analyze and compare several accelerated Newton methods with built in multiplicity estimates. We also introduce the concept of indicator functions and discuss the Crouse-Putt method. It is shown that many of the accelerated Newton methods not only derive from Schröder’s classic approach but are equivalent. The related computational experiments show that the built in multiplicity estimates can significantly decrease the number of Newton iterations, while the error of these estimates may significantly increase.     

Selected bibliography on degeneracy

A selected bibliography on degeneracy problems organized according to the appearance of the respective references in various fields of operations research is given.     

Shape-preserving bivariate polynomial approximation inC([−1,1]×[−1,1])

In this paper we construct bivariate polynomials attached to a bivariate function, that approximate with Jackson-type rate involving a bivariate Ditzian-Totik ω2-modulus of smoothness and preserve some natural kinds of bivariate monotonicity and convexity of function.The result extends that in univariate case-of D. Leviatan in [5-6], improves that in bivariate case of the author in [3] and in some special cases, that in bivariate case of G. Anastassiou in [1].     

Support vector machines and neural networks used to evaluate paper manufactured using Eucalyptus globulus

Using advanced machine learning techniques as an alternative to conventional double-entry volume equations, a regression model of the inside-bark volume (dependent variable) for standing Eucalyptus globulus trunks (or main stems) has been built as a function of the following three independent variables: age, height and outside-bark diameter at breast height (DBH). The experimental observed data (age, height, outside-bark DBH and inside-bark volume) for 142 trees (E. globulus) were measured and a nonlinear model was built using a data-mining methodology based on support vector machines (SVM) and multilayer perceptron networks (MLP) for regression problems. Coefficients of determination and Furnival’s indices indicate the superiority of the SVM with a radial kernel over the allometric regression models and the MLP.     

On Nonlocal Cahn–Hilliard–Navier–Stokes Systems in Two Dimensions

We consider a diffuse interface model which describes the motion of an incompressible isothermal mixture of two immiscible fluids. This model consists of the Navier–Stokes equations coupled with a convective nonlocal Cahn–Hilliard equation. Several results were already proven by two of the present authors. However, in the two-dimensional case, the uniqueness of weak solutions was still open. Here we establish such a result even in the case of degenerate mobility and singular potential. Moreover, we show the weak–strong uniqueness in the case of viscosity depending on the order parameter, provided that either the mobility is constant and the potential is regular or the mobility is degenerate and the potential is singular. In the case of constant viscosity, on account of the uniqueness results, we can deduce the connectedness of the global attractor whose existence was obtained in a previous paper. The uniqueness technique can be adapted to show the validity of a smoothing property for the difference of two trajectories which is crucial to establish the existence of an exponential attractor. The latter is established even in the case of variable viscosity, constant mobility and regular potential.     

Approximation of Analytic Functions with an Arbitrary Order by Generalized Baskakov–Faber Operators in Compact Sets

By using a sequence \(\lambda _{n}>0\), \(n\in \mathbb {N}\) with the property that \(\lambda _{n}\rightarrow 0\) as fast we want, in this paper we obtain the approximation order \(O(\lambda _{n})\) for a generalized Baskakov–Faber operator attached to analytic functions of exponential growth in a continuum \(G\subset \mathbb {C}\). Several concrete examples of continuums G are given for which this operator can explicitly be constructed.     

On the Quasiconcave Bilevel Programming Problem

Bilevel programming involves two optimization problems where the constraint region of the first-level problem is implicitly determined by another optimization problem. In this paper, we consider the case in which both objective functions are quasiconcave and the constraint region common to both levels is a polyhedron. First, it is proved that this problem is equivalent to minimizing a quasiconcave function over a feasible region comprised of connected faces of the polyhedron. Consequently, there is an extreme point of the polyhedron that solves the problem. Finally, it is shown that this model includes the most important case where the objective functions are ratios of concave and convex functions     

The Order of Best Approximation in Some Classes of Functions

Starting from the equivalence between the Ditzian–Totik modulus and , where , in this article large classes of functions are introduced for which the modulus can be easily calculated. As a consequence, very good estimates for the bestapproximation are obtained. The attempts to estimate or calculate themodulus can be a very intricateproblem.     

Error estimates of proper orthogonal decomposition eigenvectors and Galerkin projection for a general dynamical system arising in fluid models

We study estimates for proper orthogonal decomposition eigenvectors and eigenvalues as well as error estimates between the exact solution of a 2D Navier–Stokes model and the numerical approach when the proper orthogonal decomposition method is considered. These estimates are also extended when bifurcation diagram are calculated using the so called p-POD or SPOD methods with a new cut-off criterion to minimize noisy modes produced by the p-POD method.