Publications associées à Efficient multiplication using type $2$ optimal normal bases

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

Faster ECC over $\mathbb{F}_{2^{521}-1}$

Robert Granger

In this paper we present a new multiplication algorithm for residues modulo the Mersenne prime

2^{521}−1

. Using this approach, on an Intel Haswell Core i7-4770, constant-time variable-base scalar multiplication on NIST’s (and SECG’s) curve P-521 requires ...

Springer Berlin Heidelberg2015

Efficient matrix computation for tensor-product isogeometric analysis: the use of sum factorization

Annalisa Buffa, Pablo Antolin Sanchez, Maurizio Martinelli

In this paper we discuss the use of the sum-factorization for the calculation of the integrals arising in Galerkin isogeometric analysis. While introducing very little change in an isogeometric code based on element-by-element quadrature and assembling, th ...

2015

Purkinje Images: Conveying Different Content for Different Luminance Adaptations in a Single Image

Mahmut Sami Arpa

Providing multiple meanings in a single piece of art has always been intriguing to both artists and observers. We present Purkinje images, which have different interpretations depending on the luminance adaptation of the observer. Finding such images is an ...

Wiley-Blackwell2015

The computational structure of environmental life cycle costing

Vincent Moreau

Existing computational methods for life cycle costing (LCC) are few and appeared inconsistent with the very definition of LCC. This article improves the common matrix-based approach in life cycle assessment as applied to LCC, correcting previous errors. Re ...

Springer Heidelberg2015

Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis

Daniel Kressner

Novel memory-efficient Arnoldi algorithms for solving matrix polynomial eigenvalue problems are presented. More specifically, we consider the case of matrix polynomials expressed in the Chebyshev basis, which is often numerically more appropriate than the ...

Wiley-Blackwell2014

LINVIEW: Incremental View Maintenance for Complex Analytical Queries

Christoph Koch, Milos Nikolic, Mohamed Elsayed Mohamed Ahmed El Seidy

Many analytics tasks and machine learning problems can be naturally expressed by iterative linear algebra programs. In this paper, we study the incremental view maintenance problem for such complex analytical queries. We develop a framework, called LINVIEW ...

2014

Continuous Decompositions and Coalescing Eigenvalues for Matrices Depending on Parameters

Alessandro Spadoni

This contribution is a summary of four lectures delivered by the first author at the CIME Summer school in June 2011 at Cetraro (Italy). Preparation of those lectures was greatly aided by the other authors of these lecture notes. Our goal is to present som ...

Springer Int Publishing Ag2014

Generalised Mersenne Numbers Revisited

Robert Granger

Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus making them an attrac ...

2013

Computation of connection coefficients and measure modifications for orthogonal polynomials

Jan Sickmann Hesthaven

We observe that polynomial measure modifications for families of univariate orthogonal polynomials imply sparse connection coefficient relations. We therefore propose connecting L (2) expansion coefficients between a polynomial family and a modified family ...

Springer Verlag2012

Efficient multiplication using type $2$ optimal normal bases

Graph Chatbot

Chattez avec Graph Search

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

Faster ECC over $\mathbb{F}_{2^{521}-1}$

Efficient matrix computation for tensor-product isogeometric analysis: the use of sum factorization

Purkinje Images: Conveying Different Content for Different Luminance Adaptations in a Single Image

The computational structure of environmental life cycle costing

Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis

LINVIEW: Incremental View Maintenance for Complex Analytical Queries

Continuous Decompositions and Coalescing Eigenvalues for Matrices Depending on Parameters

Generalised Mersenne Numbers Revisited

Computation of connection coefficients and measure modifications for orthogonal polynomials

Purkinje Images: Conveying Different Content for Different Luminance Adaptations in a Single Image

Faster ECC over $\mathbb{F}_{2^{521}-1}$

The computational structure of environmental life cycle costing

Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis

LINVIEW: Incremental View Maintenance for Complex Analytical Queries

Continuous Decompositions and Coalescing Eigenvalues for Matrices Depending on Parameters

Efficient matrix computation for tensor-product isogeometric analysis: the use of sum factorization

Generalised Mersenne Numbers Revisited

Computation of connection coefficients and measure modifications for orthogonal polynomials

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