An alternating potential based approach for a Cauchy problem for the Laplace equation in a planar domain with a cut

We consider a Cauchy problem for the Laplace equation in a bounded region containing a cut, where the region is formed by removing a sufficiently smooth arc (the cut) from a bounded simply connected domain D. The aim is to reconstruct the solution on the cut from the values of the solution and its normal derivative on the boundary of the domain D. We propose an alternating iterative method which involves solving direct mixed problems for the Laplace operator in the same region. These mixed problems have either a Dirichlet or a Neumann boundary condition imposed on the cut and are solved by a potential approach. Each of these mixed problems is reduced to a system of integral equations of the first kind with logarithmic and hypersingular kernels and at most a square root singularity in the densities at the endpoints of the cut. The full discretization of the direct problems is realized by a trigonometric quadrature method which has super-algebraic convergence. The numerical examples presented illustrate the feasibility of the proposed method.

Fractional Integration of the Product of Bessel Functions of the First Kind

Dedicated to 75th birthday of Prof. A.M. Mathai, Mathematical Subject Classification 2010:26A33, 33C10, 33C20, 33C50, 33C60, 26A09

Singular Solutions of Protter’s Problem for a Class of 3-D Hyperbolic Equations

Недю Иванов Попиванов, Алексей Йорданов Николов - През 1952 г. М. Протър формулира нови гранични задачи за вълновото уравнение, които са тримерни аналози на задачите на Дарбу в равнината. Задачите са разгледани в тримерна област, ограничена от две характеристични конуса и равнина. Сега, след като са минали повече от 50 години, е добре известно, че за безброй гладки функции в дясната страна на уравнението тези задачи нямат класически решения, а обобщеното решение има силна степенна особеност във върха на характеристичния конус, която е изолирана и не се разпространява по конуса. Тук ние разглеждаме трета гранична задача за вълновото уравнение с младши членове и дясна страна във формата на тригонометричен полином. Дадена е по-нова от досега известната априорна оценка за максимално възможната особеност на решенията на тази задача. Оказва се, че при по-общото уравнение с младши членове възможната сингулярност е от същия ред като при чисто вълновото уравнение.

Numerical Issues in Using MATLAB

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

Best Approximation and Moduli of Smoothness

2010 Mathematics Subject Classification: 41A25, 41A10.

Exponential approximation in the norms and semi-norms

The deviations of some entire functions of exponential type from real-valued functions and their derivatives are estimated. As approximation metrics we use the Lp-norms and power variations on R. Theorems presented here correspond to the Ganelius and Popov results concerning the one-sided trigonometric approximation of periodic functions (see [4, 5 and 8]). Some related facts were announced in [2, 3, 6 and 7].

On some Extremal Problems of Landau

2000 Mathematics Subject Classification: Primary: 42A05. Secondary: 42A82, 11N05.

On the Mixed Modulus of Smoothness and a Class of Double Fourier Series

MSC 2010: 42A32; 42A20

Cooperative greedy pursuit strategies for sparse signal representation by partitioning

Cooperative Greedy Pursuit Strategies are considered for approximating a signal partition subjected to a global constraint on sparsity. The approach aims at producing a high quality sparse approximation of the whole signal, using highly coherent redundant dictionaries. The cooperation takes place by ranking the partition units for their sequential stepwise approximation, and is realized by means of i)forward steps for the upgrading of an approximation and/or ii) backward steps for the corresponding downgrading. The advantage of the strategy is illustrated by approximation of music signals using redundant trigonometric dictionaries. In addition to rendering stunning improvements in sparsity with respect to the concomitant trigonometric basis, these dictionaries enable a fast implementation of the approach via the Fast Fourier Transform

On Provable Algorithms for Determination of Continuous Protein Interdomain Motions from Residual Dipolar Couplings

Dynamics of biomolecules over various spatial and time scales are essential for biological functions such as molecular recognition, catalysis and signaling. However, reconstruction of biomolecular dynamics from experimental observables requires the determination of a conformational probability distribution. Unfortunately, these distributions cannot be fully constrained by the limited information from experiments, making the problem an ill-posed one in the terminology of Hadamard. The ill-posed nature of the problem comes from the fact that it has no unique solution. Multiple or even an infinite number of solutions may exist. To avoid the ill-posed nature, the problem needs to be regularized by making assumptions, which inevitably introduce biases into the result.

Here, I present two continuous probability density function approaches to solve an important inverse problem called the RDC trigonometric moment problem. By focusing on interdomain orientations we reduced the problem to determination of a distribution on the 3D rotational space from residual dipolar couplings (RDCs). We derived an analytical equation that relates alignment tensors of adjacent domains, which serves as the foundation of the two methods. In the first approach, the ill-posed nature of the problem was avoided by introducing a continuous distribution model, which enjoys a smoothness assumption. To find the optimal solution for the distribution, we also designed an efficient branch-and-bound algorithm that exploits the mathematical structure of the analytical solutions. The algorithm is guaranteed to find the distribution that best satisfies the analytical relationship. We observed good performance of the method when tested under various levels of experimental noise and when applied to two protein systems. The second approach avoids the use of any model by employing maximum entropy principles. This 'model-free' approach delivers the least biased result which presents our state of knowledge. In this approach, the solution is an exponential function of Lagrange multipliers. To determine the multipliers, a convex objective function is constructed. Consequently, the maximum entropy solution can be found easily by gradient descent methods. Both algorithms can be applied to biomolecular RDC data in general, including data from RNA and DNA molecules.

Orthogonal chirp division multiplexing for coherent optical fiber communications

In this paper, we propose an orthogonal chirp division multiplexing (OCDM) technique for coherent optical communication. OCDM is the principle of orthogonally multiplexing a group of linear chirped waveforms for high-speed data communication, achieving the maximum spectral efficiency (SE) for chirp spread spectrum, in a similar way as the orthogonal frequency division multiplexing (OFDM) does for frequency division multiplexing. In the coherent optical (CO)-OCDM, Fresnel transform formulates the synthesis of the orthogonal chirps; discrete Fresnel transform (DFnT) realizes the CO-OCDM in the digital domain. As both the Fresnel and Fourier transforms are trigonometric transforms, the CO-OCDM can be easily integrated into the existing CO-OFDM systems. Analyses and numerical results are provided to investigate the transmission of CO-OCDM signals over optical fibers. Moreover, experiments of 36-Gbit/s CO-OCDM signal are carried out to validate the feasibility and confirm the analyses. It is shown that the CO-OCDM can effectively compensate the dispersion and is more resilient to fading and noise impairment than OFDM.

Algebro-Geometric Aspects of the Classical Yang-Baxter Equation

In this thesis we consider algebro-geometric aspects of the Classical Yang-Baxter Equation and the Generalised Classical Yang-Baxter Equation. In chapter one we present a method to construct solutions of the Generalised Classical Yang-Baxter Equation starting with certain sheaves of Lie algebras on algebraic curves. Furthermore we discuss a criterion to check unitarity of such solutions. In chapter two we consider the special class of solutions coming from sheaves of traceless endomorphisms of simple vector bundles on the nodal cubic curve. These solutions are quasi-trigonometric and we describe how they fit into the classification scheme of such solutions. Moreover, we describe a concrete formula for these solutions. In the third and final chapter we show that any unitary, rational solution of the Classical Yang-Baxter Equation can be obtained via the method of chapter one applied to a sheaf of Lie algebras on the cuspidal cubic curve.

A dedicated greedy pursuit algorithm for sparse spectral representation of music sound

A dedicated algorithm for sparse spectral representation of music sound is presented. The goal is to enable the representation of a piece of music signal as a linear superposition of as few spectral components as possible, without affecting the quality of the reproduction. A representation of this nature is said to be sparse. In the present context sparsity is accomplished by greedy selection of the spectral components, from an overcomplete set called a dictionary. The proposed algorithm is tailored to be applied with trigonometric dictionaries. Its distinctive feature being that it avoids the need for the actual construction of the whole dictionary, by implementing the required operations via the fast Fourier transform. The achieved sparsity is theoretically equivalent to that rendered by the orthogonal matching pursuit (OMP) method. The contribution of the proposed dedicated implementation is to extend the applicability of the standard OMP algorithm, by reducing its storage and computational demands. The suitability of the approach for producing sparse spectral representation is illustrated by comparison with the traditional method, in the line of the short time Fourier transform, involving only the corresponding orthonormal trigonometric basis.

Höjdbestämningsmetoder vid upprättande av nybyggnadskartor : Jämförelse mellan nätverks-RTK och trigonometrisk höjdmätning

Levelling and trigonometric height measurements are the methods that are mostly used today for height determination, as the standard error with these methods is in the magnitude of millimeters, as long as the view length is less than 50 m. When creating a new construction map the requirement on standard error differ from 1 (Fredriksson, 2011) to 10 cm (www.arvidsjaur.se) depending on which municipality it concerns. When using network RTK for measuring, the accuracy in height can fall below 3 cm when the conditions are optimal. The purpose of this paper is to investigate if network RTK can be used as an alternative to determinate height when accuracy under 10 cm is requested. Five points at locations with different conditions for accuracy got their height determined with the three methods mentioned above. Positional accuracy was formed for each point and method. The result from levelling was used as reference for the calculations. To compare the result with the requirements extended standard uncertainty, 2covering 95 %, was used. The result from trigonometric height measurement shows a position accuracy of 4 mm. From the network RTK, the points that were positioned without interference got a positional accuracy of 3.3 to 5.5 cm, while the points that were influenced by their environment, multipath interference and obstructions, got a positional accuracy of 123.3 cm and 234.4 cm. Positional accuracy of this method became 127.4 cm. The result from the height determination with network RTK shows big difference in accuracy for the different points. The conclusion is that network RTK measurement would not be a sufficiently accurate height determination method for preparation of a new construction map in an area similar to the one used for this test. Conversely, a construction map drawn up in an open area free from interference obstacles the results show that the network RTK is an approved method for determining height, depending on the requirements of the municipality.

Semi-implicit finite strain constitutive integration and mixed strain/stress control based on intermediate configurations

A new semi-implicit stress integration algorithm for finite strain plasticity (compatible with hyperelas- ticity) is introduced. Its most distinctive feature is the use of different parameterizations of equilibrium and reference configurations. Rotation terms (nonlinear trigonometric functions) are integrated explicitly and correspond to a change in the reference configuration. In contrast, relative Green–Lagrange strains (which are quadratic in terms of displacements) represent the equilibrium configuration implicitly. In addition, the adequacy of several objective stress rates in the semi-implicit context is studied. We para- metrize both reference and equilibrium configurations, in contrast with the so-called objective stress integration algorithms which use coinciding configurations. A single constitutive framework provides quantities needed by common discretization schemes. This is computationally convenient and robust, as all elements only need to provide pre-established quantities irrespectively of the constitutive model. In this work, mixed strain/stress control is used, as well as our smoothing algorithm for the complemen- tarity condition. Exceptional time-step robustness is achieved in elasto-plastic problems: often fewer than one-tenth of the typical number of time increments can be used with a quantifiable effect in accuracy. The proposed algorithm is general: all hyperelastic models and all classical elasto-plastic models can be employed. Plane-stress, Shell and 3D examples are used to illustrate the new algorithm. Both isotropic and anisotropic behavior is presented in elasto-plastic and hyperelastic examples.