Publication

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

Publications associées (33)

Volumetric untrimming: Precise decomposition of trimmed trivariates into tensor products

3D objects, modeled using Computer Aided Geometric Design (CAGD) tools, are traditionally represented using a boundary representation (B-rep), and typically use spline functions to parameterize these boundary surfaces. However, recent development in physic ...

2019

Tensor product of correspondence functors

Jacques Thévenaz, Serge Bouc

As part of the study of correspondence functors, the present paper investigates their tensor product and proves some of its main properties. In particular, the correspondence functor associated to a finite lattice has the structure of a commutative algebra ...

2018

MATHICSE Technical Report : Modelling spatially dependent functional data via regression with differential regularization

Fabio Nobile, Eleonora Arnone

We propose a method for modelling spatially dependent functional data, based on regression with differential regularization. The regularizing term enables to include problem-specific information about the spatio-temporal variation of phenomenon under study ...

MATHICSE2018

L-2-Betti Numbers Of Rigid C*-Tensor Categories And Discrete Quantum Groups

Sven Raum

We compute the L-2-Betti numbers of the free C*-tensor categories, which are the representation categories of the universal unitary quantum groups A(u)(F). We show that the L-2-Betti numbers of the dual of a compact quantum group G are equal to the L-2-Bet ...

Mathematical Science Publ2017

Preconditioned Low-Rank Riemannian Optimization For Linear Systems With Tensor Product Structure

Daniel Kressner, Michael Maximilian Steinlechner

The numerical solution of partial differential equations on high-dimensional domains gives rise to computationally challenging linear systems. When using standard discretization techniques, the size of the linear system grows exponentially with the number ...

Siam Publications2016

MATHICSE Technical Report : Preconditioned low-rank Riemannian optimization for linear systems with tensor product structure

Daniel Kressner, Michael Maximilian Steinlechner

MATHICSE2015

An Error Analysis Of Galerkin Projection Methods For Linear Systems With Tensor Product Structure

Daniel Kressner, Christine Tobler

Recent results on the convergence of a Galerkin projection method for the Sylvester equation are extended to more general linear systems with tensor product structure. In the Hermitian positive definite case, explicit convergence bounds are derived for Gal ...

Society for Industrial and Applied Mathematics2013

The Chu Construction For Complete Atomistic Coatomistic Lattices

Gavin Jay Seal, Boris Ischi

The Chu construction is used to define a *-autonomous structure on a category of complete atomistic coatomistic lattices. This construction leads to a new tensor product that is compared with a certain number of other existing tensor products. ...

Univ Houston2013

Modeling Magma Dynamics with a Mixed Fourier Collocation - Discontinuous Galerkin Method

Jan Sickmann Hesthaven

A high-order discretization consisting of a tensor product of the Fourier collocation and discontinuous Galerkin methods is presented for numerical modeling of magma dynamics. The physical model is an advection-reaction type system consisting of two hyperb ...

GLOBAL SCIENCE PRESS2011

Stochastic spectral Galerkin and collocation methods for PDEs with random coefficients: a numerical comparison

Fabio Nobile, Lorenzo Tamellini

Much attention has recently been devoted to the development of Stochastic Galerkin (SG) and Stochastic Collocation (SC) methods for uncertainty quantification. An open and relevant research topic is the comparison of these two methods. By introducing a sui ...

Springer2011

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search