Publication

MATHICSE Technical Report : Fast computation of the matrix exponential for a Toeplitz matrix

Related publications (72)

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.

On the finite section method for computing exponentials of doubly-infinite skew-Hermitian matrices

Meiyue Shao

Computing the exponential of large-scale skew-Hermitian matrices or parts thereof is frequently required in applications. In this work, we consider the task of extracting finite diagonal blocks from a doubly-infinite skew-Hermitian matrix. These matrices u ...

Elsevier Science Inc2014

Anatomical Priors to improve Global Tractography

Jean-Philippe Thiran, Alessandro Daducci, Alia Lemkaddem

The main assumption of fiber-tracking algorithms is that fiber trajectories are represented by paths of highest diffusion, which is usually accomplished by following the principal diffusion directions in every voxel. The state-of-the-art approaches known a ...

2014

Protecting Circuits From Computationally Bounded And Noisy Leakage

Sebastian Faust

Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles any circuit into a circuit with the same functionality but resilience against well-defin ...

Siam Publications2014

Density approximations for multivariate affine jump-diffusion processes

Damir Filipovic

We introduce closed-form transition density expansions for multivariate affine jump-diffusion processes. The expansions rely on a general approximation theory which we develop in weighted Hilbert spaces for random variables which possess all polynomial mom ...

Elsevier2013

Interactive Function Computation

Michael Christoph Gastpar

We investigate the role of interaction for computa- tion problem settings where nodes intend to compute functions of the raw messages generated at other nodes. In this work, we make some progress on a more elementary research component: feedback. Specifica ...

2013

Analytical shape derivatives of the MFIE system matrix discretized with RWG functions

Juan Ramon Mosig

An analytical formula for the shape derivative of the magnetic field integral equation (MFIE) method of moments (MoM) system matrix (or impedance matrix) is derived and validated against finite difference formulas. The motivation for computing the shape de ...

Institute of Electrical and Electronics Engineers2013

Computation over Gaussian networks with orthogonal components

Michael Christoph Gastpar, Chien-Yi Wang

Function computation of arbitrarily correlated discrete sources over Gaussian networks with multiple access components but no broadcast is studied. Two classes of functions are considered: the arithmetic sum function and the frequency histogram function. T ...

2013

The Weakest Failure Detectors To Solve Quittable Consensus And Nonblocking Atomic Commit

Rachid Guerraoui

We define quittable consensus, a natural variation of the consensus problem, where processes have the option to agree on "quit" if failures occur, and we relate this problem to the well-known problem of nonblocking atomic commit. We then determine the weak ...

Society for Industrial and Applied Mathematics2012

Reduced Models for Optimal Control, Shape Optimization and Inverse Problems in Haemodynamics

Andrea Manzoni

The objective of this thesis is to develop reduced models for the numerical solution of optimal control, shape optimization and inverse problems. In all these cases suitable functionals of state variables have to be minimized. State variables are solutions ...

EPFL2012

A Distributed Algorithm for Computing the Node Search Number in Trees

Florian Huc

We present a distributed algorithm to compute the node search number in trees. This algorithm extends the centralized algorithm proposed by Ellis et al. (Inf. Comput. 113(1):50-79, 1994). It can be executed in an asynchronous environment, requires an overa ...

2012