Publications related to Interpolatory Rational Model Order Reduction of Parametric Problems Lacking Uniform Inf-Sup Stability

Related publications (32)

Combining physics-based and data-driven models: advancing the frontiers of research with scientific machine learning

Scientific Machine Learning (SciML) is a recently emerged research field which combines physics-based and data-driven models for the numerical approximation of differential problems. Physics-based models rely on the physical understanding of the problem at ...

2025

Inverse Applications of the Generalized Littlewood Theorem Concerning Integrals of the Logarithm of Analytic Functions

Serguei Sekatski

Recently, we established and used the generalized Littlewood theorem concerning contour integrals of the logarithm of analytical function to obtain new criteria equivalent to the Riemann hypothesis. The same theorem was subsequently applied to calculate ce ...

2024

Model order reduction based on functional rational approximants for parametric PDEs with meromorphic structure

Davide Pradovera

Many engineering fields rely on frequency-domain dynamical systems for the mathematical modeling of physical (electrical/mechanical/etc.) structures. With the growing need for more accurate and reliable results, the computational burden incurred by frequen ...

EPFL2021

K3 surfaces, cyclotomic polynomials and orthogonal groups

Eva Bayer Fluckiger

Let X be a complex projective K3 surface and let T-X be its transcendental lattice; the characteristic polynomials of isometries of T-X induced by automorphisms of X are powers of cyclotomic polynomials. Which powers of cyclotomic polynomials occur? The ai ...

Springer Int Publ Ag2024

Multigraded algebras and multigraded linear series

Leonid Monin

This paper is devoted to the study of multigraded algebras and multigraded linear series. For an Ns

\mathbb {N}s

-graded algebra A

A

, we define and study its volume function FA:N+s -> R

F_A:\mathbb {N}_+s\rightarrow \mathbb {R}

, which computes the ...

Wiley2024

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Lars Rohwedder

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. ...

ASSOC COMPUTING MACHINERY2021

A reflected forward-backward splitting method for monotone inclusions involving Lipschitzian operators

Volkan Cevher, Cong Bang Vu

In this paper, we propose a novel splitting method for finding a zero point of the sum of two monotone operators where one of them is Lipschizian. The weak convergence the method is proved in real Hilbert spaces. Applying the proposed method to composite m ...

2021

The multivariate Serre conjecture ring

Luc Guyot

It is well-known that for any integral domain R, the Serre conjecture ring R(X), i.e., the localization of the univariate polynomial ring R[X] at monic polynomials, is a Bezout domain of Krull dimension

Academic Press Inc Elsevier Science2023

Polynomial Evaluation on Superscalar Architecture, Applied to the Elementary Function e(x)

Felix Schürmann, Fabien Jonathan Delalondre, Francesco Cremonesi, Timothée Ewart

The evaluation of small degree polynomials is critical for the computation of elementary functions. It has been extensively studied and is well documented. In this article, we evaluate existing methods for polynomial evaluation on superscalar architecture. ...

2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

,

b \in \Z^m

,

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Approximation Algorithms for Allocation and Network Design

Etienne Michel François Bamas

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

EPFL2023

Symmetry and Invariant Bases in Finite Element Exterior Calculus

Martin Werner Licht

We study symmetries of bases and spanning sets in finite element exterior calculus, using representation theory. We want to know which vector-valued finite element spaces have bases invariant under permutation of vertex indices. The permutations of vertex ...

2023

Markov cubature rules for polynomial processes

Damir Filipovic, Martin Larsson, Sergio Andres Pulido Nino

We study discretizations of polynomial processes using finite state Markov processes satisfying suitable moment matching conditions. The states of these Markov processes together with their transition probabilities can be interpreted as Markov cubature rul ...

ELSEVIER2020

Dictionary Learning for Two-Dimensional Kendall Shapes

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

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

Positive Definite Completions and Continuous Graphical Models

Kartik Waghmare

This thesis concerns the theory of positive-definite completions and its mutually beneficial connections to the statistics of function-valued or continuously-indexed random processes, better known as functional data analysis. In particular, it dwells upon ...

EPFL2023

Fast Least-Squares Padé approximation of problems with normal operators and meromorphic structure

Fabio Nobile, Davide Pradovera, Francesca Bonizzoni

In this work, we consider the approximation of Hilbert space-valued meromorphic functions that arise as solution maps of parametric PDEs whose operator is the shift of an operator with normal and compact resolvent, e.g., the Helmholtz equation. In this res ...

2020

Multilevel weighted least squares polynomial approximation

Fabio Nobile

Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required to achieve quasi ...

2020

Distributed sampling for rational approximation of the acoustic scattering of an airfoil

Davide Pradovera, Francesca Bonizzoni

In this paper we compute a reduced order model for a time‐harmonic external acoustic scattering problem with parametric frequency. The employed technique is minimal rational interpolation, an explicit moment‐matching method for Hilbert space‐valued meromor ...

2019

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Damian Mateusz Straszak

Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...

EPFL2018

Optimal Rates for Spectral Algorithms with Least-Squares Regression over Hilbert Spaces

Volkan Cevher, Junhong Lin

In this paper, we study regression problems over a separable Hilbert space with the square loss, covering non-parametric regression over a reproducing kernel Hilbert space. We investigate a class of spectral/regularized algorithms, including ridge regressi ...

2020