Concept

Numératie

Publications associées (180)

A heuristic for nonlinear global optimization

Michel Bierlaire, Michaël Clément Louis Ghislain Thémans, Nicolas Zufferey

We propose a new heuristic for nonlinear global optimization combining a variable neighborhood search framework with a modified trust-region algorithm as local search. The proposed method presents the capability to prematurely interrupt the local search if ...

2007

A Numerical Sufficiency Test for the Asymptotic Stability of Linear Time-Varying Systems

Dominique Bonvin, Philippe Müllhaupt, Davide Buccieri

A numerical sufficiency test for the asymptotic stability of linear time-varying Hurwitz systems is proposed. The algorithmic procedure constructs a bounding tube in which the state is guaranteed to stay. The continuous-time system is evaluated at discrete ...

2007

A Fast Iterative Thresholding Algorithm for Wavelet-Regularized Deconvolution

Michaël Unser, Cédric René Jean Vonesch

We present an iterative deconvolution algorithm that minimizes a functional with a non-quadratic wavelet-domain regularization term. Our approach is to introduce subband-dependent parameters into the bound optimization framework of Daubechies et al.; it is ...

SPIE2007

Elasto-viscoplastic modeling of flexible pavement

André-Gilles Dumont

This communication concerns analysis of the behavior of flexible pavements using an elastic-viscoplastic constitutive relation for the asphalt concrete. The numerical model takes into consideration the influence of the temperature on the behavior of the as ...

2007

Deflation in Krylov subspace methods and distance to uncontrollability

Daniel Kressner

The task of extracting from a Krylov decomposition the approximation to an eigenpair that yields the smallest backward error can be phrased as finding the smallest perturbation which makes an associated matrix pair uncontrollable. Exploiting this relations ...

2007

Developments in overlapping Schwarz preconditioning of high-order nodal discontinuous Galerkin discretizations

Jan Sickmann Hesthaven

A preconditioned two-level overlapping Schwarz method for solving unstructured nodal discontinuous Galerkin discretizations of the indefinite Helmholtz problem is studied. We employ triangles in two dimensions and in a local discontinuous Galerkin (LDG) va ...

Springer2007

Large-eddy simulation of plant canopy flows using plant-scale representation

Marc Parlange, Charles Vivant Ignacio Meneveau

Turbulent flow in a corn canopy is simulated using large-eddy simulation (LES) with a Lagrangian dynamic Smagorinsky model. A new numerical representation of plant canopies is presented that resolves approximately the local structure of plants and takes in ...

2007

Non-linear PML equations for time dependent electromagnetics in three dimensions

Jan Sickmann Hesthaven

In this paper we present a new set of non-linear PML equations for the multi-dimensional Maxwell's equation and show that they are strongly well posed and temporally stable. Numerical examples demonstrate the validity of the new method. ...

SPRINGER/PLENUM PUBLISHERS2006

Block algorithms for reordering standard and generalized Schur forms

Daniel Kressner

Block algorithms for reordering a selected set of eigenvalues in a standard or generalized Schur form are proposed. Efficiency is achieved by delaying orthogonal transformations and (optionally) making use of level 3 BLAS operations. Numerical experiments ...

Association for Computing Machinery2006

Dealing with singularities in nonlinear unconstrained optimization

Michel Bierlaire, Michaël Clément Louis Ghislain Thémans

We propose new trust-region based optimization algorithms for solving unconstrained nonlinear problems whose second derivatives matrix is singular at a local solution. We give a theoretical characterization of the singularity in this context and we propose ...

2006

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