Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Concept

Quadratic function

Summary

In mathematics, a quadratic polynomial is a polynomial of degree two in one or more variables. A quadratic function is the polynomial function defined by a quadratic polynomial. Before the 20th century, the distinction was unclear between a polynomial and its associated polynomial function; so "quadratic polynomial" and "quadratic function" were almost synonymous. This is still the case in many elementary courses, where both terms are often abbreviated as "quadratic". For example, a univariate (single-variable) quadratic function has the form :f(x)=ax^2+bx+c,\quad a \ne 0, where x is its variable. The graph of a univariate quadratic function is a parabola, a curve that has an axis of symmetry parallel to the y-axis. If a quadratic function is equated with zero, then the result is a quadratic equation. The solutions of a quadratic equation are the zeros of the corresponding quadratic function. The bivariate case in terms of variables x and y has the fo

Official source

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications

Related people

Related units

Related concepts

Related courses

Related lectures

Contributions to Likelihood-Based Modelling of Extreme Values

Léo Raymond-Belzile

xtreme value analysis is concerned with the modelling of extreme events such as floods and heatwaves, which can have large impacts. Statistical modelling can be useful to better assess risks even if, due to scarcity of measurements, there is inherently very large residual uncertainty in any analysis. Driven by the increase in environmental databases, spatial modelling of extremes has expanded rapidly in the last decade. This thesis presents contributions to such analysis. The first chapter is about likelihood-based inference in the univariate setting and investigates the use of bias-correction and higher-order asymptotic methods for extremes, highlighting through examples and illustrations the unique challenge posed by data scarcity. We focus on parametric modelling of extreme values, which relies on limiting distributional results and for which, as a result, uncertainty quantification is complicated. We find that, in certain cases, small-sample asymptotic methods can give improved inference by reducing the error rate of confidence intervals. Two data illustrations, linked to assessment of the frequency of extreme rainfall episodes in Venezuela and the analysis of survival of supercentenarians, illustrate the methods developed. In the second chapter, we review the major methods for the analysis of spatial extremes models. We highlight the similarities and provide a thorough literature review along with novel simulation algorithms. The methods described therein are made available through a statistical software package. The last chapter focuses on estimation for a Bayesian hierarchical model derived from a multivariate generalized Pareto process. We review approaches for the estimation of censored components in models derived from (log)-elliptical distributions, paying particular attention to the estimation of a high-dimensional Gaussian distribution function via Monte Carlo methods. The impacts of model misspecification and of censoring are explored through extensive simulations and we conclude with a case study of rainfall extremes in Eastern Switzerland.

EPFL2019

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that any set of

e(n)

points in general position in the plane contains

n

points in convex position. In 1935, Erd\H{o}s and Szekeres proved that

e(n) \le {2n-4 \choose n-2}+1

and later in 1961, they obtained the lower bound

2^{n-2}+1 \le e(n)

, which they conjectured to be optimal. We prove that

e(n) \le {2n-5 \choose n-2}-{2n-8 \choose n-3}+2

. In a recent breakthrough, Suk proved that

e(n) \le 2^{n+O\left(n^{2/3}\log n\right)}

. We strengthen this result by extending it to pseudo-configurations and also improving the error term. Combining our results with a theorem of Dobbins et al., we significantly improve the best known upper bounds on the following two functions, introduced by Bisztriczky and Fejes T'{o}th and by Pach and T'{o}th, respectively. Let

c(n)

(and

c'(n)

) denote the smallest positive integer

N

such that any family of

N

pairwise disjoint convex bodies in general position (resp.,

N

convex bodies in general position, any pair of which share at most two boundary points) has an

n

members in convex position. We show that

c(n)\le c'(n)\le 2^{n+O\left(\sqrt{n\log n}\right)}

. Given a point set

P

in the plane, an ordinary circle for

P

is defined as a circle containing exactly three points of

P

. We prove that any set of

n

points in the plane, not all on a line or a circle, determines at least

\frac{1}{4}n^2-O(n)

ordinary circles. We determine the exact minimum number of ordinary circles for all sufficiently large

n

, and characterize all point sets that come close to this minimum. We also consider the orchard problem for circles, where we determine the maximum number of circles containing four points of a given set and describe the extremal configurations. A special case of the Schwartz-Zippel lemma states that given an algebraic curve

C\subset \mathbb{C}^2

of degree

d

and two finite sets

A,B\subset \mathbb{C}

, we have

|C\cap (A\times B)|=O_d(|A|+|B|)

. We establish a two-dimensional version of this result, and prove upper bounds on the size of the intersection

|X\cap (P\times Q)|

for a variety

X\subset \mathbb{C}^4

and finite sets

P,Q\subset \mathbb{C}^2

. A key ingredient in our proofs is a two-dimensional version of a special case of Alon's combinatorial Nullstellensatz. As corollaries, we generalize the Szemer'edi-Trotter point-line incidence theorem and several known bounds on repeated and distinct Euclidean distances. We use incidence geometry to prove some sum-product bounds over arbitrary fields. First, we give an explicit exponent and improve a recent result of Bukh and Tsimerman by proving that

\max \{ |A+A|, |f(A, A)|\}\gg |A|^{6/5}

for any small set

A\subset \mathbb{F}_p

and quadratic non-degenerate polynomial

f(x, y)\in \mathbb{F}_p[x, y]

. This generalizes the result of Roche-Newton et al. giving the best known lower bound for the term

\max \{ |A+A|, |A \cdot A |\}

. Secondly, we improve and generalize the sum-product results of Hegyv'{a}ri and Hennecart on

\max\{ |A+B|, |f(B,C)|\}

, for a specific type of function

f

. Finally, we prove that the number of distinct cubic distances generated by any small set

A\times A\subset \mathbb{F}_p^2

\Omega(|A|^{8/7})

, which improves a result of Yazici et al.

EPFL2017

Space-time adaptive algorithms for parabolic problems

Virabouth Prachittham

We developed a space and time adaptive method to simulate electroosmosis and mass transport of a sample concentration within a network of microchannels. The space adaptive criteria is based on an error estimator derived using anisotropic interpolation estimates and a post-processing procedure. In order to improve the accuracy of the numerical solution and to reduce even further the computational cost of the numerical simulation, a time adaptive procedure is combined with the one in space. To do so, a time error estimator is derived for a first model problem, the linear heat equation discretized in time with the Crank-Nicolson scheme. The main difficulty is then to obtain an optimal second order error estimator. Applying standard energy techniques with a continuous, piecewise linear approximation in time fail in recovering the optimal order. To restore the appropriate rate of convergence, a continuous piecewise quadratic polynomial function in time is needed. For this purpose, two different quadratic functions are introduced and two different time error estimators are then derived. It turns out that the second error estimator is more efficient than the first one when considering our adaptive algorithm. Thus, using the second quadratic polynomial, an upper bound for the error is derived for a second model problem, the time-dependent convection-diffusion problem discretized in time with the Crank-Nicolson scheme. The corresponding space and time error estimators are finally used for the numerical simulation of mass transport of a sample concentration within a complex network of microchannels driven by an electroosmotic flow and/or by a pressure-driven flow. Numerical results presented show the efficiency and the robustness of this approach.

EPFL2009