Concept

Spline

Publications associées (32)

MATHICSE Technical Report: THU-Splines - Highly Localized Refinement on Smooth Unstructured Splines

We present a novel method named truncated hierarchical unstructured splines (THU-splines) that supports both local h-refinement and unstructured quadrilateral meshes. In a THU-spline construction, an unstructured quadrilateral mesh is taken as the input co ...

MATHICSE2021

A projected super-penalty method for the C1-coupling of multi-patch isogeometric Kirchhoff plates

Annalisa Buffa, Luca Coradello

This work focuses on the development of a super-penalty strategy based on the L2-projection of suitable coupling terms to achieve C1-continuity between non-conforming multi-patch isogeometric Kirchhoff plates. In particular, the choice of penalty parameter ...

2021

Improving parametric mass modelling of lensing clusters through a perturbative approach

Jean-Paul Richard Kneib, Benjamin Yvan Alexandre Clement, Benjamin Emmanuel Nicolas Beauchesne, Johan Richard

We present a new method to model the mass distribution of galaxy clusters that combines a parametric and a free-form approach to reconstruct cluster cores with strong lensing constraints. It aims at combining the advantages of both approaches, by keeping t ...

OXFORD UNIV PRESS2021

Convex optimization in sums of Banach spaces

Michaël Unser, Shayan Aziznejad

We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...

2021

Continuous-Domain Signal Reconstruction Using L-p-Norm Regularization

Michaël Unser, Pakshal Narendra Bohra

We focus on the generalized-interpolation problem. There, one reconstructs continuous-domain signals that honor discrete data constraints. This problem is infinite-dimensional and ill-posed. We make it well-posed by imposing that the solution balances data ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Isogeometric analysis with C1 hierarchical functions on planar two-patch geometries

Rafael Vazquez Hernandez

Adaptive isogeometric methods for the solution of partial diifferential equations rely on the construction of locally refinable spline spaces. A simple and efficient way to obtain these spaces is to apply the multi-level construction of hierarchical spline ...

2020

Support and approximation properties of Hermite splines

Michaël Unser, Julien René Pierre Fageot, Virginie Sophie Uhlmann, Shayan Aziznejad

In this paper, we formally investigate two mathematical aspects of Hermite splines that are relevant to practical applications. We first demonstrate that Hermite splines are maximally localized, in the sense that the size of their support is minimal among ...

2020

Generating Sparse Stochastic Processes Using Matched Splines

Michaël Unser, Leello Tadesse Dadi, Shayan Aziznejad

We provide an algorithm to generate trajectories of sparse stochastic processes that are solutions of linear ordinary differential equations driven by Levy white noises. A recent paper showed that these processes are limits in law of generalized compound-P ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Dictionary Learning for Two-Dimensional Kendall Shapes

Michaël Unser, Julien René Pierre Fageot, Virginie Sophie Uhlmann, Anna You-Lai Song

We propose a novel sparse dictionary learning method for planar shapes in the sense of Kendall, namely configurations of landmarks in the plane considered up to similitudes. Our shape dictionary method provides a good trade-off between algorithmic simplici ...

SIAM PUBLICATIONS2020

Random extrapolation for primal-dual coordinate descent

Volkan Cevher, Ahmet Alacaoglu

We introduce a randomly extrapolated primal-dual coordinate descent method that adapts to sparsity of the data matrix and the favorable structures of the objective function. Our method updates only a subset of primal and dual variables with sparse data, an ...

2020

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