Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 23 for “"sparse polynomial"”.
-
Sparse Polynomial Interpolation and Testing
… is the process of learning an unknown polynomial f from some set of its evaluations. We consider the interpolation of a sparse polynomial, i.e., where f is comprised of a small, bounded number of terms. Sparse interpolation dates back to work in the late 18th century by the French …
-
Sparse polynomial systems in optimization
Systems of polynomial equations appear both in mathematics, as well as in many applications in the sciences, economics and engineering. Solving these systems is at the heart of computational algebraic geometry, a field which is often associated with symbolic computations based on Gr¨obner bases. …
-
Quantitative Aspects of Sums of Squares and Sparse Polynomial Systems
… algebraic geometry is the study of roots of polynomials and polynomial systems. We are familiar with the notion of degree, but there are other ways to consider a polynomial: How many variables does it have? How many terms does it have? Considering the sparsity of a polynomial means we pay …
-
A Sparse Polynomial Chaos Algorithm with a Variance-Adaptive Design Domain for the Uncertainty Quantification and Optimization of Grating Structures
Σε αυτή την εργασία, παρουσιάζουμε έναν αλγόριθμο βασισμένο στο Ανάπτυγμα Πολυω- νυμικού Χάους (PCE) για την αντιμετώπιση προβλημάτων ποσοτικοποίησης αβεβαιότητας που σχετίζονται με φίλτρα περίθλασης. Η προσέγγισή μας κατασκευάζει προσαρμοστικά ανισοτροπικά μοντέλα PCΕ για τις ποσότητες …
-
Identifying Trace Affine Linear Sets Using Homotopy Continuation
We investigate how the coefficients of a sparse polynomial system influence the sum, or the trace, of its solutions. We discuss an extension of the classical trace test in numerical algebraic geometry to sparse polynomial systems. Two known methods for identifying a trace affine linear subset of …
-
Faster Algorithms for Sparse Decomposition and Sparse Series Solutions to Differential Equations
Sparse polynomials are those polynomials with only a few non-zero coefficients relative to their degree. They can appear in practice in polynomial systems as inputs, where the degree of the input sparse polynomial can be exponentially larger than the bit length of the representation of it. This …
-
Computational Aspects of Galois Groups in Enumerative Geometry
… been exploited for fast and efficient solving of polynomial systems. As such, determining Galois groups of enumerative problems and understanding how they may be used in numerical computations is of great importance. We detail the mathematical background needed to define Galois groups of …
-
Parameterized Polynomial Systems: Monodromy, Sparse Polynomials, and Solutions
… group. We show how this result may be applied to sparse polynomial systems, where the restricted monodromy group can be obtained by changing one coefficient parameter. As an application, we complete the proof of the sparse trace test. The sparse trace test verifies that a computed solution set of …
-
Surrogate Models for Diffusion on Graphs: A High-Dimensional Polynomial Approach
… from high-dimensional approximation based on sparse polynomial expansions, which are known to produce accurate and sample-efficient approximations when the function to be approximated has holomorphic regularity. Hence, to justify our methodology, we present theoretical results showing that …
-
New Explicit Bounds in p-adic Fewnomial Theory
… bounds in p-adic fewnomial theory, focusing on sparse polynomial systems over Qp. Fewnomial theory studies how the number of solutions to a poly-nomial system depends on combinatorial data such as the number of monomial terms, rather than on total degree. While existential bounds over Qp have …
-
New Explicit Bounds in p-adic Fewnomial Theory
… bounds in p-adic fewnomial theory, focusing on sparse polynomial systems over Qp. Fewnomial theory studies how the number of solutions to a poly-nomial system depends on combinatorial data such as the number of monomial terms, rather than on total degree. While existential bounds over Qp have …
-
New Explicit Bounds in p-adic Fewnomial Theory
… bounds in p-adic fewnomial theory, focusing on sparse polynomial systems over Qp. Fewnomial theory studies how the number of solutions to a poly-nomial system depends on combinatorial data such as the number of monomial terms, rather than on total degree. While existential bounds over Qp have …
-
Newton Polytopes and Numerical Algebraic Geometry
… we give an algorithm which recursively solves a sparse polynomial system when the support of that system is either lacunary or triangular. Prior to explaining these results, we give necessary background on polytopes, algebraic geometry, monodromy groups of branched covers, and numerical algebraic …
-
Efficient multidimensional uncertainty quantification of high speed circuits using advanced polynomial chaos approaches
… novel approaches based on the generalized polynomial chaos (gPC) theory for the efficient multidimensional uncertainty quantification of general distributed and lumped high-speed circuit networks. The key feature of this work is the development of approaches which are more efficient and/or …
-
Advanced stochastic finite element simulations and reliability analysis
… methodology consists of constructing an adaptive sparse polynomial chaos (PC) expansion of the response of stochastic systems in the framework of spectral stochastic finite element method (SSFEM). The proposed methodology utilizes the concept of variability response function (VRF) in order to …
-
Trees, Point Counting Beyond Fields, and Root Separation
Counting the solutions to systems of polynomial equations over finite fields is a central problem in number theory, as well as computer algebra. In this work, we discuss its applications to the problems of computing the dimension of an algebraic set over the complex numbers, and point counting over …
-
Topics in resultants and implicitization
… tools for determining whether or not a system of polynomials has a common root without actually solving for the roots of these equations. Resultants can also be used to solve for the common roots of polynomial systems. Classical resultants are typically represented as determinants whose entries …
-
Efficient Computation with Sparse and Dense Polynomials
Computations with polynomials are at the heart of any computer algebra system and also have many applications in engineering, coding theory, and cryptography. Generally speaking, the low-level polynomial computations of interest can be classified as arithmetic operations, algebraic computations, …
-
Sparse Reconstruction Techniques for Solutions of High-Dimensional Parametric PDEs
<p>This work studies sparse reconstruction techniques for approximating solutions of high-dimensional parametric PDEs. Such problems are relevant to mathematical modeling in engineering and the sciences, and are inherently difficult to solve due to the exponential relationship between dimension and …
-
Greedy Dictionary Learning Algorithms for Sparse Surrogate Modelling
… learning algorithms for efficiently constructing sparse surrogate models using a set of scattered observational data. The central idea is to define a dictionary of basis functions either a priori or a posteriori in light of the dataset and select a subset of the basis functions from the dictionary …
Page 1 of 2