Correction to "Simulation of hysteresis systems using a piecewise polynomial function"

2002 ◽  
Vol 9 (9) ◽  
pp. 295-295 ◽  
Author(s):  
J.-D. Wei ◽  
C.-T. Sun
Keyword(s):  
Polynomial Function ◽  
Piecewise Polynomial ◽  
Piecewise Polynomial Function

Multivariate piecewise polynomials

Acta Numerica ◽  
1993 ◽  
Vol 2 ◽  
pp. 65-109 ◽  
Author(s):  
C. de Boor
Keyword(s):  
Approximation Theory ◽  
Variational Approach ◽  
Polynomial Function ◽  
Piecewise Polynomial ◽  
Multivariate Splines ◽  
Piecewise Polynomial Function ◽  
Multivariate Spline ◽  
Piecewise Polynomials ◽  
The Subject ◽  
Function Of Several Arguments

This article was supposed to be on ‘multivariate splines». An informal survey, taken recently by asking various people in Approximation Theory what they consider to be a ‘multivariate spline’, resulted in the answer that a multivariate spline is a possibly smooth piecewise polynomial function of several arguments. In particular the potentially very useful thin-plate spline was thought to belong more to the subject of radial basis funtions than in the present article. This is all the more surprising to me since I am convinced that the variational approach to splines will play a much greater role in multivariate spline theory than it did or should have in the univariate theory. Still, as there is more than enough material for a survey of multivariate piecewise polynomials, this article is restricted to this topic, as is indicated by the (changed) title.

scholarly journals A diagrammatic approach to Kronecker squares

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Ernesto Vallejo
Keyword(s):  
Polynomial Function ◽  
Young Tableaux ◽  
Piecewise Polynomial ◽  
Piecewise Polynomial Function ◽  
Isomorphism Classes ◽  
Nous Montrons ◽  
Il Y A ◽  
International Audience ◽  
Kronecker Coefficients ◽  
Standard Young Tableaux

International audience In this paper we improve a method of Robinson and Taulbee for computing Kronecker coefficients and show that for any partition $\overline{ν}$ of $d$ there is a polynomial $k_{\overline{ν}}$ with rational coefficients in variables $x_C$, where $C$ runs over the set of isomorphism classes of connected skew diagrams of size at most $d$, such that for all partitions $\lambda$ of $n$, the Kronecker coefficient $\mathsf{g}(\lambda, \lambda, (n-d, \overline{ν}))$ is obtained from $k_{\overline{ν}}(x_C)$ substituting each $x_C$ by the number of $\lambda$-removable diagrams in $C$. We present two applications. First we show that for $\rho_{k} = (k, k-1,\ldots, 2, 1)$ and any partition $\overline{ν}$ of size $d$ there is a piecewise polynomial function $s_{\overline{ν}}$ such that $\mathsf{g}(\rho_k, \rho_k, (|\rho_k| - d, \overline{ν})) = s_{\overline{ν}} (k)$ for all $k$ and that there is an interval of the form $[c, \infty)$ in which $s_{\overline{ν}}$ is polynomial of degree $d$ with leading coefficient the number of standard Young tableaux of shape $\overline{ν}$. The second application is new stability property for Kronecker coefficients. Dans ce papier nous améliorons une méthode de Robinson-Taulbee pour calculer les coefficients de Kronecker et montrons que pour toute partition $\overline{ν}$ de $d$ il y a un polynôme $k_{\overline{ν}}$ avec coefficients rationnels dans les variables $x_C$, où $C$ est dans l’ensemble de classes d’isomorphisme des diagrammes gauches connexes de taille non plus que $d$, tel que pour toute partition $\lambda$ de $n$, le coefficient de Kronecker $\mathsf{g}(\lambda, \lambda, (n-d, \overline{ν}))$ est obtenu de $k_{\overline{ν}}(x_C)$ en substituant chaque $x_C$ pour le nombre de diagrammes $\lambda$-removables en $C$. Nous présentons deux applications. Premièrement nous montrons que pour $\rho_{k} = (k, k-1,\ldots, 2, 1)$ et une partition $\overline{ν}$ de taille $d$ il y a une fonction polynôme par morceaux $s_{\overline{ν}}$ tel que pour toute $k$ on a $\mathsf{g}(\rho_k, \rho_k, (|\rho_k| - d, \overline{ν})) = s_{\overline{ν}} (k)$ et qu'il y a une intervalle de la forme $[c, \infty)$ dans laquelle $s_{\overline{ν}}$ est polynôme de degré $d$ avec coefficient principal le nombre de tableaux de Young standard de forme $\overline{ν}$. La seconde application est une nouveau propriété de stabilité des coefficients de Kronecker.

Piecewise Polynomial Mapping Method and Corresponding WENO Scheme with Improved Resolution

2015 ◽  
Vol 18 (5) ◽  
pp. 1417-1444 ◽  
Author(s):  
Qin Li ◽  
Pengxin Liu ◽  
Hanxin Zhang
Keyword(s):  
Riemann Problem ◽  
Mach Reflection ◽  
Mapping Function ◽  
Mapping Method ◽  
Weno Scheme ◽  
Polynomial Mapping ◽  
Piecewise Polynomial ◽  
Piecewise Polynomial Function ◽  
Double Mach Reflection ◽  
Fifth Order

AbstractAbstract. The method of mapping function was first proposed by Henrick et al. [J. Comput. Phys. 207:542-547 (2005)] to adjust nonlinear weights in [0,1] for the fifth order WENO scheme, and through which the requirement of convergence order is satisfied and the performance of the scheme is improved. Different from Henrick’s method, a concept of piecewise polynomial function is proposed in this study and corresponding WENO schemes are obtained. The advantage of the new method is that the function can have a gentle profile at the location of the linear weight (or the mapped nonlinear weight can be close to its linear counterpart), and therefore is favorable for the resolution enhancement. Besides, the function also has the flexibility of quick convergence to identity mapping near two endpoints of [0,1], which is favorable for improved numerical stability. The fourth-, fifth- and sixth-order polynomial functions are constructed correspondingly with different emphasis on aforementioned flatness and convergence. Among them, the fifth-order version has the flattest profile. To check the performance of the methods, the 1-D Shu-Osher problem, the 2-D Riemann problem and the double Mach reflection are tested with the comparison of WENO-M, WENO-Z and WENO-NS. The proposed new methods show the best resolution for describing shear-layer instability of the Riemann problem, and they also indicate high resolution in computations of double Mach reflection, where only these proposed schemes successfully resolved the vortex-pairing phenomenon. Other investigations have shown that the single polynomial mapping function has no advantage over the proposed piecewise one, and it is of no evident benefit to use the proposed method for the symmetric fifth-order WENO. Overall, the fifth-order piecewise polynomial and corresponding WENO scheme are suggested for resolution improvement.

scholarly journals A Novel Algorithm for Path Planning of the Mobile Robot in Obstacle Environment

2021 ◽  
Vol 15 ◽  
pp. 225-235
Author(s):  
Chun-li Yang
Keyword(s):  
Mobile Robot ◽  
Path Length ◽  
Symmetric Polynomial ◽  
Obtuse Angle ◽  
Target Point ◽  
Piecewise Polynomial ◽  
Tracking Accuracy ◽  
Piecewise Polynomial Function ◽  
Smooth Path ◽  
Novel Algorithm

—In this paper, a design method of smoothing the path generated by a novel algorithm is proposed, which makes the mobile robot can more rapidly and smoothly follow the path and reach the target point. No matter the attitude vector angle is an acute angle or obtuse angle, there is no doubt that we can find the right curve, including polar polynomial curves and piecewise polynomial functions, which makes the path length and the circular arc tend to be similar and guarantees the shorter path length. In the condition of meeting the dynamic characteristics of the mobile robot, the tracking speed and quality are improved. Therefore, the symmetric polynomial curve and the piecewise polynomial function curve are used to generate a smooth path. This novel algorithm improves the path tracking accuracy and the flexibility of the mobile robot. At the same time, it expands the application range of mobile robot in structured environment.

Sign in / Sign up

Export Citation Format

Share Document