Publication

Dynamical Low Rank approximation of PDEs with random parameters

Related concepts (51)

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.

Variation of parameters

In mathematics, variation of parameters, also known as variation of constants, is a general method to solve inhomogeneous linear ordinary differential equations. For first-order inhomogeneous linear differential equations it is usually possible to find solutions via integrating factors or undetermined coefficients with considerably less effort, although those methods leverage heuristics that involve guessing and do not work for all inhomogeneous linear differential equations.

Semi-differentiability

In calculus, a branch of mathematics, the notions of one-sided differentiability and semi-differentiability of a real-valued function f of a real variable are weaker than differentiability. Specifically, the function f is said to be right differentiable at a point a if, roughly speaking, a derivative can be defined as the function's argument x moves to a from the right, and left differentiable at a if the derivative can be defined as x moves to a from the left.

Holonomy

In differential geometry, the holonomy of a connection on a smooth manifold is a general geometrical consequence of the curvature of the connection measuring the extent to which parallel transport around closed loops fails to preserve the geometrical data being transported. For flat connections, the associated holonomy is a type of monodromy and is an inherently global notion. For curved connections, holonomy has nontrivial local and global features. Any kind of connection on a manifold gives rise, through its parallel transport maps, to some notion of holonomy.

Deterministic algorithm

In computer science, a deterministic algorithm is an algorithm that, given a particular input, will always produce the same output, with the underlying machine always passing through the same sequence of states. Deterministic algorithms are by far the most studied and familiar kind of algorithm, as well as one of the most practical, since they can be run on real machines efficiently. Formally, a deterministic algorithm computes a mathematical function; a function has a unique value for any input in its domain, and the algorithm is a process that produces this particular value as output.

Zero-dimensional space

In mathematics, a zero-dimensional topological space (or nildimensional space) is a topological space that has dimension zero with respect to one of several inequivalent notions of assigning a dimension to a given topological space. A graphical illustration of a nildimensional space is a point. Specifically: A topological space is zero-dimensional with respect to the Lebesgue covering dimension if every open cover of the space has a refinement which is a cover by disjoint open sets.

Spherical 3-manifold

In mathematics, a spherical 3-manifold M is a 3-manifold of the form where is a finite subgroup of SO(4) acting freely by rotations on the 3-sphere . All such manifolds are prime, orientable, and closed. Spherical 3-manifolds are sometimes called elliptic 3-manifolds or Clifford-Klein manifolds. A spherical 3-manifold has a finite fundamental group isomorphic to Γ itself. The elliptization conjecture, proved by Grigori Perelman, states that conversely all compact 3-manifolds with finite fundamental group are spherical manifolds.

G2 manifold

DISPLAYTITLE:G2 manifold In differential geometry, a G2 manifold is a seven-dimensional Riemannian manifold with holonomy group contained in G2. The group is one of the five exceptional simple Lie groups. It can be described as the automorphism group of the octonions, or equivalently, as a proper subgroup of special orthogonal group SO(7) that preserves a spinor in the eight-dimensional spinor representation or lastly as the subgroup of the general linear group GL(7) which preserves the non-degenerate 3-form , the associative form.

Separable space

In mathematics, a topological space is called separable if it contains a countable, dense subset; that is, there exists a sequence of elements of the space such that every nonempty open subset of the space contains at least one element of the sequence. Like the other axioms of countability, separability is a "limitation on size", not necessarily in terms of cardinality (though, in the presence of the Hausdorff axiom, this does turn out to be the case; see below) but in a more subtle topological sense.

Separable polynomial

In mathematics, a polynomial P(X) over a given field K is separable if its roots are distinct in an algebraic closure of K, that is, the number of distinct roots is equal to the degree of the polynomial. This concept is closely related to square-free polynomial. If K is a perfect field then the two concepts coincide. In general, P(X) is separable if and only if it is square-free over any field that contains K, which holds if and only if P(X) is coprime to its formal derivative D P(X).

E8 manifold

DISPLAYTITLE:E8 manifold In mathematics, the E8 manifold is the unique compact, simply connected topological 4-manifold with intersection form the E8 lattice. The manifold was discovered by Michael Freedman in 1982. Rokhlin's theorem shows that it has no smooth structure (as does Donaldson's theorem), and in fact, combined with the work of Andrew Casson on the Casson invariant, this shows that the manifold is not even triangulable as a simplicial complex.