Continuous Newton-like Inertial Dynamics for Monotone Inclusions

Set-Valued and Variational Analysis - In a Hilbert framework ℌ, we study the convergence properties of a Newton-like inertial dynamical system governed by a general maximally monotone...     

Estimation of the Sorption Activity of Silver Nanoparticles on Biodegradable Fibers of Natural and Artificial Origin

Russian Physics Journal - The specific features of the sorption activity of silver nanoparticles (AgNPs) on biodegradable polymers of natural (collagen) and artificial (polyamide 6.6) origin have...     

An interval branch and bound method for global Robust optimization

In this paper, we design a Branch and Bound algorithm based on interval arithmetic to address nonconvex robust optimization problems. This algorithm provides the exact global solution of such difficult problems arising in many real life applications. A code was developed in MatLab and was used to solve some robust nonconvex problems with few variables. This first numerical study shows the interest of this approach providing the global solution of such difficult robust nonconvex optimization problems.

     

Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.     

Mesomorphism of Dichotomous Compounds; X-Ray Diffraction Analysis of 4-Chlorophenyl Hexadecyl Ether

Crystallography Reports - The crystal and molecular structures of Cl–C6H4–O–C16H33 (I) have been studied, and its differential scanning calorimetry (DSC) study is performed....     

Application of Synchrotron Radiation to Analyze the Friction-Induced Structural and Phase Transformations of Chrome-Nickel Austenitic Steel

Russian Physics Journal -     

k-Hankel Gabor Transform and Its Applications to the Theory of Localization Operators

Analysis Mathematica - We introduce and study the k-Hankel Gabor transform. We investigate the localization operators for this transform. In particular, we study their trace class properties and we...     

Correction to: Impact of leg bending in the patient-specific computational fluid dynamics of popliteal stenting

Acta Mechanica Sinica - A Correction to this paper has been published: https://doi.org/10.1007/s10409-021-01066-2     

Automatic approximation using asymptotically optimal adaptive interpolation

Numerical Algorithms - We present an asymptotic analysis of adaptive methods for Lp approximation of functions f ∈ Cr([a, b]), where $1\le p\le +\infty $ . The methods rely on piecewise...