Method of Linear Programming as an Idea for High School Curriculum

2010 Mathematics Subject Classification: 97D40, 97M10, 97M40, 97N60, 97N80, 97R80

A Representation of Binary Matrices

Христина Костадинова, Красимир Йорджев - В статията се обсъжда представянето на произволна бинарна матрица с помощта на последователност от цели неотрицателни числа. Разгледани са някои предимства и недостатъци на това представяне като алтернатива на стандартното, общоприето представяне чрез двумерен масив. Показано е, че представянето на бинарните матрици с помощта на наредени n-торки от естествени числа води до по-бързи алгоритми и до съществена икономия на оперативна памет. Използуван е апарата на обектно-ориентираното програмиране със синтаксиса и семантиката на езика C++.

Digital Representation of Knitting Patterns in Traditional Costumes

The paper presents the application of a CAD system for digital representation of traditional knitting. The CAD system is oriented to hand knitting. As a software application the system is developed by using C# programming language and .NET platform. The paper focuses on the applied side of the software and its usage as a means of representing and storing ethnographic exhibits.

Riemann-Hilbert Problems with Canonical Normalization and Families of Commuting Operators

2010 Mathematics Subject Classification: 35Q15, 31A25, 37K10, 35Q58.

Optimization Problem in a Class of Linear System. Application to Multiple Drug Administration

2000 Mathematics Subject Classification: 62H15, 62P10.

Branching Particle Representation of a Class of Semilinear Equations

2000 Mathematics Subject Classification: 60J80, 60J85

A Refinement of some Overrelaxation Algorithms for Solving a System of Linear Equations

In this paper we propose a refinement of some successive overrelaxation methods based on the reverse Gauss–Seidel method for solving a system of linear equations Ax = b by the decomposition A = Tm − Em − Fm, where Tm is a banded matrix of bandwidth 2m + 1. We study the convergence of the methods and give software implementation of algorithms in Mathematica package with numerical examples. ACM Computing Classification System (1998): G.1.3.

The Asymptotic Behaviour of the First Eigenvalue of Linear Second-Order Elliptic Equations in Divergente Form

2000 Mathematics Subject Classification: 35J70, 35P15.

Spectral Shift Function for the Perturbations of Schrödinger Operators at High Energy

2000 Mathematics Subject Classification: 35P20, 35J10, 35Q40.

Linear Colligations and Dynamic System Corresponding to Operators in the Banach Space

2000 Mathematics Subject Classification: Primary 47A48, 93B28, 47A65; Secondary 34C94.

Potapov-Ginsburg Transformation and Functional Models of Non-Dissipative Operators

2000 Mathematics Subject Classification: Primary 47A20, 47A45; Secondary 47A48.

Equivariant Embeddings of Differentiable Spaces

Given a differentiable action of a compact Lie group G on a compact smooth manifold V , there exists [3] a closed embedding of V into a finite-dimensional real vector space E so that the action of G on V may be extended to a differentiable linear action (a linear representation) of G on E. We prove an analogous equivariant embedding theorem for compact differentiable spaces (∞-standard in the sense of [6, 7, 8]).

Structuring of Ranked Models

Prognostic procedures can be based on ranked linear models. Ranked regression type models are designed on the basis of feature vectors combined with set of relations defined on selected pairs of these vectors. Feature vectors are composed of numerical results of measurements on particular objects or events. Ranked relations defined on selected pairs of feature vectors represent additional knowledge and can reflect experts' opinion about considered objects. Ranked models have the form of linear transformations of feature vectors on a line which preserve a given set of relations in the best manner possible. Ranked models can be designed through the minimization of a special type of convex and piecewise linear (CPL) criterion functions. Some sets of ranked relations cannot be well represented by one ranked model. Decomposition of global model into a family of local ranked models could improve representation. A procedures of ranked models decomposition is described in this paper.

Linear Fractional PDE, Uniqueness of Global Solutions

Mathematics Subject Classification: 26A33, 47A60, 30C15.

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

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