Concept

Cartesian product of graphs

Related publications (12)

Direct numerical simulation of phase change in the presence of non-condensable gases

This paper describes a new numerical method for the simulation of phase change phenomena between a liquid and a vapour in the presence of non-condensable gases. The method is based on an interface-tracking approach in the framework of single-fluid modellin ...

2020

Efficient second-order methods for model compression

Sidak Pal Singh

Second-order information, in the form of Hessian- or Inverse-Hessian-vector products, is a fundamental tool for solving optimization problems. Recently, there has been a tremendous amount of work on utilizing this information for the current compute and me ...

2020

Learning anisotropic filters on product graphs

Pascal Frossard, Clément Arthur Yvon Vignac

The extension of convolutional neural networks to irregular domains has pavedthe way to promising graph data analysis methods. It has however come at theexpense of a reduced representation power, as most of these new network archi-tectures can only learn i ...

2019

Stationary time-vertex signal processing

Nathanaël Perraudin, Andreas Loukas

This paper considers regression tasks involving high-dimensional multivariate processes whose structure is dependent on some known graph topology. We put forth a new definition of time-vertex wide-sense stationarity, or joint stationarity for short, that g ...

2019

A time-reversible integrator for the time-dependent Schrödinger equation on an adaptive grid

Jiri Vanicek, Seonghoon Choi

One of the most accurate methods for solving the time-dependent Schrödinger equation uses a combination of the dynamic Fourier method with the split-operator algorithm on a tensor-product grid. To reduce the number of required grid points, we let the grid ...

2019

Isogeny graphs of ordinary abelian varieties

Dimitar Petkov Jetchev, Benjamin Pierre Charles Wesolowski, Ernest Hunter Brooks

Fix a prime number l. Graphs of isogenies of degree a power of l are well-understood for elliptic curves, but not for higher-dimensional abelian varieties. We study the case of absolutely simple ordinary abelian varieties over a finite field. We analyse gr ...

Springer Heidelberg2017

Extensions of a result of Elekes and Rónyai

Frank de Zeeuw

Many problems in combinatorial geometry can be formulated in terms of curves or surfaces containing many points of a cartesian product. In 2000, Elekes and Rónyai proved that if the graph of a polynomial f(x, y) contains cn2 points of an n × n × n cartesia ...

Elsevier2013

A critical comparison of several numerical methods for computing effective properties of highly heterogeneous materials

Cyrille Dunant, Alain Benjamin Giorla

Modelling transport and long-term creep in concrete materials is a difficult problem when the complexity of the microstructure is taken into account, because it is hard to predict instantaneous elastic responses. In this work, several numerical methods are ...

Elsevier Sci Ltd2013

A second-order cut-cell method for the numerical simulation of 2D flows past obstacles

We present a new second-order method, based on the MAC scheme on cartesian grids, for the numerical simulation of two-dimensional incompressible flows past obstacles. In this approach, the solid boundary is embedded in the cartesian computational mesh. Dis ...

Pergamon-Elsevier Science Ltd2012

Implementation of optimal Galerkin and Collocation approximations of PDEs with Random Coefficients

Fabio Nobile, Lorenzo Tamellini

In this work we first focus on the Stochastic Galerkin approximation of the solution u of an elliptic stochastic PDE. We rely on sharp estimates for the decay of the coefficients of the spectral expansion of u on orthogonal polynomials to build a sequence ...

2011

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.