SearcharxivSearch

arXiv subjects

Pablo Pedregal

Publications and source records attributed to Pablo Pedregal.

At least 19 recordsLinked to original sources

Optimal history encoding for elastic-plastic hereditary laws: Sharp input and constitutive approximation

We formulate rate-independent elastic-ideally-plastic response directly in hereditary form and study its approximation by finite history surrogates. At the material-point level, the constitutive law is the vector play operator generated by metric projection onto a closed convex elastic domain in stress space. Starting from the closest-point return mapping for step inputs, we pass to absolutely continuous driving histories, for which the constitutive law admits a differential form: the stress remains in the elastic domain and the difference of rates belongs almost everywhere to the normal cone. In this $W^{1,1}$ setting, the hereditary law is causal, contracts variation, and satisfies a $BV$-to-$L^\infty$ stability estimate. We then approximate histories by right-continuous step surrogates with at most $N$ constant pieces. For absolutely continuous inputs, we prove a sharp minimax theorem for input approximation in $L^\infty$, normalized by the $BV$ norm: the optimal encoder is given by equal-variation sampling. For constitutive approximation, the correct vector-valued minimax statement is obtained by allowing the encoder to be material-law aware: it may compress the exact stress history $\mathcal P(\pi)$ rather than only the driving history $\pi$. The resulting stress-aware encoder, followed by the same discrete hereditary decoder, gives the sharp value $(2N)^{-1}$ under the natural nondegeneracy assumption $0\in\operatorname{int}C$. The scalar complementary-variable case is also recorded: there the input equal-variation encoder is sharp because the scalar stop/play operator is $L^\infty$-nonexpansive in the complementary variable. The results identify cumulative variation as the natural variable for sampling and compressing both driving and constitutive histories.

math.NA

Conjugate harmonic functions in 3D with respect to a unitary gradient

We propose to relax the classic Cauchy-Riemann equations for a mapping. We support the interest of such a proposal by looking at one specific situation in 3D, and proving the existence of pairs of harmonic conjugate functions with respect to a unitary gradient as the title of this contribution conveys. We further investigate the relationship between boundary conditions for such pairs, the importance of the unitary constraint, and the eventual link of these ideas to Calder\'on's problem in 3D.

math.AP

Beyond Peano's theorem: a variational look at discontinuous ODE systems

We propose a framework to define solutions of ODE systems under a novel condition that goes well beyond the usual continuity condition required in the classical theory of ODEs (Peano's or Picard's theorems). We illustrate our results with some simple but enlightening examples, including some facts about Sobolev fields, and mention some relevant questions to proceed with this analysis further.

math.CA

Invariant Hulls and Geometric Variational Principles

We investigate functionals defined on manifolds through parameterizations. If they are to be meaningful, from a geometrical viewpoint, they ought to be invariant under reparameterizations. Standard, local, integral functionals with this invariance property are well-known. We would like to focus though on the passage from a given arbitrary functional to its invariant realization or invariant hull through the use of inner-variations, much in the same way as with the convex or quasiconvex hulls of integrands in the vector Calculus of Variations. These two processes are, however, very different in nature. After examining some basic, interesting, general properties about the mutual relationship between a functional and its invariant realization, we deal with the one dimensional case to gain some initial familiarity with such a transformation and calculations, before proceeding to the higher dimensional situation. As one would anticipate, explicit computations in the latter are much harder to perform, if not impossible, as one is to work with vector variational problems. In particular, we are able to reach some modest conclusion about the volume functional of a piece of a manifold in the general $N$-dimensional situation, especially in the two-dimensional case $N=2$. Various problems and conjectures are stated along the way.

math.DG

Existence and relaxation for optimal control governed by steady, quasilinear PDEs

We focus on optimal control problems governed by elliptic, quasilinear PDEs. Though there are various examples of such problems in the literature, we make an attempt at describing some general principles by dealing with three basic situations. In the first one, we assume that the state equation is variational; the second one focuses on a non-variational, monotone operator as state equation; finally, we add a non-linear term off the divergence part of the equation. In the first two cases, existence of optimal solutions can be established under suitable sets of assumptions, while relaxation is required for the third situation. Concerning the cost functional, and though more general examples can be dealt with, we will take a typical case consisting of two terms: one depending on the state, and another one of the form of a typical Thychonov regularization.

math.OC

On a general variational framework for existence and uniqueness in Differential Equations

Starting from the classic contraction mapping principle, we establish a general, flexible, variational setting that turns out to be applicable to many situations of existence in Differential Equations. We show its potentiality with some selected examples including initial-value, Cauchy problems for ODEs; non-linear, monotone PDEs; linear and non-linear hyperbolic problems; and steady Navier-Stokes systems.

math.AP

On non-locality in the Calculus of Variations

Non-locality is being intensively studied in various PDE-contexts and in variational problems. The numerical approximation also looks challenging, as well as the application of these models to Continuum Mechanics and Image Analysis, among other areas. Even though there is a growing body of deep and fundamental knowledge about non-locality, for variational principles there are still very basic questions that have not been addressed so far. Taking some of these as a motivation, we describe a general perspective on distinct classes of non-local variational principles setting a program for the analysis of this kind of problems. We start such program with the simplest problem possible: that of scalar, uni-dimensional cases, under a particular class of non-locality. Even in this simple initial scenario, one finds quite unexpected facts to the point that our intuition about local, classic problems can no longer guide us for these new problems. There are three main issues worth highlighting, in the particular situation treated: $\bullet$ natural underlying spaces involve different non-local types of derivatives as, for instance, fractional Sobolev spaces; $\bullet$ no convexity of integrands is required for existence of minimizers; $\bullet$ optimality is formulated in terms of quite special integral equations rather than differential equations. We are thus able to provide some specific answers to the initial questions that motivated our investigation. In subsequent papers, we will move on to consider the higher dimensional situation driven by the possibility that no convexity or quasiconvexity might be involved in weak lower semicontinuity in a full vector, higher dimensional situation.

math.AP

A variational approach to Hilbert's 16th problem within the framework of global analysis

We focus on the second part of Hilbert's 16th problem and provide an upper bound on the number of limit cycles that a polynomial, differential, planar system may have, depending exclusively on the degree $n$ of the system. Such a bound turns out to be a polynomial of degree $4$ in $n$. More specifically, if $H(n)$ indicates the maximum number of limit cycles among planar, differential, polynomial systems of degree $n$, then \begin{gather} H(n)\le \dfrac52 n^4-\dfrac{23}2 n^3+ \dfrac{43}2n^2-\dfrac{37}2n+7\,\,\,\, \mbox{if $n$ is even, and} \nonumber H(n)\le \dfrac52 n^4-\dfrac{23}2 n^3+ \dfrac{41}2n^2-\dfrac{33}2n+6\,\,\,\, \mbox{if $n$ is odd}.\nonumber \end{gather} For quadratic systems, we find $H(2)=4$. Our proof is entirely variational and utilizes in a fundamental way tools and facts from global analysis to the point that no particular expertise in dynamical systems is necessary or required.

math.DS

Hilbert's 16th problem. II. Pfaffian equations and variational methods

Starting from a Pfaffian equation in dimension $N$ and focusing on compact solutions for it, we place in perspective the variational method used in [29] to solve Hilbert's 16th problem. In addition to exploring how this viewpoint can help in detecting and finding approximations for limit cycles of planar systems, we recall some of the initial important facts of the full program developed in [29] to motivate that the same proposal could eventually be used in other situations. In particular, we make some initial interesting calculations in dimension $N=3$ that lead to some similar initial conclusions as with the case $N=2$.

math.DS

Hilbert's 16th problem. I. When differential systems meet variational methods

We provide an upper bound for the number of limit cycles that planar polynomial differential systems of a given degree may have. The bound turns out to be a polynomial of degree four in the degree of the system. The strategy brings together variational and dynamical system techniques by transforming the task of counting limit cycles into counting critical points for a certain smooth, non-negative functional, through Morse inequalities, for which limit cycles are global minimizers. We thus solve the second part of Hilbert's 16th problem providing a uniform upper bound for the number of limit cycles which only depends on the degree of the polynomial differential system.

math.DS

Inverse quasiconvexification

In the context of the Calculus of Variations for non-convex, vector variational problems, the natural process of going from a function $ϕ$ to its quasiconvexification $Qϕ$ is quite involved, and, most of the time, an impossible task. We propose to look at the reverse process, what might be called inverse quasiconvexification: start from a function $ϕ_0$, and find functions $ϕ$ for which $ϕ_0=Qϕ$. In addition to establishing a few general principles, we show several explicit examples motivated by their application to inverse problems in conductivity.

math.OC

Morrey's conjecture: rank-one convexity implies quasi-convexity for two-dimensional, two-component maps

We prove that for two-component maps in dimension two, rank-one convexity is equivalent to quasiconvexity. The essential tool for the proof is a fixed-point argument for a suitable set-valued map going from one component to the other that preserves decomposition directions within the $(H_n)$-condition formalism. The existence of a fixed point ensures that, in addition to keeping decomposition directions, joint volume fractions are respected as well, leading to the fundamental fact that every two-dimensional, two-component gradient can be reached by lamination. When maps have more than two components, fixed points exist for every combination of two components, but they do not match in general. Higher dimension would require further insight on how to organize and deal with triangulations for piece-wise affine maps.

math.OC

Some evidence in favor of Morrey's conjecture

We provide further evidence to favor the fact that rank-one convexity does not imply quasiconvexity for two-component maps in dimension two. We provide an explicit family of maps parametrized by $τ$, and argue that, for small $τ$, they cannot be achievable by lamination. In this way, Morrey's conjecture might turn out to be correct in all cases.

math.OC

On a variant of Tykhonov regularization in optimal control under PDEs

We make some remarks on a variant of the classical Tikhonov regularization in optimal control under PDEs which allows for a certain flexibility in dealing with non-linearities and state restrictions, in the sense that differential constraints between control and state are eliminated and pairs can run freely in their respective sets of feasibility, at the expense of introducing an additional variable in a collection of approximated problems. In addition to exploring basic issues like existence and optimality, we also discuss a numerical procedure and apply it to some academic, illustrative numerical tests, as well as examine the convergence of solutions of this new family of approximated problems to the solutions of the underlying optimal control problem.

math.OC

Young-measure solutions for multidimensional systems of conservation laws

We explore Young measure solutions of systems of conservation laws through an alternative variational method that introduces a suitable, non-negative error functional to measure departure of feasible fields from being a weak solution. Young measure solutions are then understood as being generated by minimizing sequences for such functional much in the same way as in non-convex, vector variational problems. We establish an existence result for such generalized solutions based on an appropriate structural condition on the system. We finally discuss how the classic concept of a Young measure solution can be improved, and support our arguments by considering a scalar, single equation in dimension one.

math.AP

Optimal feedback control, linear first-order PDE systems, and obstacle problems

We introduce an alternative approach for the analysis and numerical approximation of the optimal feedback control mapping. It consists in looking at a typical optimal control problem in such a way that feasible controls are mappings depending both in time and space. In this way, the feedback form of the problem is built-in from the very beginning. Optimality conditions are derived for one such optimal mapping, which by construction is the optimal feedback mapping of the problem. In formulating optimality conditions, costates in feedback form are solutions of linear, first-order transport systems, while optimal descent directions are solutions of appropriate obstacle problems. We treat situations with no constraint-sets for control and state, as well as the more general case where a constraint-set is considered for the control variable. Constraints for the state variable are deferred to a coming contribution.

math.OC

A dynamical-system approach to mathematical programming

We explore how to build a vector field from the various functions involved in a given mathematical program, and show that locally-stable equilibria of the underlying dynamical system are precisely the local solutions of the optimization problem. The general situation in which explicit inequality constraints are present is especially interesting as the vector field has to be discontinuous, and so one is led to consider discontinuous dynamical systems and their equilibria.

math.OC