اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRecursive families of higher order iterative maps
93
0
0.0
(
0
)
تأليف
Mario M. Grac{c}a
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
To approximate a simple root of an equation we construct families of iterative maps of higher order of convergence. These maps are based on model functions which can be written as an inner product. The main family of maps discussed is defined recursively and is called {it Newton-barycentric}. We illustrate the application of Newton-barycentric maps in two worked examples, one dealing with a typical least squares problem and the other showing how to locate simultaneously a great number of extrema of the Ackleys function.
قيم البحث
اقرأ أيضاً
A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in non-deterministic polynomial time. We also explore specializations like nominal letrec-matching for plain expres
sions and for DAGs and determine the complexity of corresponding unification problems.
In this contribution we extend the Taylor expansion method proposed previously by one of us and establish equivalent partial differential equations of DDH lattice Boltzmann scheme at an arbitrary order of accuracy. We derive formally the associated d
ynamical equations for classical thermal and linear fluid models in one to three space dimensions. We use this approach to adjust relaxation parameters in order to enforce fourth order accuracy for thermal model and diffusive relaxation modes of the Stokes problem. We apply the resulting scheme for numerical computation of associated eigenmodes and compare our results with analytical references.
We consider the problem of decomposing higher-order moment tensors, i.e., the sum of symmetric outer products of data vectors. Such a decomposition can be used to estimate the means in a Gaussian mixture model and for other applications in machine le
arning. The $d$th-order empirical moment tensor of a set of $p$ observations of $n$ variables is a symmetric $d$-way tensor. Our goal is to find a low-rank tensor approximation comprising $r ll p$ symmetric outer products. The challenge is that forming the empirical moment tensors costs $O(pn^d)$ operations and $O(n^d)$ storage, which may be prohibitively expensive; additionally, the algorithm to compute the low-rank approximation costs $O(n^d)$ per iteration. Our contribution is avoiding formation of the moment tensor, computing the low-rank tensor approximation of the moment tensor implicitly using $O(pnr)$ operations per iteration and no extra memory. This advance opens the door to more applications of higher-order moments since they can now be efficiently computed. We present numerical evidence of the computational savings and show an example of estimating the means for higher-order moments.
We consider the discretization of a stationary Stokes interface problem in a velocity-pressure formulation. The interface is described implicitly as the zero level of a scalar function as it is common in level set based methods. Hence, the interface
is not aligned with the mesh. An unfitted finite element discretization based on a Taylor-Hood velocity-pressure pair and an XFEM (or CutFEM) modification is used for the approximation of the solution. This allows for the accurate approximation of solutions which have strong or weak discontinuities across interfaces which are not aligned with the mesh. To arrive at a consistent, stable and accurate formulation we require several additional techniques. First, a Nitsche-type formulation is used to implement interface conditions in a weak sense. Secondly, we use the ghost penalty stabilization to obtain an inf-sup stable variational formulation. Finally, for the highly accurate approximation of the implicitly described geometry, we use a combination of a piecewise linear interface reconstruction and a parametric mapping of the underlying mesh. We introduce the method and discuss results of numerical examples.
In this paper, we first introduce the reader to the Basic Scheme of Moulinec and Suquet in the setting of quasi-static linear elasticity, which takes advantage of the fast Fourier transform on homogenized microstructures to accelerate otherwise time-
consuming computations. By means of an asymptotic expansion, a hierarchy of linear problems is derived, whose solutions are looked at in detail. It is highlighted how these generalized homogenization problems depend on each other. We extend the Basic Scheme to fit this new problem class and give some numerical results for the first two problem orders.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
