Numerical Algorithms and High-Performance Computing - CADMOS Chair

Chair

Related publications (333)

Bifurcation and decay of solutions for a class of elliptic equations on R-N

Charles Stuart

We consider a class of nonlinear eigenvalue problems including equations such as −Δu(x) + q(x)u(x) + γ u(x)2 ξ(x)2 + u(x)2 u = λu(x) for x ∈ R , where γ > 0, q ∈ L∞(RN ) and ξ ∈ L2(RN ) are given and we are interested in eigenvalues λ ∈ R for which this eq ...

American Mathematical Society, P.O. Box 6248 Ms. Phoebe Murdock, Providence, Ri 02940 Usa2011

Divisibility in Grassmann algebra

Bernard Dacorogna, Olivier Kneuss

Given a k-form f and an l-form g with 0

2011

On the computation of structured singular values and pseudospectra

Daniel Kressner, Effrosyni Kokiopoulou

Structured singular values and pseudospectra play an important role in assessing the properties of a linear system under structured perturbations. This paper discusses computational aspects of structured pseudospectra for structures that admit an eigenvalu ...

2010

A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data

Fabio Nobile

We investigate the convergence rate of approximations by finite sums of rank-1 tensors of solutions of multiparametric elliptic PDEs. Such PDEs arise, for example, in the parametric, deterministic reformulation of elliptic PDEs with random field inputs, ba ...

Society for Industrial and Applied Mathematics2010

Reduction to Condensed Forms for Symmetric Eigenvalue Problems on Multi-core Architectures

Daniel Kressner

We investigate the performance of the routines in LAPACK and the Successive Band Reduction (SBR) toolbox for the reduction of a dense matrix to tridiagonal form, a crucial preprocessing stage in the solution of the symmetric eigenvalue problem, on general- ...

Springer, New York2010

Polar Codes: Characterization of Exponent, Bounds, and Constructions

Rüdiger Urbanke, Satish Babu Korada, Eren Sasoglu

Polar codes were recently introduced by Arikan. They achieve the capacity of arbitrary symmetric binary-input discrete memoryless channels under a low complexity successive cancellation decoding strategy. The original polar code construction is closely rel ...

2010

Constructing and decoding GWBE codes using Kronecker products

Mohammadjavad Faraji, Pedram Pad

In this letter, we introduce a novel method for constructing large size generalized Welch bound equality (GWBE) matrices. This method can also be used for the construction of large WBE matrices. The advantage of this method is its low complexity for constr ...

Institute of Electrical and Electronics Engineers2010

Study of Jacobian Normalization for VTLN

Philip Neil Garner, John David Scott Dines, Lakshmi Babu Saheer

The divergence of the theory and practice of vocal tract length normalization (VTLN) is addressed, with particular emphasis on the role of the Jacobian determinant. VTLN is placed in a Bayesian setting, which brings in the concept of a prior on the warping ...

Idiap2010

A novel variant of the parallel QR algorithm for solving dense nonsymmetric eigenvalue problems on hybrid distributed high performance computing systems is presented. For this purpose, we introduce the concept of multiwindow bulge chain chasing and paralle ...

2010

The aim of this work is to understand the decomposition, in irreducible modules, of tensor products of Weil modules for Sp2n(3). To do this, we begin by computing the Weil modules for Sp4(3), Sp6(3) and Sp8(3) in order to understand how tensor products dec ...

2010