Publication

Strictly Real Fundamental Theorem Of Algebra Using Polynomial Interlacing

Related publications (41)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Synthesis of Fixed-Point Programs

Viktor Kuncak, Eva Darulova, Indranil Saha

Several problems in the implementations of control systems, signal-processing systems, and scientific computing systems reduce to compiling a polynomial expression over the reals into an imperative program using fixed-point arithmetic. Fixed-point arithmet ...

2013

A Probabilistic Approach of Sum Rules for Heat Polynomials

Olivier Lévêque

In this paper, we show that the sum rules for generalized Hermite polynomials derived by Daboul and Mizrahi (2005 J. Phys. A: Math. Gen. 38 427-48) and by Graczyk and Nowak (2004 C. R. Acad. Sci., Ser. 1 338 849) can be interpreted and easily recovered usi ...

2012

Properties of Network Polynomials

Christina Fragouli, Javad Ebrahimi Boroojeni

It is well known that transfer polynomials play an important role in the network code design problem. In this paper we provide a graph theoretical description of the terms of such polynomials. We consider acyclic networks with arbitrary number of receivers ...

2012

Properties of Network Polynomials

Javad Ebrahimi Boroojeni

Ieee2012

Estimation of multiple phases from a single fringe pattern in digital holographic interferometry

Pramod Rastogi, Sai Siva Gorthi

Simultaneous measurement of multidimensional displacements using digital holographic interferometry involves multi-directional illumination of the deformed object and requires the reliable estimation of the resulting multiple interference phase distributio ...

Optical Society of America2012

MATHICSE Technical Report : Analysis of the discrete $L^2$ projection on polynomial spaces with random evaluations

Fabio Nobile, Giovanni Migliorati, Erik Gustaf Bogislaw Von Schwerin

We analyse the problem of approximating a multivariate function by discrete least-squares projection on a polynomial space starting from random, noise-free observations. An area of possible application of such technique is Uncertainty Quantification (UQ) f ...

MATHICSE2011

Local Interference Can Accelerate Gossip Algorithms

Michael Christoph Gastpar

In this paper, we show how interference can be exploited to perform gossip computations for average-based consensus over a larger local neighborhood, rather than only pairs of nodes. We use a new channel coding technique called computation coding to comput ...

2011

Sur la méthode de Buser-Silhol pour l'uniformisation des surfaces de Riemann hyperelliptiques

Grégoire Aubry

The Uniformization Theorem due to Koebe and Poincaré implies that every compact Riemann surface of genus greater or equal to 2 can be endowed with a metric of constant curvature – 1. On the other hand, a compact Riemann surface is a complex algebraic curve ...

EPFL2010

Vinberg's theta-groups in positive characteristic and Kostant-Weierstrass slices

We generalize the basic results of Vinberg's theta-groups, or periodically graded reductive Lie algebras, to fields of good positive characteristic. To this end we clarify the relationship between the little Weyl group and the (standard) Weyl group. We ded ...

Birkhäuser-Verlag, Springer2009

Iterated monodromy groups of quadratic polynomials, I

We describe the iterated monodromy groups associated with post-critically finite quadratic polynomials, and make explicit their connection to the 'kneading sequence' of the polynomial. ...

2008