Analysis of PDEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 18 February
We slightly extend the convex integration via staircase laminate toolbox recently developed by Kleiner, Müller, Székelyhidi, and Xie. As an example we revisit the proof by Astala-Faraco-Székelyhidi on optimal Meyers' regularity theory via this framework.
Information Theory
Bounds and Constructions of Codes for Ordered Composite DNA Sequences
This paper extends the foundational work of Dollma et al. on codes for ordered composite DNA sequences. We consider the general setting with an alphabet of size $q$ and a resolution parameter $k$, moving beyond the binary ($q=2$) case primarily studied previously. We investigate error-correcting codes for substitution errors and deletion errors under several channel models, including $(e_1,\ldots,e_k)$-composite error/deletion, $e$-composite error/deletion, and the newly introduced $t$-$(e_1,\ldots,e_t)$-composite error/deletion model. We first establish equivalence relations among families of composite-error correcting codes (CECCs) and among families of composite-deletion correcting codes (CDCCs). This significantly reduces the number of distinct error-parameter sets that require separate analysis. We then derive novel and general upper bounds on the sizes of CECCs using refined sphere-packing arguments and probabilistic methods. These bounds together cover all values of parameters $q$, $k$, $(e_1,\ldots,e_k)$ and $e$. In contrast, previous bounds were only established for $q=2$ and limited choices of $k$, $(e_1,\ldots,e_k)$ and $e$. For CDCCs, we generalize a known non-asymptotic upper bound for $(1,0,\ldots,0)$-CDCCs and then provide a cleaner asymptotic bound. On the constructive side, for any $q\ge2$, we propose $(1,0,\ldots,0)$-CDCCs, $1$-CDCCs and $t$-$(1,\ldots,1)$-CDCCs with near-optimal redundancies. These codes have efficient and systematic encoders. For substitution errors, we design the first explicit encoding and decoding algorithms for the binary $(1,0,\ldots,0)$-CECC constructed by Dollma et al, and extend the approach to general $q$. Furthermore, we give an improved construction of binary $1$-CECCs, a construction of nonbinary $1$-CECCs, and a construction of $t$-$(1,\ldots,1)$-CECCs. These constructions are also systematic.
Read the full abstract
Functional Analysis
A Class of algebras admitting infinitely many norm topologies
Let $\mathcal{A}$ be an algebra, and let $\mathcal{A}^2 =$ span$\{ab : a, b \in \mathcal{A}\}$ be a subalgebra of $\mathcal{A}$. In this paper, we prove that if $\mathcal{A}^2$ has infinite codimension in $\mathcal{A}$ iff $\mathcal{A}$ has discontinuous square annihilation property (DSAP). In fact, in this case, the algebra $\mathcal{A}$ admits infinitely many non-equivalent algebra norms.
Read the full abstract
Optimization and Control
Primal-dual dynamical systems with closed-loop control for convex optimization in continuous and discrete time
This paper develops a primal-dual dynamical system where the coefficients are designed in closed-loop way for solving a convex optimization problem with linear equality constraints. We first introduce a “second-order primal" + “first-order dual” continuous-time dynamical system, in which both the time scaling and Hessian-driven damping are governed by a feedback control of the gradient for the Lagrangian function. This system achieves the fast convergence rates for the primal-dual gap, the feasibility violation, and the objective residual along its trajectory. Subsequently, by time discretization of this system, we develop an accelerated primal-dual algorithm with a gradient-defined adaptive step size. We also obtain convergence rates for the primal-dual gap, the feasibility violation, and the objective residual. Furthermore, we provide numerical results to demonstrate the practical efficacy and superior performance of the proposed algorithm.
Read the full abstract
Algebraic Geometry
Effective local differential topology of algebraic varieties over local fields of positive characteristics
In this paper we provide a framework for quantitative statements on distances and measures when studying algebraic varieties and morphisms of algebraic varieties over local fields. We will concentrate on local fields of the type $\mathbb{F}_\ell((t))$ and work uniformly with respect to finite extensions of $\mathbb{F}_\ell$. In this framework we prove analogues of standard results from local differential topology, including the implicit function theorem and study the behavior of smooth measures under push forward with respect to submersions.
Read the full abstract
Algebraic Geometry
Invertible top form on the Hilbert scheme of a plane in positive characteristic
We prove that the Hilbert scheme of the plane in positive characteristic admits an invertible top differential form. This implies certain integrability properties of the symmetric powers of the plane. This allows to define a function on the collection of monic polynomials over a local field which can be thought of as a variant of the inverse square root of the discriminant. In characteristic 0 it essentially coincides with this inverse square root, however in general it is quite different, and unlike this inverse square root, it is locally summable. In a sequel work [AGKS] we use this local summability in order to prove the positive characteristic analog of Harish-Chandra's local integrability theorem of characters of representations under certain conditions. The main results of this paper are known in characteristic zero. In fact a stronger result is known: there is a symplectic form on the Hilbert scheme of a plane.
Read the full abstract
Representation Theory
Orbital integral bounds the character for cuspidal representations of $GL_n(\mathbb{F}_{\ell}((t)))$
We prove that the character of an irreducible cuspidal representation of $GL_n(\mathbb{F}_{\ell}((t)))$ is locally bounded up to a logarithmic factor by the orbital integral of a matrix coefficient of this representation. The characteristic $0$ analog of this result is part of the proof of the celebrated Harish-Chandra's integrability theorem. In a sequel work [AGKS] we use this result in order to prove a positive characteristic analog of Harish-Chandra's integrability theorem under some additional assumptions.
Read the full abstract
Optimization and Control
Partially observed controlled Markov chains and optimal control of the Wonham filter
We consider a class of optimal control problems, with finite or infinite horizon, for a continuous-time Markov chain with finite state space. In this case, the control process affects the transition rates. We suppose that the controlled process can not be observed, and at any time the control actions are chosen based on the observation of a related stochastic process perturbed by an exogenous Brownian motion. We describe a construction of the controlled Markov chain, having stochastic transition rates adapted to the observation filtration. By a change of probability measure of Girsanov type, we introduce the so-called separated optimal control problem, where the state is the conditional (unnormalized) distribution of the controlled Markov chain and the observation process becomes a driving Brownian motion, and we prove the equivalence with the original control problem. The controlled equations for the separated problem are an instance of the Wonham filtering equations. Next we present an analysis of the separated problem: we characterize the value function as the unique viscosity solution to the dynamic programming equations (both in the parabolic and the elliptic case) we prove verifications theorems and a version of the stochastic maximum principle in the form of a necessary conditions for optimality.
Read the full abstract
Representation Theory
On Harish-Chandra's integrability theorem in positive characteristic
The celebrated Harish-Chandra's integrability theorem states that the distributional character of an irreducible smooth representation of a p-adic group $G(F)$ is integrable, that is represented by an $L^1_{loc}(G(F))$ function. Here $F$ is a non-Archimedean local field of characteristic $0$ and $G$ is a reductive algebraic group defined over $F$. In this paper we focus on cuspidal representations of $GL_n(F)$ for a field $F$ of positive characteristic. We show that in this case the integrability holds under the hypothesis of existence of desingularization of (certain) algebraic varieties in positive characteristics. Furthermore, in the case $char(F)>n/2$ we establish the regularity of such characters unconditionally.
Read the full abstract
Complex Variables
Inequalities For The Growth Of Rational Functions With Prescribed Poles
Let $\mathcal R_{n}$ be the set of all rational functions of the type $r(z) = f(z)/w(z)$, where $f(z)$ is a polynomial of degree at most $n$ and $w(z) = \prod_{j=1}^{n}(z-\beta_j)$, $|\beta_j|>1$ for $1\leq j\leq n$. In this work, we investigate the growth behavior of rational functions with prescribed poles by utilizing certain coefficients of the polynomial $f(z)$. The results obtained here not only refine and strengthen the findings of Rather et al. \cite{NS}, but also generalize recent growth estimates for polynomials due to Dhankhar and Kumar \cite{KD} to the broader setting of rational functions with fixed poles. Additionally, we establish corresponding results for such rational functions under suitable restrictions on their zeros.
Read the full abstract
Algebraic Geometry
The jet schemes of the nilpotent cone of $\mathfrak{gl}_n$ over $\mathbb{F}_\ell$ and analytic properties of the Chevalley map
We prove dimension bounds on the jet schemes of the variety of nilpotent matrices (and of related varieties) in positive characteristic. This result has applications to the analytic properties of the Chevalley map that sends a matrix to its characteristic polynomial. We show that our dimension bound implies, under the assumption of existence of resolution of singularities in positive characteristic, that the Chevalley map pushes a smooth compactly supported measure to a measure whose density function is $L^t$ for any $t<\infty$. We also prove this analytic property of the Chevalley map, unconditionally, when the characteristic of the field exceeds $n/2$. The zero characteristic counterpart of this result is an important step in the proof of the celebrated Harish-Chandra's integrability theorem. In a sequel work [AGKSb], we show that also in positive characteristic, this analytic statement implies Harish-Chandra's integrability theorem for cuspidal representations of the general linear group.
Read the full abstract
Category Theory
Derivations as Algebras
Differential categories provide the categorical foundations for the algebraic approaches to differentiation. They have been successful in formalizing various important concepts related to differentiation, such as, in particular, derivations. In this paper, we show that the differential modality of a differential category lifts to a monad on the arrow category and, moreover, that the algebras of this monad are precisely derivations. Furthermore, in the presence of finite biproducts, the differential modality in fact lifts to a differential modality on the arrow category. In other words, the arrow category of a differential category is again a differential category. As a consequence, derivations also form a tangent category, and derivations on free algebras form a cartesian differential category.
Read the full abstract
Information Theory
Scalable Base Station Configuration via Bayesian Optimization with Block Coordinate Descent
This paper proposes a scalable Bayesian optimization (BO) framework for dense base-station (BS) configuration design. BO can find an optimal BS configuration by iterating parameter search, channel simulation, and probabilistic modeling of the objective function. However, its performance is severely affected by the curse of dimensionality, thereby reducing its scalability. To overcome this limitation, the proposed method sequentially optimizes per-BS parameters based on block coordinate descent while fixing the remaining BS configurations, thereby reducing the effective dimensionality of each optimization step. Numerical results demonstrate that the proposed approach significantly outperforms naive optimization in dense deployment scenarios.
Read the full abstract
Quantum Algebra
Projective corepresentations and cohomology of compact quantum groups
We study projective unitary (co)representations of compact quantum groups and the associated second cohomology theory. We introduce left/right/bi/strongly projective corepresentations and study them in details. In particular, we prove that given any compact quantum group $\q$, there are compact quantum groups $\tilde{\q_l}, \tilde{\q_r}, {\tilde \q}_{bi}, {\tilde \q}_{stp}$, each of which contains $\q$ as a Woronowicz subalgebra and every left/right/bi/strongly projective unitary corepresentation of $\q$ lifts to a linear corepresentation of these quantum groups respectively. We observe that the strongly projective corepresentations are associated with the second invariant ($S^1$-valued) cohomology $H^2_{uinv}(\cdot)$ of the quantum group. We define a suitable analogue of normalizer of a compact quantum group in a bigger compact quantum group and using this, associate a canonical discrete group $\Gamma_\q$ to a compact quantum group $\q$ which is an alternative generalization of the second group cohomology and we show by an example that $\Gamma_\q$ in general may be different from $H^2_{uinv}(\q,S^1) $. We also illustrate with examples that $\Gamma_{\q}$ is more suitable than $H^2_{uinv}(., S^1)$ for labeling topological phases under quantum group symmetry.
Read the full abstract
Logic · Cross-listed from quant-ph
A Formal Theory for Finite-Dimensional Possibilistic Quantum Mechanics
In this work, we present a logical formalism for reasoning about quantum systems in finite dimension. Contrary to the usual approach in quantum logic, our formalism is based classical first-order logic, which allows us to use the tools of model theory in our study. In particular, we show that our formal theory is complete, meaning that it entirely determines the behaviour of quantum systems. Moreover, we provide a characterization of the models of our formal theory, thus providing new insights in the study of hidden variable models of quantum theory.
Read the full abstract
Analysis of PDEs
Global Gevrey Hypoellipticity of Involutive Systems on Non-Compact Manifolds
We investigate the global Gevrey hypoellipticity of a class of first-order differential operators associated with tube-type involutive structures on $M\times\mathbb{T}^m$, where $M$ is a non-compact manifold diffeomorphic to the interior of a compact manifold with boundary and $\mathbb{T}^m$ is the $m$-dimensional torus. For $s>1$, we work in Gevrey classes of Roumieu and Beurling type. A key step is the construction, on $M$, of a scattering metric whose coefficients are Gevrey of order $s$ in every analytic chart; this allows us to use Hodge theory and obtain Gevrey regularity for the harmonic forms. Under a natural condition on the defining closed $1$-forms, we obtain a sharp criterion for global Gevrey hypoellipticity in terms of rationality and (Roumieu/Beurling) exponential Liouville behavior.
Read the full abstract
Group Theory
On generating functions and automata associated to reflections in Coxeter systems
In this article, we study two combinatorial problems concerning the set of reflections of a Coxeter system. The first problem asks whether the language of palindromic reduced words for reflections is regular, and the second is about finding formulas for the Poincaré series of reflections, namely the generating function of reflection lengths. These two problems were inspired by a conjecture of Stembridge stating that the Poincaré series of reflections is rational and by the solution provided by de Man. To address the first problem, we introduce reflection-prefixes, arising naturally from palindromic reduced words. We study their connections with the root poset, dominance order on roots, and dihedral reflection subgroups. Using $m$-canonical automata associated with $m$-Shi arrangements, we prove that the language of reduced words for reflection-prefixes is regular. For the second problem, we focus on affine Coxeter groups. In this case, we derive a simple formula for the Poincaré series using symmetries of the Hasse diagram of the root poset.
Read the full abstract
Combinatorics
An assortment of problems in permutation patterns: unimodality, equivalence, derangements, and sorting
We collect open problems in permutation patterns on four themes: rank-unimodality in the permutation pattern poset and log-convexity of principal classes, Wilf-equivalence and shape-Wilf-equivalence, the enumeration of derangements in permutation classes, and sorting by stacks in series, generalized stacks, and restricted containers (C-machines).
Read the full abstract
Symplectic Geometry
Comet-type periodic motions and their out-of-plane bifurcations in the Earth-Moon CR3BP: a computational symplectic analysis
Comet-type periodic orbits of the circular restricted three-body problem (CR3BP) are periodic solutions that are generated from very large retrograde and direct circular Keplerian motions around the common center of mass of the primaries. In this paper we first provide an analytical proof of the existence of the comet-type periodic orbits by using the classical Poincaré continuation method. Within this analytical approach, we also determine the Conley-Zehnder index, defined as a Maslov index using a crossing form. Then, by applying a standard corrector-predictor technique, we explore numerically the two families of comet orbits within the Earth-Moon CR3BP. We compute their stability indices, identify vertical self-resonant bifurcations of higher order periods (of multiplicity from integer multiples up to six), investigate the vertically bifurcated spatial periodic solutions, and discuss their orbital characteristics. We also describe the orbits that are in resonance with the Earth and the Moon. We illustrate our main results in the form of bifurcation graphs, based on symplectic invariants, that provide a topological overview of the connections of the bifurcated branches, including bridge families.
Read the full abstract
Analysis of PDEs
Heat Equation driven by mixed local-nonlocal operators with non-regular space-dependent coefficients
In this paper, we study the Cauchy problem for a heat equation governed by a mixed local–nonlocal diffusion operator with spatially dependent coefficients. For bounded measurable coefficients satisfying uniform positivity conditions and initial data in $H^1(\mathbb R^d)$, we first establish existence and uniqueness of weak solutions in the natural energy space and derive an a priori energy estimate. We then extend the analysis to strictly positive distributional coefficients and compactly supported distributional initial data by means of a Friedrichs-type regularisation procedure. Under suitable moderateness assumptions on the regularising nets, we establish the existence of very weak solutions and prove uniqueness modulo negligible perturbations of admissible regularisations. Finally, under appropriate convergence assumptions on the regularised coefficients and initial data, together with preservation of uniform positivity, we prove consistency of the very weak solution with the corresponding weak solution.
Read the full abstract
Probability
Markov processes forced on a subspace by a large drift, with applications to population genetics
Consider a sequence of Markov processes $X^1, X^2,...$ with state space $E$, where $X^N$ has a strong drift to $D \subseteq E$, such that $\Phi(X^N)$ is slow for some appropriate $\Phi: E\to D$. Using the method of martingale problems, we give a limit result, such that $\Phi(X^N) \xRightarrow{N\to\infty} Z$ in the space of càdlàg paths, and $X^N \xRightarrow{N\to\infty} X$ in measure. \\ We apply the general limit result to models for copy number variation of genetic elements in a diploid Moran model of size $N$. The population by time $t$ is described by $X^N \in \mathcal P(\mathbb N_0)$, where $X^N_k$ is the frequency of individuals with copy number $k$, and $\Phi: \mathcal P(\mathbb
Read the full abstract
Analysis of PDEs
Large-Time Asymptotics for Heat and Fractional Heat Equations on the Lattice and General Finite Subgraphs
In this paper, we study large-time asymptotics for heat and fractional heat equations in two discrete settings: the full lattice \(\mathbb Z^d\) and finite connected subgraphs with Dirichlet boundary condition. These results provide a unified discrete theory of long-time asymptotics for local and nonlocal diffusions. For \(d\ge1\) and \(s\in(0,1]\), we consider on \(\mathbb Z^d\) the Cauchy problem \[ \partial_t u+(-\Delta)^s u=0,\qquad u(0)=u_0\in \ell^1(\mathbb Z^d), \] and derive a precise first-order asymptotic expansion toward the lattice fractional heat kernel \(G_t^{(s)}\). The main technical input is a pair of sharp translation-increment bounds for \(G_t^{(s)}\): a pointwise estimate and an \(\ell^1\)-estimate. As consequences, under finite first moment we obtain the optimal decay rate \(t^{-1/(2s)}\) in \(\ell^p\)-asymptotics (\(1\le p\le\infty\)), and we prove sharpness by explicit shifted-kernel examples. Without moment assumptions, we still establish convergence in the full \(\ell^1\)-class, and we show that no universal quantitative rate can hold in general. We also analyze fractional Dirichlet diffusion on finite connected subgraphs (restricted fractional setting, including \(s=1\) as the local case). In this finite-dimensional framework, solutions admit spectral decomposition and exhibit exponential large-time behavior governed by the principal eigenvalue and the spectral gap. In addition, we study positivity improving properties of the associated semigroups for both the lattice and Dirichlet evolutions.
Read the full abstract
Combinatorics
Long cycles in vertex transitive digraphs
One of the most well-known conjectures concerning Hamiltonicity in graphs asserts that any sufficiently large connected vertex transitive graph contains a Hamilton cycle. In this form, it was first written down by Thomassen in 1978, inspired by a closely related conjecture due to Lovász from 1969. It has been attributed to several other authors in a survey on the topic by Witte and Gallian in 1984. The analogous question for vertex transitive digraphs has an even longer history, having been first considered by Rankin in 1946. It is arguably more natural from the group-theoretic perspective underlying this problem in both settings. Trotter and Erdős proved in 1978 that there are infinitely many connected vertex transitive digraphs which are not Hamiltonian. This left open the very natural question of how long a directed cycle one can guarantee in a connected vertex transitive digraph on $n$ vertices. In 1981, Alspach asked if the maximum perimeter gap (the gap between the circumference and the order of the digraph) is a growing function in $n$. We answer this question in the affirmative, showing that it grows at least as fast as $(1-o(1)) \ln n$. On the other hand, we prove that one can always find a directed cycle of length at least $\Omega(n^{1/3})$, establishing the first lower bound growing with $n$, providing a directed analogue of a famous result of Babai from 1979 in the undirected setting.
Read the full abstract
Representation Theory
The invariance of the Auslander-Reiten Formula for hereditary algebras
We show that the Auslander-Reiten Formula for a finite dimensional hereditary algebra is invariant under the Auslander-Reiten translate.
Functional Analysis
Hypercontractivity for a family of quantum Ornstein-Uhlenbeck semigroups
We show that a family of quantum Ornstein-Uhlenbeck semigroups is hypercontractive. We also obtain the optimal order of the optimal time up to a constant. The main ingredient of our proof is Meixner polynomials. The goal of this paper is twofold: to provide more examples of hypercontractive quantum Markov semigourps on non-tracial von Neumann algebras, and to determine the optimal order of the optimal time for quantum Ornstein-Uhlenbeck semigroups.
Read the full abstract
Combinatorics
One-factorizations of complete multipartite graphs with distance constraints
The present paper considers multipartite graphs from the perspective of design theory and coding theory. A one-factor $F$ of the complete multipartite graph $K_{n\times g}$ (with $n$ parts of size $g$) gives rise to a $(g+1)$-ary code ${\cal C}$ of length $n$ and constant weight two. Furthermore, if the one-factor $F$ meets a certain constraint, then ${\cal C}$ becomes an optimal code with minimum distance three. We initiate the study of one-factorizations of complete multipartite graphs subject to distance constraints. The problem of decomposing $K_{n\times g}$ into the largest subgraphs with minimum distance three is investigated. It is proved that, for $n\le g$, the complete multipartite graph $K_{n\times g}$ can be decomposed into $g^2$ copies of the largest subgraphs with minimum distance three. For even $gn$ with $n>g$, it is proved that the complete multipartite graph $K_{n\times g}$ can be decomposed into $g(n-1)$ one-factors with minimum distance three, leaving a small gap of $n$ (in terms of $g$) to be resolved (If $gn$ is odd when $n>g$, no such decomposition of $K_{n\times g}$ exists).
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
A Resolution of the Ito-Stratonovich Debate in Quantum Stochastic Processes
Quantum stochastic processes are widely used in describing open quantum systems and in the context of quantum foundations. Physically relevant quantum stochastic processes driven by multiplicative colored noise are generically non-Markovian and analytically intractable. Further, their Markovian limits are generically inequivalent when using either the Ito or Stratonovich conventions for the same quantum stochastic processes. We introduce a quantum noise homogenization scheme that temporally coarse-grains non-Markovian, colored-noise-driven quantum stochastic processes and connects them to their effective white-noise (Markovian) limits. Our approach uses a novel phase-space augmentation that maps the non-Markovian dynamics into a higher-dimensional Markovian system and then applies a controlled perturbative coarse-graining scheme in the characteristic time scales of the noise. This allows an explicit analytical algorithm to derive effective Markovian generators with renormalized coefficients and enables various physical constraints, such as causality, to be imposed on them. We thus resolve the Ito–Stratonovich ambiguity for multiplicative colored-noise-driven quantum stochastic processes, wherein we show that their consistent Markovian limit corresponds to the Stratonovich convention with renormalized coefficients as well as correction terms in Ito's convention. By assuming their Markovian limit unravels causal, completely positive and trace-preserving dynamics, we further characterize a physically relevant family of non-Markovian quantum stochastic processes driven by multiplicative colored~noise.
Read the full abstract
Numerical Analysis
An agglomeration-based multigrid solver for the discontinuous Galerkin discretization of cardiac electrophysiology
This work presents a novel agglomeration-based multilevel preconditioner designed to accelerate the convergence of iterative solvers for linear systems arising from the discontinuous Galerkin discretization of the monodomain model in cardiac electrophysiology. The proposed approach exploits general polytopic grids at coarser levels, obtained through the agglomeration of elements from an initial, potentially fine, mesh. By leveraging a robust and efficient agglomeration strategy, we construct a nested hierarchy of grids suitable for multilevel solver frameworks. The effectiveness and performance of the methodology are assessed through a series of numerical experiments on two- and three-dimensional domains, involving different ionic models and realistic unstructured geometries. The results demonstrate strong solver effectiveness and favorable scalability with respect to both the polynomial degree of the discretization and the number of levels selected in the multigrid preconditioner.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
Introducing the b-value: combining unbiased and biased estimators from a sensitivity analysis perspective
In empirical research, when we have multiple estimators for the same parameter of interest, a central question arises: how do we combine unbiased but less precise estimators with biased but more precise ones to improve the inference? Under this setting, the point estimation problem has attracted considerable attention. In this paper, we focus on a less studied inference question: how can we conduct valid statistical inference in such settings with unknown bias? We propose a strategy to combine unbiased and biased estimators from a sensitivity analysis perspective. We derive a sequence of confidence intervals indexed by the magnitude of the bias, which enable researchers to assess how conclusions vary with the bias levels. Importantly, we introduce the notion of the b-value, a critical value of the unknown maximum relative bias at which combining estimators does not yield a significant result. We apply this strategy to three canonical combined estimators: the precision-weighted estimator, the pretest estimator, and the soft-thresholding estimator. For each estimator, we characterize the sequence of confidence intervals and determine the bias threshold at which the conclusion changes. Based on the theory, we recommend reporting the b-value based on the soft-thresholding estimator and its associated confidence intervals, which are robust to unknown bias and achieve the lowest worst-case risk among the alternatives.
Read the full abstract
Numerical Analysis
Finite elements for the space approximation of a differential model for salts crystallization
This article investigates a space-time differential model related to the degradation of stone artifacts caused by exposure to air and atmospheric agents, which specifically lead to the accumulation of salt crystals in the material. A numerical method based on finite-element space discretization and implicit-explicit time marching is proposed as an extension of a one-dimensional finite-difference framework introduced in the literature. Within the same one-dimensional setting, a sensitivity analysis is performed, based on the techniques developed therein. They are also used as a comparison tool for the finite-element formulation, here introduced for more realistic simulations in higher space dimensions. Considerations about stability will be provided, together with an experimental convergence analysis highlighting the performance of the proposed approach. Numerical results in two and three space dimensions, obtained by an efficient code implementation, will be presented and discussed.