Zobrazeno 1 - 10
of 113
pro vyhledávání: '"Luca Dieci"'
Publikováno v:
SIAM Journal on Scientific Computing. 44:A2918-A2943
In this paper, we propose a numerical method to solve the classic $L^2$-optimal transport problem. Our algorithm is based on use of multiple shooting, in combination with a continuation procedure, to solve the boundary value problem associated to the
Autor:
Luca Dieci, Cinzia Elia
Publikováno v:
Automatica. 152:110939
Publikováno v:
Mathematics of Computation.
We study discretizations of Hamiltonian systems on the probability density manifold equipped with the L 2 L^2 -Wasserstein metric. Based on discrete optimal transport theory, several Hamiltonian systems on a graph (lattice) with different weights are
Autor:
Luca Dieci
Publikováno v:
Applied Numerical Mathematics. 155:3-15
In this work we show that numerical integration during sliding motion, for piecewise-smooth systems, can be performed without the need to project the approximate solutions on the constraints' surface. We give a general algorithm, an order of approxim
Publikováno v:
Numerical Algorithms. 85:145-169
In this work, we present a method to explore the landscape of a smooth potential in the search of global minimizers, combining a double-descent technique and a basin-escaping technique based on intermittent colored diffusion. Numerical results illust
Autor:
Luca Dieci, Joseph D. Walsh
Publikováno v:
Statistical Analysis and Data Mining: The ASA Data Science Journal. 12:514-533
In this work we consider the Takagi factorization of a matrix valued function depending on parameters. We give smoothness and genericity results and pay particular attention to the concerns caused by having either a singular value equal to $0$ or mul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6f485d988662a14b4e525333d49d576d
http://arxiv.org/abs/2110.15918
http://arxiv.org/abs/2110.15918
Autor:
Joseph D. Walsh, Luca Dieci
Publikováno v:
Journal of Computational and Applied Mathematics. 353:318-344
We introduce a new technique, which we call the boundary method, for solving semi-discrete optimal transport problems with a wide range of cost functions. The boundary method reduces the effective dimension of the problem, thus improving complexity.
Autor:
Robert D. Russell, Luca Dieci
Algorithms for computing invariant subspaces are interpreted using a general framework based upon the fact that the invariant subspace problem is equivalent to solving a system of nonlinear decoupling equations. Computing an invariant subspace relati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e98dc57847e72fb0f19d7c4609d28ba6
https://doi.org/10.1201/9781003072584-29
https://doi.org/10.1201/9781003072584-29
Publikováno v:
Numerical Algorithms. 80:1241-1266
In this work, we develop and implement new numerical methods to locate generic degeneracies (i.e., isolated parameters’ values where the eigenvalues coalesce) of banded matrix valued functions. More precisely, our specific interest is in two classe