Efficient matrix computation for tensor-product isogeometric analysis: the use of sum factorization
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
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 ...
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 ...
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 ...
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
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 ...
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 ...
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 ...
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. ...
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 ...
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 ...
