Numerical Algorithms and High-Performance Computing - CADMOS Chair

Chair

Related publications (333)

Fast recovery and approximation of hidden Cauchy structure

Robert Gerhard Jérôme Luce

We derive an algorithm of optimal complexity which determines whether a given matrix is a Cauchy matrix, and which exactly recovers the Cauchy points defining a Cauchy matrix from the matrix entries. Moreover, we study how to approximate a given matrix by ...

Elsevier Science Inc2016

MATHICSE Technical Report : Perturbation of higher-order singular values

Daniel Kressner, André Uschmajew

The higher-order singular values for a tensor of order d are defined as the singular values of the d different matricizations associated with the multilinear rank. When d≥3, the singular values are generally different for different matricizations but not c ...

MATHICSE2016

Bifurcation points of a singular boundary-value problem on (0,1)

Charles Stuart

Following earlier work on some special cases [17,11] and on the analogous problem in higher dimensions [10,20], we make a more thorough investigation of the bifurcation points for a nonlinear boundary value problem of the form -{A(x)u' (x)}'.= f (lambda, x ...

Academic Press Inc Elsevier Science2016

Stochastic models for interacting processes feature a dimensionality that grows exponentially with the number of processes. This state space explosion severely impairs the use of standard methods for the numerical analysis of such Markov chains. In this wo ...

Springer Int Publishing Ag2016

We numerically study the resistive method for the numerical approximation of elliptic PDEs. In particular we focus on the resistive method for weakly setting solution values in specific subdomains or interfaces in the domain. ...

2016

Converse Bounds for Noisy Group Testing with Arbitrary Measurement Matrices

Volkan Cevher, Jonathan Mark Scarlett

We consider the group testing problem, in which one seeks to identify a subset of defective items within a larger set of items based on a number of noisy tests. While matching achievability and converse bounds are known in several cases of interest for i.i ...

Ieee2016

Bi-Jacobi fields are generalized Jacobi fields, and are used to efficiently compute approximations to Riemannian cubic splines in a Riemannian manifold M. Calculating bi-Jacobi fields is straightforward when M is a symmetric space such as bi-invariant SO(3 ...

Int Press Boston, Inc2016

MATHICSE Technical Report : Multigrid methods combined with low-rank approximation for tensor structured Markov chains

Daniel Kressner, Francisco Santos Paredes Quartin de Macedo

Markov chains that describe interacting subsystems suffer, on the one hand, from state space explosion but lead, on the other hand, to highly structured matrices. In this work, we propose a novel tensor-based algorithm to address such tensor structured Mar ...

MATHICSE2016

Integrated Improved Performance with Negative Triangularity

Olivier Sauter

Integrated Improved Performance with Negative Triangularity ...

2016

Notions of affinity in calculus of variations with differential forms

Saugata Bandyopadhyay, Swarnendu Sil

Ext-int. one affine functions are functions affine in the direction of one-divisible exterior forms with respect to the exterior product in one variable and with respect to the interior product in the other. The purpose of this article is to prove a charac ...

Walter De Gruyter Gmbh2016