اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAlgebraic methods in approximation theory
73
0
0.0
(
0
)
تأليف
Hal Schenck
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This survey gives an overview of several fundamental algebraic constructions which arise in the study of splines. Splines play a key role in approximation theory, geometric modeling, and numerical analysis, their properties depend on combinatorics, topology, and geometry of a simplicial or polyhedral subdivision of a region in R^k, and are often quite subtle. We describe four algebraic techniques which are useful in the study of splines: homology, graded algebra, localization, and inverse systems. Our goal is to give a hands-on introduction to the methods, and illustrate them with concrete examples in the context of splines. We highlight progress made with these methods, such as a formula for the third coefficient of the polynomial giving the dimension of the spline space in high degree, much of which builds on pioneering work of Schumaker, Alfeld-Schumaker, and Billera. The objects appearing here may be computed using the Macaulay2 software system.
قيم البحث
اقرأ أيضاً
In this paper, we attempt to develop the Quillen Suslin theory for the algebraic fundamental group of a ring. We give a surjective group homomorphism from the algebraic fundamental group of the field of the real numbers to the group of integers. At t
he end of the paper, we also propose some problems related to the algebraic fundamental group of some particular type of rings.
Algebraic models for the reconstruction problem in X-ray computed tomography (CT) provide a flexible framework that applies to many measurement geometries. For large-scale problems we need to use iterative solvers, and we need stopping rules for thes
e methods that terminate the iterations when we have computed a satisfactory reconstruction that balances the reconstruction error and the influence of noise from the measurements. Many such stopping rules are developed in the inverse problems communities, but they have not attained much attention in the CT world. The goal of this paper is to describe and illustrate four stopping rules that are relevant for CT reconstructions.
In recent contributions, algebraic multigrid methods have been designed and studied from the viewpoint of the spectral complementarity. In this note we focus our efforts on specific applications and, more precisely, on large linear systems arising fr
om the approximation of weighted Laplacian with various boundary conditions. We adapt the multigrid idea to this specific setting and we present and critically discuss a wide numerical experimentation showing the potentiality of the considered approach.
This paper studies numerical methods for the approximation of elliptic PDEs with lognormal coefficients of the form $-{rm div}(a abla u)=f$ where $a=exp(b)$ and $b$ is a Gaussian random field. The approximant of the solution $u$ is an $n$-term polyno
mial expansion in the scalar Gaussian random variables that parametrize $b$. We present a general convergence analysis of weighted least-squares approximants for smooth and arbitrarily rough random field, using a suitable random design, for which we prove optimality in the following sense: their convergence rate matches exactly or closely the rate that has been established in cite{BCDM} for best $n$-term approximation by Hermite polynomials, under the same minimial assumptions on the Gaussian random field. This is in contrast with the current state of the art results for the stochastic Galerkin method that suffers the lack of coercivity due to the lognormal nature of the diffusion field. Numerical tests with $b$ as the Brownian bridge confirm our theoretical findings.
The RKHS bandit problem (also called kernelized multi-armed bandit problem) is an online optimization problem of non-linear functions with noisy feedback. Although the problem has been extensively studied, there are unsatisfactory results for some pr
oblems compared to the well-studied linear bandit case. Specifically, there is no general algorithm for the adversarial RKHS bandit problem. In addition, high computational complexity of existing algorithms hinders practical application. We address these issues by considering a novel amalgamation of approximation theory and the misspecified linear bandit problem. Using an approximation method, we propose efficient algorithms for the stochastic RKHS bandit problem and the first general algorithm for the adversarial RKHS bandit problem. Furthermore, we empirically show that one of our proposed methods has comparable cumulative regret to IGP-UCB and its running time is much shorter.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
