اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSoftware for the Gale transform of fewnomial systems and a Descartes rule for fewnomials
46
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We give a Descartes-like bound on the number of positive solutions to a system of fewnomials that holds when its exponent vectors are not in convex position and a sign condition is satisfied. This was discovered while developing algorithms and software for computing the Gale transform of a fewnomial system, which is our main goal. This software is a component of a package we are developing for Khovanskii-Rolle continuation, which is a numerical algorithm to compute the real solutions to a system of fewnomials.
قيم البحث
اقرأ أيضاً
We prove that for any degree d, there exist (families of) finite sequences a_0, a_1,..., a_d of positive numbers such that, for any real polynomial P of degree d, the number of its real roots is less than or equal to the number of the so-called essen
tial tropical roots of the polynomial obtained from P by multiplication of its coefficients by a_0, a_1,... a_d respectively. In particular, for any real univariate polynomial P of degree d with non-vanishing constant term, we conjecture that one can take a_k = e^{-k^2}, k = 0, ... , d. The latter claim can be thought of as a tropical generalization of Descartess rule of signs. We settle this conjecture up to degree 4 as well as a weaker statement for arbitrary real polynomials. Additionally we describe an application of the latter conjecture to the classical Karlin problem on zero-diminishing sequences.
We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem. The frame
work presented in Telen et al. (2018) uses truncated normal forms (TNFs) to compute the algebra structure of R/I and the solutions of I. This framework allows for the use of much more general bases than the standard monomials for R/I. This is exploited in this paper to introduce the use of two special (nonmonomial) types of basis functions with nice properties. This allows, for instance, to adapt the basis functions to the expected location of the roots of I. We also propose algorithms for efficient computation of TNFs and a generalization of the construction of TNFs in the case of non-generic zero-dimensional systems. The potential of the TNF method and usefulness of the new results are exposed by many experiments.
Taylor series is a useful mathematical tool when describing and constructing a function. With the series representation, some properties of fractional calculus can be revealed clearly. This paper investigates two typical applications: Lebiniz rule an
d Laplace transform. It is analytically shown that the commonly used Leibniz rule cannot be applied for Caputo derivative. Similarly, the well-known Laplace transform of Riemann-Liouville derivative is doubtful for n-th continuously differentiable function. By the aid of this series representation, the exact formula of Caputo Leibniz rule and the explanation of Riemann-Liouville Laplace transform are presented. Finally, three illustrative examples are revisited to confirm the obtained results.
The rim-hook rule for quantum cohomology of the Grassmannian allows one to reduce quantum calculations to classical calculations in the cohomology of the Grassmannian. We use the Abelian/non-Abelian correspondence for cohomology to prove a rim-hook r
emoval rule for the cohomology of quiver flag varieties. Quiver flag varieties are generalisations of type A flag varieties; this result is new even in the flag case. This gives an effective way of computing products in their cohomology, reducing computations to that in the cohomology ring of the Grassmannian. We then prove a quantum rim-hook rule for Fano quiver flag varieties (including type A flag varieties). As a corollary, we see that the Gu--Sharpe mirror to a Fano quiver flag variety computes its quantum cohomology.
Hierarchical $mathcal{H}^2$-matrices are asymptotically optimal representations for the discretizations of non-local operators such as those arising in integral equations or from kernel functions. Their $O(N)$ complexity in both memory and operator a
pplication makes them particularly suited for large-scale problems. As a result, there is a need for software that provides support for distributed operations on these matrices to allow large-scale problems to be represented. In this paper, we present high-performance, distributed-memory GPU-accelerated algorithms and implementations for matrix-vector multiplication and matrix recompression of hierarchical matrices in the $mathcal{H}^2$ format. The algorithms are a new module of H2Opus, a performance-oriented package that supports a broad variety of $mathcal{H}^2$-matrix operations on CPUs and GPUs. Performance in the distributed GPU setting is achieved by marshaling the tree data of the hierarchical matrix representation to allow batched kernels to be executed on the individual GPUs. MPI is used for inter-process communication. We optimize the communication data volume and hide much of the communication cost with local compute phases of the algorithms. Results show near-ideal scalability up to 1024 NVIDIA V100 GPUs on Summit, with performance exceeding 2.3 Tflop/s/GPU for the matrix-vector multiplication, and 670 Gflops/s/GPU for matrix compression, which involves batched QR and SVD operations. We illustrate the flexibility and efficiency of the library by solving a 2D variable diffusivity integral fractional diffusion problem with an algebraic multigrid-preconditioned Krylov solver and demonstrate scalability up to 16M degrees of freedom problems on 64 GPUs.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
