Pub Date : 2020-03-24DOI: 10.14658/pupj-drna-2019-Special_Issue-4
M. Chatzakou, Y. Sarantopoulos
In this work, we discuss generalizations of the classical Bernstein and Markov type inequalities for polynomials and we present some new inequalities for the $k$th Frechet derivative of homogeneous polynomials on real and complex $L_{p}(mu)$ spaces. We also give applications to homogeneous polynomials and symmetric multilinear mappings in $L_{p}(mu)$ spaces. Finally, Bernstein's inequality for homogeneous polynomials on both real and complex Hilbert spaces has been discussed.
{"title":"Bernstein and Markov-type inequalities for polynomials on Lp(μ) spaces","authors":"M. Chatzakou, Y. Sarantopoulos","doi":"10.14658/pupj-drna-2019-Special_Issue-4","DOIUrl":"https://doi.org/10.14658/pupj-drna-2019-Special_Issue-4","url":null,"abstract":"In this work, we discuss generalizations of the classical Bernstein and Markov type inequalities for polynomials and we present some new inequalities for the $k$th Frechet derivative of homogeneous polynomials on real and complex $L_{p}(mu)$ spaces. We also give applications to homogeneous polynomials and symmetric multilinear mappings in $L_{p}(mu)$ spaces. Finally, Bernstein's inequality for homogeneous polynomials on both real and complex Hilbert spaces has been discussed.","PeriodicalId":51943,"journal":{"name":"Dolomites Research Notes on Approximation","volume":"12 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2020-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42937428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-01-01DOI: 10.14658/PUPJ-DRNA-2020-1-5
E. Perracchione
As usually claimed, meshless methods work in any dimension and are easy to implement. However in practice, to preserve the convergence order when the dimension grows, they need a huge number of sampling points and both computational costs and memory turn out to be prohibitive. Moreover, when a large number of points is involved, the usual instability of the Radial Basis Function (RBF) approximants becomes evident. To partially overcome this drawback, we propose to apply tensor decomposition methods. This, together with rational RBFs, allows us to obtain efficient interpolation schemes for high dimensions. The effectiveness of our approach is also verified by an application to oenology.
{"title":"RBF-based tensor decomposition with applications to oenology","authors":"E. Perracchione","doi":"10.14658/PUPJ-DRNA-2020-1-5","DOIUrl":"https://doi.org/10.14658/PUPJ-DRNA-2020-1-5","url":null,"abstract":"As usually claimed, meshless methods work in any dimension and are easy to implement. However in practice, to preserve the convergence order when the dimension grows, they need a huge number of sampling points and both computational costs and memory turn out to be prohibitive. Moreover, when a large number of points is involved, the usual instability of the Radial Basis Function (RBF) approximants becomes evident. To partially overcome this drawback, we propose to apply tensor decomposition methods. This, together with rational RBFs, allows us to obtain efficient interpolation schemes for high dimensions. The effectiveness of our approach is also verified by an application to oenology.","PeriodicalId":51943,"journal":{"name":"Dolomites Research Notes on Approximation","volume":"13 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66792429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-01-01DOI: 10.14658/PUPJ-DRNA-2018-3-2
I. M. Bulai, M. G. Pedersen
Phantom bursters were introduced to explain bursting electrical activity in β -cells with different periods. We study a polynomial version of the phantom bursting model. In particular we analyse the fast subsystem, where the slowest variable is assumed constant. We find the equilibrium points of the fast subsystem and analyse their stability. Furthermore an analytical analysis of the existence of Hopf bifurcation points and the stability of the resulting periodics is performed by studying the sign of the first Lyapunov coefficient.
{"title":"Hopf bifurcation analysis of the fast subsystem of a polynomial phantom burster model","authors":"I. M. Bulai, M. G. Pedersen","doi":"10.14658/PUPJ-DRNA-2018-3-2","DOIUrl":"https://doi.org/10.14658/PUPJ-DRNA-2018-3-2","url":null,"abstract":"Phantom bursters were introduced to explain bursting electrical activity in β -cells with different periods. We study a polynomial version of the phantom bursting model. In particular we analyse the fast subsystem, where the slowest variable is assumed constant. We find the equilibrium points of the fast subsystem and analyse their stability. Furthermore an analytical analysis of the existence of Hopf bifurcation points and the stability of the resulting periodics is performed by studying the sign of the first Lyapunov coefficient.","PeriodicalId":51943,"journal":{"name":"Dolomites Research Notes on Approximation","volume":"11 1","pages":"3-10"},"PeriodicalIF":1.3,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66792399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-01-01DOI: 10.14658/PUPJ-DRNA-2018-4-4
S. Dinew, S. Kołodziej
We survey elements of the nonlinear potential theory associated to m-subharmonic functions and the complex Hessian equation. We focus on properties which distinguish m-subharmonic functions from plurisubharmonic ones. Introduction Plurisubharmonic functions arose as multidimensional generalizations of subharmonic functions in the complex plane (see [LG]). Thus it is not surprising that these two classes of functions share many similarities. There are however many subtler properties which make a plurisubharmonic function in Cn, n > 1 differ from a general subharmonic function. Below we list some of the basic ones: Liouville type properties. it is known ([LG]) that an entire plurisubharmonic function cannot be bounded from above unless it is constant. The function u(z) = −1 ||z||2n−2 in C n, n> 1 is an example that this is not true for subharmonic ones; Integrability. Any plurisubarmonic function belongs to L loc for any 1≤ p <∞. For subharmonic functions this is true only for p < n n−1 as the function u above shows. Symmetries. Any holomorphic mapping preserves plurisubharmonic functions in the sense that a composition of a plurisubharmonic function with a holomporhic mapping is still plurisubharmonic. This does not hold for subharmonic functions in Cn, n> 1. The notion of m-subharmonic function (see [Bl1], [DK2, DK1]) interpolates between subharmonicity and plurisubharmonicity. It is thus expected that the corresponding nonlinear potential theory will share the joint properties of potential and pluripotential theories. Indeed in the works of Li, Blocki, Chinh, Abdullaev and Sadullaev, Dhouib and Elkhadhra, Nguyen and many others the m-subharmonic potential theory was thoroughly developed. In particular S. Y. Li [Li] solved the associated smooth Dirichlet problem under suitable assumptions, proving thus an analogue of the Caffarelli-Nirenberg-Spruck theorem [CNS] who dealt with the real setting. Z. Blocki [Bl1, Bl3] noted that the Bedford-Taylor apparatus from [BT1] and [BT2] can be adapted to m-subharmonic setting. He also described the domain of definition of the complex Hessian operator. L. H. Chinh developed the variational apporach to the complex Hessian equation [Chi1] and studied the associated viscosity theory of weak solutions in [Chi3]. He also developed the theory of m-subharmonic Cegrell classes [Chi1, Chi2]. Abdullaev and Sadullaev in [AS] defined the corresponding m-capacities (this was done also independently by Chinh in [Chi2] and the authors in [DK2]). A. Dhouib and F. Elkhadhra investigated m-subharmonicity with respect to a current [DE] and noticed several interesting phenomena. N. C. Nguyen in [N] investigated existence of solutions to the Hessian equations if a subsolution exists. Arguably the most interesting part of the theory is the one that differs from its pluripotential counterpart. This involves not only new phenomena but also requires new tools. Obviously there are good reasons for such a discrepancy. The very notion o
我们研究了与m-次谐波函数和复Hessian方程相关的非线性势理论的要素。我们着重于区分m次谐波函数和多次谐波函数的性质。复数次谐波函数是复数平面上次谐波函数的多维推广(参见[LG])。因此,这两类函数有许多相似之处也就不足为奇了。然而,有许多更微妙的性质使得Cn, n > 1中的多次谐波函数不同于一般的次谐波函数。下面我们列出了一些基本的:Liouville类型的属性。众所周知([LG]),除非整个多次谐波函数是常数,否则它不能从上面有界。函数u(z) = - 1 ||z||2n - 2在C n n, n> 1中是一个例子这对于次谐波是不成立的;可积性。对于任意1≤p 1,任何多次调和函数都属于lloc。m-次谐波函数的概念(参见[Bl1], [DK2, DK1])插补在次谐波和多次次谐波之间。因此,期望相应的非线性势理论具有势理论和多势理论的联合性质。实际上,在Li、Blocki、Chinh、Abdullaev和Sadullaev、Dhouib和Elkhadhra、Nguyen和其他许多人的著作中,m-次谐波势理论得到了彻底的发展。特别是S. Y. Li [Li]在适当的假设下解决了相关的光滑Dirichlet问题,从而证明了处理实际情况的Caffarelli-Nirenberg-Spruck定理[CNS]的类似。Z. Blocki [Bl1, Bl3]注意到[BT1]和[BT2]中的Bedford-Taylor装置可以适应m-次谐波设置。他还描述了复Hessian算子的定义域。L. H. Chinh发展了复Hessian方程的变分方法[Chi1],并在[Chi3]中研究了弱解的相关黏性理论。他还发展了m-次谐波Cegrell类理论[Chi1, Chi2]。Abdullaev和Sadullaev在[AS]中定义了相应的m-容量(Chinh在[Chi2]和作者在[DK2]中也独立完成了这一工作)。a. Dhouib和F. Elkhadhra研究了电流的m-次谐波[DE],并注意到几个有趣的现象。N. C. Nguyen [N]研究了Hessian方程的子解存在性。可以说,这个理论中最有趣的部分是它与多能理论的对应部分不同。这不仅涉及新的现象,而且需要新的工具。显然,这种差异是有充分理由的。多元次谐波的概念是独立于Kähler度规的,与m次谐波形成鲜明对比。m- hessian方程的基本解为- 1 |z|2 n m- 2,因此在原点处存在强于对数的奇点,函数在无穷远处有界。而且它仅在p < nm n−m时是Lp可积的。本调查笔记的目的是收集m-次谐波函数的这种独特的结果。我们的选择当然是主观的,我们不涉及许多重要的问题,如紧流形上的m极集或m次调和函数。首先我们处理m-sh函数的对称性。我们特别证明了这些对称的集合与任意1< m< n的全纯和反全纯正交仿射映射的集合重合,与边界情况形成鲜明对比。我们还研究了Lelong数的上水平集的类似物。在Harvey和Lawson ([HL1])和Chu ([Ch])的论证之后,我们提出了一个惊人的事实的证明,即上层水平集在m< n时是离散的。这再次与Siu定理暗示当m= n时这些集合的可解析性的多次谐波情况截然不同。雅盖隆大学,Kraków,波兰。Dinew·Kołodziej 36笔记组织如下:第1节列出了基本概念和工具。特别地,我们已经涵盖了m-sh函数的线性代数和势理论性质。我们还包括一个相当简短的小节,专门讨论一般椭圆偏微分方程的弱解。第2节的第一部分专门讨论m-sh函数的对称性。在第二种方法中,我们构造一个特殊的非线性算子Pm。我们证明了所有的m-sh函数都是Pm的子解,更重要的是,Pm与m-Hessian算子具有相同的基本解。我们希望指出,Pm是Harvey和Lawson定义的具有相同Riesz特征的一致椭圆算子的更一般构造的一个例子(见[HL1])。最后,在第3节中,我们研究了m-sh函数的Lelong数的类似物的上水平集。本节依赖于Harvey和Lawson ([HL1, HL2])以及Chu ([Ch])的一般性论点。 当我们处理m-sh函数的具体情况时,我们的论点稍微简单一些,但主要思想是相同的。奉献精神。我们很高兴把这篇文章献给诺姆,一位伟大的朋友和数学家。Aknowledgements。两位作者均获得NCN基金2013/08/A/ST1/00312的资助。在本节中,我们回顾出现在m-次谐波函数势理论中的概念和工具。1.1线性代数。用Mn表示所有厄米对称n× n矩阵的集合。固定矩阵M∈Mn。用λ(M) = (λ1,λ2,…,λn)表示其特征值按降序排列。定义1.1。与M相关的第M个对称多项式定义为Sm(M) = Sm(λ(M)) =∑0< j10,···,Sm(λ)>}。(1.1)这些锥的以下两个性质是经典的:(Maclaurin不等式)如果λ∈Γm则(S j (j)) 1 j≥(Si (i)) 1 i对于1≤j≤i≤m;2. (g<s:1> rding不等式,[Ga]) Γm对于任意m都是凸锥,函数s1m m在约束于Γm时是凹的;关于这些锥的进一步性质,我们参考读者[Bl1]或[W]。1.2 m-次谐波函数的势理论方面。我们只考虑一个相对紧凑的域Ω∧Cn。下面我们假设n≥2。用d =∂+∂'和d c:= i(∂'−∂)表示标准的外部微分算子。用β:= dd c |z|2表示Cn中的正则Kähler形式。我们现在定义光滑的m次谐波函数。定义1.2。给定一个C2(Ω)函数u,我们称它为Ω中的m次谐波,如果对于任意z∈Ω, Hessian矩阵∂2u∂zi∂z´j (z)具有特征值,在圆锥的闭包中形成一个向量Γm。特征值向量的几何性质可以用微分形式的语言更解析地表述:u是m次调和的当且仅当下列不等式成立:(dd u)∧β n−k≥0,k = 1,···,m。注意,如果n−k≥1,这些不等式依赖于背景Kähler形式β。因此,定义相对于一般Kähler形式ω的次调和性是有意义的(详见[DK1])。然而,在本调查中,我们将只处理标准的Kähler形式β。在([Bl1]) Z. Błocki证明中,我们可以放宽对u的光滑性要求,并开发出Hessian算子的非线性势理论,就像Bedford和Taylor在多次谐波函数([BT1], [BT2])的情况下所做的那样。一般来说,m-sh函数定义如下:定义1.3。设u是定义域Ω∈Cn上的次调和函数。如果对于任意c2 -光滑m-sh函数v1,···,vm−1的集合,不等式dd u∧dd c v1∧···∧dd c vm−1∧β n−m≥0在弱电流意义下成立,则u称为m次谐波(简称m-sh)。所有m−Ω -sh函数的集合用SHm(Ω)表示。备注1。在m = n的情况下,m-sh函数是简单的多次谐波函数。同样,在m-sh次多项式集合上测试u的m次谐波性也足够了(见[Bl1])。利用定义中的近似序列u j,可以根据[BT2]中给出的由局部有界m-sh函数给出的电流楔积的Bedford和Taylor构造。它们被归纳定义为dd∧∧···∧dd up∧
{"title":"Non standard properties of m-subharmonic functions","authors":"S. Dinew, S. Kołodziej","doi":"10.14658/PUPJ-DRNA-2018-4-4","DOIUrl":"https://doi.org/10.14658/PUPJ-DRNA-2018-4-4","url":null,"abstract":"We survey elements of the nonlinear potential theory associated to m-subharmonic functions and the complex Hessian equation. We focus on properties which distinguish m-subharmonic functions from plurisubharmonic ones. Introduction Plurisubharmonic functions arose as multidimensional generalizations of subharmonic functions in the complex plane (see [LG]). Thus it is not surprising that these two classes of functions share many similarities. There are however many subtler properties which make a plurisubharmonic function in Cn, n > 1 differ from a general subharmonic function. Below we list some of the basic ones: Liouville type properties. it is known ([LG]) that an entire plurisubharmonic function cannot be bounded from above unless it is constant. The function u(z) = −1 ||z||2n−2 in C n, n> 1 is an example that this is not true for subharmonic ones; Integrability. Any plurisubarmonic function belongs to L loc for any 1≤ p <∞. For subharmonic functions this is true only for p < n n−1 as the function u above shows. Symmetries. Any holomorphic mapping preserves plurisubharmonic functions in the sense that a composition of a plurisubharmonic function with a holomporhic mapping is still plurisubharmonic. This does not hold for subharmonic functions in Cn, n> 1. The notion of m-subharmonic function (see [Bl1], [DK2, DK1]) interpolates between subharmonicity and plurisubharmonicity. It is thus expected that the corresponding nonlinear potential theory will share the joint properties of potential and pluripotential theories. Indeed in the works of Li, Blocki, Chinh, Abdullaev and Sadullaev, Dhouib and Elkhadhra, Nguyen and many others the m-subharmonic potential theory was thoroughly developed. In particular S. Y. Li [Li] solved the associated smooth Dirichlet problem under suitable assumptions, proving thus an analogue of the Caffarelli-Nirenberg-Spruck theorem [CNS] who dealt with the real setting. Z. Blocki [Bl1, Bl3] noted that the Bedford-Taylor apparatus from [BT1] and [BT2] can be adapted to m-subharmonic setting. He also described the domain of definition of the complex Hessian operator. L. H. Chinh developed the variational apporach to the complex Hessian equation [Chi1] and studied the associated viscosity theory of weak solutions in [Chi3]. He also developed the theory of m-subharmonic Cegrell classes [Chi1, Chi2]. Abdullaev and Sadullaev in [AS] defined the corresponding m-capacities (this was done also independently by Chinh in [Chi2] and the authors in [DK2]). A. Dhouib and F. Elkhadhra investigated m-subharmonicity with respect to a current [DE] and noticed several interesting phenomena. N. C. Nguyen in [N] investigated existence of solutions to the Hessian equations if a subsolution exists. Arguably the most interesting part of the theory is the one that differs from its pluripotential counterpart. This involves not only new phenomena but also requires new tools. Obviously there are good reasons for such a discrepancy. The very notion o","PeriodicalId":51943,"journal":{"name":"Dolomites Research Notes on Approximation","volume":"11 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66792660","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-01-01DOI: 10.14658/pupj-drna-2018-3-3
A. Franceschini, M. Ferronato, C. Janna, V. Magri
The numerical simulations of real-world engineering problems create models with several millions or even billions of degrees of freedom. Most of these simulations are centered on the solution of systems of non-linear equations, that, once linearized, become a sequence of linear systems, whose solution is often the most time-demanding task. Thus, in order to increase the capability of modeling larger cases, it is of paramount importance to exploit the resources of High Performance Computing architectures. In this framework, the development of new algorithms to accelerate the solution of linear systems for many-core architectures is a really active research field. Our main focus is algebraic preconditioning and, among the various options, we elect to develop approximate inverses for symmetric and positive definite (SPD) linear systems [22], both as stand-alone preconditioner or smoother for AMG techniques. This choice is mainly supported by the almost perfect parallelism that intrinsically characterizes these algorithms. As basic kernel, the Factorized Sparse Approximate Inverse (FSAI) developed in its adaptive form by Janna and Ferronato [18] is selected. Recent developments are i) a robust multilevel approach for SPD problems based on FSAI preconditioning, which eliminates the chance of algorithmic breakdowns independently of the preconditioner sparsity [14] and ii) a novel AMG approach featuring the adaptive FSAI method as a flexible smoother as well as new approaches to adaptively compute the prolongation operator. In this latter work, a new technique to build the prolongation is also presented.
{"title":"Recent advancements in preconditioning techniques for large size linear systems suited for high performance computing","authors":"A. Franceschini, M. Ferronato, C. Janna, V. Magri","doi":"10.14658/pupj-drna-2018-3-3","DOIUrl":"https://doi.org/10.14658/pupj-drna-2018-3-3","url":null,"abstract":"The numerical simulations of real-world engineering problems create models with several millions or even billions of degrees of freedom. Most of these simulations are centered on the solution of systems of non-linear equations, that, once linearized, become a sequence of linear systems, whose solution is often the most time-demanding task. Thus, in order to increase the capability of modeling larger cases, it is of paramount importance to exploit the resources of High Performance Computing architectures. In this framework, the development of new algorithms to accelerate the solution of linear systems for many-core architectures is a really active research field. Our main focus is algebraic preconditioning and, among the various options, we elect to develop approximate inverses for symmetric and positive definite (SPD) linear systems [22], both as stand-alone preconditioner or smoother for AMG techniques. This choice is mainly supported by the almost perfect parallelism that intrinsically characterizes these algorithms. As basic kernel, the Factorized Sparse Approximate Inverse (FSAI) developed in its adaptive form by Janna and Ferronato [18] is selected. Recent developments are i) a robust multilevel approach for SPD problems based on FSAI preconditioning, which eliminates the chance of algorithmic breakdowns independently of the preconditioner sparsity [14] and ii) a novel AMG approach featuring the adaptive FSAI method as a flexible smoother as well as new approaches to adaptively compute the prolongation operator. In this latter work, a new technique to build the prolongation is also presented.","PeriodicalId":51943,"journal":{"name":"Dolomites Research Notes on Approximation","volume":"11 1","pages":"11-22"},"PeriodicalIF":1.3,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66792535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-01-01DOI: 10.14658/PUPJ-DRNA-2018-4-5
M. Klimek, M. Kosek
The metric space of pluriregular sets was introduced over two decades ago but to this day most of its topological properties remain a mystery. The purpose of this short survey is to present the cur ...
{"title":"On the metric space of pluriregular sets","authors":"M. Klimek, M. Kosek","doi":"10.14658/PUPJ-DRNA-2018-4-5","DOIUrl":"https://doi.org/10.14658/PUPJ-DRNA-2018-4-5","url":null,"abstract":"The metric space of pluriregular sets was introduced over two decades ago but to this day most of its topological properties remain a mystery. The purpose of this short survey is to present the cur ...","PeriodicalId":51943,"journal":{"name":"Dolomites Research Notes on Approximation","volume":"11 1","pages":"51-61"},"PeriodicalIF":1.3,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66792734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-01-01DOI: 10.14658/PUPJ-DRNA-2017-SPECIAL_ISSUE-13
S. Marchi, W. Erb, F. Marchetti
Polynomial interpolation and approximation methods on sampling points along Lissajous curves using Chebyshev series is an effective way for a fast image reconstruction in Magnetic Particle Imaging. Due to the nature of spectral methods, a Gibbs phenomenon occurs in the reconstructed image if the underlying function has discontinuities. A possible solution for this problem are spectral filtering methods acting on the coefficients of the approximating polynomial. In this work, after a description of the Gibbs phenomenon and classical filtering techniques in one and several dimensions, we present an adaptive spectral filtering process for the resolution of this phenomenon and for an improved approximation of the underlying function or image. In this adaptive filtering technique, the spectral filter depends on the distance of a spatial point to the nearest discontinuity. We show the effectiveness of this filtering approach in theory, in numerical simulations as well as in the application in Magnetic Particle Imaging.
{"title":"Spectral filtering for the reduction of the Gibbs phenomenon for polynomial approximation methods on Lissajous curves with applications in MPI","authors":"S. Marchi, W. Erb, F. Marchetti","doi":"10.14658/PUPJ-DRNA-2017-SPECIAL_ISSUE-13","DOIUrl":"https://doi.org/10.14658/PUPJ-DRNA-2017-SPECIAL_ISSUE-13","url":null,"abstract":"Polynomial interpolation and approximation methods on sampling points along Lissajous curves using Chebyshev series is an effective way for a fast image reconstruction in Magnetic Particle Imaging. Due to the nature of spectral methods, a Gibbs phenomenon occurs in the reconstructed image if the underlying function has discontinuities. A possible solution for this problem are spectral filtering methods acting on the coefficients of the approximating polynomial. In this work, after a description of the Gibbs phenomenon and classical filtering techniques in one and several dimensions, we present an adaptive spectral filtering process for the resolution of this phenomenon and for an improved approximation of the underlying function or image. In this adaptive filtering technique, the spectral filter depends on the distance of a spatial point to the nearest discontinuity. We show the effectiveness of this filtering approach in theory, in numerical simulations as well as in the application in Magnetic Particle Imaging.","PeriodicalId":51943,"journal":{"name":"Dolomites Research Notes on Approximation","volume":"10 1","pages":"128-137"},"PeriodicalIF":1.3,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66792250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-01-01DOI: 10.14658/PUPJ-DRNA-2017-SPECIAL_ISSUE-6
C. Conti, M. Cotronei, Lucia Romani
The main goal of this paper is to present some generalizations of polynomial B-splines, which include exponential B-splines and the larger family of exponential pseudo-splines. We especially focus on their connections to subdivision schemes. In addition, we generalize a well-known result on the approximation order of exponential pseudo-splines, providing conditions to establish the approximation order of nonstationary subdivision schemes reproducing spaces of exponential polynomial functions. 2010 MSC: 65D17, 65D15, 41A25
{"title":"Beyond B-splines: exponential pseudo-splines and subdivision schemes reproducing exponential polynomials","authors":"C. Conti, M. Cotronei, Lucia Romani","doi":"10.14658/PUPJ-DRNA-2017-SPECIAL_ISSUE-6","DOIUrl":"https://doi.org/10.14658/PUPJ-DRNA-2017-SPECIAL_ISSUE-6","url":null,"abstract":"The main goal of this paper is to present some generalizations of polynomial B-splines, which include exponential B-splines and the larger family of exponential pseudo-splines. We especially focus on their connections to subdivision schemes. In addition, we generalize a well-known result on the approximation order of exponential pseudo-splines, providing conditions to establish the approximation order of nonstationary subdivision schemes reproducing spaces of exponential polynomial functions. 2010 MSC: 65D17, 65D15, 41A25","PeriodicalId":51943,"journal":{"name":"Dolomites Research Notes on Approximation","volume":"10 1","pages":"31-42"},"PeriodicalIF":1.3,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66791816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}