Search results for "FOS: Mathematics"
showing 10 items of 1448 documents
Inverse problems and invisibility cloaking for FEM models and resistor networks
2013
In this paper we consider inverse problems for resistor networks and for models obtained via the finite element method (FEM) for the conductivity equation. These correspond to discrete versions of the inverse conductivity problem of Calderón. We characterize FEM models corresponding to a given triangulation of the domain that are equivalent to certain resistor networks, and apply the results to study nonuniqueness of the discrete inverse problem. It turns out that the degree of nonuniqueness for the discrete problem is larger than the one for the partial differential equation. We also study invisibility cloaking for FEM models, and show how an arbitrary body can be surrounded with a layer …
A fast Fourier transform based direct solver for the Helmholtz problem
2018
This article is devoted to the efficient numerical solution of the Helmholtz equation in a two‐ or three‐dimensional (2D or 3D) rectangular domain with an absorbing boundary condition (ABC). The Helmholtz problem is discretized by standard bilinear and trilinear finite elements on an orthogonal mesh yielding a separable system of linear equations. The main key to high performance is to employ the fast Fourier transform (FFT) within a fast direct solver to solve the large separable systems. The computational complexity of the proposed FFT‐based direct solver is O(N log N) operations. Numerical results for both 2D and 3D problems are presented confirming the efficiency of the method discussed…
Persistence in complex systems
2022
Persistence is an important characteristic of many complex systems in nature, related to how long the system remains at a certain state before changing to a different one. The study of complex systems' persistence involves different definitions and uses different techniques, depending on whether short-term or long-term persistence is considered. In this paper we discuss the most important definitions, concepts, methods, literature and latest results on persistence in complex systems. Firstly, the most used definitions of persistence in short-term and long-term cases are presented. The most relevant methods to characterize persistence are then discussed in both cases. A complete literature r…
Inverse problems for a fractional conductivity equation
2020
This paper shows global uniqueness in two inverse problems for a fractional conductivity equation: an unknown conductivity in a bounded domain is uniquely determined by measurements of solutions taken in arbitrary open, possibly disjoint subsets of the exterior. Both the cases of infinitely many measurements and a single measurement are addressed. The results are based on a reduction from the fractional conductivity equation to the fractional Schr\"odinger equation, and as such represent extensions of previous works. Moreover, a simple application is shown in which the fractional conductivity equation is put into relation with a long jump random walk with weights.
Fractional Maximal Functions in Metric Measure Spaces
2013
Abstract We study the mapping properties of fractional maximal operators in Sobolev and Campanato spaces in metric measure spaces. We show that, under certain restrictions on the underlying metric measure space, fractional maximal operators improve the Sobolev regularity of functions and map functions in Campanato spaces to Hölder continuous functions. We also give an example of a space where fractional maximal function of a Lipschitz function fails to be continuous.
Quasiconformal geometry and removable sets for conformal mappings
2020
We study metric spaces defined via a conformal weight, or more generally a measurable Finsler structure, on a domain $\Omega \subset \mathbb{R}^2$ that vanishes on a compact set $E \subset \Omega$ and satisfies mild assumptions. Our main question is to determine when such a space is quasiconformally equivalent to a planar domain. We give a characterization in terms of the notion of planar sets that are removable for conformal mappings. We also study the question of when a quasiconformal mapping can be factored as a 1-quasiconformal mapping precomposed with a bi-Lipschitz map.
Sobolev homeomorphic extensions onto John domains
2020
Given the planar unit disk as the source and a Jordan domain as the target, we study the problem of extending a given boundary homeomorphism as a Sobolev homeomorphism. For general targets, this Sobolev variant of the classical Jordan-Schoenflies theorem may admit no solution - it is possible to have a boundary homeomorphism which admits a continuous $W^{1,2}$-extension but not even a homeomorphic $W^{1,1}$-extension. We prove that if the target is assumed to be a John disk, then any boundary homeomorphism from the unit circle admits a Sobolev homeomorphic extension for all exponents $p<2$. John disks, being one sided quasidisks, are of fundamental importance in Geometric Function Theory.
Quasisymmetric extension on the real line
2015
We give a geometric characterization of the sets $E\subset \mathbb{R}$ that satisfy the following property: every quasisymmetric embedding $f: E \to \mathbb{R}^n$ extends to a quasisymmetric embedding $f:\mathbb{R}\to\mathbb{R}^N$ for some $N\geq n$.
Distributed $n$-player approachability and consensus in coalitional games
2015
We study a distributed allocation process where, at each time, every player: i) proposes a new bid based on the average utilities produced up to that time, ii) adjusts such allocations based on the inputs received from its neighbors, and iii) generates and allocates new utilities. The average allocations evolve according to a doubly (over time and space) averaging algorithm. We study conditions under which the average allocations reach consensus to any point within a predefined target set even in the presence of adversarial disturbances. Motivations arise in the context of coalitional games with transferable utilities (TU) where the target set is any set of allocations that makes the grand …
An unbounded family of log Calabi–Yau pairs
2016
We give an explicit example of log Calabi-Yau pairs that are log canonical and have a linearly decreasing Euler characteristic. This is constructed in terms of a degree two covering of a sequence of blow ups of three dimensional projective bundles over the Segre-Hirzebruch surfaces ${\mathbb F}_n$ for every positive integer $n$ big enough.