Noether-type discrete conserved quantities arising from a finite element approximation of a variational problem

In this work, we prove a weak Noether-type Theorem for a class of variational problems that admit broken extremals. We use this result to prove discrete Noether-type conservation laws for a conforming finite element discretisation of a model elliptic problem. In addition, we study how well the finite element scheme satisfies the continuous conservation laws arising from the application of Noether’s first theorem (1918). We summarise extensive numerical tests, illustrating the conservation of the discrete Noether law using the p-Laplacian as an example and derive a geometric-based adaptive algorithm where an appropriate Noether quantity is the goal functional.

Approximation of centroid end-points and switch points for replacing type reduction algorithms

Despite several years of research, type reduction (TR) operation in interval type-2 fuzzy logic system (IT2FLS) cannot perform as fast as a type-1 defuzzifier. In particular, widely used Karnik-Mendel (KM) TR algorithm is computationally much more demanding than alternative TR approaches. In this work, a data driven framework is proposed to quickly, yet accurately, estimate the output of the KM TR algorithm using simple regression models. Comprehensive simulation performed in this study shows that the centroid end-points of KM algorithm can be approximated with a mean absolute percentage error as low as 0.4%. Also, switch point prediction accuracy can be as high as 100%. In conjunction with the fact that simple regression model can be trained with data generated using exhaustive defuzzification method, this work shows the potential of proposed method to provide highly accurate, yet extremely fast, TR approximation method. Speed of the proposed method should theoretically outperform all available TR methods while keeping the uncertainty information intact in the process.

Linear approximation of Karnik-Mendel type reduction algorithm

Karnik-Mendel (KM) algorithm is the most used and researched type reduction (TR) algorithm in literature. This algorithm is iterative in nature and despite consistent long term effort, no general closed form formula has been found to replace this computationally expensive algorithm. In this research work, we demonstrate that the outcome of KM algorithm can be approximated by simple linear regression techniques. Since most of the applications will have a fixed range of inputs with small scale variations, it is possible to handle those complexities in design phase and build a fuzzy logic system (FLS) with low run time computational burden. This objective can be well served by the application of regression techniques. This work presents an overview of feasibility of regression techniques for design of data-driven type reducers while keeping the uncertainty bound in FLS intact. Simulation results demonstrates the approximation error is less than 2%. Thus our work preserve the essence of Karnik-Mendel algorithm and serves the requirement of low
computational complexities.

Low-energy direct muon transfer from H to Ne10+, S16+ and Ar18+ using the two-state close-coupling approximation to the Faddeev-Hahn-type equation

We perform a three-body calculation of direct muon-transfer rates from thermalized muonic hydrogen isotopes to bare nuclei Ne10+, S16+ and Ar18+ employing integro-differential Faddeev-Hahn-type equations in configuration space with a two-state close-coupling approximation scheme. All Coulomb potentials including the strong final-state Coulomb repulsion are treated exactly. A long-range polarization potential is included in the elastic channel to take into account the high polarizability of the muonic hydrogen. The transfer rates so-calculated are in good agreement with recent experiments. We find that the muon is captured predominantly in the n = 6, 9 and 10 states of muonic Ne10+, S16+ and Ar18+, respectively.

Approximation Properties of Schurer-Stancu Type Polynomials

MSC 2010: 41A25, 41A35

Accurate WKB Approximation for a 1D Problem with Low Regularity

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

Weighted Approximation by a Class of Bernstein-Type Operators

AMS classification: 41A36, 41A10, 41A25, 41Al7.

Contracting bubbles in Hele-Shaw cells with a power-law fluid

The problem of bubble contraction in a Hele-Shaw cell is studied for the case in which the surrounding fluid is of power-law type. A small perturbation of the radially symmetric problem is first considered, focussing on the behaviour just before the bubble vanishes, it being found that for shear-thinning fluids the radially symmetric solution is stable, while for shear-thickening fluids the aspect ratio of the bubble boundary increases. The borderline (Newtonian) case considered previously is neutrally stable, the bubble boundary becoming elliptic in shape with the eccentricity of the ellipse depending on the initial data. Further light is shed on the bubble contraction problem by considering a long thin Hele-Shaw cell: for early times the leading-order behaviour is one-dimensional in this limit; however, as the bubble contracts its evolution is ultimately determined by the solution of a Wiener-Hopf problem, the transition between the long-thin limit and the extinction limit in which the bubble vanishes being described by what is in effect a similarity solution of the second kind. This same solution describes the generic (slit-like) extinction behaviour for shear-thickening fluids, the interface profiles that generalise the ellipses that characterise the Newtonian case being constructed by the Wiener-Hopf calculation.