Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Xiuwei Yin, Guangjun Shen, Jiang-Lun Wu Pages: 1 - 13 Abstract: Analysis and Applications, Ahead of Print. In this paper, we study the stability of quasilinear parabolic stochastic partial differential equations with multiplicative noise, which are neither monotone nor locally monotone. The exponential mean square stability and pathwise exponential stability of the solutions are established. Moreover, under certain hypothesis on the stochastic perturbations, pathwise exponential stability can be derived, without utilizing the mean square stability. Citation: Analysis and Applications PubDate: 2021-08-23T07:00:00Z DOI: 10.1142/S0219530521500172
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Yuan Shen, Yannian Zuo, Liming Sun, Xiayang Zhang Pages: 1 - 28 Abstract: Analysis and Applications, Ahead of Print. We consider the linearly constrained separable convex optimization problem whose objective function is separable with respect to [math] blocks of variables. A bunch of methods have been proposed and extensively studied in the past decade. Specifically, a modified strictly contractive Peaceman–Rachford splitting method (SC-PRCM) [S. H. Jiang and M. Li, A modified strictly contractive Peaceman–Rachford splitting method for multi-block separable convex programming, J. Ind. Manag. Optim. 14(1) (2018) 397-412] has been well studied in the literature for the special case of [math]. Based on the modified SC-PRCM, we present modified proximal symmetric ADMMs (MPSADMMs) to solve the multi-block problem. In MPSADMMs, all subproblems but the first one are attached with a simple proximal term, and the multipliers are updated twice. At the end of each iteration, the output is corrected via a simple correction step. Without stringent assumptions, we establish the global convergence result and the [math] convergence rate in the ergodic sense for the new algorithms. Preliminary numerical results show that our proposed algorithms are effective for solving the linearly constrained quadratic programming and the robust principal component analysis problems. Citation: Analysis and Applications PubDate: 2021-08-16T07:00:00Z DOI: 10.1142/S0219530521500160
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Akio Ito Pages: 1 - 66 Abstract: Analysis and Applications, Ahead of Print. This paper deals with a nonlinear system (S) composed of three PDEs and one ODE below: (S) ut = ∇⋅ (du(α(v),w)∇β(w; u)) −∇⋅ (u∇λ(v)),vt = dvΔv + awz,wt = −awz,zt = dzΔz − bz + cu. The system (S) was proposed as one of the mathematical models which describe tumor invasion phenomena with chemotaxis effects. The most important and interesting point is that the diffusion coefficient of tumor cells, denoted by [math], is influenced by both nonlocal effect of a chemical attractive substance, denoted by [math], and the local one of extracellular matrix, denoted by [math]. From this point, the first PDE in (S) contains a nonlinear cross diffusion. Actually, this mathematical setting gives an inner product of a suitable real Hilbert space, which governs the dynamics of the density of tumor cells [math], a quasi-variational structure. Hence, the first purpose in this paper is to make it clear what this real Hilbert space is. After this, we show the existence of strong time local solutions to the initial-boundary problems associated with (S) when the space dimension is [math] by applying the general theory of evolution inclusions on real Hilbert spaces with quasi-variational structures. Moreover, for the case [math] we succeed in constructing a strong time global solution. Citation: Analysis and Applications PubDate: 2021-08-04T07:00:00Z DOI: 10.1142/S0219530521500159
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:M. Melgaard, F. D. Y. Zongo Pages: 1 - 18 Abstract: Analysis and Applications, Ahead of Print. We study the nonlinear, nonlocal, time-dependent partial differential equation i∂tφ = (−Δ + m2 − m)φ − 1 x ∗ φ 2 φ on ℝ3, which is known to describe the dynamics of quasi-relativistic boson stars in the mean-field limit. For positive mass parameter [math] we establish existence of infinitely many (corresponding to distinct energies [math]) traveling solitary waves, [math], with speed [math], where [math] corresponds to the speed of light in our choice of units. These traveling solitary waves cannot be obtained by applying a Lorentz boost to a solitary wave at rest (with [math]) because Lorentz covariance fails. Instead, we study a suitable variational problem for which the functions [math] arise as solutions (called boosted excited states) to a Choquard-type equation in [math], where the negative Laplacian is replaced by the pseudo-differential operator [math] and an additional term [math] enters. Moreover, we give a new proof for existence of boosted ground states. The results are based on perturbation methods in critical point theory. Citation: Analysis and Applications PubDate: 2021-07-26T07:00:00Z DOI: 10.1142/S0219530521500147
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Yunyou Qian, Dansheng Yu Pages: 1 - 23 Abstract: Analysis and Applications, Ahead of Print. In this paper, we introduce some neural network interpolation operators activated by smooth ramp functions. By using the smoothness of the ramp functions, we can give some useful estimates of the derivatives of the neural networks, which combining with some techniques in approximation theory enable us to establish the converse estimates of approximation by neural networks. We establish both the direct and the converse results of approximation by the new neural network operators defined by us, and thus give the essential approximation rate. To improve the approximation rate for functions of smoothness, we further introduce linear combinations of the new operators. The new combinations interpolate the objective function and its derivative. We also estimate the uniform convergence rate and simultaneous approximation rate by the new combinations. Citation: Analysis and Applications PubDate: 2021-07-09T07:00:00Z DOI: 10.1142/S0219530521500123
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Long Huang, Ferenc Weisz, Dachun Yang, Wen Yuan Pages: 1 - 50 Abstract: Analysis and Applications, Ahead of Print. Let [math], [math] be the mixed-norm Lebesgue space, and [math] an integrable function. In this paper, via establishing the boundedness of the mixed centered Hardy–Littlewood maximal operator [math] from [math] to itself or to the weak mixed-norm Lebesgue space [math] under some sharp assumptions on [math] and [math], the authors show that the [math]-mean of [math] converges to [math] almost everywhere over the diagonal if the Fourier transform [math] of [math] belongs to some mixed-norm homogeneous Herz space [math] with [math] being the conjugate index of [math]. Furthermore, by introducing another mixed-norm homogeneous Herz space and establishing a characterization of this Herz space, the authors then extend the above almost everywhere convergence of [math]-means to the unrestricted case. Finally, the authors show that the [math]-mean of [math] converges over the diagonal to [math] at all its [math]-Lebesgue points if and only if [math] belongs to [math], and a similar conclusion also holds true for the unrestricted convergence at strong [math]-Lebesgue points. Observe that, in all these results, those Herz spaces to which [math] belongs prove to be the best choice in some sense. Citation: Analysis and Applications PubDate: 2021-06-29T07:00:00Z DOI: 10.1142/S0219530521500135
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Helmut Abels, Christine Pfeuffer Pages: 1 - 36 Abstract: Analysis and Applications, Ahead of Print. In this paper, we show the invariance of the Fredholm index of non-smooth pseudodifferential operators with coefficients in Hölder spaces. By means of this invariance, we improve previous spectral invariance results for non-smooth pseudodifferential operators [math] with coefficients in Hölder spaces. For this purpose, we approximate [math] with smooth pseudodifferential operators and use a spectral invariance result of smooth pseudodifferential operators. Then, we get the spectral invariance result in analogy to a proof of the spectral invariance result for non-smooth differential operators by Rabier. Citation: Analysis and Applications PubDate: 2021-06-26T07:00:00Z DOI: 10.1142/S0219530521500111
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Mourad E. H. Ismail, Ruiming Zhang Pages: 1 - 18 Abstract: Analysis and Applications, Ahead of Print. In this paper, we use an identity connecting a modified [math]-Bessel function and a [math] function to give [math]-versions of entries in the Lost Notebook of Ramanujan. We also establish an identity which gives an [math]-version of a partition identity. We prove new relations and identities involving theta functions, the Ramanujan function, the Stieltjes–Wigert, [math]-Lommel and [math]-Bessel polynomials. We introduce and study [math]-analogues of the spherical Bessel functions. Citation: Analysis and Applications PubDate: 2021-05-31T07:00:00Z DOI: 10.1142/S0219530521500093
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Zongmin Wu, Ran Zhang Pages: 1 - 19 Abstract: Analysis and Applications, Ahead of Print. The nonlinear chaotic differential/algebraic equation (DAE) has been established to simulate the nonuniform oscillations of the motion of a falling sphere in the non-Newtonian fluid. The DAE is obtained only by learning the experimental data with sparse optimization method. However, the deterministic solution will become increasingly inaccurate for long time approximation of the continuous system. In this paper, we introduce two probabilistic solutions to compute the totally DAE, the Random branch selection iteration (RBSI) and Random switching iteration (RSI). The samples are also taken as the reference trajectory to learn random parameter. The proposed probabilistic solutions can be regarded as the discrete analogues of differential inclusion and switching DAEs, respectively. They have been also compared with the deterministic method, i.e. backward differentiation formula (BDF). The deterministic methods only give limited candidates of all the probability solutions, while the RSI can include all the possible trajectories. The numerical results and statistical information criterion show that RSI can successfully reveal the sustaining instabilities of the motion itself and long time chaotic behavior. Citation: Analysis and Applications PubDate: 2021-05-31T07:00:00Z DOI: 10.1142/S021953052150010X
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Van Tiep Do, Ron Levie, Gitta Kutyniok Pages: 1 - 50 Abstract: Analysis and Applications, Ahead of Print. Natural images are often the superposition of various parts of different geometric characteristics. For instance, an image might be a mixture of cartoon and texture structures. In addition, images are often given with missing data. In this paper, we develop a method for simultaneously decomposing an image to its two underlying parts and inpainting the missing data. Our separation–inpainting method is based on an [math] minimization approach, using two dictionaries, each sparsifying one of the image parts but not the other. We introduce a comprehensive convergence analysis of our method, in a general setting, utilizing the concepts of joint concentration, clustered sparsity, and cluster coherence. As the main application of our theory, we consider the problem of separating and inpainting an image to a cartoon and texture parts. Citation: Analysis and Applications PubDate: 2021-05-07T07:00:00Z DOI: 10.1142/S021953052150007X
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Xin Zhong Pages: 1 - 27 Abstract: Analysis and Applications, Ahead of Print. We investigate an initial boundary value problem of two-dimensional nonhomogeneous heat conducting magnetohydrodynamic equations. We prove that there exists a unique global strong solution. Moreover, we also obtain the large time decay rates of the solution. Note that the initial data can be arbitrarily large and the initial density allows vacuum states. Our method relies upon the delicate energy estimates and Desjardins’ interpolation inequality (B. Desjardins, Regularity results for two-dimensional flows of multiphase viscous fluids, Arch. Rational Mech. Anal. 137(2) (1997) 135–158). Citation: Analysis and Applications PubDate: 2021-04-30T07:00:00Z DOI: 10.1142/S0219530521500056
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Razvan C. Fetecau, Hansol Park, Francesco S. Patacchini Pages: 1 - 53 Abstract: Analysis and Applications, Ahead of Print. We investigate a model for collective behavior with intrinsic interactions on Riemannian manifolds. We establish the well-posedness of measure-valued solutions (defined via mass transport) on sphere, as well as investigate the mean-field particle approximation. We study the long-time behavior of solutions to the model on sphere, where the primary goal is to establish sufficient conditions for a consensus state to form asymptotically. Well-posedness of solutions and the formation of consensus are also investigated for other manifolds (e.g., a hypercylinder). Citation: Analysis and Applications PubDate: 2021-04-19T07:00:00Z DOI: 10.1142/S0219530521500081
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Ning Bi, Jun Tan, Wai-Shing Tang Pages: 1 - 13 Abstract: Analysis and Applications, Ahead of Print. In this paper, we provide a necessary condition and a sufficient condition such that any [math]-sparse vector [math] can be recovered from [math] via [math] local minimization. Moreover, we further verify that the sufficient condition is naturally valid when the restricted isometry constant of the measurement matrix [math] satisfies [math]. Compared with the existing [math] local recoverability condition [math], this result shows that [math] local recoverability contains more measurement matrices. Citation: Analysis and Applications PubDate: 2021-04-10T07:00:00Z DOI: 10.1142/S0219530521500068
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Marino Badiale, Michela Guida, Sergio Rolando Pages: 1 - 27 Abstract: Analysis and Applications, Ahead of Print. Given [math], [math], two measurable functions [math] and [math], and a continuous function [math] ([math]), we study the quasilinear elliptic equation −div(A( x ) ∇u p−2∇u)u + V ( x ) u p−2u = K( x )f(u)in ℝN. We find existence of nonnegative solutions by the application of variational methods, for which we have to study the compactness of the embedding of a suitable function space [math] into the sum of Lebesgue spaces [math], and thus into [math] ([math]) as a particular case. Our results do not require any compatibility between how the potentials [math], [math] and [math] behave at the origin and at infinity, and essentially rely on power type estimates of the relative growth of [math] and [math], not of the potentials separately. The nonlinearity [math] has a double-power behavior, whose standard example is [math], recovering the usual case of a single-power behavior when [math]. Citation: Analysis and Applications PubDate: 2021-03-27T07:00:00Z DOI: 10.1142/S0219530521500020
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Xingcai Zhou, Shaogao Lv Pages: 1 - 25 Abstract: Analysis and Applications, Ahead of Print. This paper considers a class of robust estimation problems for varying coefficient dynamic models via wavelet techniques, which can adapt to local features of the underlying functions and has less restriction to the smoothness of the functions. The convergence rates and asymptotic distributions of the robust wavelet-based estimator are established when the design variables are stationary short-range dependent (SRD) and the errors are long-range dependent (LRD). Particularly, a rate of convergence [math] in terms of estimation consistency can be achievable when the true components satisfy certain smoothness for a LRD process. Furthermore, an asymptotic property of the proposed estimator is given to indicate the confidence level of our proposed method for varying coefficient models with LRD. Citation: Analysis and Applications PubDate: 2021-03-06T08:00:00Z DOI: 10.1142/S0219530521500032
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Shouyou Huang, Yunlong Feng, Qiang Wu Pages: 1 - 19 Abstract: Analysis and Applications, Ahead of Print. Minimum error entropy (MEE) is an information theoretic learning approach that minimizes the information contained in the prediction error, which is measured by entropy. It has been successfully used in various machine learning tasks for its robustness to heavy-tailed distributions and outliers. In this paper, we consider its use in nonparametric regression and analyze its generalization performance from a learning theory perspective by imposing a [math]th order moment condition on the noise variable. To this end, we establish a comparison theorem to characterize the relation between the excess generalization error and the prediction error. A relaxed Bernstein condition and concentration inequalities are used to derive error bounds and learning rates. Note that the [math]th moment condition is rather weak particularly when [math] because the noise variable does not even admit a finite variance in this case. Therefore, our analysis explains the robustness of MEE in the presence of heavy-tailed distributions. Citation: Analysis and Applications PubDate: 2021-03-06T08:00:00Z DOI: 10.1142/S0219530521500044
Please help us test our new pre-print finding feature by giving the pre-print link a rating. A 5 star rating indicates the linked pre-print has the exact same content as the published article.
Authors:Ernesto de Vito, Massimo Fornasier, Valeriya Naumova Pages: 1 - 48 Abstract: Analysis and Applications, Ahead of Print. Despite a variety of available techniques, such as discrepancy principle, generalized cross validation, and balancing principle, the issue of the proper regularization parameter choice for inverse problems still remains one of the relevant challenges in the field. The main difficulty lies in constructing an efficient rule, allowing to compute the parameter from given noisy data without relying either on any a priori knowledge of the solution, noise level or on the manual input. In this paper, we propose a novel method based on a statistical learning theory framework to approximate the high-dimensional function, which maps noisy data to the optimal Tikhonov regularization parameter. After an offline phase where we observe samples of the noisy data-to-optimal parameter mapping, an estimate of the optimal regularization parameter is computed directly from noisy data. Our assumptions are that ground truth solutions of the inverse problem are statistically distributed in a concentrated manner on (lower-dimensional) linear subspaces and the noise is sub-gaussian. We show that for our method to be efficient, the number of previously observed samples of the noisy data-to-optimal parameter mapping needs to scale at most linearly with the dimension of the solution subspace. We provide explicit error bounds on the approximation accuracy from noisy data of unobserved optimal regularization parameters and ground truth solutions. Even though the results are more of theoretical nature, we present a recipe for the practical implementation of the approach. We conclude with presenting numerical experiments verifying our theoretical results and illustrating the superiority of our method with respect to several state-of-the-art approaches in terms of accuracy or computational time for solving inverse problems of various types. Citation: Analysis and Applications PubDate: 2021-01-30T08:00:00Z DOI: 10.1142/S0219530520500220
Hybrid journal (It can contain Open Access articles)
[118 journals]
