Data Flow Analysis and the Linear Programming Model

* The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.be

Training a Linear Neural Network with a Stable LSP Solution for Jamming Cancellation

Two jamming cancellation algorithms are developed based on a stable solution of least squares problem (LSP) provided by regularization. They are based on filtered singular value decomposition (SVD) and modifications of the Greville formula. Both algorithms allow an efficient hardware implementation. Testing results on artificial data modeling difficult real-world situations are also provided.

Numerical Approximation of a Fractional-In-Space Diffusion Equation, I

2000 Mathematics Subject Classification: 26A33 (primary), 35S15 (secondary)

On Two Saigo’s Fractional Integral Operators in the Class of Univalent Functions

2000 Mathematics Subject Classification: Primary 26A33, 30C45; Secondary 33A35

Numerical Approximation of a Fractional-In-Space Diffusion Equation (II) – with Nonhomogeneous Boundary Conditions

2000 Mathematics Subject Classification: 26A33 (primary), 35S15

Bounds for Fractional Powers of Operators in a Hilbert Space and Constants in Moment Inequalities

Mathematics Subject Classification: 47A56, 47A57,47A63

Caputo Derivatives in Viscoelasticity: A Non-Linear Finite-Deformation Theory for Tissue

Mathematics Subject Classification: 26A33, 74B20, 74D10, 74L15

Direct and Converse Theorems for Generalized Bernstein-Type Operators

2000 Mathematics Subject Classification: 41A25, 41A27, 41A36.

Operators with Polynomial Coefficients and Generalized Gelfand-Shilov Classes

2010 Mathematics Subject Classification: Primary 35S05, 35J60; Secondary 35A20, 35B08, 35B40.

Best Approximation and Moduli of Smoothness

2010 Mathematics Subject Classification: 41A25, 41A10.

On Principle Eigenvalue for Linear Second Order Elliptic Equations in Divergence Form

2002 Mathematics Subject Classification: 35J15, 35J25, 35B05, 35B50

On the Approximation of the Generalized Cut Function of Degree p+1 By Smooth Sigmoid Functions

We introduce a modification of the familiar cut function by replacing the linear part in its definition by a polynomial of degree p + 1 obtaining thus a sigmoid function called generalized cut function of degree p + 1 (GCFP). We then study the uniform approximation of the (GCFP) by smooth sigmoid functions such as the logistic and the shifted logistic functions. The limiting case of the interval-valued Heaviside step function is also discussed which imposes the use of Hausdorff metric. Numerical examples are presented using CAS MATHEMATICA.

Approximation Properties of Schurer-Stancu Type Polynomials

MSC 2010: 41A25, 41A35

Equivalence Between K-functionals Based on Continuous Linear Transforms

2000 Mathematics Subject Classification: 46B70, 41A10, 41A25, 41A27, 41A35, 41A36, 42A10.

Accurate WKB Approximation for a 1D Problem with Low Regularity

2000 Mathematics Subject Classification: 34L40, 65L10, 65Z05, 81Q20.