Interpolation polynomiale

Science formelle
Mathématiques
Analyse (mathématiques)
Analyse numérique

Publications associées (32)

À propos
Confidentialité
Mentions légales

Graph Chatbot

Analysis of accretion disc structure and stability using open code for vertical structure

Pascale Jablonka

Detailed chemical abundances of very metal-poor (VMP; [Fe/H] < -2) stars are important for better understanding the first stars, early star formation, and chemical enrichment of galaxies. Big on-going and coming high-resolution spectroscopic surveys provid ...

OXFORD UNIV PRESS2023

Benign Overfitting in Deep Neural Networks under Lazy Training

Volkan Cevher, Grigorios Chrysos, Fanghui Liu, Zhenyu Zhu

This paper focuses on over-parameterized deep neural networks (DNNs) with ReLU activation functions and proves that when the data distribution is well-separated, DNNs can achieve Bayesoptimal test error for classification while obtaining (nearly) zero-trai ...

2023

Outlier-free spline spaces for isogeometric discretizations of biharmonic and polyharmonic eigenvalue problems

Espen Sande

We present outlier-free isogeometric Galerkin discretizations of eigenvalue problems related to the biharmonic and the polyharmonic operator in the univariate setting. These are Galerkin discretizations in certain spline subspaces that provide accurate app ...

Elsevier Science Sa2023

Non-intrusive data-driven reduced-order modeling for time-dependent parametrized problems

Jan Sickmann Hesthaven, Junming Duan

Reduced-order models are indispensable for multi-query or real-time problems. However, there are still many challenges to constructing efficient ROMs for time-dependent parametrized problems. Using a linear reduced space is inefficient for time-dependent n ...

Academic Press Inc Elsevier Science2023

A new variable shape parameter strategy for RBF approximation using neural networks

Jan Sickmann Hesthaven

The choice of the shape parameter highly effects the behaviour of radial basis function (RBF) approximations, as it needs to be selected to balance between the ill-conditioning of the interpolation matrix and high accuracy. In this paper, we demonstrate ho ...

PERGAMON-ELSEVIER SCIENCE LTD2023

Fourier non-uniqueness sets from totally real number fields

Martin Peter Stoller

Let K be a totally real number field of degree n >= 2. The inverse different of K gives rise to a lattice in Rn. We prove that the space of Schwartz Fourier eigenfunctions on R-n which vanish on the "component-wise square root" of this lattice, is infinite ...

EUROPEAN MATHEMATICAL SOC-EMS2022

Perturbed Fourier uniqueness and interpolation results in higher dimensions

Martin Peter Stoller, Joao Pedro Gonçalves Ramos

We obtain new Fourier interpolation and uniqueness results in all dimensions, extending methods and results by the first author and M. Sousa [11] and the second author [12]. We show that the only Schwartz function which, together with its Fourier transform ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

Application of optimal spline subspaces for the removal of spurious outliers in isogeometric discretizations

Espen Sande

We show that isogeometric Galerkin discretizations of eigenvalue problems related to the Laplace operator subject to any standard type of homogeneous boundary conditions have no outliers in certain optimal spline subspaces. Roughly speaking, these optimal ...

2022

Choreography Controlled (ChoCo) brain MRI artifact generation for labeled motion-corrupted datasets

Michel Kocher, François Lazeyras, Bastien Chopard, Sébastien Courvoisier, Julien Songeon

MRI is a non-invasive medical imaging modality that is sensitive to patient motion, which constitutes a major limitation in most clinical applications. Solutions may arise from the reduction of acquisition times or from motion-correction techniques, either ...

ELSEVIER SCI LTD2022

pyFFS: A Python Library for Fast Fourier Series Computation and Interpolation with GPU Acceleration

Martin Vetterli, Paul Hurley, Eric Bezzam, Sepand Kashani, Matthieu Martin Jean-André Simeoni

Fourier transforms are an often necessary component in many computational tasks, and can be computed efficiently through the fast Fourier transform (FFT) algorithm. However, many applications involve an underlying continuous signal, and a more natural choi ...

SIAM2022

Page 2 sur 4