The coupled Navier-Stokes and Q-Tensor system is one of the models used to describe the behavior of the nematic liquid crystals. The existence of weak solutions and a uniqueness criteria have been already studied (see [11] for a Cauchy problem in the whole R3 and [7] for a initial-boundary problem in a bounded domain Ω). Nevertheless, results on strong regularity have only been treated in [11] ...

in this paper we introduce new modified implicit and explicit algorithms and prove strong convergence of the two algorithms to a common fixed point of a family of uniformly asymptotically regularasymptotically nonexpansive mappings in a real reflexive banach space with a uniformly g$hat{a}$teaux differentiable norm. our result is applicable in $l_{p}(ell_{p})$ spaces,$1 < p

Under mild conditions, the Pareto set of a continuous multi-objective optimization problem exhibits certain regularity. We have recently advocated taking into consideration such regularity in designing multi-objective evolutionary algorithms. Following our previous work on using Local Principal Component Analysis for capturing the regularity, this paper presents a new approach for acquiring and...

Szemerédi’s Regularity Lemma proved to be a very powerful tool in extremal graph theory with a large number of applications. Chung [Regularity lemmas for hypergraphs and quasi-randomness, Random Structures and Algorithms 2 (1991), 241–252], Frankl and Rödl [The uniformity lemma for hypergraphs, Graphs and Combinatorics 8 (1992), 309–312, Extremal problems on set systems, Random Structures and A...

Concepts of conditioning have long been important in numerical work on solving systems of equations, but in recent years attempts have been made to extend them to feasibility conditions, optimality conditions, complementarity conditions and variational inequalities, all of which can be posed as solving “generalized equations” for set-valued mappings. Here, the conditioning of such generalized e...

We show that the problem of checking whether two processes definable in the syntax of Basic Parallel Processes (BPP) are strongly bisimilar is PSPACE-hard. We also demonstrate that there is a polynomial time reduction from the strong bisimilarity checking problem of regular BPP to the strong regularity (finiteness) checking of BPP. This implies that strong regularity of BPP is also PSPACE-hard.