Numerical methods and models relevant to transportation applications

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.

We study continuous-domain linear inverse problems that involve a general data-fidelity term and a regularisation term. We consider a regularisation that is formed by the sparsity-promoting total-variation norm, pre-composed with a differential operator th ...

As one of the major threats to women's health worldwide, breast cancer requires early diagnosis and accurate classification, since they are key to optimizing therapeutic interventions and ensuring precise prognosis. Recently, deep learning has demonstrated ...

Increasing the scanning speed in Atomic Force Microscopy (AFM) relies on improving the tracking performance in the vertical direction of motion. The lightly damped resonances of piezo-actuators utilized in AFM nano-positioning stages hinder the maximum ach ...

Deep neural networks (DNNs) are receiving increasing attention in wind power forecasting due to their ability to effectively capture complex patterns in wind data. However, their forecast errors are severely limited by the local optimal weight issue in opt ...

A triple power series expansion for mutual inductance of two coaxial thick coils with rectangular cross section is obtained. Previously developed calculation methods consist of either semi-analytical methods containing numerical calculations or exact expre ...

We present a simple and versatile approach to test the accuracy of scattering calculations. Based on the Lorentz reciprocity relation, this criterion can be used for any scattering object, especially where a reference solution (e.g. from Mie theory) does n ...

For any 𝜀 > 0, we prove that 𝑘-Dimensional Matching is hard to approximate within a factor of 𝑘/(12+𝜀) for large 𝑘 unless NP ⊆ BPP. Listed in Karp’s 21 NP-complete problems, 𝑘-Dimensional Matching is a benchmark computational complexity problem which we fi ...

In this article, we focus on the parallel communication cost of multiplying the same vector along two modes of a 3-dimensional symmetric tensor. This is a key computation in the higher-order power method for determining eigenpairs of a 3-dimensional symmet ...

In less than a century, electronic computers have become essential to everyday life and have transformed scientific research. Their use in solving scientific problems has integrated theoretical and experimental approaches, often blurring the lines between ...

Literature on linear induction motors (LIMs) has proposed several approaches to model the behavior of such devices for different applications. In terms of accuracy and fidelity, field analysis-based models are the most relevant. Closed-form or numerical so ...

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

For a high-dimensional problem, a randomized Gram-Schmidt (RGS) algorithm is beneficial in terms of both computational cost and numerical stability. We apply this dimension reduction technique by random sketching to Krylov subspace methods, e.g., to the ge ...

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. We establish communication lower bounds that determine ...

We present a combination technique based on mixed differences of both spatial approximations and quadrature formulae for the stochastic variables to solve efficiently a class of optimal control problems (OCPs) constrained by random partial differential equ ...

Sample efficiency is a fundamental challenge in de novo molecular design. Ideally, molecular generative models should learn to satisfy a desired objective under minimal calls to oracles (computational property predictors). This problem becomes more apparen ...

The goal of this work is to use anisotropic adaptive finite elements for the numerical simulation of aluminium electrolysis. The anisotropic adaptive criteria are based on a posteriori error estimates derived for simplified problems. First, we consider an ...

In algorithms for solving optimization problems constrained to a smooth manifold, retractions are a well-established tool to ensure that the iterates stay on the manifold. More recently, it has been demonstrated that retractions are a useful concept for ot ...

This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...

We develop new tools to study landscapes in nonconvex optimization. Given one optimization problem, we pair it with another by smoothly parametrizing the domain. This is either for practical purposes (e.g., to use smooth optimization algorithms with good g ...

Time-domain solutions of Maxwell’s equations in homogeneous and isotropic media are paramount to studying transient or broadband phenomena. However, analytical solutions are generally unavailable for practical applications, while numerical solutions are co ...

Numerical methods and models relevant to transportation applications

Chat with Graph Search

Convergence analysis of the discretization of continuous-domain inverse problems

Mspo: a Machine Learning Hyperparameter Optimization Method for Enhanced Breast Cancer Image Classification

Data-driven control in atomic force microscopy using a genetic algorithm

Improving the accuracy and interpretability of neural networks for wind power forecasting

Calculation of mutual inductance of two coaxial thick coils with rectangular cross section by using cylindrical multipole expansion

Testing the accuracy and convergence of scattering calculations using Lorentz reciprocity

Asymptotically Optimal Hardness for 𝑘-Set Packing and 𝑘-Matroid Intersection

Brief Announcement: Minimizing Communication for Parallel Symmetric Tensor Times Same Vector Computation

Simulating Interacting Quantum Systems with Near-Term Quantum Computers

Pseudo-Three-Dimensional Analytical Model of Linear Induction Motors for High-Speed Applications

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Randomized flexible GMRES with deflated restarting

COMMUNICATION LOWER BOUNDS AND OPTIMAL ALGORITHMS FOR MULTIPLE TENSOR-TIMES-MATRIX COMPUTATION

A Combination Technique for Optimal Control Problems Constrained by Random PDEs

Augmented Memory: Sample-Efficient Generative Molecular Design with Reinforcement Learning

Adaptive Finite Elements with Large Aspect Ratio. Application to Aluminium Electrolysis

From low-rank retractions to dynamical low-rank approximation and back

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

The effect of smooth parametrizations on nonconvex optimization landscapes

The time-domain Cartesian multipole expansion of electromagnetic fields