weight functions
Recently Published Documents


TOTAL DOCUMENTS

1071
(FIVE YEARS 187)

H-INDEX

36
(FIVE YEARS 5)

Symmetry ◽  
2021 ◽  
Vol 14 (1) ◽  
pp. 15
Author(s):  
Amrendra Gill ◽  
Maxim Ivanov ◽  
Madeti Prabhakar ◽  
Andrei Vesnin

F-polynomials for virtual knots were defined by Kaur, Prabhakar and Vesnin in 2018 using flat virtual knot invariants. These polynomials naturally generalize Kauffman’s affine index polynomial and use smoothing in the classical crossing of a virtual knot diagram. In this paper, we introduce weight functions for ordered orientable virtual and flat virtual links. A flat virtual link is an equivalence class of virtual links with respect to a local symmetry changing a type of classical crossing in a diagram. By considering three types of smoothing in classical crossings of a virtual link diagram and suitable weight functions, there is provided a recurrent construction for new invariants. It is demonstrated by explicit examples that newly defined polynomial invariants are stronger than F-polynomials.


Mathematics ◽  
2021 ◽  
Vol 10 (1) ◽  
pp. 14
Author(s):  
Heng Cheng ◽  
Miaojuan Peng

The improved element-free Galerkin (IEFG) method is proposed in this paper for solving 3D Helmholtz equations. The improved moving least-squares (IMLS) approximation is used to establish the trial function, and the penalty technique is used to enforce the essential boundary conditions. Thus, the final discretized equations of the IEFG method for 3D Helmholtz equations can be derived by using the corresponding Galerkin weak form. The influences of the node distribution, the weight functions, the scale parameters of the influence domain, and the penalty factors on the computational accuracy of the solutions are analyzed, and the numerical results of three examples show that the proposed method in this paper can not only enhance the computational speed of the element-free Galerkin (EFG) method but also eliminate the phenomenon of the singular matrix.


Author(s):  
Steven Charlton ◽  
◽  
Claude Duhr ◽  
Herbert Gangl ◽  
◽  
...  

We define a variant of real-analytic polylogarithms that are single-valued and that satisfy ''clean'' functional relations that do not involve any products of lower weight functions. We discuss the basic properties of these functions and, for depths one and two, we present some explicit formulas and results. We also give explicit formulas for the single-valued and clean single-valued version attached to the Nielsen polylogarithms Sn,2(x), and we show how the clean single-valued functions give new evaluations of multiple polylogarithms at certain algebraic points.


2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Xianyong Huang ◽  
Bicheng Yang

By the use of the weight functions, the symmetry property, and Hermite-Hadamard’s inequality, a more accurate half-discrete Mulholland-type inequality involving one multiple upper limit function is given. The equivalent conditions of the best possible constant factor related to multiparameters are studied. Furthermore, the equivalent forms, several inequalities for the particular parameters, and the operator expressions are provided.


2021 ◽  
Vol 72 ◽  
pp. 1215-1250
Author(s):  
Michele Flammini ◽  
Gianpiero Monaco ◽  
Luca Moscardelli ◽  
Mordechai Shalom ◽  
Shmuel Zaks

We consider the online version of the coalition structure generation problem, in which agents, corresponding to the vertices of a graph, appear in an online fashion and have to be partitioned into coalitions by an authority (i.e., an online algorithm). When an agent appears, the algorithm has to decide whether to put the agent into an existing coalition or to create a new one containing, at this moment, only her. The decision is irrevocable. The objective is partitioning agents into coalitions so as to maximize the resulting social welfare that is the sum of all coalition values. We consider two cases for the value of a coalition: (1) the sum of the weights of its edges, and (2) the sum of the weights of its edges divided by its size. Coalition structures appear in a variety of application in AI, multi-agent systems, networks, as well as in social networks, data analysis, computational biology, game theory, and scheduling. For each of the coalition value functions we consider the bounded and unbounded cases depending on whether or not the size of a coalition can exceed a given value α. Furthermore, we consider the case of a limited number of coalitions and various weight functions for the edges, i.e., unrestricted, positive and constant weights. We show tight or nearly tight bounds for the competitive ratio in each case.


2021 ◽  
Vol 77 (1) ◽  
Author(s):  
Javier Jiménez-Garrido ◽  
Javier Sanz ◽  
Gerhard Schindl

AbstractWe characterize the equality between ultradifferentiable function classes defined in terms of abstractly given weight matrices and in terms of the corresponding matrix of associated weight functions by using new growth indices. These indices, defined by means of weight sequences and (associated) weight functions, are extending the notion of O-regular variation to a mixed setting. Hence we are extending the known comparison results concerning classes defined in terms of a single weight sequence and of a single weight function and give also these statements an interpretation expressed in O-regular variation.


2021 ◽  
pp. 107754632110534
Author(s):  
Yuhao Zhao ◽  
Jingtao Du ◽  
Yang Liu

Recently, dynamic analysis of a beam structure with nonlinear energy sink (NES) and various supports is attracting great attention. Most of the existing studies are about the beam structure with NES or nonlinear boundary supports with zero rotational restraint, respectively. However, there is little research accounting for such two types of complex factors simultaneously. In this work, the dynamic behavior of an axially loaded beam with both NES and general boundary supports is modeled and studied. The Galerkin truncated method (GTM) is employed to make the prediction of dynamic behavior of such a beam system, in which the mode functions of axially loaded Euler–Bernoulli beam with linear elastic boundary conditions are selected as the trail and weight functions. Then, the Galerkin condition is used to discretize the nonlinear governing equation of the beam system and establish the residual equations. The Runge–Kutta method is used to solve the residual matrix which consists of residual equations directly, and the harmonic balance method is also used to verify the results from the GTM. The influence of NES on vibration suppression and dynamic behavior of the beam structure is investigated and discussed. Results show that the vibration states of the beam structure can be transformed effectively through the change of NES parameters. On the other hand, the NES with suitable parameters has a beneficial effect on the vibration suppression at both ends of the beam structure.


2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Jagbir Kaur ◽  
Vivek Sangwan

As it is well recognized that conventional numerical schemes are inefficient in approximating the solutions of the singularly perturbed problems (SPP) in the boundary layer region, in the present work, an effort has been made to propose a robust and efficient numerical approach known as element-free Galerkin (EFG) technique to capture these solutions with a high precision of accuracy. Since a lot of weight functions exist in the literature which plays a crucial role in the moving least square (MLS) approximations for generating the shape functions and hence affect the accuracy of the numerical solution, in the present work, due emphasis has been given to propose a robust weight function for the element-free Galerkin scheme for SPP. The key feature of nonrequirement of elements or node connectivity of the EFG method has also been utilized by proposing a way to generate nonuniformly distributed nodes. In order to verify the computational consistency and robustness of the proposed scheme, a variety of linear and nonlinear numerical examples have been considered and L ∞ errors have been presented. Comparison of the EFG solutions with those available in the literature depicts the superiority of the proposed scheme.


2021 ◽  
Author(s):  
Luke Stagner ◽  
William W Heidbrink ◽  
Mirko Salewski ◽  
Asger Schou Jacobsen ◽  
Benedikt Geiger

Abstract Both fast ions and runaway electrons are described by distribution functions, the understanding of which are of critical importance for the success of future fusion devices such as ITER. Typically, energetic particle diagnostics are only sensitive to a limited subsection of the energetic particle phase-space which is often insufficient for model validation. However, previous publications show that multiple measurements of a single spatially localized volume can be used to reconstruct a distribution function of the energetic particle velocity-space by using the diagnostics' velocity-space weight functions, i.e. Velocity-space Tomography. In this work we use the recently formulated orbit weight functions to remove the restriction of spatially localized measurements and present Orbit Tomography, which is used to reconstruct the 3D phase-space distribution of all energetic particle orbits in the plasma. Through a transformation of the orbit distribution, the full energetic particle distribution function can be determined in the standard {energy,pitch,r,z}-space. We benchmark the technique by reconstructing the fast-ion distribution function of an MHD-quiescent DIII-D discharge using synthetic and experimental FIDA measurements. We also use the method to study the redistribution of fast ions during a sawtooth crash at ASDEX Upgrade using FIDA measurements. Finally, a comparison between the Orbit Tomography and Velocity-space Tomography is shown.


2021 ◽  
Vol 10 (11) ◽  
pp. 3505-3513
Author(s):  
Z.Kh. Ochilov ◽  
M.I. Muminov

In this paper, we consider the problem of recovering a function in three-dimensional space from a family of cones with a weight function of a special form. Exact solutions of the problem are obtained for the given weight functions. A class of parameters for the problem that has no solution is constructed.


Sign in / Sign up

Export Citation Format

Share Document