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 6231 for “"polynomial"”.

  1. Polynomial preconditioning with the minimum residual polynomial.

    … reduce costs for solving the problem. We study a polynomial preconditioner p(A) based upon the minimum residual polynomial from GMRES. The polynomial can improve the eigenvalue distribution of A for better convergence. We demonstrate a power basis method of generating the polynomial and how it can …

    baylor Repository record for Polynomial preconditioning with the minimum residual polynomial. (opens in a new tab)

  2. Polynomial Maps of Polynomial Processes for Energy Markets

    … based on the mathematical foundations for polynomial diffusions, involving polynomial maps of polynomial processes (PMPP models) for various energy prices such as oil, natural gas and electricity prices. Under the PMPP framework, underlying factors are modeled by polynomial processes such …

    calgary Repository record for Polynomial Maps of Polynomial Processes for Energy Markets (opens in a new tab)

  3. Polynomial scaling

    concordia Download PDF for Polynomial scaling (opens in a new tab)

  4. A New Perspective on a Polynomial Time Knot Polynomial

    In this work we consider the Z1(K) polynomial time knot polynomial defined anddescribed by Dror Bar-Natan and Roland van der Veen in their 2018 paper ”A polynomial time knot polynomial”. We first look at some of the basic properties of Z1(K), and develop an invariant of diagrams Ψm(D) related to …

    lsu-thes Repository record for A New Perspective on a Polynomial Time Knot Polynomial (opens in a new tab)

  5. A polynomial computer

    A computer for solving polynomial equations, performing Fourier synthesis, and displaying system functions is a valuable asset to an electrical laboratory. A number of successful computers have been built for such purposes but each has its limitations. The design of a versatile and precise …

    ubc Repository record for A polynomial computer (opens in a new tab) Download PDF for A polynomial computer (opens in a new tab)

  6. Polynomial Time Calculi

    … deals with type systems which guarantee polynomial time complexity of typed programs. Such algorithms are commonly regarded as being feasible for practical applications, because their runtime grows reasonably fast for bigger inputs. The implicit complexity community has proposed several …

    lmu-germany Repository record for Polynomial Time Calculi (opens in a new tab)

  7. Generalized Polynomial Superfunctors

    … a generalized notion of homogeneous strict polynomial functors defined over a superalgebra, $A$. In particular, we define two closely related families of categories $\mathsf{P}^d_A$ and $\mathsf{P}^d_{(A,\mathfrak{a})}$ which generalize the categories $\mathsf{P}_d$ of classical homogeneous …

    oklahoma-thes Repository record for Generalized Polynomial Superfunctors (opens in a new tab) Restricted access

  8. Extensions of the Tutte Polynomial and Results on the Interlace Polynomial

    In graph theory, graph polynomials are an important tool to encode information from a graph. The Tutte polynomial, first introduced in 1947, is one of the most important graph polynomials due to its universality. Here, we present three classic definitions of the Tutte polynomial via a …

    waterloo Repository record for Extensions of the Tutte Polynomial and Results on the Interlace Polynomial (opens in a new tab)

  9. Conway's Link Polynomial: a Generalization of the Classic Alexander's Knot Polynomial

    … invariant of knots. To this end, the Conway polynomial is defined as a generalization of Alexander's original knot polynomial. It is noted, however, that the Conway polynomial is not a complete invariant. If two knots are equivalent, as defined in this investigation, then they receive …

    unt Repository record for Conway's Link Polynomial: a Generalization of the Classic Alexander's Knot Polynomial (opens in a new tab)

  10. Polynomial Methods and Polynomial Partitioning in Discrete Geometry and Harmonic Analysis

    … την τε- χνική της Πολυωνυμικής Διαμέρισης (Polynomial Partitioning) που εισήχθη από τους Guth και Katz, αναλύοντας τον ρόλο της στην παροχή μιας σύγχρονης απόδειξης του θεωρήματος Szemerédi-Trotter. Στη συνέχεια, η τεχνική αυτή εφαρμόζεται στην επίλυση του Προβλήμα- τος Διακριτών Αποστάσεων …

    athens Repository record for Polynomial Methods and Polynomial Partitioning in Discrete Geometry and Harmonic Analysis (opens in a new tab)

  11. Polynomial representations of GrT,simple polynomial modules andpolynomial parts of Auslander-Reitencomponents

    … the general framework given by Doty to consider polynomial representations of $G_r T$ for $G$ either a reductive group or a Borel subgroup of such a group and view the category of polynomial $G_r T$-modules as a full subcategory of the category of $X(T)$-graded $G_r$-modules. It is our aim to …

    cau-kiel Repository record for Polynomial representations of GrT,simple polynomial modules andpolynomial parts of Auslander-Reitencomponents (opens in a new tab)

  12. Exact CutFEM polynomial integration

    … in recent years, among them is the equivalent polynomial technique. This method replaces the discontinuous function with a polynomial, potentially allowing for the integration to occur over the entire domain, rather than integrating over complex subdomains. Although eliminating the issues …

    ttu Repository record for Exact CutFEM polynomial integration (opens in a new tab)

  13. Valuations of polynomial rings

    … V of R [x] can be represented by certain "key" polynomials in R [x]. The present paper exhibits the connection between these two treatments. This is achieved by first determining keys for the valuation which a pseudo-convergent sequence defines on A[x], and then relating these keys to those for …

    ubc Repository record for Valuations of polynomial rings (opens in a new tab) Download PDF for Valuations of polynomial rings (opens in a new tab)

  14. Polynomial zerofinding matrix algorithms.

    … defined as the zeros of its characteristic polynomial. Determining the zeros of polynomials by the computation of the eigenvalues of a corresponding companion matrix turns the table on the usual definition. In this dissertation, the work of Newbery has been expanded and a (complex) symmetric …

    ottawa-retro Repository record for Polynomial zerofinding matrix algorithms. (opens in a new tab)

  15. *-Polynomial Identities of Matrices

    … Rowen concerning s 4m-2, a so-called "standard" polynomial identity for K2m( F, t) and H2m( F, s), and s4m -4, a "standard" polynomial identity for K2 m-1(F, t).

    ottawa-retro Repository record for *-Polynomial Identities of Matrices (opens in a new tab)

  16. Polynomial Kalman filter updates

    … The approach is then generalized to a polynomial approximation of the Bayesian update, resulting in a Polynomial Unscented Kalman Filter that augments the UKF update with higher-order polynomial terms. Computing the moments required by these polynomial estimators motivates the use of a …

    iastate Repository record for Polynomial Kalman filter updates (opens in a new tab)

  17. POLYNOMIAL FIT OF INTERFEROGRAMS.

    The conventional Zernike polynomial fit of circular aperture interferograms is reviewed and a more quantitative and statistical analysis is added. Some conventional questions such as the required number of polynomials, sampling requirements, and how to determine the optimum references surface are …

    arizona-thes Repository record for POLYNOMIAL FIT OF INTERFEROGRAMS. (opens in a new tab)

Page 1 of 312