Numerical Issues in Using MATLAB

Михаил Константинов, Весела Пашева, Петко Петков - Разгледани са някои числени проблеми при използването на компютърната система MATLAB в учебната дейност: пресмятане на тригонометрични функции, повдигане на матрица на степен, спектрален анализ на целочислени матрици от нисък ред и пресмятане на корените на алгебрични уравнения. Причините за възникналите числени трудности могат да се обяснят с особеностите на използваната двоичната аритметика с плаваща точка.

On Finite Element Methods for 2nd order (semi–) periodic Eigenvalue Problems

We deal with a class of elliptic eigenvalue problems (EVPs) on a rectangle Ω ⊂ R^2 , with periodic or semi–periodic boundary conditions (BCs) on ∂Ω. First, for both types of EVPs, we pass to a proper variational formulation which is shown to fit into the general framework of abstract EVPs for symmetric, bounded, strongly coercive bilinear forms in Hilbert spaces, see, e.g., [13, §6.2]. Next, we consider finite element methods (FEMs) without and with numerical quadrature. The aim of the paper is to show that well–known error estimates, established for the finite element approximation of elliptic EVPs with classical BCs, hold for the present types of EVPs too. Some attention is also paid to the computational aspects of the resulting algebraic EVP. Finally, the analysis is illustrated by two non-trivial numerical examples, the exact eigenpairs of which can be determined.

Timed Transition Automata as Numerical Planning Domain

A general technique for transforming a timed finite state automaton into an equivalent automated planning domain based on a numerical parameter model is introduced. Timed transition automata have many applications in control systems and agents models; they are used to describe sequential processes, where actions are labelling by automaton transitions subject to temporal constraints. The language of timed words accepted by a timed automaton, the possible sequences of system or agent behaviour, can be described in term of an appropriate planning domain encapsulating the timed actions patterns and constraints. The time words recognition problem is then posed as a planning problem where the goal is to reach a final state by a sequence of actions, which corresponds to the timed symbols labeling the automaton transitions. The transformation is proved to be correct and complete and it is space/time linear on the automaton size. Experimental results shows that the performance of the planning domain obtained by transformation is scalable for real world applications. A major advantage of the planning based approach, beside of the solving the parsing problem, is to represent in a single automated reasoning framework problems of plan recognitions, plan synthesis and plan optimisation.

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

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

Quasi-Monte Carlo Methods for some Linear Algebra Problems. Convergence and Complexity

We present quasi-Monte Carlo analogs of Monte Carlo methods for some linear algebra problems: solving systems of linear equations, computing extreme eigenvalues, and matrix inversion. Reformulating the problems as solving integral equations with a special kernels and domains permits us to analyze the quasi-Monte Carlo methods with bounds from numerical integration. Standard Monte Carlo methods for integration provide a convergence rate of O(N^(−1/2)) using N samples. Quasi-Monte Carlo methods use quasirandom sequences with the resulting convergence rate for numerical integration as good as O((logN)^k)N^(−1)). We have shown theoretically and through numerical tests that the use of quasirandom sequences improves both the magnitude of the error and the convergence rate of the considered Monte Carlo methods. We also analyze the complexity of considered quasi-Monte Carlo algorithms and compare them to the complexity of the analogous Monte Carlo and deterministic algorithms.

Numerical Solution of Fractional Diffusion-Wave Equation with two Space Variables by Matrix Method

Mathematics Subject Classi¯cation 2010: 26A33, 65D25, 65M06, 65Z05.

Explicit Solutions of Nonlocal Boundary Value Problems, Containing Bitsadze-Samarskii Constraints

MSC 2010: 44A35, 35L20, 35J05, 35J25

Three-Dimensional Operational Calculi for Nonlocal Evolution Boundary Value Problems

Иван Христов Димовски, Юлиан Цанков Цанков - Построени са директни операционни смятания за функции u(x, y, t), непрекъснати в област от вида D = [0, a] × [0, b] × [0, ∞). Наред с класическата дюамелова конволюция, построението използва и две некласически конволюции за операторите ∂2x и ∂2y. Тези три едномерни конволюции се комбинират в една тримерна конволюция u ∗ v в C(D). Вместо подхода на Я. Микусински, основаващ се на конволюционни частни, се развива алтернативен подход с използване на мултипликаторните частни на конволюционната алгебра (C(D), ∗).

Viability, Optimality and Stability of Dynamical Systems and Estimation of Convergence of Numerical Schemes

AMS subject classification: 49N35,49N55,65Lxx.

Interior Boundaries for Degenerate Elliptic Equations of Second Order Some Theory and Numerical Observations

2010 Mathematics Subject Classification: Primary 35J70; Secondary 35J15, 35D05.