Publications related to MATHICSE Technical Report : Quasi-Toeplitz matrix arithmetic : a Matlab toolbox

Soft optical composites for tunable transmittance

Pedro Miguel Nunes Pereira de Almeida Reis, Sanjeev Kumar

We introduce a soft composite that is actuated mechanically to achieve switchable and tunable optical transmittance. Our design comprises a series of parallel opaque platelets embedded into an optically clear silicone-based elastomer matrix. Under an appli ...

2016

Parallel algorithms for tensor completion in the CP format

Daniel Kressner, André Uschmajew

Low-rank tensor completion addresses the task of filling in missing entries in multidimensional data. It has proven its versatility in numerous applications, including context aware recommender systems and multivariate function learning. To handle large-sc ...

Elsevier Science Bv2016

Assessment Of The Dispersion Quality Of Refractive Index-Matched Nanodispersions

Véronique Michaud

Dispersion quality has a large influence on the resulting properties of filled polymers, hybrids and nanocomposites in general. Reducing the van der Waals forces and therefore, matching the refractive index between the filler and the matrix should improve ...

Kerschensteiner Verlag Gmbh2016

Representer Theorems for Sparsity-Promoting $ ℓ _{ 1 } $ Regularization

Michaël Unser, Julien René Pierre Fageot, Harshit Gupta

We present a theoretical analysis and comparison of the effect of

ℓ _{ 1 }

versus

ℓ _{ 2 }

regularization for the resolution of ill-posed linear inverse and/or compressed sensing problems. Our formulation covers the most general setting where the s ...

IEEE2016

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

On Convergence Of The Maximum Block Improvement Method

André Uschmajew

The MBI (maximum block improvement) method is a greedy approach to solving optimization problems where the decision variables can be grouped into a finite number of blocks. Assuming that optimizing over one block of variables while fixing all others is rel ...

Siam Publications2015

Evaluating functions of positive-definite matrices using colored-noise thermostats

Michele Ceriotti, Michele Parrinello

Many applications in computational science require computing the elements of a function of a large matrix. A commonly used approach is based on the the evaluation of the eigenvalue decomposition, a task that, in general, involves a computing time that scal ...

Amer Physical Soc2014

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

Bilinear Generalized Approximate Message Passing—Part I: Derivation

Volkan Cevher

In this paper, we extend the generalized approximate message passing (G-AMP) approach, originally proposed for high-dimensional generalized-linear regression in the context of compressive sensing, to the generalized-bilinear case, which enables its applica ...

Institute of Electrical and Electronics Engineers2014

Approximate Matrix Multiplication with Application to Linear Embeddings

Michail Vlachos, Anastasios Kyrillidis

In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as the ratio of th ...

Ieee2014

MATHICSE Technical Report : Quasi-Toeplitz matrix arithmetic : a Matlab toolbox

Graph Chatbot

Chat with Graph Search

Soft optical composites for tunable transmittance

Parallel algorithms for tensor completion in the CP format

Assessment Of The Dispersion Quality Of Refractive Index-Matched Nanodispersions

Representer Theorems for Sparsity-Promoting $ ℓ _{ 1 } $ Regularization

Converse Bounds for Noisy Group Testing with Arbitrary Measurement Matrices

On Convergence Of The Maximum Block Improvement Method

Evaluating functions of positive-definite matrices using colored-noise thermostats

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

Bilinear Generalized Approximate Message Passing—Part I: Derivation

Approximate Matrix Multiplication with Application to Linear Embeddings

Representer Theorems for Sparsity-Promoting $ ℓ _{ 1 } $ Regularization

Parallel algorithms for tensor completion in the CP format

Soft optical composites for tunable transmittance

Assessment Of The Dispersion Quality Of Refractive Index-Matched Nanodispersions

On Convergence Of The Maximum Block Improvement Method

Converse Bounds for Noisy Group Testing with Arbitrary Measurement Matrices

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

Evaluating functions of positive-definite matrices using colored-noise thermostats

Bilinear Generalized Approximate Message Passing—Part I: Derivation

Approximate Matrix Multiplication with Application to Linear Embeddings